When graph theory helps self-stabilization

@inproceedings{Boulinier2004WhenGT,
  title={When graph theory helps self-stabilization},
  author={C. Boulinier and F. Petit and Vincent Villain},
  booktitle={PODC '04},
  year={2004}
}
We propose a general self-stabilizing scheme for solving any synchronization problem whose safety specification can be defined using a local property. We demonstrate the versatility of our scheme by showing that very memory-efficient solutions to many well-known problems (e.g., asynchronous phase clock, local mutual exclusion, local reader-writers, and local group mutual exclusion) can be derived using the proposed framework. We show that all these algorithms use a phase clock whose minimum… Expand
Low Communication Self-stabilization through Randomization
Synchronous vs. Asynchronous Unison
Synchronization Algorithms on Oriented Chains
Synchronous vs. Asynchronous Unison
Fast and compact self-stabilizing verification, computation, and fault detection of an MST
Distance- k knowledge in self-stabilizing algorithms
Self-Stabilizing Small k-Dominating Sets
Toward a Time-Optimal Odd Phase Clock Unison in Trees
Recurrence in Self-Stabilization
...
1
2
3
4
5
...

References

SHOWING 1-2 OF 2 REFERENCES
Self Stabilization
  • S. Dolev
  • Computer Science
  • J. Aerosp. Comput. Inf. Commun.
  • 2004
Self-stabilizing systems in spite of distributed control