Three tokens in Herman's algorithm

DOI10.1007/s00165-012-0228-5zbMath1259.68230OpenAlexW1997745977MaRDI QIDQ1941880

Björn Wachter, Stefan Kiefer, Andrzej S. Murawski, James Worrell, Joël Ouaknine

Publication date: 22 March 2013

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-012-0228-5

Mathematics Subject Classification ID

Randomized algorithms (68W20)

Related Items (3)

Bounds on 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

Uses Software

• PRISM

Cites Work

• 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
• Coupling and self-stabilization
• On Stabilization in Herman’s Algorithm
• Diffusion-reaction in one dimension
• Self-stabilizing systems in spite of distributed control
• CONCUR 2005 – Concurrency Theory

This page was built for publication: Three tokens in Herman's algorithm