Fischer’s protocol revisited: A simple proof using modal constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1066, Issue , 1996, Pages 604-615

  Larsen, Kim G ^a   Steffen, Bernhard ^b   Weise, Carsten ^c  

^a AALBORG UNIVERSITY   (Denmark)

^b UNIVERSITY OF PASSAU   (Germany)

^c RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; SPECIFICATIONS;

AUTOMATIC VERIFICATION; COMPOSITIONALITY; PROOF OBLIGATIONS; REDUCTION PROCESS; STATE-SPACE EXPLOSION; TIMED AUTOMATA; TIMED MODAL SPECIFICATIONS; VERIFICATION PROBLEMS;

HYBRID SYSTEMS;

EID: 84958046456     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0020979     Document Type: Conference Paper

References (27)

1. M. Abadi, L. Lamport. An Old-Fashioned Recipe for Real Time. LNCS 600.
2. R. Alur, C. Coucoubetis, N. Halbwachs, T.A. Henzinger, et al. The algorithmic analysis of hybrid systems. Theoretical Computer Science, February 1995
3. H. Andersen, C. Stirling, G. Winskel. A Compositional Proof System for the Modal Mu-Calculus, in: Proceedings LICS, 1994.
4. R. Alur, D.L. Dill. A Theory of Timed Automata. TCS 126(2):183-236, 94.
5. R. Alur, T.A. Henzinger, M.Y. Vardi. Parametric real-time reasoning. Proc. 25th STOC, ACM Press 1993, pp. 592-601.
6. R. Bryant. Graph-Based Algorithms for Boolean Function Manipulation, in: IEEE Transactions on Computation, 35 (8). 1986.
7. 20 States and Beyond, in: Proceedings LICS’90.
8. K. Čerāns. Decidability of Bisimulation Equivalences for Parallel Timer Processes. Proceedings CAV '92, pp. 289-300.
9. K. Čerāns, J.C. Godesken, K.G. Larsen. Timed Modal Specification - Theory and Tools, in: C. Courcoubetis (Ed.), Proc. 5th CAV, 1993, LNCS 697, pp. 253-267.
10. E. Clarke, O. Grumber, D. Long. Model Checking and Abstraction, in: Proceedings XIX POPL’92.
11. E. Clarke, D. Long, K. McMillan. Compositional Model Checking, in: Proceedings LICS’89.
12. P. Cousot, R. Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs, in: Proc. POPL’77.
13. R. Enders, T. Filkorn, D. Taubner. Generating BDDs for Symbolic Model Checking in CCS. in: Proc. CAV’91, LNCS 575, pp. 203-213
14. P. Godefroid, P. Wolper. Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties, in: Proc. CAV’91, LNCS 575, pp. 332-342.
15. P. Godefroid, D. Pirottin. Refining Dependencies Improves Partial-Order Verification Methods, in: Proc. CAV’93, LNCS 697, pp. 438-449.
16. J. C. Godskesen. Timed Modal Specifications - A Theory for Verification of Real-Time Concurrent Systems. Ph.D. Thesis, Aalborg Univ., R-94-2039, Oct. '94.
17. S. Graf, C. Loiseaux. Program Verification using Compositional Abstraction, in: Proceedings FASE/TAPSOFT’93.
18. S. Graf, B. Steffen. Using Interface Specifications for Compositional Minimization of Finite State Systems, in: Proceedings CAV’90.
19. H. Hüttel and K. Larsen. The use of static constructs in a modal process logic. Proceedings of Logic at Botik’89. LNCS 363, 1989.
20. K.G. Larsen. Modal specifications, in: LNCS 407, 1990.
21. K.G. Larsen, P. Pettersson, W. Yi. Compositional and Symbolic Model Checking for Real-Time Systems. Proc. CONCUR’95.
22. K.G. Larsen, B. Steffen, C. Weise. A Constraint-oriented Proof Methodology using Modal Transition Systems. Proc. TACAS’95, to appear as LNCS 1019.
23. K. Larsen and B. Thomsen. A modal process logic. In: Proc. LICS, 1988.
24. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
25. D. Park. Concurrency and automata on infinite sequences. In P. Deussen (ed.), 5th GI Conference, LNCS 104, pp. 167-183, 1981.
26. A. Valmari. On-The-Fly Verification with Stubborn Sets, in: C. Courcoubetis (Ed.), Proc. 5th CAV, 1993, LNCS 697, pp. 397-408.
27. W. Yi. CCS + Time = an Interleaving Model for Real-Time Systems, Proc. 18th ICALP, 1991, LNCS 510, pp. 217-228.