Self-stabilizing systems in spite of distributed control

@article{Dijkstra1974SelfstabilizingSI,
  title={Self-stabilizing systems in spite of distributed control},
  author={Edsger W. Dijkstra},
  journal={Commun. ACM},
  year={1974},
  volume={17},
  pages={643-644}
}
  • E. Dijkstra
  • Published 1 November 1974
  • Computer Science
  • Commun. ACM
The synchronization task between loosely coupled cyclic sequential processes (as can be distinguished in, for instance, operating systems) can be viewed as keeping the relation “the system is in a legitimate state” invariant. As a result, each individual process step that could possibly cause violation of that relation has to be preceded by a test deciding whether the process in question is allowed to proceed or has to be delayed. The resulting design is readily—and quite systematically… 
Self-Stabilizing Snapshot Objects for Asynchronous Fail-Prone Network Systems
TLDR
This work proposes self-stabilizing variations of Delporte-Gallet et al.'s non-blocking algorithm and always-terminating algorithm for snapshot objects in asynchronous crash-prone message-passing systems and considers repeated gossiping of O(v) bits messages and deals with bounded space (which is a prerequisite for self-Stabilization).
Automated Synthesis of Distributed Self-Stabilizing Protocols
TLDR
An SMT-based method that automatically synthesizes a distributed self-stabilizing protocol from a given high-level specification and network topology is introduced and successful synthesis of well-known protocols such as Dijkstra's token ring is reported.
Specification-Based Synthesis of Distributed Self-Stabilizing Protocols
TLDR
An SMT-based method that automatically synthesizes a distributed self-stabilizing protocol from a given high-level specification and the network topology is introduced and it is reported successful synthesis of Dijkstra's token ring and a self-Stabilizing version of Raymond's mutual exclusion algorithm.
Automated Synthesis of Timed and Distributed Fault-Tolerant Systems
TLDR
This dissertation concentrates on the problem of automated synthesis and repair of fault-tolerant systems, and proposes an automated sound and complete method to synthesize self-stabilizing systems starting from the desired topology and type of the system.
Performance Evaluation of Self-stabilizing Algorithms by Probabilistic Model Checking
TLDR
It is argued that the traditional methods existing for performance evaluation of self-stabilizing algorithms have shortcomings and do not give enough insight about the behavior of the system, and proposes a novel method based on probabilistic model checking and computation of the expected number of recovery steps.
Fault-tolerance of distributed algorithms: self-stabilization and wait-freedom
TLDR
Two promising paradigms, self-stabilization and wait-freedom, for designing fault-tolerant distributed algorithms are introduced and some subjects important from the point of view of algorithm engineering are discussed.
Self-stabilizing routing protocols
This Thesis is protected by copyright and/or related rights. It has been brought to you by Digital Scholarship@UNLV with permission from the rights-holder(s). You are free to use this Thesis in any
A self-stabilizing token circulation with graceful handover on bidirectional ring networks
  • H. Kakugawa, S. Kamei
  • Computer Science
    2021 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)
  • 2021
TLDR
This paper proposes an algorithm for circulating two tokens on bidirectional ring network with the locally shared memory model by extending Dijkstra’s self-stabilizing token ring, and proposes the concept of the model gap tolerance property for graceful handover.
...
...