ACM Computing Surveys (CSUR)
Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
The Triumph and Tribulation of System Stabilization
WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
Fault-Containment in Weakly-Stabilizing Systems
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Algorithms and theory of computation handbook
A tranformational approach for designing scheduler-oblivious self-stabilizing algorithms
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Effect of fairness in model checking of self-stabilizing programs
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Dynamic FTSS in asynchronous systems: The case of unison
Theoretical Computer Science
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Loosely-Stabilizing leader election in population protocol model
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Loosely-stabilizing leader election in a population protocol model
Theoretical Computer Science
A Lightweight Method for Automated Design of Convergence in Network Protocols
ACM Transactions on Autonomous and Adaptive Systems (TAAS) - Special Section: Extended Version of SASO 2011 Best Paper
Brief announcement: probabilistic stabilization under probabilistic schedulers
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Towards scalable model checking of self-stabilizing programs
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
We investigate a new property of computing systems called weak stabilization. Although this property is strictly weaker than the well-known property of stabilization, weak stabilization is superior to stabilization in several respects. In particular, adding delays to a system preserves the system property of weak stabilization, but does not necessarily preserve its stabilization property. Because most implementations are bound to add arbitrary delays to the systems being implemented, weakly stabilizing systems are much easier to implement than stabilizing systems. We also prove the following important result. A weakly stabilizing system that has a finite number of states is in fact stabilizing assuming that the system execution is strongly fair. Finally, we discuss an interesting method for composing several weakly stabilizing systems into a single weakly stabilizing system.