Weak vs. Self vs. Probabilistic Stabilization - Archive ouverte HAL Access content directly
Conference Papers Year :

Weak vs. Self vs. Probabilistic Stabilization

Stéphane Devismes
Sébastien Tixeuil
Masafumi Yamashita
  • Function : Author


Self-stabilization is a strong property which guarantees that a network always resume a correct behavior starting from an arbitrary initial state. Weaker guarantees have later been introduced to cope with impossibility results: probabilistic stabilization only gives probabilistic convergence to a correct behavior. Also, weak-stabilization only gives the possibility of convergence. In this paper, we investigate the relative power of weak, self, and probabilistic stabilization, with respect to the set of problems that can be solved. We formally prove that in that sense, weak stabilization is strictly stronger that self-stabilization. Also, we refine previous results on weak stabilization to prove that, for practical schedule instances, a deterministic weak-stabilizing protocol can be turned into a probabilistic self-stabilizing one. This latter result hints at more practical use of weak-stabilization, as such algorithms are easier to design and prove than their (probabilistic) self-stabilizing counterparts.

Dates and versions

hal-01303470 , version 1 (18-04-2016)



Stéphane Devismes, Sébastien Tixeuil, Masafumi Yamashita. Weak vs. Self vs. Probabilistic Stabilization. IEEE International Conference on Distributed Computing Systems (ICDCS 2008), Jun 2008, Beijing, China. pp.681-688, ⟨10.1109/ICDCS.2008.12⟩. ⟨hal-01303470⟩
61 View
0 Download



Gmail Facebook Twitter LinkedIn More