Dijkstra's self-stabilizing algorithm in unsupportive environments

DOI10.1007/3-540-45438-1_5MaRDI QIDQ4446600zbMATH OpenFDO

Authors Shlomi Dolev, Ted Herman

Publication date 2 February 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2194/21940067.htm

Mathematics Subject Classification ID

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

Recommendations

• Probabilistic self-stabilization
• On the costs of self-stabilization
• A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring
• Self-stabilization
• Self-stabilization with r-Operators Revisited

Cited in

(5)

• Short correctness proofs for two self-stabilizing algorithms under the distributed daemon model
• A self-stabilizing algorithm for strong fairness
• Studies on algorithms for self-stabilizing communication protocols
• Practically stabilizing SWMR atomic memory in message-passing systems
• Self-stabilizing and private distributed shared atomic memory in seldomly fair message passing networks

This page was built for publication: Dijkstra's self-stabilizing algorithm in unsupportive environments

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