Weak vs. Self vs. Probabilistic Stabilization

DOI10.1142/S0129054115500173zbMath1320.68047OpenAlexW2259980641MaRDI QIDQ2947955

Sébastien Tixeuil, Stéphane Devismes, Masafumi Yamashita

Publication date: 29 September 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054115500173

zbMATH Keywords

distributed systemsfault-tolerancedistributed algorithmself-stabilizationprobabilistic self-stabilizationweak stabilization

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (6)

Partially Ordered Knowledge Sharing and Fractionated Systems in the Context of other Models for Distributed Computing ⋮ Dynamic FTSS in asynchronous systems: the case of unison ⋮ Fault containment in weakly stabilizing systems ⋮ Automated Analysis of Impact of Scheduling on Performance of Self-stabilizing Protocols ⋮ Parameterized synthesis of self-stabilizing protocols in symmetric networks ⋮ Loosely-Stabilizing Leader Election in Population Protocol Model

Cites Work

• Probabilistic self-stabilization
• Synchronous vs. asynchronous unison
• Stabilization and pseudo-stabilization
• Memory requirements for silent stabilization
• Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings
• Self-stabilizing systems in spite of distributed control
• Self-Stabilizing Algorithms for Finding Centers and Medians of Trees

This page was built for publication: Weak vs. Self vs. Probabilistic Stabilization