Skip to main content
Article thumbnail
Location of Repository

A Generic Rewrite Method for Proving Self-Stabilization

By Joffroy Beauquier, Béatrice Bérard and Laurent Fribourg

Abstract

Self-stabilization is a property of distributed systems. It guarantees that, whatever the initial state, the system always reaches a stable set of states, called "legitimate configurations", within a finite number of steps. The proof of convergence 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 and generic proof method of convergence, which regards self-stabilizing systems as string rewrite systems, and adapts a procedure initially designed by Dershowitz for proving (non)termination of string rewrite systems

Year: 1998
OAI identifier: oai:CiteSeerX.psu:10.1.1.32.5657
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.lsv.ens-cachan.fr/P... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.