Final Semantics for Decorated Traces
| dc.contributor.author | Bonchi, Filippo | |
| dc.contributor.author | Bonsangue, Marcello | |
| dc.contributor.author | Caltais, Georgiana | |
| dc.contributor.author | Rutten, Jan | |
| dc.contributor.author | Silva, Alexandra | |
| dc.date.accessioned | 2019-01-23T16:42:16Z | |
| dc.date.available | 2019-01-23T16:42:16Z | |
| dc.date.issued | 2012 | eng |
| dc.description.abstract | In concurrency theory, various semantic equivalences on labelled transition systems are based on traces enriched or decorated with some additional observations. They are generally referred to as decorated traces, and examples include ready, failure, trace and complete trace equivalence. Using the generalized powerset construction, recently introduced by a subset of the authors [Silva, A., F. Bonchi, M.M. Bonsangue and J.J.M.M. Rutten, Generalizing the powerset construction, coalgebraically, in: K. Lodaya and M. Mahajan, editors, FSTTCS 2010, LIPIcs 8, 2010, pp. 272–283. URL http://drops.dagstuhl.de/opus/volltexte/2010/2870], we give a coalgebraic presentation of decorated trace semantics. This yields a uniform notion of canonical, minimal representatives for the various decorated trace equivalences, in terms of final Moore automata. As a consequence, proofs of decorated trace equivalence can be given by coinduction, using different types of (Moore-) bisimulation (up-to), which is helpful for automation. | eng |
| dc.description.version | published | eng |
| dc.identifier.doi | 10.1016/j.entcs.2012.08.006 | eng |
| dc.identifier.ppn | 516664905 | |
| dc.identifier.uri | https://kops.uni-konstanz.de/handle/123456789/44700 | |
| dc.language.iso | eng | eng |
| dc.rights | Attribution-NonCommercial-NoDerivs 3.0 Unported | |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/ | |
| dc.subject.ddc | 004 | eng |
| dc.title | Final Semantics for Decorated Traces | eng |
| dc.type | JOURNAL_ARTICLE | eng |
| dspace.entity.type | Publication | |
| kops.citation.bibtex | @article{Bonchi2012Final-44700,
year={2012},
doi={10.1016/j.entcs.2012.08.006},
title={Final Semantics for Decorated Traces},
volume={286},
issn={1571-0661},
journal={Electronic Notes in Theoretical Computer Science},
pages={73--86},
author={Bonchi, Filippo and Bonsangue, Marcello and Caltais, Georgiana and Rutten, Jan and Silva, Alexandra}
} | |
| kops.citation.iso690 | BONCHI, Filippo, Marcello BONSANGUE, Georgiana CALTAIS, Jan RUTTEN, Alexandra SILVA, 2012. Final Semantics for Decorated Traces. In: Electronic Notes in Theoretical Computer Science. 2012, 286, pp. 73-86. ISSN 1571-0661. Available under: doi: 10.1016/j.entcs.2012.08.006 | deu |
| kops.citation.iso690 | BONCHI, Filippo, Marcello BONSANGUE, Georgiana CALTAIS, Jan RUTTEN, Alexandra SILVA, 2012. Final Semantics for Decorated Traces. In: Electronic Notes in Theoretical Computer Science. 2012, 286, pp. 73-86. ISSN 1571-0661. Available under: doi: 10.1016/j.entcs.2012.08.006 | eng |
| kops.citation.rdf | <rdf:RDF
xmlns:dcterms="http://purl.org/dc/terms/"
xmlns:dc="http://purl.org/dc/elements/1.1/"
xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
xmlns:bibo="http://purl.org/ontology/bibo/"
xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
xmlns:foaf="http://xmlns.com/foaf/0.1/"
xmlns:void="http://rdfs.org/ns/void#"
xmlns:xsd="http://www.w3.org/2001/XMLSchema#" >
<rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/44700">
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dcterms:abstract xml:lang="eng">In concurrency theory, various semantic equivalences on labelled transition systems are based on traces enriched or decorated with some additional observations. They are generally referred to as decorated traces, and examples include ready, failure, trace and complete trace equivalence. Using the generalized powerset construction, recently introduced by a subset of the authors [Silva, A., F. Bonchi, M.M. Bonsangue and J.J.M.M. Rutten, Generalizing the powerset construction, coalgebraically, in: K. Lodaya and M. Mahajan, editors, FSTTCS 2010, LIPIcs 8, 2010, pp. 272–283. URL http://drops.dagstuhl.de/opus/volltexte/2010/2870], we give a coalgebraic presentation of decorated trace semantics. This yields a uniform notion of canonical, minimal representatives for the various decorated trace equivalences, in terms of final Moore automata. As a consequence, proofs of decorated trace equivalence can be given by coinduction, using different types of (Moore-) bisimulation (up-to), which is helpful for automation.</dcterms:abstract>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-01-23T16:42:16Z</dcterms:available>
<dc:creator>Rutten, Jan</dc:creator>
<dcterms:issued>2012</dcterms:issued>
<dc:contributor>Caltais, Georgiana</dc:contributor>
<dcterms:title>Final Semantics for Decorated Traces</dcterms:title>
<dc:contributor>Rutten, Jan</dc:contributor>
<dc:creator>Bonsangue, Marcello</dc:creator>
<dc:rights>Attribution-NonCommercial-NoDerivs 3.0 Unported</dc:rights>
<dc:creator>Bonchi, Filippo</dc:creator>
<dc:contributor>Silva, Alexandra</dc:contributor>
<dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/44700/1/Bonchi_2-1lfoij2mbhfr88.pdf"/>
<bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/44700"/>
<dc:creator>Caltais, Georgiana</dc:creator>
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-01-23T16:42:16Z</dc:date>
<dc:contributor>Bonsangue, Marcello</dc:contributor>
<dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/44700/1/Bonchi_2-1lfoij2mbhfr88.pdf"/>
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<dc:creator>Silva, Alexandra</dc:creator>
<dc:contributor>Bonchi, Filippo</dc:contributor>
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<dc:language>eng</dc:language>
<dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/3.0/"/>
</rdf:Description>
</rdf:RDF> | |
| kops.description.openAccess | openaccesshybrid | eng |
| kops.flag.isPeerReviewed | true | eng |
| kops.flag.knbibliography | false | |
| kops.identifier.nbn | urn:nbn:de:bsz:352-2-1lfoij2mbhfr88 | |
| kops.sourcefield | Electronic Notes in Theoretical Computer Science. 2012, <b>286</b>, pp. 73-86. ISSN 1571-0661. Available under: doi: 10.1016/j.entcs.2012.08.006 | deu |
| kops.sourcefield.plain | Electronic Notes in Theoretical Computer Science. 2012, 286, pp. 73-86. ISSN 1571-0661. Available under: doi: 10.1016/j.entcs.2012.08.006 | deu |
| kops.sourcefield.plain | Electronic Notes in Theoretical Computer Science. 2012, 286, pp. 73-86. ISSN 1571-0661. Available under: doi: 10.1016/j.entcs.2012.08.006 | eng |
| relation.isAuthorOfPublication | 23c8465d-2f7a-4b05-a1af-35aa34f5fd85 | |
| relation.isAuthorOfPublication.latestForDiscovery | 23c8465d-2f7a-4b05-a1af-35aa34f5fd85 | |
| source.bibliographicInfo.fromPage | 73 | eng |
| source.bibliographicInfo.toPage | 86 | eng |
| source.bibliographicInfo.volume | 286 | eng |
| source.identifier.issn | 1571-0661 | eng |
| source.periodicalTitle | Electronic Notes in Theoretical Computer Science | eng |
Dateien
Originalbündel
1 - 1 von 1
Vorschaubild nicht verfügbar
- Name:
- Bonchi_2-1lfoij2mbhfr88.pdf
- Größe:
- 283.59 KB
- Format:
- Adobe Portable Document Format
- Beschreibung:
