DISC 1999: Distributed Computing pp 240-255 | Cite as

A New Rewrite Method for Proving Convergence of Self-Stabilizing Systems

  • Joffroy Beauquier
  • Béatrice Bérard
  • Laurent Fribourg
Conference paper
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1693)

Abstract

In the framework of self-stabilizing systems, the convergence proof is generally done by exhibiting a measure that strictly decreases until a legitimate configuration is reached. The discovery of such a mea- sure is very specific and requires a deep understanding of the studied transition system. In contrast we propose here a simple method for prov- ing convergence, which regards self-stabilizing systems as string rewrite systems, and adapts a procedure initially designed by Dershowitz for proving termination of string rewrite systems.

This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    G. Antonoiu and P.K. Srimani. “A Self-Stabilizing Leader Election Algorithm for Tree Graphs”, Journal of Parallel and Distributed Computing, 34:2, May 1996, pp. 227–232.CrossRefGoogle Scholar
  2. 2.
    Y. Afek, S. Kutten and M. Yung M.. “Memory efficient self stabilizing protocols for general networks”, Proc. 7th WDAG, LNCS 725, Springer-Verlag, 1990, pp. 15–28.Google Scholar
  3. 3.
    A. Arora, M.G. Gouda and T. Herman. “Composite routing protocols”. Proc. 2nd IEEE Symp. on Parallel and Distributed Processing, 1990.Google Scholar
  4. 4.
    J. Beauquier and O. Debas. “An optimal self-stabilizing algorithm for mutual exclusion on uniform bidirectional rings”. Proc. 2nd Workshop on Self-Stabilizing Systems, Las Vegas, 1995, pp. 226–239.Google Scholar
  5. 5.
    R.V. Book and F. Otto. String-Rewriting Systems. Springer-Verlag, 1993.Google Scholar
  6. 6.
    J.E. Burns and J. Pachl. “Uniform Self-Stabilizing Rings”. TOPLAS 11:2, 1989.Google Scholar
  7. 7.
    N. Dershowitz. “Termination of Linear Rewriting Systems”. Proc. ICALP, LNCS 115, Springer-Verlag, 1981, pp. 448–458.Google Scholar
  8. 8.
    N. Dershowitz and C. Hoot. “Topics in termination”. Proc. Rewriting Techniques and Applications, LNCS 690, Springer-Verlag, 1993, pp. 198–212.Google Scholar
  9. 9.
    N. Dershowitz and J.-P. Jouannaud. “Rewrite Systems”. Handbook of Theoretical Computer Science, vol. B, Elsevier–MIT Press, 1990, pp. 243–320.MathSciNetGoogle Scholar
  10. 10.
    E.W. Dijkstra. “Self-stabilizing systems in spite of distributed control”. Comm. ACM 17:11, 1974, pp. 643–644.MATHCrossRefGoogle Scholar
  11. 11.
    E.W. Dijkstra. “A Belated Proof of Self-stabilization”. Distributed Computing 1:1, 1986, pp. 5–6.MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    M. Fay. “First-order uni.cation in an equational theory”. Proc. 4th Workshop on Automated Deduction, Austin, Texas, 1979, pp. 161–167.Google Scholar
  13. 13.
    S. Ghosh. “An Alternative Solution to a Problem on Self-Stabilization”. ACM TOPLAS 15:4, 1993, pp. 735–742.CrossRefGoogle Scholar
  14. 14.
    M.G. Gouda. “The triumph and tribulation of system stabilization”. Proc. 9th WDAG, LNCS 972, Springer-Verlag, 1995, pp. 1–18.Google Scholar
  15. 15.
    M.G. Gouda and T. Herman. “Adaptative programming”. IEEE Transactions on Software Engineering 17, 1991, pp.911–921.CrossRefMathSciNetGoogle Scholar
  16. 16.
    T. Herman. Adaptativity through distributed convergence. Ph.D. Thesis, University of Texas at Austin. 1991.Google Scholar
  17. 17.
    J.-H. Hoepman. “Uniform Deterministic Self-Stabilizing Ring-Orientation on Odd-Length Rings”. Proc. 8th Workshop on Distributed Algorithms, LNCS 857, Springer-Verlag. 1994, pp.265–279.CrossRefGoogle Scholar
  18. 18.
    S.C. Hsu and S.T. Huang. “A self-stabilizing algorithm for maximal matching”. Information Processing Letters 43:2, 1992, pp. 77–81.MATHCrossRefMathSciNetGoogle Scholar
  19. 19.
    J.-M. Hullot. “Canonical Forms and Unification”. Proc. 5th Conf. on Automated Deduction, LNCS, Springer-Verlag, 1980, pp. 318–334.Google Scholar
  20. 20.
    J. Jaffar. “Minimal and Complete Word Unification”. J. ACM 37:1, 1990, pp. 47–85.MATHCrossRefMathSciNetGoogle Scholar
  21. 21.
    S. Katz and K.J. Perry. “Self-stabilizing extensions for message-passing systems”. Distributed Computing 7, 1993, pp. 17–26.CrossRefGoogle Scholar
  22. 22.
    J.L.W. Kessels. “An Exercise in proving self-stabilization with a variant function”. Information and Processing Letters 29, 1988, pp. 39–42.MATHCrossRefMathSciNetGoogle Scholar
  23. 23.
    Y. Kesten, O. Maler, M. Marcuse, A. Pnueli and E. Shahar. “Symbolic Model-Checking with Rich Assertional Languages”. Proc. CAV’97, LNCS 1254, Springer-Verlag, 1997, pp. 424–435.Google Scholar
  24. 24.
    I. Litovski and Y. Métivier. “Computing with Graph Rewriting Systems with Priorities”. Theoretical Computer Science 115:2, 1993, pp. 191–224.CrossRefMathSciNetGoogle Scholar
  25. 25.
    I. Litovski, Y. Métivier and E. Sopena. “Different Local Controls for Graph Relabeling Systems”. Mathematical Systems Theory 28:1, 1995, pp. 41–65.CrossRefMathSciNetGoogle Scholar
  26. 26.
    I. Litovski, Y. Métivier and W. Zielonka. “On the Recognition of Families of Graphs with Local Computations”. Information and Computation 118:1, 1995, pp. 110–119.CrossRefMathSciNetGoogle Scholar
  27. 27.
    G.S. Makanin. “The problem of solvability of equations in a free semigroup”. Matematiceskij Sbornik 103, 1977, pp. 147–236.MathSciNetGoogle Scholar
  28. 28.
    M. Schneider. “Self-Stabilization”. ACM Computing Surveys 25:1, 1993.Google Scholar
  29. 29.
    J.R. Slagle. “Automated Theorem-Proving for Theories with Simplifiers, Commutativity, and Associativity.” J. ACM 21:4, 1974, pp. 622–642.MATHCrossRefMathSciNetGoogle Scholar
  30. 30.
    G. Tel. Introduction to Distributed Algorithms. Cambridge University Press, 1994.Google Scholar
  31. 31.
    O. Theel and F.C. Gärtner. “An Exercise in Proving Convergence through Transfer Functions”. Proc. 4th Workshop on Self-stabilizing Systems, Austin, Texas, 1999, pp. 41–47.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Joffroy Beauquier
    • 1
  • Béatrice Bérard
    • 1
  • Laurent Fribourg
    • 2
  1. 1.LRI, CNRS URA 410Université Paris-SudOrsay cedexFrance
  2. 2.LSV, CNRS UMR 8643ENS de CachanCachan cedexFrance

Personalised recommendations