Relating coalgebraic notions of bisimulation

Abstract

The theory of coalgebras, for an endofunctor on a category, has been proposed as a general theory of transition systems. We investigate and relate four generalizations of bisimulation to this setting, providing conditions under which the four different generalizations coincide. We study transfinite sequences whose limits are the greatest bisimulations.

Cited by in corpus (20)

• Coinduction up to in a fibrational setting
• Behavioural equivalences for coalgebras with unobservable moves
• Weak bisimulation for coalgebras over order enriched monads
• Relation lifting, with an application to the many-valued cover modality
• Bisimulation of Labelled State-to-Function Transition Systems Coalgebraically
• The Theory of Traces for Systems with Nondeterminism, Probability, and Termination
• Generalized Vietoris Bisimulations
• Distribution Bisimilarity via the Power of Convex Algebras
• Model Theory and Proof Theory of Coalgebraic Predicate Logic
• A Definition Scheme for Quantitative Bisimulation
• Effectuses in Categorical Quantum Foundations
• Universal Constructions for (Co)Relations: categories, monoidal categories, and props
• A coalgebraic semantics for causality in Petri nets
• Amortized Analysis via Coalgebra
• Structural operational semantics for non-deterministic processes with quantitative aspects
• Behavioural equivalences for timed systems
• Lax functors and coalgebraic weak bisimulation
• Logic-Induced Bisimulations
• On the trade-off between labels and weights in quantitative bisimulation
• The Algebra of Recursive Graph Transformation Language UnCAL: Complete Axiomatisation and Iteration Categorical Semantics