Final Semantics for Decorated Traces | Zendy

Filippo Bonchi | Zendy; Marcello Bonsangue | Zendy; Georgiana Caltais | Zendy; Jan Rutten | Zendy; Paula Alexandra Silva | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Final Semantics for Decorated Traces

Author(s) -

Filippo Bonchi,

Marcello Bonsangue,

Georgiana Caltais,

Jan Rutten,

Paula Alexandra Silva

Publication year - 2012

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2012.08.006

Subject(s) - concurrency , trace (psycholinguistics) , bisimulation , mathematical proof , computer science , programming language , equivalence (formal languages) , semantics (computer science) , automaton , algebra over a field , theoretical computer science , mathematics , discrete mathematics , pure mathematics , linguistics , philosophy , geometry

In concurrency theory, various semantic equivalences on la- belled 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 (FSTTCS’10), 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, which is helpful for automation

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research