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. © Springer-Verlag Berlin Heidelberg 2006.
Author supplied keywords
Cite
CITATION STYLE
Beauquier, J., Johnen, C., & Messika, S. (2006). All k-bounded policies are equivalent for self-stabilization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4280 LNCS, pp. 82–94). Springer Verlag. https://doi.org/10.1007/978-3-540-49823-0_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
