A coalgebraic presentation of structured transition systems

DOI10.1016/S0304-3975(00)00121-3zbMath0973.68173MaRDI QIDQ5941158

Andrea Corradini, Reiko Heckel, Martin Grosse-Rhode

Publication date: 20 August 2001

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

zbMATH Keywords

bialgebraslax coalgebra morphismsstructured coalgebrastransition systems

Mathematics Subject Classification ID

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

Related Items (8)

Coalgebraic Symbolic Semantics ⋮ Reactive systems, (semi-)saturated semantics and coalgebras on presheaves ⋮ Bialgebras for structural operational semantics: an introduction ⋮ GETGRATS ⋮ Simulations in coalgebra ⋮ A coalgebraic presentation of structured transition systems ⋮ State space analysis of Petri nets with relation-algebraic methods ⋮ Compositional SOS and beyond: A coalgebraic view of open systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Petri nets are monoids
• Higher-level synchronising devices in Meije-SCCS
• Structured operational semantics and bisimulation as a congruence
• An algebraic semantics for structured transition systems and its application to logic programs
• Coalgebraic methods in computer science, CMCS '98. Proceedings of the 1st workshop, Lisbon, Portugal, March 28--29, 1998
• Semantics: foundations and applications. REX workshop, Beekbergen, The Netherlands, June 1-4, 1992. Proceedings
• Towards a unified view of bisimulation: A comparative study
• Fixpoint semantics and simulation
• Universal coalgebra: A theory of systems
• Bisimulation from open maps
• A compositional proof system on a category of labelled transition systems
• Adjoint Lifting Theorems for Categories of Algebras
• Formal verification of parallel programs
• On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces
• Processes as terms: non-well-founded models for bisimulation
• Bisimulation can't be traced
• A coalgebraic presentation of structured transition systems

This page was built for publication: A coalgebraic presentation of structured transition systems