Abstract
The Timed Asynchronous System (TAS) model[3] has less stringent assumptions than the synchronous model but is still strong enough to serve as a foundation for the construction of dependable applications. In this paper, we verify the correctness of some basic distributed services in TAS. First, TAS is modelled and then some important properties of two basic services, FADS (Fail Aware Datagram Service) and HALL (Highly Available Local Leader Election Service), are formally verified. The PVS theorem prover is used for modelling and verification of the algorithms.
During the process of verification, some of the assumptions in the model that were not explicitly noted in the literature came to light. In addition, due to the insight gained in the process of verification, the ability to extend the validity of some of the properties in the face of additional failures in the system became clear through appropriate modifications of these assumptions.
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
Christof Fetzer, “Fail Awareness in Timed Asynchronous Systems,” PhD thesis, CSE Dept, University of California, San Diego, 1997.
Nancy A. Lynch, “Distributed Algorithms,” Morgan Kaufmann,1996.
Flaviu Cristian, Christof Fetzer, “The Timed Asynchronous Distributed System Model,” IEEE Transaction on Parallel and Distributed Systems, vol. 10, no. 6, pp. 642–657, June 1999.
Flaviu Cristian, Christof Fetzer, “A Fail Aware Datagram Service,” 2 nd annual workshop on Parallel and Distributed Systems, April 5, 1997, Geneva, Switzerland.
John Rushby, “Systematic Formal Verification for Fault-Tolerant Time-Triggered Algorithms,” IEEE Transactions on Software Engineering, vol. 25, no. 4, September 1999.
Natarajan Shankar, Sam Owre, John Rushby, D. W. J. Stringer Calvert, “PVS Prover Guide, Version 2.3,” September 1999.
Flaviu Cristian, Christof Fetzer, “A Highly Available Local Leader Election Service,” IEEE Transactions on Software Engineering, vol. 25, no. 5, pp. 603–618, September/October 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jaggi, N., Gopinath, K. (2001). Verification of a Leader Election Algorithm in Timed Asynchronous Systems. In: Hariharan, R., Vinay, V., Mukund, M. (eds) FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2001. Lecture Notes in Computer Science, vol 2245. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45294-X_18
Download citation
DOI: https://doi.org/10.1007/3-540-45294-X_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43002-5
Online ISBN: 978-3-540-45294-2
eBook Packages: Springer Book Archive