All k-bounded policies are equivalent for self-stabilization

Authors:
Joffroy Beauquier;Colette Johnen;Stéphane Messika
Affiliations:
L.R.I., C.N.R.S., Université Paris-Sud 11, Orsay Cedex, France;L.R.I., C.N.R.S., Université Paris-Sud 11, Orsay Cedex, France;L.R.I., C.N.R.S., Université Paris-Sud 11, Orsay Cedex, France
Venue:
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Year:
2006

Citing 14
Cited 1

Verification of multiprocess probabilistic protocols

Distributed Computing
Probabilistic self-stabilization

Information Processing Letters
Formal verification of timed properties of randomized distributed algorithms

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Memory space requirements for self-stabilizing leader election protocols

Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem

POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Analyzing Expected Time by Scheduler-Luck Games

IEEE Transactions on Software Engineering
Verification of the Randomized Consensus Algorithms of Aspnes and Herlihy: A Case Study

WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
Randomized Finite-State Distributed Algorithms as Markov Chains

DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Probabilistic Simulations for Probabilistic Processes

CONCUR '94 Proceedings of the Concurrency Theory
Service Time Optimal Self-Stabilizing Token Circulation Protocol on Anonymous Unidrectional Rings

SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Brief announcement: coupling for Markov decision processes - application to self-stabilization with arbitrary schedulers

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Coupling and self-stabilization

Distributed Computing - Special issue: DISC 04
Automatic verification of probabilistic concurrent finite state programs

SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Brief announcement: computing automatically the stabilization time against the worst and the best schedules

DISC'06 Proceedings of the 20th international conference on Distributed Computing

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We reduce the problem of proving the convergence of a randomized self-stabilizing algorithm under k-bounded policies to the convergence of the same algorithm under a specific policy. As a consequence, all k-bounded schedules are equivalent: a given algorithm is self-stabilizing under one of them if and only if it is self-stabilizing under any of them.