Fischer's protocol revisited: A simple proof using modal constraints
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 604-615
- https://doi.org/10.1007/bfb0020979
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Symbolic model checking: 1020 States and beyondPublished by Elsevier ,2004
- Compositional model checkingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A theory of timed automataPublished by Elsevier ,2002
- The algorithmic analysis of hybrid systemsTheoretical Computer Science, 1995
- A Compositional Proof System for the Modal mu-CalculusBRICS Report Series, 1994
- Parametric real-time reasoningPublished by Association for Computing Machinery (ACM) ,1993
- Model checking and abstractionPublished by Association for Computing Machinery (ACM) ,1992
- Using partial orders for the efficient verification of deadlock freedom and safety propertiesPublished by Springer Nature ,1992
- Generating BDDs for symbolic model checking in CCSPublished by Springer Nature ,1992
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986