PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Introduction to distributed algorithms
Introduction to distributed algorithms
Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Cross-Over Composition - Enforcement of Fairness under Unfair Adversary
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Self-stabilizing extensions for message-passing systems
Distributed Computing - Special issue: Self-stabilization
Observing locally self-stabilization in a probabilistic way
DISC'05 Proceedings of the 19th international conference on Distributed Computing
| Hi-index | 0.00 |
A self-stabilizing algorithm cannot detect by itself that stabilization has been reached. For overcoming this drawback Lin and Simon introduced the notion of an external observer, i.e., a set of processes, one being located at each node, whose role is to detect stabilization. We propose here a less expensive approach, where there is a single observing process located at a unique node. This process is not allowed to detect false stabilization and it must eventually detect that stabilization is reached. Moreover it must not interfere with the observed self-stabilizing algorithm. Our result is that there exists such an observer for any problem on a distinguished network having a synchronous self-stabilizing solution. Note that our proof is constructive.