Final Semantics for Decorated Traces

Cite This

Files in this item

Checksum: MD5:7b8b42d27a3e16d1bf24aa29202ddbe6

BONCHI, Filippo, Marcello BONSANGUE, Georgiana CALTAIS, Jan RUTTEN, Alexandra SILVA, 2012. Final Semantics for Decorated Traces. In: Electronic Notes in Theoretical Computer Science. 286, pp. 73-86. ISSN 1571-0661. Available under: doi: 10.1016/j.entcs.2012.08.006

@article{Bonchi2012Final-44700, title={Final Semantics for Decorated Traces}, year={2012}, doi={10.1016/j.entcs.2012.08.006}, 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} }

<rdf:RDF xmlns:dcterms="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <dc:creator>Caltais, Georgiana</dc:creator> <dcterms:title>Final Semantics for Decorated Traces</dcterms:title> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:hasPart rdf:resource=""/> <dc:creator>Silva, Alexandra</dc:creator> <bibo:uri rdf:resource=""/> <dspace:hasBitstream rdf:resource=""/> <dc:language>eng</dc:language> <dc:contributor>Caltais, Georgiana</dc:contributor> <dspace:isPartOfCollection rdf:resource=""/> <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], 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:rights rdf:resource=""/> <dcterms:issued>2012</dcterms:issued> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:contributor>Bonsangue, Marcello</dc:contributor> <dc:creator>Rutten, Jan</dc:creator> <dc:contributor>Bonchi, Filippo</dc:contributor> <dcterms:isPartOf rdf:resource=""/> <dc:contributor>Silva, Alexandra</dc:contributor> <dc:creator>Bonsangue, Marcello</dc:creator> <dc:date rdf:datatype="">2019-01-23T16:42:16Z</dc:date> <dc:contributor>Rutten, Jan</dc:contributor> <dcterms:available rdf:datatype="">2019-01-23T16:42:16Z</dcterms:available> <dc:rights>Attribution-NonCommercial-NoDerivs 3.0 Unported</dc:rights> <dc:creator>Bonchi, Filippo</dc:creator> </rdf:Description> </rdf:RDF>

Downloads since Jan 23, 2019 (Information about access statistics)

Bonchi_2-1lfoij2mbhfr88.pdf 118

This item appears in the following Collection(s)

Attribution-NonCommercial-NoDerivs 3.0 Unported Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 3.0 Unported

Search KOPS


My Account