Abstract
This paper links two formerly disjoint research areas: temporal logic and stabilization. Temporal logic is a widely acknowledged language for the specification and verification of concurrent systems. Stabilization is a vitally emerging paradigm in fault tolerant distributed computing.
In this paper we give a brief introduction to stabilizing systems and present fair transition systems for their formal description. Then we give a formal definition of stabilization in linear temporal logic and provide a set of temporal proof rules specifically tailored towards the verification of stabilizing systems. By exploiting the semantical characteristics of stabilizing systems the presented proof rules are considerably simpler than the general temporal logic proof rules for program validity, yet we prove their completeness for the class of stabilizing systems.
These proof rules replace the hitherto informal reasoning in the field of stabilization and constitute the basis for machine-supported verification of an important class of distributed algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abadi, M. and L. Lamport: 1991, ‘The existence of refinement mappings’. Theoretical Computer Science 82 (2).
Afek, Y. and G. Brown: 1993, ‘Self-stabilization over unreliable communication media’. Distributed Computing (7), 27–34.
Alur, R., T. Henzinger, and P. Ho: 1993, ‘Automatic symbolic model checking of embedded systems’. In: IEEE Real-Time Systems Symposium.
Arora, A.: 1992, ‘A Foundation of Fault Tolerant Computing’. Ph.D. thesis, The University of Texas at Austin.
Arora, A. and M. Gouda: 1993, ‘Closure and convergence: a foundation of fault-tolerant computing’. IEEE Transactions on Software Engineering (19), 1015–1027.
Arora, A. and M. Gouda: 1994, ‘Distributed reset’. IEEE Transcations on Computers (43), 1026–1038.
Beauquier, J. and S. Delaët: 1994, ‘Probabilistic self-stabilizing mutual exclusion in uniform rings’. In: PODC94 Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing. p. 378.
Boyer, R. and J. Moore: 1986, ‘Integrating decision procedures into heuristic theorem provers’. Machine Intelligence 11.
Burch, J., E. Clarke, K. McMillan, D. Dill, and L. Hwang: 1990, ‘Symbolic Model Checking: 1020 States and Beyond’. In: Logic and Computer Science.
Burns, J., M. Gouda, and R. Miller: 1993, ‘Stabilization and pseudo-stabilization’. Distributed Computing 7, 35–42.
Cristian, F.: 1985, ‘A rigorous approach to fault-tolerant computing’. IEEE Transactions on Software Engineering 11 (1).
Dijkstra, E.: 1974, ‘Self stabilizing systems in spite of distributed control’. Communications of the ACM 17 (11).
Dolev, S., A. Israeli, and S. Moran: 1993, ‘Self-stabilization of dynamic systems assuming only read/write atomicity’. Distributed Computing 7, 3–16.
Gouda, M., R. Howell, and L. Rosier: 1990, ‘The instability of self-stabilization’. Acta Informatica 27, 697–724.
Gouda, M. and N. Multari: 1991, ‘Stabilizing communication protocols’. IEEE Transactions on Computers 40, 448–458.
Katz, S. and K. Perry: 1993, ‘Self-stabilizing extensions for message-passing systems’. Distributed Computing 7, 17–26.
Lamport, L.: 1984, ‘Solved problems, unsolved problems, and non-problems in con-currency’. In: Proceedings of the 3rd Annual ACM Symposium on Principles of Distributed Computing.
Lin, C. and J. Simon: 1995, ‘Possibility and impossibility results for self-stabilizing phase clocks on synchronous rings’. In: Proceedings of the Seconf Workshop on Self-Stabilizing Systems. pp. 10. 1–10. 15.
Manna, Z. and A. Pnueli: 1991a, ‘Completing the temporal picture’. Theoretical Computer Science 83 (1).
Manna, Z. and A. Pnueli: 1991b, The Temporal Logic of Reactive and Concurrent Systems. Springer Verlag.
Manna, Z. and A. Pnueli: 1995, Temporal Verification of Reactive Systems. Springer Verlag.
Owre, S., J. Rushby, and N. Shankar: 1992, ‘PVS: a prototype verification system’. In: 11th Int Conf on Automated Deduction (CADE), Vol. 607 of LNCS. Springer Verlag.
Owre, S., J. Rushby, N. Shankar, and F. von Henke: 1993, ‘Formal verification for fault-tolerant architectures: some lessons learned’. In: FME 93: Industrial-strength Formal Methods, Vol. 670 of LNCS. Springer Verlag.
Schneider, M.: 1993, `Self-stabilization’. ACM Computing Surveys 25, 45–67.
Siegel, M.: 1996, ‘Phased Design and Verification of Stabilizing Systems’. Ph.D. thesis, University of Kiel.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Lakhnech, Y., Siegel, M. (2000). Temporal Logic for Stabilizing Systems. In: Barringer, H., Fisher, M., Gabbay, D., Gough, G. (eds) Advances in Temporal Logic. Applied Logic Series, vol 16. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-9586-5_4
Download citation
DOI: https://doi.org/10.1007/978-94-015-9586-5_4
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5389-3
Online ISBN: 978-94-015-9586-5
eBook Packages: Springer Book Archive