Skip to main content
SpringerLink
Log in
Book cover

International Conference on Graph Transformation

ICGT 2002: Graph Transformation pp 106–119Cite as

Termination Detection of Distributed Algorithms by Graph Relabelling Systems

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2505))

Abstract

A unified and general scheme for detecting the termination of distributed computations is proposed. This scheme uses the encoding of distributed algorithms in form of graph rewriting systems to transform the problem of adding termination detection to a distributed computation into an operation on graph rewriting systems. Various examples are used to illustrate this approach.

This work is a part of the Visidia project [15], and has been supported by the “Conseil Régional d’Aquitaine”.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Article  Google Scholar 

  5. K. Mani Chandy, Laura M. Haas, and Jayadev Misra. Distributed deadlock detection. ACM Transactions on Computer Systems, 1(2):144–156, May 1983.

    Google Scholar 

  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.

    Article  MathSciNet  Google Scholar 

  7. E.W. Dijkstra and C.S. Sholten. Termination detection for diffusing computations. Information Processing Letters, 11(1):1–4, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  8. S. Dolev. Self-stabilization. The MIT Press, 2000.

    Google Scholar 

  9. E. Godard, Y. Métivier, M. Mosbah, and A. Sellami. Termination detection of distributed algorithms by graph relabelling systems. Technical report, LaBRI-University of Bordeaux 1, 2002.

    Google Scholar 

  10. I. Litovsky and Y. Métivier. Computing trees with graph rewriting systems with priorities. Tree automata and languages, pages 115–139, 1992.

    Google Scholar 

  11. I. Litovsky and Y. Métivier. Computing with graph rewriting systems with priorities. Theoret. Comput. Sci., 115:191–224, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  12. I. Litovsky, Y. Métivier, and E. Sopena. Different local controls for graph relabelling systems. Math. Syst. Theory, 28:41–65, 1995.

    Article  MATH  Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LaBRI - Université Bordeaux1, 351 Cours de la Libération, 33405, Talence, France

    Emmanuel Godard, Yves Métivier, Mohamed Mosbah & Afif Sellami

Authors
  1. Emmanuel Godard
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yves Métivier
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mohamed Mosbah
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Afif Sellami
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, Corso Italia 40, 56125, Pisa, Italy

    Andrea Corradini

  2. Computer Science Department, Technical University of Berlin, Franklinstraße 28/29, 10587, Berlin, Germany

    Hartmut Ehrig

  3. Computer Science Department, University of Bremen, Bibliothekstraße 1, 28359, Bremen, Germany

    Hans -Jörg Kreowski

  4. Leiden Institute of Advanced Computer Science, Leiden University, Niels Bohrweg 1, 2333, CA Leiden, The Netherlands

    Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Godard, E., Métivier, Y., Mosbah, M., Sellami, A. (2002). Termination Detection of Distributed Algorithms by Graph Relabelling Systems. In: Corradini, A., Ehrig, H., Kreowski, H.J., Rozenberg, G. (eds) Graph Transformation. ICGT 2002. Lecture Notes in Computer Science, vol 2505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45832-8_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-45832-8_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44310-0

  • Online ISBN: 978-3-540-45832-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation