Abstract
A self-stabilizing algorithm [2] is a distributed algorithm with an additional property: it guarantees to eventually execute its task, by reaching a legitimate configuration, regardless of the state in which the processes and communication links are started.
Some algorithms are supposed to remain safe at all times while they carry out their task. Safety, however, is impossible when very high levels of failures overwhelm the system, e.g., when more than a third of the processes are Byzantine, or in the extreme case, when all the processes disappear.
A detailed version appears in a technical report [1].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Delaët, S., Dolev, S., Peres, O.: Safe and eventually safe: Comparing stabilizing and non-stabilizing algorithms on a common ground. Technical Report 0905, Ben-Gurion University of the Negev (August 2009)
Dolev, S.: Self-Stabilization. MIT Press, Cambridge (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Delaët, S., Dolev, S., Peres, O. (2009). Safer Than Safe: On the Initial State of Self-stabilizing Systems. In: Guerraoui, R., Petit, F. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2009. Lecture Notes in Computer Science, vol 5873. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05118-0_55
Download citation
DOI: https://doi.org/10.1007/978-3-642-05118-0_55
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05117-3
Online ISBN: 978-3-642-05118-0
eBook Packages: Computer ScienceComputer Science (R0)