Binary self-stabilization in distributed systems
Information Processing Letters
Self-stabilization
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
Uniform Deterministic Self-Stabilizing Ring-Orientation on Odd-Length Rings
WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
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
The Theory of Weak Stabilization
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Brief announcement: verification of stabilizing programs with SMT solvers
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
| Hi-index | 0.00 |
Existing approaches for verifying self-stabilization with symbolic model checker have relied on the use of weak fairness. We point out that this approach has limited scalability. To overcome this limitation, we show that if self-stabilization is possible without fairness then cost of verifying self-stabilization is substantially lower. The practical meaning of this observation is if the extra effort required to verify self-stabilization under weak fairness is not necessary then the state space reached by model checking of self-stabilizing programs could be substantially larger.