On Stabilization in Herman’s Algorithm

DOI10.1007/978-3-642-22012-8_37zbMath1333.68038arXiv1104.3100OpenAlexW1942846975MaRDI QIDQ3012941

Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, James Worrell, Li-jun Zhang

Publication date: 7 July 2011

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1104.3100

Mathematics Subject Classification ID

Distributed systems (68M14) Randomized algorithms (68W20) Network protocols (68M12) Distributed algorithms (68W15)

Related Items (6)

Bounds on Herman's algorithm ⋮ Probabilistic verification of Herman's self-stabilisation algorithm ⋮ Three tokens in Herman's algorithm ⋮ A tighter bound for the self-stabilization time in Herman's algorithm ⋮ A nearly optimal upper bound for the self-stabilization time in Herman's algorithm ⋮ On Stabilization in Herman’s Algorithm

Uses Software

• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interacting particle systems. With a new postface.
• 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})\)
• Random walks, Brownian motion, and interacting particle systems. A Festschrift in honor of Frank Spitzer
• Stabilizing time-adaptive protocols
• Coupling and self-stabilization
• On Stabilization in Herman’s Algorithm
• Diffusion-reaction in one dimension
• Self-stabilizing systems in spite of distributed control

This page was built for publication: On Stabilization in Herman’s Algorithm