A coalgebraic view on decorated traces

DOI10.1017/S0960129514000449zbMATH Open1364.68276MaRDI QIDQ2973240FDOQ2973240

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

Publication date: 3 April 2017

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Recommendations

• Final semantics for decorated traces
• Simplified coalgebraic trace equivalence
• Trace semantics via determinization
• Steps and traces
• Trace semantics via determinization

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Universal coalgebra: A theory of systems
• Coalgebraic bisimulation-up-to
• Algebraic laws for nondeterminism and concurrency
• Title not available (Why is that?)
• Testing equivalence as a bisimulation equivalence
• A hierarchy of probabilistic system types
• Erratum and addendum: ``Eilenberg-Moore algebras for stochastic relations
• Final semantics for decorated traces
• Processes as formal power series: a coinductive approach to denotational semantics
• Brzozowski's and up-to algorithms for must testing

Cited In (5)

• Final semantics for decorated traces
• Title not available (Why is that?)
• Title not available (Why is that?)
• Simplified coalgebraic trace equivalence
• Preservation and reflection of bisimilarity via invertible steps

This page was built for publication: A coalgebraic view on decorated traces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2973240)