A tighter bound for the self-stabilization time in Herman's algorithm

DOI10.1016/J.IPL.2013.04.006zbMATH Open1291.68428OpenAlexW1983293262MaRDI QIDQ2444741

Could not fetch data.

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

zbMATH Keywords

Markov chainsformal methodsHerman's algorithmself-stabilization algorithm

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

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

Related Items (2)

A nearly optimal upper bound for the self-stabilization time in Herman's algorithm ⋮ On the expected time for Herman's probabilistic self-stabilizing algorithm

This page was built for publication: A tighter bound for the self-stabilization time in Herman's algorithm

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