A self-stabilizing algorithm for constructing weakly connected minimal dominating sets

Turau, Volker; Hauck, Bernd

doi:10.1016/j.ipl.2009.03.013

Cited by 7 publications

(1 citation statement)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A self-stabilizing algorithm under a certain computational model is silent if any execution of the algorithm under that computational model contains a configuration γ such that in the suffix of the execution starting with γ , the values stored in all the local variables and all the shared registers of all the processors never change. Most of the existing self-stabilizing algorithms (e.g., (Collin & Dolev, 1994;Ghosh et al, 1996a;Ghosh et al, 1996b;Ghosh et al, 1996c;Huang, 2005;Huang & Chen, 1992;Hsu & Huang, 1992;Huang & Lin, 2002;Huang et al, 2000;Huang et al, 2007;Huang et al, 2004;Ikeda et al, 2002;Shukla et al, 1995;Tsin, 2007;Turau, 2007;Turau & Hauck, 2009;Tzeng et al, 2007)) are silent.…”

Section: Self-stabilizationmentioning

confidence: 99%

Correctness of Self-Stabilizing Algorithms Under the Dolev Model When Adapted to Composite Atomicity Models

Chen

Wang

Huang

et al. 2012

International Journal of Artificial Life Research

View full text Add to dashboard Cite

In this paper, the authors first clarify that it is not a trivial matter whether or not a self-stabilizing algorithm under the Dolev model, when adapted to a composite atomicity model, is also self-stabilizing. Then the authors employ a particular “simulation” approach to show that if a self-stabilizing algorithm under the Dolev model has one of two certain forms, then it is also self-stabilizing when adapted to one of the composite atomicity models, the fair daemon model. Since most existing self-stabilizing algorithms under the Dolev model have the above-mentioned forms, the authors’ results imply that they are all self-stabilizing when adapted to the fair daemon model.

show abstract