Axioms for memory access in asynchronous hardware systems
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
The mutual exclusion problem: partII—statement and solutions
Journal of the ACM (JACM)
A belated proof of self-stabilization
Distributed Computing
Token Systems That Self-Stabilize
IEEE Transactions on Computers
The instability of self-stabilization
Acta Informatica
A first-come-first-served mutual-exclusion algorithm with small communication variables
ACM Transactions on Programming Languages and Systems (TOPLAS)
Stability and stabilizability of discrete event dynamic systems
Journal of the ACM (JACM)
Wait-free clock synchronization
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Unifying self-stabilization and fault-tolerance
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Closure and Convergence: A Foundation of Fault-Tolerant Computing
IEEE Transactions on Software Engineering - Special issue on software reliability
Component Based Design of Multitolerant Systems
IEEE Transactions on Software Engineering
Self-stabilization
Concurrent reading and writing
Communications of the ACM
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Self-Stabilization by Counter Flushing
SIAM Journal on Computing
Self-Stabilization of Wait-Free Shared Memory Objects
WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
Applications of Probabilistic Quorums to Iterative Algorithms
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Self-Stabilizing Microprocessor: Analyzing and Overcoming Soft Errors
IEEE Transactions on Computers
Fault-Tolerant Implementations of Regular Registers by Safe Registers with Applications to Networks
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
The truth system: can a system of lying processes stabilize?
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Pragmatic self-stabilization of atomic memory in message-passing systems
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
| Hi-index | 0.00 |
The first self-stabilizing algorithm published by Dijkstra in 1973 assumed the existence of a central daemon, that activates one processor at time to change state as a function of its own state and the state of a neighbor. Subsequent research has reconsidered this algorithm without the assumption of a central daemon, and under different forms of communication, such as the model of link registers. In all of these investigations, one common feature is the atomicity of communication, whether by shared variables or read/write registers. This paper weakens the atomicity assumptions for the communication model, proposing versions of Dijkstra's algorithm that tolerate various weaker forms of atomicity, including cases of regular and safe registers. The paper also presents an implementation of Dijkstra's algorithm based on registers that have probabilistically correct behavior, which requires a notion of weak stabilization, where Markov chains are used to evaluate the probability to be in a safe configuration.