Enhanced coalgebraic bisimulation

DOI10.1017/S0960129515000523zbMath1380.68300MaRDI QIDQ5361143

Filippo Bonchi, Jurriaan Rot, Alexandra Silva, Damien Pous, Marcello M. Bonsangue, Jan J. M. M. Rutten

Publication date: 27 September 2017

zbMATH Keywords

coalgebrabisimulationbehavioural equivalencetransition systemmonadcoinductionbisimilarityweighted automatonbisimulation-up-to\(\lambda\)-bialgebrastream systemup-to-bisimilarityup-to-contextup-to-equivalenceup-to-union

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Categorical semantics of formal languages (18C50) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Categories of machines, automata (18B20)

Related Items (10)

A complete logic for behavioural equivalence in coalgebras of finitary set functors ⋮ Proving language inclusion and equivalence by coinduction ⋮ Unnamed Item ⋮ Coinduction in Flow: The Later Modality in Fibrations ⋮ Up-To Techniques for Weighted Systems ⋮ A general account of coinduction up-to ⋮ A Complete Logic for Behavioural Equivalence in Coalgebras of Finitary Set Functors ⋮ Unnamed Item ⋮ A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata ⋮ Corecursion up-to via causal transformations

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
• A coalgebraic perspective on linear weighted automata
• Bialgebras for structural operational semantics: an introduction
• Calculi for synchrony and asynchrony
• A calculus of communicating systems
• Structural induction and coinduction in a fibrational setting
• Universal coalgebra: A theory of systems
• Behavioural differential equations: a coinductive calculus of streams, automata, and power series
• Simulations and Bisimulations for Coalgebraic Modal Logics
• Lax Extensions of Coalgebra Functors
• Coalgebraic Bisimulation-Up-To
• Checking NFA equivalence with bisimulations up to congruence
• Similarity Quotients as Final Coalgebras
• Relating coalgebraic notions of bisimulation
• Context-Free Languages, Coalgebraically
• Introduction to Bisimulation and Coinduction
• Structural Operational Semantics for Weighted Transition Systems
• Complete Lattices and Up-To Techniques
• On the bisimulation proof method
• Bisimulation can't be traced
• Coinduction up-to in a fibrational setting
• Coinductive Proof Techniques for Language Equivalence
• Monoid-labeled transition systems
• A final coalgebra theorem
• Circular Coinduction in Coq Using Bisimulation-Up-To Techniques
• Enhancements of the bisimulation proof method
• Presenting Distributive Laws

This page was built for publication: Enhanced coalgebraic bisimulation