Abstract
This paper investigates self-stabilization on hierarchically divided networks. An underlying theory of self-stabilizing systems will be briefly exposed and a generic example will be given. The example and the theory have been mechanically verified using a general purpose theorem prover HOL. Three issues inherent to the problem, namely self-stabilization, concurrency, and hierarchy, can be factored out and treated one separately — something which has considerably simplified our mechanical proof (proof economy is an important issue in mechanical verification, even more than it is in the pencil and paper realm as what misleadingly appears as a few lines there may easily become a few hundreds in the mechanical world).
The research was carried out at Utrecht University, the Netherlands.
Chapter PDF
References
Y. Afek and G.M. Brown. Self-stabilization of the alternating-bit protocol. In Proceeding of the IEEE 8th Symposium on Reliable Distributed Systems, pages 80–83, 1989.
Y. Afek and G.M. Brown. Self-stabilization of the alternating-bit protocol. In IEEE 8th Symposiom on Reliable Distributed Systems, October 1989.
A. Arora and M.G. Gouda. Distributed reset. In Proceedings of the 10th Conference on Foundation of Software Technology and Theoretical Computer Science, 1990. Also in Lecture Notes on Computer Science vol. 472.
A. Arora. A foundation for fault-tolerant computing. PhD thesis, Dept. of Comp. Science, Univ. of Texas at Austin, 1992.
F. Bastani, I. Yen, and I. Chen. A class of inherently fault tolerant distributed programs. IEEE Transactions on Software Engineering, 14(1):1432–1442, 1988.
K.M. Chandy and J. Misra. Parallel Program Design — A Foundation. Addison-Wesley Publishing Company, Inc., 1988.
N.S. Chen, H.P. Yu, and S.T. Huang. A self-stabilizing algorithm for constructing spanning trees. Information Processing Letters, 39(3):147–151, 1991.
Mike J.C. Gordon and Tom F. Melham. Introduction to HOL. Cambridge University Press, 1993.
Ted Herman. Adaptivity through Distributed Convergence. PhD thesis, University of Texas at Austin, 1991.
P.J.A. Lentfert. Distributed Hierarchical Algorithms. PhD thesis, Utrecht University, April 1993.
P.J.A. Lentfert and S.D. Swierstra. Towards the formal design of self-stabilizing distributed algorithms. In P. Enjalbert, A. Finkel, and K.W. Wagner, editors, STACS 93, Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science, pages 440–451. Springer-Verlag, February 1993.
Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems—Specification. Springer Verlag, 1992.
I.S.W.B. Prasetya. A formal approach to design self-stabilizing programs. In E. Backer, editor, Proceeding of Computing Science in the Netherlands 94, pages 241–252. SION, Stichting Matematisch Centrum, 1994.
I.S.W.B. Prasetya. Towards a mechanically supported and compositional calculus to design distributed algorithms. In T.F. Melham and J. Camilleri, editors, Lecture Notes in Computer Science 859: Higher Order Theorem Proving and Its Application, pages 362–377. Springer-Verlag, 1994.
I.S.W.B. Prasetya. Mechanically Supported Design of Self-stabilizing Algorithms. PhD thesis, Dept. of Comp. Science, Utrecht University, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Prasetya, I.S.W.B. (1997). Mechanically verified self-stabilizing hierarchical algorithms. In: Brinksma, E. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 1997. Lecture Notes in Computer Science, vol 1217. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035402
Download citation
DOI: https://doi.org/10.1007/BFb0035402
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62790-6
Online ISBN: 978-3-540-68519-7
eBook Packages: Springer Book Archive