Abstract
We present the development and the validation of an algorithm for detecting the termination of diffusing computations. To the best of our knowledge, this is the first one which is based on the maximal paths generated by a diffusing computation. After an informal presentation of the algorithm, we proceed to its rigorous development within the framework of the Unity formalism and the assistance of the PVS proof system. The correctness of the algorithm is established through a refinement of an abstract model.
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.
Similar content being viewed by others
References
M. Abadi and L. Lamport. The existence of refinement mappings. Technical Report 29, DEC, August 1988.
J.R. Abrial. The B-Book Assigning programs to meanings. Cambridge University Press, 1996.
K. Mani Chandy and Jayadev Misra. Parallel Program Design: A Foundation. Addison-Wesley, 1988.
Michel Charpentier. Assistance à la Répartition de Systèmes Réactifs. Thèse de doctorat, Institut National Polytechnique de Toulouse, France, November 1997.
E.W.D. Dijkstra and C.S. Scholten. Termination detection for diffusing computations. Information Processing Letters, 11(4): 1–4, 1980.
Mamoun Filali, Philippe Mauran, Gérard Padiou, Philippe Quéinnec, and Xavier Thirioux. Un algorithme de terminaison de calcul diffusant par évaluation des chemins maximaux. Rapport de recherche 99-22-R, Institut de Recherche en Informatique de Toulouse, November 1999. 35 pages.
N. Lynch and F. Vaandrager. Forward and backward simulations — part I: Untimed systems. Information and Computation, 121(2):214–233, September 1995.
Z. Manna and A. Pnueli. The temporal logic of reactive and concurrent systems: specification. Springer-Verlag, 1992.
Friedemann Mattern. Algorithms for distributed termination detection. Distributed Computing, 2(3):161–175, 1987.
Friedemann Mattern. Virtual time and global state in distributed systems. In M. Cosnard, Y. Robert, P. Quinton, and M. Raynal, editors, Parallel and Distributed Algorithms, pages 215–226. North-Holland, 1989.
Jayadev Misra. A logic for concurrent programming. Technical report, The University of Texas at Austin, April 1994.
Sam Owre, John M. Rushby, and Natarajan Shankar. PVS: A prototype verification system. In 11th Int’l Conf. on Automated Deduction, volume 607 of Lecture Notes in Computer Science, pages 748–752. Springer-Verlag, June 1992.
Michel Raynal. Synchronisation et État Global dans les Systèmes Répartis. Collection Direction Etudes-Recherches EDF. Edition Eyrolles, 1992.
Beverly A. Sanders. Eliminating the substitution axiom from UNITY logic. Formal Aspects of Computing, 3(2): 189–205, April-June 1991.
Rob T. Udink and Joost N. Kok. On the relation between Unity properties and sequence of states. Technical Report RUU-CS-93-07, Utrecht University, Dept. of Computer Science, February 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Filali, M., Mauran, P., Padiou, G., Quéinnec, P., Thirioux, X. (2000). Refinement based validation of an algorithm for detecting distributed termination. In: Rolim, J. (eds) Parallel and Distributed Processing. IPDPS 2000. Lecture Notes in Computer Science, vol 1800. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45591-4_140
Download citation
DOI: https://doi.org/10.1007/3-540-45591-4_140
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67442-9
Online ISBN: 978-3-540-45591-2
eBook Packages: Springer Book Archive