An Automatic Approach to Self-Stabilization

Authors:
Brahim Hamid;Mohamed Mosbah
Affiliations:
University of Bordeaux-1;University of Bordeaux-1
Venue:
SNPD-SAWN '05 Proceedings of the Sixth International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing and First ACIS International Workshop on Self-Assembling Wireless Networks
Year:
2005

Citing 0
Cited 3

A self-stabilizing distributed algorithm for resolving conflicts

OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems - Volume Part II
A local self-stabilizing enumeration algorithm

DAIS'06 Proceedings of the 6th IFIP WG 6.1 international conference on Distributed Applications and Interoperable Systems
A formal model for fault-tolerance in distributed systems

SAFECOMP'05 Proceedings of the 24th international conference on Computer Safety, Reliability, and Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a formal method to design self-stabilizing algorithms by using graph rewriting systems (GRS). This method is based on two phases. The first phase consists of defining the set of illegitimate configurations (GRSIC). The second phase allows to construct some local correction rules to eliminate the illegitimate configurations. Then the graph relabeling system composed of the initial graph rewriting system improved with the addition of the correction rules is a self-stabilizing system (LSGRS). We obtain a general approach to deal with fault-tolerance in distributed computing. We illustrate our approach by various self-stabilizing algorithms for computing distributed spanning trees and SSP's algorithm.