Transitivity and Difunctionality of Bisimulations

DOI10.1007/978-3-319-40370-0_4zbMath1475.18008OpenAlexW2478562955MaRDI QIDQ5739448

Mehdi Zarrad, H. Peter Gumm

Publication date: 15 July 2016

Published in: Coalgebraic Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01446032/file/418352_1_En_4_Chapter.pdf

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Categories and theories (18C99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Expressive logics for coalgebras via terminal sequence induction
• Structural induction and coinduction in a fibrational setting
• Coalgebraic logic
• Fixpoint semantics and simulation
• Universal coalgebra: A theory of systems
• Products of coalgebras.
• Terminal coalgebras in well-founded set theory
• Types and coalgebraic structure
• Lax Extensions of Coalgebra Functors
• Coalgebraic Simulations and Congruences
• Relating coalgebraic notions of bisimulation
• Bisimulation for Neighbourhood Structures
• Algebraic laws for nondeterminism and concurrency
• Relations binaires, fermetures, correspondances de Galois
• Functors for coalgebras

This page was built for publication: Transitivity and Difunctionality of Bisimulations