Abstract
This article introduces two new logical operators in UNITY. These operators are used to present a general scheme to specify the problem a self-stabilizing algorithm is assumed to solve. Furthermore, a general solution strategy is specified for a class of problems. The theory is illustrated by an example.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
A. Arora and M.G. Gouda. Distributed reset (extended abstract). In Proc. of 10th Conf. on Foundations of Software Technology and Theoretical Computer Science, pages 316–331. Springer-Verlag, 1990.
B. Awerbuch, B. Patt-Shamir, and G. Varghese. Self-stabilization by local checking and correction. In Proc. of 32'nd IEEE Symp. on Foundations on Computer Science, October 1991.
K.M. Chandy and J. Misra. Parallel Program Design — A Foundation. Addison-Wesley Publishing Company, Inc., 1988.
E.W. Dijkstra. Self-stabilizing systems in spite of distributed control. Communications of the ACM, 17(11):643–644, 1974.
S. Katz and K.J. Perry. Self-stabilizing extensions for message-passing systems. In Proc. of the Ninth Annual ACM Symp. on Principles of Distributed Computing, pages 91–101, Quebec City, August 1990.
H.S.M. Kruijer. Self-stabilization (in spite of distributed control) in tree structured systems. Information Processing Letters, 8(2):91–95, 1979.
P.J.A. Lentfert and S.D. Swierstra. Distributed maximum maintenance on hierarchically divided graphs. Formal Aspects of Computing, 1992.
P.J.A. Lentfert and S.D. Swierstra. Towards the formal design of self-stabilizing distributed algorithms. Technical Report RUU-CS-92-25, Utrecht University, July 1992.
P.J.A. Lentfert, A.H. Uittenbogaard, S.D. Swierstra, and G. Tel. Distributed hierarchical routing. Technical Report RUU-CS-89-5, Utrecht University, March 1989. Also in: P.M.G. Apers et al. (Eds.). Proc. CSN89. Utrecht, November 9–10, 1989.
Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems, volume 1. Springer Verlag, to appear.
J.M. McQuillan, I. Richer, and E.C. Rosen. The new routing algorithm for the arpanet. IEEE Trans. on Communications, com-28(5):711–719, May 1980.
B.A. Sanders. Stepwise refinement of mixed specifications of concurrent programs. In M. Broy and C.B. Jones, editors, Proceedings IFIP Working Conf. on Programming and Methods, pages 1–25. Elsevier Science Publishers B.V. (North Holland), May 1990.
B.A. Sanders. Eliminating the substitution axiom from UNITY logic. Formal Aspects of Computing, 3(2):189–205, 1991.
W.D. Tajibnapis. A correctness proof of a topology information maintenance protocol for a distributed computer network. Computer Systems, 20(7):477–485, July 1977.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lentfert, P.J.A., Swierstra, S.D. (1993). Towards the formal design of self-stabilizing distributed algorithms. In: Enjalbert, P., Finkel, A., Wagner, K.W. (eds) STACS 93. STACS 1993. Lecture Notes in Computer Science, vol 665. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56503-5_44
Download citation
DOI: https://doi.org/10.1007/3-540-56503-5_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56503-1
Online ISBN: 978-3-540-47574-3
eBook Packages: Springer Book Archive