A belated proof of self-stabilization
Distributed Computing
Design and validation of computer protocols
Design and validation of computer protocols
ACM Computing Surveys (CSUR)
Self-stabilization by local checking and correction
Self-stabilization by local checking and correction
Introduction to distributed algorithms
Introduction to distributed algorithms
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Symbolic Model Checking for Self-Stabilizing Algorithms
IEEE Transactions on Parallel and Distributed Systems
Symbolic Model Checking
Exploitation of Ljapunov Theory for Verifying Self-Stabilizing Algorithms
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Verifying a self-stabilizing mutual exclusion algorithm
PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
A case-study in component-based mechanical verification of fault-tolerant programs
ICDCS '99 Workshop on Self-stabilizing Systems
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
| Hi-index | 0.00 |
We show that, contrary to common belief, Dijkstra's K-state mutual exclusion algorithm on a ring also stabilizes when the number K of states per process is one less than the number N + 1 of processes in the ring. We formalize the algorithm and verify the proof in PVS, based on Qadeer and Shankar's work. We show that K = N is sharp by giving a counter-example for K = N - 1.