Sixth International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing and First ACIS International Workshop on Self-Assembling Wireless Networks (SNPD/SAWN'05)
An Automatic Approach to Self-Stabilization
Towson University, Towson, Maryland, USA
May 23-May 25
ISBN: 0-7695-2294-7
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.
Citation:
Brahim Hamid, Mohamed Mosbah, "An Automatic Approach to Self-Stabilization," snpd-sawn, pp.123-128, Sixth International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing and First ACIS International Workshop on Self-Assembling Wireless Networks (SNPD/SAWN'05), 2005
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb