Refinement based validation of an algorithm for detecting distributed termination

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1800, Issue , 2000, Pages 1027-1036

  Filali, Mamoun ^a   Mauran, Philippe ^a   Padiou, Gérard ^a   Quéinnec, Philippe ^a   Thirioux, Xavier ^a  

^a IRIT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; DISTRIBUTED PARAMETER NETWORKS;

ABSTRACT MODELING; DIFFUSING COMPUTATION; DISTRIBUTED TERMINATION; INFORMAL PRESENTATION; MAXIMAL PATH; PROOF SYSTEM; ABSTRACT MODELS;

ALGORITHMS;

EID: 84876378219     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-45591-4_140     Document Type: Article

References (15)

1. M. Abadi and L. Lamport. The existence of refinement mappings. Technical Report 29, DEC, August 1988.
2. J.R. Abrial. The B-Book Assigning programs to meanings. Cambridge University Press, 1996.
3. K. Mani Chandy and Jayadev Misra. Parallel Program Design: A Foundation. Addison-Wesley, 1988.
4. Michel Charpentier. Assistance à la Répartition de Systèmes Réactifs. Thèse de doctorat, Institut National Polytechnique de Toulouse, France, November 1997.
5. E.W.D. Dijkstra and C.S. Scholten. Termination detection for diffusing computations. Information Processing Letters, 11(4):1-4, 1980.
6. 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.
7. N. Lynch and F. Vaandrager. Forward and backward simulations - part I: Untimed systems. Information and Computation, 121(2):214-233, September 1995.
8. Z. Manna and A. Pnueli. The temporal logic of reactive and concurrent systems: specification. Springer-Verlag, 1992.
9. Friedemann Mattern. Algorithms for distributed termination detection. Distributed Computing, 2(3):161-175, 1987.
10. 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.
11. Jayadev Misra. A logic for concurrent programming. Technical report, The University of Texas at Austin, April 1994.
12. Sam Owre, JohnM. 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.
13. Michel Raynal. Synchronisation et État Global dans les Systèmes Répartis. Collection Direction Etudes-Recherches EDF. Edition Eyrolles, 1992.
14. Beverly A. Sanders. Eliminating the substitution axiom from UNITY logic. Formal Aspects of Computing, 3(2):189-205, April-June 1991.
15. 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.