A coalgebraic view on decorated traces

DOI10.1017/S0960129514000449zbMATH Open1364.68276MaRDI QIDQ2973240FDOQ2973240

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

Publication date: 3 April 2017

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Universal coalgebra: A theory of systems
• Coalgebraic Bisimulation-Up-To
• Algebraic laws for nondeterminism and concurrency
• 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 (2)

• Title not available (Why is that?)
• 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)