Publikation:

Final Semantics for Decorated Traces

Vorschaubild

Dateien

Bonchi_2-1lfoij2mbhfr88.pdf
Bonchi_2-1lfoij2mbhfr88.pdfGröße: 283.59 KBDownloads: 198

Datum

2012

Autor:innen

Bonchi, Filippo
Bonsangue, Marcello
Rutten, Jan
Silva, Alexandra

Herausgeber:innen

Kontakt

ISSN der Zeitschrift

Electronic ISSN

ISBN

Bibliografische Daten

Verlag

Schriftenreihe

Auflagebezeichnung

URI (zitierfähiger Link)
http://nbn-resolving.de/urn:nbn:de:bsz:352-2-1lfoij2mbhfr88
DOI (zitierfähiger Link)
https://doi.org/10.1016/j.entcs.2012.08.006
ArXiv-ID

Internationale Patentnummer

Link zur Lizenz
Attribution-NonCommercial-NoDerivs 3.0 Unported

Angaben zur Forschungsförderung

Projekt

Open Access-Veröffentlichung
Open Access Hybrid

Sammlungen

Informatik und Informationswissenschaft: Publikationen
Core Facility der Universität Konstanz

Gesperrt bis

Titel in einer weiteren Sprache

Publikationstyp
Zeitschriftenartikel
Publikationsstatus
Published

Erschienen 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

Zusammenfassung

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.

Zusammenfassung in einer weiteren Sprache

Fachgebiet (DDC)
004 Informatik

Schlagwörter

Konferenz

Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690BONCHI, 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
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}
}
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>

Interner Vermerk

xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter

Kontakt
URL der Originalveröffentl.

Prüfdatum der URL

Prüfungsdatum der Dissertation

Finanzierungsart

Kommentar zur Publikation

Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Nein
Begutachtet
Ja
Diese Publikation teilen