Necessary and Sufficient Conditions for 1-adaptivity

A 1-adaptive self-stabilizing system is a self-stabilizing system that can correct any memory corruption of a single process in one computation step. 1-adaptivity means that if in a legitimate state the memory of a single process is corrupted, then the next system transition will lead to a legitimate state and the system will recover a correct behavior. Thus 1-adaptive self-stabilizing algorithms guarantee the very strong property that a single fault is corrected immediately and consequently that it cannot be propagated. Our aim here is to study necessary and sufficient conditions to obtain that property in order to design such algorithms. In particular we show that this property can be obtained even under the distributed demon and that it can also be applied to probabilistic algorithms. We provide two self-stabilizing 1-adaptive algorithms that demonstrate how the conditions we present here can be used to design and prove 1-adaptive algorithms

[1]  Shlomi Dolev,et al.  Self Stabilization , 2004, J. Aerosp. Comput. Inf. Commun..

[2]  Boaz Patt-Shamir,et al.  Adaptive Stabilization of Reactive Protocols , 2004, FSTTCS.

[3]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[4]  Ted Herman.  Observations on Time-Adaptive Self-Stabilization , 1997 .

[5]  Shay Kutten,et al.  Fault-Local Distributed Mending , 1999, J. Algorithms.

[6]  Sriram V. Pemmaraju,et al.  Error-detecting codes and fault-containing self-stabilization , 2000, Inf. Process. Lett..

[7]  Arobinda Gupta,et al.  Fault-containing self-stabilizing algorithms , 1996, PODC '96.

[8]  Boaz Patt-Shamir,et al.  Distributed error confinement , 2003, PODC '03.

[9]  Hagit Attiya,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 1998 .

[10]  Yehuda Afek,et al.  Self-stabilizing unidirectional network algorithms by power-supply , 1997, SODA '97.

[11]  Valmir Carneiro Barbosa,et al.  An introduction to distributed algorithms , 1996 .

[12]  Sébastien Tixeuil,et al.  A lower bound on dynamic k-stabilization in asynchronous systems , 2002, 21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings..

[13]  Boaz Patt-Shamir,et al.  Asynchronous time-adaptive self stabilization , 1998, PODC '98.

[14]  Boaz Patt-Shamir,et al.  Time-adaptive self stabilization , 1997, PODC '97.

[15]  Marcin Paprzycki,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 2001, Scalable Comput. Pract. Exp..

[16]  Sébastien Tixeuil,et al.  Transient fault detectors , 1998, Distributed Computing.

[17]  Shay Kutten,et al.  Optimal reactive k-stabilization: the case of mutual exclusion , 1999, PODC '99.

[18]  Anish Arora,et al.  Tolerance to unbounded Byzantine faults , 2002, 21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings..

[19]  Shlomi Dolev,et al.  SuperStabilizing protocols for dynamic distributed systems , 1995, PODC '95.

[20]  Shay Kutten,et al.  Fault-local distributed mending (extended abstract) , 1995, PODC '95.

[21]  Ted Herman,et al.  Superstabilizing mutual exclusion , 2000, Distributed Computing.

[22]  Yehuda Afek,et al.  Local Stabilizer , 2002, J. Parallel Distributed Comput..