Resource bounds for self stabilizing message driven protocols

DOI10.1145/112600.112624MaRDI QIDQ5255827zbMATH OpenOpenAlexFDO

Authors Shlomi Dolev, Amos Israeli, Shlomo Moran

Publication date 19 June 2015

Published in Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/112600.112624

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Formal languages and automata (68Q45)

Cited in

(5)

• Empire of colonies: Self-stabilizing and self-organizing distributed algorithm
• Self-stabilizing depth-first search
• On the computational power of self-stabilizing systems
• A uniform self-stabilizing minimum diameter spanning tree algorithm
• Communication efficient self-stabilizing leader election

This page was built for publication: Resource bounds for self stabilizing message driven protocols

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