Self-stabilizing systems in spite of distributed control

@article{Dijkstra1974SelfstabilizingSI,
  title={Self-stabilizing systems in spite of distributed control},
  author={E. Dijkstra},
  journal={Commun. ACM},
  year={1974},
  volume={17},
  pages={643-644}
}
  • E. Dijkstra
  • Published 1974
  • Computer Science, Mathematics
  • 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… Expand
Self-stabilizing Uniform Reliable Broadcast (preliminary version)
We study a well-known communication abstraction called Uniform Reliable Broadcast (URB). URB is central in the design and implementation of fault-tolerant distributed systems, as many non-trivialExpand
1-1-1994 Self-stabilizing routing protocols
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. Expand
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. Expand
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. Expand
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. Expand
Computing the Stabilization Times of Self-Stabilizing Systems
A self-stabilizing token circulation with graceful handover on bidirectional ring networks
  • H. Kakugawa, Sayaka 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. Expand
Certification of an Exact Worst-Case Self-Stabilization Time
TLDR
This work is the first attempt to certify time complexity bounds of fault-tolerant distributed algorithms, using the Coq proof assistant to formally prove the time complexity of the first Dijkstra’s self-stabilizing token ring algorithm. Expand
Self-Stabilizing Indulgent Zero-degrading Binary Consensus
TLDR
This work proposes the first, to the best of the knowledge, self-stabilizing algorithm for indulgent zero-degrading binary consensus for time-free message-passing systems prone to detectable process failures and presents a variation on the one by Mostéfaoui, Mourgaya, and Raynal. Expand
...
1
2
3
4
5
...