A tighter bound for the self-stabilization time in Herman's algorithm
From MaRDI portal
Publication:2444741
DOI10.1016/j.ipl.2013.04.006zbMath1291.68428MaRDI QIDQ2444741
Publication date: 11 April 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2013.04.006
Related Items
Cites Work
- On the expected time for Herman's probabilistic self-stabilizing algorithm
- Probabilistic self-stabilization
- An elementary proof that Herman's ring is \(\Theta (N^{2})\)
- Probabilistic verification of Herman's self-stabilisation algorithm
- Three tokens in Herman's algorithm
- Coupling and self-stabilization
- On Stabilization in Herman’s Algorithm