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

Authors:
Chih-Yuan Chen;Cheng-Pin Wang;Tetz C. Huang;Ji-Cherng Lin
Affiliations:
Department of Computer Science and Information Engineering, Tao-yuan Innovation Institute of Technology, Chung-Li, Taiwan;General Education Center, Tzu Chi College of Technology, Hualien, Taiwan;Department of Computer Science and Engineering, Yuan-Ze University, Chung-Li, Taiwan;Department of Computer Science and Engineering, Yuan-Ze University, Chung-Li, Taiwan
Venue:
International Journal of Artificial Life Research
Year:
2012

Citing 16
Cited 0

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 breadth-first trees

Information Processing Letters
A self-stabilizing algorithm for maximal matching

Information Processing Letters
Self-stabilizing depth-first search

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
Self-stabilization

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

Communications of the ACM
Self-stabilization of dynamic systems assuming only read/write atomicity

Distributed Computing - Special issue: Self-stabilization
A self-stabilizing algorithm for the shortest path problem assuming read/write atomicity

Journal of Computer and System Sciences
A self-stabilizing (Δ+4)-edge-coloring algorithm for planar graphs in anonymous uniform systems

Information Processing Letters
An improved self-stabilizing algorithm for biconnectivity and bridge-connectivity

Information Processing Letters
Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler

Information Processing Letters
A self-stabilizing algorithm for finding a minimal 2-dominating set assuming the distributed demon model

Computers & Mathematics with Applications
A self-stabilizing algorithm for constructing weakly connected minimal dominating sets

Information Processing Letters
A self-stabilizing algorithm for the center-finding problem assuming read/write separate atomicity

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.