Towards Weak Bisimulation For Coalgebras

DOI10.1016/S1571-0661(04)80499-7zbMath1268.68130MaRDI QIDQ2841308

Jan Rothe, Dragan Mašulović

Publication date: 24 July 2013

Published in: Electronic Notes in Theoretical 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)

Related Items (5)

Adding recursive constructs to bialgebraic semantics ⋮ Behavioural equivalences for coalgebras with unobservable moves ⋮ Subsequential transducers: a coalgebraic perspective ⋮ A Syntactical Approach to Weak (Bi-)Simulation for Coalgebras ⋮ An Exercise on Transition Systems

Uses Software

• CCSL

Cites Work

• Universal coalgebra: A theory of systems
• Institutionalising Many-Sorted Coalgebraic Modal Logic
• A Syntactical Approach to Weak (Bi-)Simulation for Coalgebras
• An approach to object semantics based on terminal co-algebras
• A note on Coinduction and Weak Bisimilarity for While Programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Towards Weak Bisimulation For Coalgebras