Self-stabilization of dynamic systems assuming only read/write atomicity
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
A self-stabilizing algorithm for constructing spanning trees
Information Processing Letters
An exercise in fault-containment: self-stabilizing leader election
Information Processing Letters
Fault-containing self-stabilizing algorithms
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Time-adaptive self stabilization
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Fault-containing network protocols
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Self-Stabilizing Algorithms for Finding Centers and Medians of Trees
SIAM Journal on Computing
Fault-containing self-stabilization using priority scheduling
Information Processing Letters
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Parallel composition of stabilizing algorithms
ICDCS '99 Workshop on Self-stabilizing Systems
Cross-Over Composition - Enforcement of Fairness under Unfair Adversary
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Self-stabilization of dynamic systems assuming only read/write atomicity
Distributed Computing - Special issue: Self-stabilization
Self-stabilizing depth-first token circulation on networks
Distributed Computing - Special issue: Self-stabilization
Timer-based composition of fault-containing self-stabilizing protocols
Information Sciences: an International Journal
Hi-index | 0.00 |
Self-stabilizing protocols provide autonomous recovery from finite number of transient faults. Fault-containing self-stabilizing protocols promise not only self-stabilization but also quick recovery from and small effect of a small number of faults. However, existing composition techniques of self-stabilizing protocols (e.g. fair composition) cannot preserve the fault-containment property when composing fault-containing protocols. In this paper, we present Recovery Waiting Fault-containing Composition (RWFC) framework that preserves the faultcontainment property of the composed protocol. We show an example of fault-containing composition of a minimum spanning tree protocol on arbitrary weighted graphs and a median finding protocol on trees via RWFC.