Branching Bisimulation Games

DOI10.1007/978-3-319-39570-8_10zbMath1347.68276OpenAlexW2474862751MaRDI QIDQ2827464

David de Frutos-Escrig, Jeroen J. A. Keiren, Tim A. C. Willemse

Publication date: 19 October 2016

Published in: Formal Techniques for Distributed Objects, Components, and Systems (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01432915/file/426757_1_En_10_Chapter.pdf

Mathematics Subject Classification ID

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

Related Items (3)

Parity game reductions ⋮ Equivalence checking 40 years after: a review of bisimulation tools ⋮ Unnamed Item

Uses Software

• mCRL2
• CADP
• mCRL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Branching bisimilarity is an equivalence indeed!
• A partial order approach to branching time logic model checking.
• Automata, logics, and infinite games. A guide to current research
• CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes
• Branching Bisimilarity with Explicit Divergence
• Branching time and abstraction in bisimulation semantics
• Branching Bisimilarity Checking for PRS
• An Overview of the mCRL2 Toolset and Its Recent Advances

This page was built for publication: Branching Bisimulation Games