Distributed execution model for self-stabilizing systems
- 17 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
There are several execution models for self-stabilizing systems discussed in the literature. Among them the distributed model is a more realistic one in the sense that it makes the weakest assumption about the execution environment; whereas the serial model is a less realistic one in the sense that it makes the strongest assumption. In this paper we first discuss how to convert a self-stabilizing system operating with the serial model into a system operating with the distributed model, but such a conversion does not guarantee that the converted system is self-stabilizing. Then we propose a transform technique which makes the proof whether or not the converted system is self-stabilizing much easier.Keywords
This publication has 11 references indexed in Scilit:
- Self-stabilization by local checking and correctionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Self-stabilization over unreliable communication mediaDistributed Computing, 1993
- A SELF-STABILIZING DISTRIBUTED ALGORITHM TO CONSTRUCT BFS SPANNING TREES OF A SYMMETRIC GRAPHParallel Processing Letters, 1992
- A self-stabilizing algorithm for constructing spanning treesInformation Processing Letters, 1991
- Stabilizing communication protocolsIEEE Transactions on Computers, 1991
- The instability of self-stabilizationActa Informatica, 1990
- Token systems that self-stabilizeIEEE Transactions on Computers, 1989
- An exercise in proving self-stabilization with a variant functionInformation Processing Letters, 1988
- A belated proof of self-stabilizationDistributed Computing, 1986
- Self-stabilizing systems in spite of distributed controlCommunications of the ACM, 1974