A new technique for proving self-stabilizing under the distributed scheduler

Authors:
Sven Köhler;Volker Turau
Affiliations:
Institute of Telematics, Hamburg University of Technology, Hamburg, Germany;Institute of Telematics, Hamburg University of Technology, Hamburg, Germany
Venue:
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Year:
2010

Citing 7
Cited 2

Self-stabilization

Self-stabilization
Self-stabilizing systems in spite of distributed control

Communications of the ACM
Self-Stabilizing Local Mutual Exclusion and Daemon Refinement

DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler

Information Processing Letters
Conflict Managers for Self-stabilization without Fairness Assumption

ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Fault tolerance in wireless sensor networks through self-stabilisation

International Journal of Communication Networks and Distributed Systems
Fault-Containing Self-Stabilization in Asynchronous Systems with Constant Fault-Gap

ICDCS '10 Proceedings of the 2010 IEEE 30th International Conference on Distributed Computing Systems

Space-efficient fault-containment in dynamic networks

SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Self-stabilizing local k-placement of replicas with minimal variance

SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Proving stabilization of a complex algorithm under the distributed scheduler is a non-trivial task. This paper introduces a new method which allows to extend proofs for the central scheduler to the distributed scheduler. The practicability of the method is shown by applying it to two existing algorithms, for which stabilization under the distributed scheduler was an open problem.