Resource bounds for self stabilizing message driven protocols
From MaRDI portal
Publication:5255827
DOI10.1145/112600.112624zbMath1314.68058OpenAlexW2041075048MaRDI QIDQ5255827
Shlomo Moran, Shlomi Dolev, Amos Israeli
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
Formal languages and automata (68Q45) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (4)
On the computational power of self-stabilizing systems ⋮ A uniform self-stabilizing minimum diameter spanning tree algorithm ⋮ Empire of colonies: Self-stabilizing and self-organizing distributed algorithm ⋮ Self-stabilizing depth-first search
This page was built for publication: Resource bounds for self stabilizing message driven protocols