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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Beauquier, J., Cordier, S., Delaët, S.: Optimum probabilistic self-stabilization on uniform rings. In: Second Workshop on Self-Stabilizing Systems (WSS 1995), pp. 15.1–15.15 (1995)
Herman, T.: Probabilistic self-stabilization. Information Processing Letters 35, 63–67 (1990)
Dolev, S., Israeli, A., Moran, S.: Analyzing expected time by scheduler-luck games. IEEE Transactions on Software Engineering 21, 429–439 (1995)
Segala, R., Lynch, N.: Probabilistic simulations for probabilistic processes. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol. 836, pp. 481–496. Springer, Heidelberg (1994)
Pogosyants, A., Segala, R.: Formal verification of timed properties of randomized distributed algorithms. In: 14th Annual ACM Symposium on Principles of Distributed Computing (PODC 1995), pp. 174–183 (1995)
Pogosyants, A., Segala, R., Lynch, N.: Verification of the randomized concensus algorithm of Aspnes and Herlihy: a case study. In: Mavronicolas, M. (ed.) WDAG 1997. LNCS, vol. 1320, pp. 22–36. Springer, Heidelberg (1997)
Fribourg, L., Messika, S., Picaronny, C.: Coupling and Self-stabilization. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol. 3274, pp. 201–215. Springer, Heidelberg (2004)
Fribourg, L., Messika, S.: Brief announcement: Coupling for markov decision processes - application to self-stabilization with arbitrary schedulers. In: 24th Annual ACM Symposium on Principles of Distributed Computing (PODC 2005), p. 322 (2005)
Beauquier, J., Johnen, C., Messika, S.: Brief announcement: Computing automatically the stabilization time against the worst and the best schedulers. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 543–547. Springer, Heidelberg (2006)
de Alfaro, L.: Formal Verification of Probabilistic systems. PhD Thesis, Stanford University (1997)
Lehmann, D., Rabin, M.O.: On the advantages of free choice: a symmetric and fully-distributed solution to the dining philosophers problem. In: 8th Annual ACM Symposium on Principles of Programming Languages (POPL 1981), pp. 133–138 (1981)
Vardi, M.Y.: Automatic verification of probabilistic concurrent finite-state programs. In: 26th Annual Symposium on Foundations of Computer Science (FOCS 1985), pp. 327–338. IEEE Computer Society, Los Alamitos (1985)
Pnueli, A., Zuck, L.: Verification of multiprocess probabilistic protocols. Distributed Computing 1(1), 53–72 (1986)
Johnen, C.: Service time optimal self-stabilizing token circulation protocol on anonymous unidrectional rings. In: 21st Symposium on Reliable Distributed Systems (SRDS 2002). IEEE, Los Alamitos (2002)
Beauquier, J., Gradinariu, M., Johnen, C.: Memory space requirements for self-stabilizing leader election protocols. In: 18th Annual ACM Symposium on Principles of Distributed Computing (PODC 1999), pp. 199–208 (1999)
Duflot, M., Fribourg, L., Picaronny, C.: Finite-state distributed algorithms as markov chains. In: DISC 2001. LNCS, vol. 2180, pp. 240–254. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beauquier, J., Johnen, C., Messika, S. (2006). All k-Bounded Policies Are Equivalent for Self-stabilization. In: Datta, A.K., Gradinariu, M. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2006. Lecture Notes in Computer Science, vol 4280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-49823-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-49823-0_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49018-0
Online ISBN: 978-3-540-49823-0
eBook Packages: Computer ScienceComputer Science (R0)