Towards weak bisimulation for coalgebras

DOI10.1016/S1571-0661(04)80499-7MaRDI QIDQ2841308zbMATH OpenFDO

Authors 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)

Recommendations

• Modal logics for observation equivalences
• Weak bisimulations for coalgebras over ordered functors
• A syntactical approach to weak (bi-)simulation for coalgebras
• Weak bisimulation for action-type coalgebras (extended abstract)
• Coalgebraic weak bisimulation for action-type systems

Cites work

• scientific article; zbMATH DE number 1688389 (Why is no real title available?)
• scientific article; zbMATH DE number 29047 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 1231637 (Why is no real title available?)
• A note on Coinduction and Weak Bisimilarity for While Programs
• A syntactical approach to weak (bi-)simulation for coalgebras
• An approach to object semantics based on terminal co-algebras
• Institutionalising many-sorted coalgebraic modal logic
• The coalgebraic class specification language CCSL
• Universal coalgebra: A theory of systems

Cited in

(16)

• A note on Coinduction and Weak Bisimilarity for While Programs
• Coalgebras for Bisimulation of Weighted Automata over Semirings
• Structural operational semantics for weak bisimulations
• On cool congruence formats for weak bisimulations
• Subsequential transducers: a coalgebraic perspective
• New up-to techniques for weak bisimulation
• Modal logics for observation equivalences
• A Characterisation of Expressivity for Coalgebraic Bisimulation and Simulation
• A syntactical approach to weak (bi-)simulation for coalgebras
• Weak bisimilarity coalgebraically
• An exercise on transition systems
• Coalgebraic Reasoning in Coq: Bisimulation and the λ-Coiteration Scheme
• Adding recursive constructs to bialgebraic semantics
• Coalgebraic Weak Bisimulation from Recursive Equations over Monads
• Behavioural equivalences for coalgebras with unobservable moves
• Weak homomorphisms and graph coalgebras

Describes a project that uses

Uses Software

• CCSL

This page was built for publication: Towards weak bisimulation for coalgebras

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