Self-stabilizing depth-first search
Information Processing Letters
Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
IEEE Transactions on Computers
A self-stabilizing algorithm for bridge finding
Distributed Computing
Self-stabilizing depth-first token circulation in arbitrary rooted networks
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
Computers & Mathematics with Applications
A self-stabilizing algorithm for the shortest path problem assuming the distributed demon
Computers & Mathematics with Applications
Hi-index | 0.00 |
In this paper, the result of any self-stabilizing algorithm under the weakly fair daemon model (for a particular problem) that is not self-stabilizing under the non-fair central daemon model is obtained. Also, if any safe configuration under the weakly fair daemon model is also a safe configuration under the non-fair central daemon model, the worst-case stabilization time, measured in steps, is infinity. The implication of this new finding is that any problem, the existence of self-stabilizing algorithms for the weakly fair daemon model only, is unsatisfactory, that is of significance to pursue self-stabilizing algorithms for the non-fair central daemon model.