A new rewrite method for proving convergence of self-stabilizing systems

4Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In the framework of self-stabilizing systems, the convergence proof is generally done by exhibiting a measure that strictly decreases until a legitimate configuration is reached. The discovery of such a measure is very specific and requires a deep understanding of the studied transition system. In contrast we propose here a simple method for proving convergence, which regards self-stabilizing systems as string rewrite systems, and adapts a procedure initially designed by Dershowitz for proving termination of string rewrite systems.

Cite

CITATION STYLE

APA

Beauquier, J., Bérard, B., & Fribourg, L. (1999). A new rewrite method for proving convergence of self-stabilizing systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1693, pp. 240–255). Springer Verlag. https://doi.org/10.1007/3-540-48169-9_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free