Termination detection of distributed algorithms by graph relabelling systems

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

Volumn 2505, Issue , 2002, Pages 106-119

  Godard, Emmanuel ^a   Mètivier, Yves ^a   Mosbah, Mohamed ^a   Sellami, Afif ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY;

DISTRIBUTED COMPUTATIONS; GRAPH RELABELLING SYSTEMS; GRAPH REWRITING SYSTEMS; TERMINATION DETECTION;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84910117579     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45832-8_10     Document Type: Conference Paper

References (18)

1. M. Bauderon, S. Gruner, Y. Mètivier, M. Mosbah, and A. Sellami. Visualization of distributed algorithms based on labeled rewriting systems. In Second International Workshop on Graph Transformation and Visual Modeling Techniques, Crete, Greece, July 12-13, 2001.
2. M. Bauderon, Y. Mètivier, M. Mosbah, and A. Sellami. From local computations to asynchronous message passing systems. Technical Report RR-1271-02, LaBRI, 2002.
3. M. Billaud, P. Lafon, Y. Mètivier, and E. Sopena. Graph rewriting systems with priorities. Lecture notes in computer science, 411:94–106, 1989.
4. K. M. Chandy and L. Lamport. Distributed snapshots: Determining global states of distributed systems. ACM Transations on Computer Systems, 3(1):63–75, 1985.
5. K. Mani Chandy, Laura M. Haas, and Jayadev Misra. Distributed deadlock detection. ACM Transactions on Computer Systems, 1(2):144–156, May 1983.
6. Edsger W. Dijkstra, W. H. J. Feijen, and A. J. M. van Gasteren. Derivation of a termination detection algorithm for distributed computations. Information Processing Letters, 16(5):217–219, 1983.
7. E.W. Dijkstra and C.S. Sholten. Termination detection for diffusing computations. Information Processing Letters, 11(1):1–4, 1980.
8. S. Dolev. Self-stabilization. The MIT Press, 2000.
9. E. Godard, Y. Mètivier, M. Mosbah, and A. Sellami. Termination detection of distributed algorithms by graph relabelling systems. Technical report, LaBRIUniversity of Bordeaux 1, 2002.
10. I. Litovsky and Y. Mètivier. Computing trees with graph rewriting systems with priorities. Tree automata and languages, pages 115–139, 1992.
11. I. Litovsky and Y. Mètivier. Computing with graph rewriting systems with priorities. Theoret. Comput. Sci., 115:191–224, 1993.
12. I. Litovsky, Y. Mètivier, and E. Sopena.: Different local controls for graph relabelling systems. Math. Syst. Theory, 28:41–65, 1995.
13. Y. Mètivier, M. Mosbah, and A. Sellami.: Proving distributed algorithms by graph relabeling systems: Examples of trees in networks with processor identities. In Applied Graph Transformations, Grenoble, April, 2002.
14. Y. Mètivier and G. Tel. Termination detection and universal graph reconstruction. In International Colloquium on structural information and communication complexity, pages 237–251. Carleton scientific press, 2000.
15. M. Mosbah and A. Sellami. Visidia: A tool for the visualization and similation of distributed algorithms. http://www.labri.fr/visidia/.
16. G. Tel. Introduction to distributed algorithms. Cambridge University Press, 2000.
17. Gerard Tel and Friedemann Mattern. The derivation of distributed termination detection algorithms from garbage collection schemes. ACM Transactions on Programming Languages and Systems, 15(1):1–35, January 1993.
18. B. Szymanski, Y. Shi and N. Prywes. Terminating iterative solutions of simultaneous equations in distributed message passing systems. In 4th International Conference on Distributed Computing Systems, pages 287–292, 1985.