Abstract
As a case study, we apply a constraint-oriented state-based proof methodology to Fischer's protocol. The method exploits compositionality and abstraction to reduce the investigated verification problem. This reduction avoids state space explosion. Key concepts of the reduction process are modal constraints, separation of proof obligations, Skolemization and abstraction. Formal basis for the method are Timed Modal Specifications (TMS) allowing loose state-based specifications, which can be refined by successively adding constraints. TMS's can be easily translated into Modal Timed Automata, thus enabling automatic verification. A central issue of the method is the use of Parametrized TMS's.
This author has been partially supported by the European Communities under CONCUR2, BRA 7166.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Abadi, L. Lamport. An Old-Fashioned Recipe for Real Time. LNCS 600.
R. Alur,C. Coucoubetis, N. Halbwachs, T.A. Henzinger, et al. The algorithmic analysis of hybrid systems. Theoretical Computer Science, February 1995
H. Andersen, C. Stirling, G. Winskel. A Compositional Proof System for the Modal Mu-Calculus. in: Proceedings LICS, 1994.
R. Alur, D.L. Dill. A Theory of Timed Automata. TCS 126(2):183–236, 94.
R. Alur, T.A. Henzinger, M.Y. Vardi. Parametric real-time reasoning. Proc. 25th STOC, ACM Press 1993, pp. 592–601.
R. Bryant. Graph-Based Algorithms for Boolean Function Manipulation. in: IEEE Transactions on Computation, 35 (8). 1986.
J. Burch, E. Clarke, K. McMillan, D. Dill, L. Hwang. Symbolic Model Checking: 1020 States and Beyond. in: Proceedings LICS'90.
K. Čerāns. Decidability of Bisimulation Equivalences for Parallel Timer Processes. Proceedings CAV '92, pp. 289–300.
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.
E. Clarke, O. Grumber, D. Long. Model Checking and Abstraction. in: Proceedings XIX POPL'92.
E. Clarke, D. Long, K. McMillan. Compositional Model Checking. in: Proceedings LICS'89.
P. Cousot, R. Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs. in: Proc. POPL'77.
R. Enders, T. Filkorn, D. Taubner. Generating BDDs for Symbolic Model Checking in CCS. in: Proc. CAV'91, LNCS 575, pp. 203–213
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.
P. Godefroid, D. Pirottin. Refining Dependencies Improves Partial-Order Verification Methods. in: Proc. CAV'93, LNCS 697, pp. 438–449.
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.
S. Graf, C. Loiseaux. Program Verification using Compositional Abstraction. in: Proceedings FASE/TAPSOFT'93.
S. Graf, B. Steffen. Using Interface Specifications for Compositional Minimization of Finite State Systems. in: Proceedings CAV'90.
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.
K.G. Larsen. Modal specifications. in: LNCS 407, 1990.
K.G. Larsen, P. Pettersson, W. Yi. Compositional and Symbolic Model-Checking for Real-Time Systems. Proc. CONCUR'95.
K.G. Larsen, B. Steffen, C. Weise. A Constraint-oriented Proof Methodology using Modal Transition Systems. Proc. TACAS'95, to appear as LNCS 1019.
K. Larsen and B. Thomsen. A modal process logic. In: Proc. LICS, 1988.
R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
D. Park. Concurrency and automata on infinite sequences. In P. Deussen (ed.), 5th GI Conference, LNCS 104, pp. 167–183, 1981.
A. Valmari. On-The-Fly Verification with Stubborn Sets. in: C. Courcoubetis (Ed.), Proc. 5th CAV, 1993, LNCS 697, pp. 397–408.
W. Yi. CCS + Time = an Interleaving Model for Real-Time Systems, Proc. 18th ICALP, 1991, LNCS 510, pp. 217–228.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Larsen, K.G., Steffen, B., Weise, C. (1996). Fischer's protocol revisited: A simple proof using modal constraints. In: Alur, R., Henzinger, T.A., Sontag, E.D. (eds) Hybrid Systems III. HS 1995. Lecture Notes in Computer Science, vol 1066. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020979
Download citation
DOI: https://doi.org/10.1007/BFb0020979
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61155-4
Online ISBN: 978-3-540-68334-6
eBook Packages: Springer Book Archive