Abstract
An iteration system is a set of assignment statements whose computation proceeds in steps: at each step, an arbitrary subset of the statements is executed in parallel. The set of statements thus executed may differ at each step; however, it is required that each statement is executed infinitely often along the computation. The convergence of such systems (to a fixed point) is typically verified by showing that the value of a given variant function is decreased by each step that causes a state change. Such a proof requires an exponential number of cases (in the number of assignment statements) to be considered. In this paper, we present alternative methods for verifying the convergence of iteration systems. In most of these methods, upto a linear number of cases need to be considered.
(Extended Abstract)
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
M.A. Arbib, Brains, Machines and Mathematics, Springer-Verlag, 1987.
A. Arora, P. Attie, M. Evangelist and M. Gouda, “Convergence of Iteration Systems”, submitted for publication in Distributed Computing (Special Issue on Self-Stabilization).
J.E. Burns, M.G. Gouda, and R.E. Miller, “On relaxing interleaving assumptions”, Proceedings of the MCC Workshop on Self-Stabilizing Systems, MCC Technical Report #STP-379-89.
G.M. Brown, M.G. Gouda, and C.-L. Wu, “Token Systems that Self-Stablize”, IEEE Transactions on Computers 38(6), pp. 845–852, 1989.
D.P. Bertsekas and J.N. Tsitsiklis, Parallel and Distributed Computation, Prentice-Hall, 1989.
K.M. Chandy and J. Misra, Parallel Program Design: A Foundation, Addison-Wesley Publishing, 1988.
E.W. Dijkstra, EWD306 “The Solution to a Cyclic Relaxation Problem”, 1973. Reprinted in Selected Writing on Computing: A Personal Perspective, Springer-Verlag, pp. 34–35, 1982.
E.W. Dijkstra, “Self-stabilizing Systems in Spite of Distributed Control”, Communications of the ACM 17(11), pp. 643–644, 1973.
D.Gries, The Science of Programming, Springer-Verlag, 1981.
M.G. Gouda and M. Evangelist, “Convergence Response Tradeoffs in Concurrent Systems”, MCC Technical Report #STP-124-89; also submitted to ACM TOPLAS.
O. Grumberg, N. Francez, J.A. Makovsky and W.P. deRoever, “A proof rule for fair termination of guarded commands”, Information and Control 66, pp. 83–102, 1985.
F. Harary, Graph Theory, Addison-Wesley Publishing, 1972.
C.A.R. Hoare, Communicating Sequential Processes, Prentice-Hall International, 1985.
T. Kohonen, Self-Organization and Associative Memory, Springer-Verlag, 1984.
H.T. Kung and C.E. Leiserson, “Systolic Arrays (for VLSI),” in Sparse Matrix Proc., 1978.
N.A. Lynch, “I/O Automata: A Model for Discrete Event Systems,” Proc. of 22nd Annual Conference on Information Sciences and Systems, 1988.
F. Robert, Discrete Iterations — A Metric Study, Springer-Verlag, 1986.
S. Wolfram, Theory and Applications of Cellular Automata, Advanced Series on Complex Systems, Vol.1, World Scientific Publishing, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arora, A., Attie, P., Evangelist, M., Gouda, M. (1990). Convergence of iteration systems. In: Baeten, J.C.M., Klop, J.W. (eds) CONCUR '90 Theories of Concurrency: Unification and Extension. CONCUR 1990. Lecture Notes in Computer Science, vol 458. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039052
Download citation
DOI: https://doi.org/10.1007/BFb0039052
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53048-0
Online ISBN: 978-3-540-46395-5
eBook Packages: Springer Book Archive