Skip to main content

The Theory of Weak Stabilization

  • Conference paper
  • First Online:
Self-Stabilizing Systems (WSS 2001)

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

Included in the following conference series:

Abstract

We investigate a new property of computing systems called weak stabilization. Although this property is strictly weaker than the well-known property of stabilization, weak stabilization is superior to stabilization in several respects. In particular, adding delays to a system preserves the system property of weak stabilization, but does not necessarily preserve its stabilization property. Because most implementations are bound to add arbitrary delays to the systems being implemented, weakly stabilizing systems are much easier to implement than stabilizing systems. We also prove the following important result. A weakly stabilizing system that has a finite number of states is in fact stabilizing assuming that the system execution is strongly fair. Finally, we discuss an interesting method for composing several weakly stabilizing systems into a single weakly stabilizing system.

This work is supported in part by DARPA contract F33615-01-C-1901.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arora, A., Gouda, M.G.: Delay-Insensitive Stabilization. Proceedings of the Third Workshop on Self-Stabilizing Systems (1997) 95–109

    Google Scholar 

  2. Dijkstra, E.W.: Self-Stabilizing Systems in Spite of Distributed Control. Communications of the ACM, Vol. 17 (1974) 643–644

    Article  MATH  Google Scholar 

  3. Dolev, S.: Self-Stabilization. 1st edn. MIT Press, Cambridge Massachusetts (2000)

    MATH  Google Scholar 

  4. Flatebo, M., Datta, A.K.: Self-Stabilization in Distributed Systems. In: Casavant, T.L., Singhal, M. (eds.): Readings in Distributed Computing Systems. Lecture Notes in Computer Science, Vol. 1281. Springer-Verlag, Berlin Heidelberg New York (1994) 100–114

    Google Scholar 

  5. .Gouda, M.G.: The Triumph and Tribulation of System Stabilization. In: Helary, J.M., Raynal, M. (eds.): Proceedings of the International Workshop on Distributed Algorithms. Lecture Notes in Computer Science, Vol. 972. Springer-Verlag, Berlin Heidelberg (1995) 1–18

    Chapter  Google Scholar 

  6. Herman, T.: A Comprehensive Bibliography on Self-Stabilization. http://www.cs.uiowa.edu/ftp/selfstab/bibliography/2000 (2000)

  7. Schneider, M.: Self-Stabilization. ACM Computing Surveys, Vol. 25 (1993) 45–67

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Sppringer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gouda, M.G. (2001). The Theory of Weak Stabilization. In: Datta, A.K., Herman, T. (eds) Self-Stabilizing Systems. WSS 2001. Lecture Notes in Computer Science, vol 2194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45438-1_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-45438-1_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45438-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics