Relating Coalgebraic Notions of Bisimulation

DOI10.1007/978-3-642-03741-2_14zbMath1239.68054OpenAlexW2164883513MaRDI QIDQ2888487

Sam Staton

Publication date: 1 June 2012

Published in: Algebra and Coalgebra in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03741-2_14

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) Categories of machines, automata (18B20)

Related Items (10)

Bisimulations Generated from Corecursive Equations ⋮ A presheaf environment for the explicit fusion calculus ⋮ Presenting functors on many-sorted varieties and applications ⋮ Unnamed Item ⋮ Coalgebras in functional programming and type theory ⋮ Bialgebras for structural operational semantics: an introduction ⋮ Coalgebraic semantics of modal logics: an overview ⋮ (Metric) Bisimulation Games and Real-Valued Modal Logics for Coalgebras ⋮ Coalgebraic Semantics for Parallel Derivation Strategies in Logic Programming ⋮ A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the final sequence of a finitary set functor
• Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads
• A new approach to abstract syntax with variable binding
• Stone coalgebras
• About permutation algebras, (pre)sheaves and named sets
• Calculi for synchrony and asynchrony
• A calculus of communicating systems
• A calculus of mobile processes. I
• Introduction to extensive and distributive categories
• Constructive versions of Tarski's fixed point theorems
• Structural induction and coinduction in a fibrational setting
• Universal coalgebra: A theory of systems
• Adding recursive constructs to bialgebraic semantics
• A theory of bisimulation for the \(\pi\)-calculus
• Bisimulation for probabilistic transition systems: A coalgebraic approach
• Bisimulation and cocongruence for probabilistic systems
• Comparing operational models of name-passing process calculi
• A domain equation for bisimulation
• A Cook's Tour of the Finitary Non-Well-Founded Sets
• Vietoris Bisimulations
• Bialgebraic Semantics and Recursion
• Models of non-well-founded sets via an indexed final coalgebra theorem
• Algebra and Coalgebra in Computer Science
• Nominal Renaming Sets
• Foundations of Software Science and Computational Structures
• Automata, Languages and Programming
• On the structure of categories of coalgebras
• Functors for coalgebras

This page was built for publication: Relating Coalgebraic Notions of Bisimulation