Uniform self-stabilizing rings
ACM Transactions on Programming Languages and Systems (TOPLAS)
Token Systems That Self-Stabilize
IEEE Transactions on Computers
Trade-offs in fault-containing self-stabilization
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Information Processing Letters
Self-Stabilizing Algorithms for Finding Centers and Medians of Trees
SIAM Journal on Computing
Error-detecting codes and fault-containing self-stabilization
Information Processing Letters
Fault-containing self-stabilization using priority scheduling
Information Processing Letters
Guarded commands, nondeterminacy and formal derivation of programs
Communications of the ACM
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Self-Stabilizing Strong Fairness under Weak Fairness
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Computers
A stabilizing algorithm for finding biconnected components
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
A Timestamp Based Transformation of Self-Stabilizing Programs for Distributed Computing Environments
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
Stabilization-Preserving Atomicity Refinement
Proceedings of the 13th International Symposium on Distributed Computing
Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
ICDCS '99 Workshop on Self-stabilizing Systems
Self-stabilizing depth-first token circulation in arbitrary rooted networks
Distributed Computing
Self-stabilizing extensions for message-passing systems
Distributed Computing - Special issue: Self-stabilization
Self-stabilizing depth-first token circulation on networks
Distributed Computing - Special issue: Self-stabilization
Self-stabilizing algorithm for maximal graph partitioning into triangles
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Hi-index | 0.00 |
System refinements from a strong to a weaker model are highly desirable because they allow designers to reason effectively in the strong model. Semantics and fairness refinements are often implemented by alternators preserving the property of stabilization. The existing alternators [Gouda and Haddix, Proceedings of the Third Workshop on Self-Stabilizing Systems (published in association with ICDCS99) The 19th IEEE International conference on Distributed Computing System), IEEE Computer Society Silver Spring, MD, 1999, pp. 48-53; Nesterenko and Arora, Disc99 Distributed Computing 13th International symposium springer, Berlin, 1999, pp. 254-268] provide semantics refinement but fail to implement starvation-freedom. Starvation-freedom requires that no two neighboring processes are scheduled simultaneously; along any interleaved execution, each action is executed infinitely often; no action is infinitely often enabled but never executed; and the number of enabled actions scheduled by the alternator is maximal. In this paper, we first establish the relationships between various mutual exclusion assumptions and the starvation-free alternators (SFAs) under various execution models.Then, as a remedy for the deficiencies of the existing alternators, we propose a fairness refinement for self-stabilizing distributed systems based on a state-space optimal self-stabilizing a (SFA) for arbitrary topologies and verify its correctness.