Three tokens in Herman's algorithm

DOI10.1007/S00165-012-0228-5zbMATH Open1259.68230OpenAlexW1997745977MaRDI QIDQ1941880FDOQ1941880

Authors: Stefan Kiefer, Andrzej S. Murawski, Björn Wachter, 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

Recommendations

• On stabilization in Herman's algorithm
• Bounds on Herman's algorithm
• Proving the Herman-protocol conjecture
• An elementary proof that Herman's ring is \(\Theta (N^{2})\)
• On the expected time for Herman's probabilistic self-stabilizing algorithm

Mathematics Subject Classification ID

Randomized algorithms (68W20)

Cites Work

• Self-stabilization
• Self-stabilizing systems in spite of distributed control
• Interacting particle systems. With a new postface.
• Diffusion-reaction in one dimension
• Probabilistic self-stabilization
• An elementary proof that Herman's ring is \(\Theta (N^{2})\)
• Coupling and self-stabilization
• On stabilization in Herman's algorithm
• On the expected time for Herman's probabilistic self-stabilizing algorithm
• CONCUR 2005 – Concurrency Theory
• Random walks, Brownian motion, and interacting particle systems. A Festschrift in honor of Frank Spitzer

Cited In (5)

• Bounds on Herman's algorithm
• A tighter bound for the self-stabilization time in Herman's algorithm
• On stabilization in Herman's algorithm
• Proving the Herman-protocol conjecture
• A nearly optimal upper bound for the self-stabilization time in Herman's algorithm

Uses Software

• PRISM

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1941880)