Branching bisimulation games

DOI10.1007/978-3-319-39570-8_10zbMATH Open1347.68276OpenAlexW2474862751MaRDI QIDQ2827464FDOQ2827464

Authors: David de Frutos Escrig, Jeroen J. A. Keiren, T. 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

Recommendations

• Games for bisimulations and abstraction
• Branching Bisimilarity with Explicit Divergence
• A game for linear-time-branching-time spectroscopy
• Branching bisimilarity is an equivalence indeed!
• Branching time and abstraction in bisimulation semantics

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Automata, logics, and infinite games. A guide to current research
• CADP 2010: a toolbox for the construction and analysis of distributed processes
• Branching time and abstraction in bisimulation semantics
• An overview of the mCRL2 toolset and its recent advances
• Branching Bisimilarity with Explicit Divergence
• Branching bisimilarity is an equivalence indeed!
• Title not available (Why is that?)
• A partial order approach to branching time logic model checking.
• Branching bisimilarity checking for PRS

Cited In (5)

• Title not available (Why is that?)
• Equivalence checking 40 years after: a review of bisimulation tools
• Parity game reductions
• Games for bisimulations and abstraction
• Branching Bisimilarity with Explicit Divergence

Uses Software

• mCRL2
• CADP
• mCRL

This page was built for publication: Branching bisimulation games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2827464)