A Syntactical Approach to Weak (Bi-)Simulation for Coalgebras

DOI10.1016/S1571-0661(04)80368-2zbMath1270.68223OpenAlexW2062493106MaRDI QIDQ2842561

Jan Rothe

Publication date: 15 August 2013

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

Full work available at URL: https://doi.org/10.1016/s1571-0661(04)80368-2

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

New Bisimulation Semantics for Distributed Systems, Towards Weak Bisimulation For Coalgebras, Towards coalgebraic behaviourism

Uses Software

• CCSL

Cites Work

• Towards Weak Bisimulation For Coalgebras
• Towards coalgebraic behaviourism
• Algebraic laws for nondeterminism and concurrency
• The temporal logic of coalgebras via Galois algebras
• An approach to object semantics based on terminal co-algebras
• A Calculus of Terms for Coalgebras of Polynomial Functors
• A note on Coinduction and Weak Bisimilarity for While Programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item