Fair bisimulation

MaRDI QIDQ4518901zbMATH OpenFDO

Authors Thomas A. Henzinger, Sriram K. Rajamani

Publication date 20 May 2001

zbMATH Keywords

bisimulationslabeled transition systems

Mathematics Subject Classification ID

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

Recommendations

• Fair simulation
• Fair simulation
• Fair equivalence relations
• Fair equivalence relations
• Bisimulation, modal logic and model checking games

Cited in

(14)

• Fair simulation
• Ensuring liveness properties of distributed systems: open problems
• Quasipolynomial computation of nested fixpoints
• Deciding orthogonal bisimulation
• Bridging the gap between fair simulation and trace inclusion
• Büchi automata can have smaller quotients
• Safe Reasoning with Logic LTS
• Equivalences for fair Kripke structures
• Fair equivalence relations
• Safe reasoning with logic LTS
• Liveness, Fairness and Impossible Futures
• Bridging the gap between fair simulation and trace inclusion.
• Fair simulation
• Simulation relations and applications in formal methods

This page was built for publication: Fair bisimulation

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