Final Semantics for Decorated Traces

DOI10.1016/j.entcs.2012.08.006zbMath1342.68224OpenAlexW2121001461WikidataQ113318088 ScholiaQ113318088MaRDI QIDQ3178274

Filippo Bonchi, Alexandra Silva, Georgiana Caltais, Marcello M. Bonsangue, Jan J. M. M. Rutten

Publication date: 8 July 2016

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2012.08.006

zbMATH Keywords

coalgebraslabelled transition systemsdecorated tracesfinal Moore automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

A coalgebraic view on decorated traces ⋮ Simplified Coalgebraic Trace Equivalence ⋮ Trace semantics via determinization

Uses Software

• CIRC

Cites Work

• Universal coalgebra: A theory of systems
• Testing equivalence as a bisimulation equivalence
• Processes as formal power series: a coinductive approach to denotational semantics
• Circular Coinduction: A Proof Theoretical Foundation
• Checking NFA equivalence with bisimulations up to congruence
• A Coalgebraic Characterization of Behaviours in the Linear Time – Branching Time Spectrum
• Generalizing determinization from automata to coalgebras
• Generic Trace Semantics via Coinduction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Final Semantics for Decorated Traces