A belated proof of self-stabilization
Distributed Computing
A time-optimal message-efficient distributed algorithm for depth-first-search
Information Processing Letters
An exercise in proving self-stabilization with a variant function
Information Processing Letters
Uniform self-stabilizing rings
ACM Transactions on Programming Languages and Systems (TOPLAS)
Token Systems That Self-Stabilize
IEEE Transactions on Computers
Distributed reset (extended abstract)
FST and TC 10 Proceedings of the tenth conference on Foundations of software technology and theoretical computer science
Stabilizing Communication Protocols
IEEE Transactions on Computers - Special issue on protocol engineering
A self-stabilizing algorithm for constructing spanning trees
Information Processing Letters
A self-stabilizing algorithm for constructing breadth-first trees
Information Processing Letters
Self-stabilizing systems in spite of distributed control
Communications of the ACM
1983 Invited address solved problems, unsolved problems and non-problems in concurrency
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Fast Self-Stabilizing Depth-First Token Circulation
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Self-stabilizing token circulation in uniform networks
Distributed Computing
Self-stabilizing depth-first token circulation in arbitrary rooted networks
Distributed Computing
An optimal self-stabilizing strarvation-free alternator
Journal of Computer and System Sciences
Optimal snap-stabilizing depth-first token circulation in tree networks
Journal of Parallel and Distributed Computing
Light enabling snap-stabilization of fundamental protocols
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
An adaptive stabilizing algorithm for finding all disjoint paths in anonymous mesh networks
Computer Communications
Timer-based composition of fault-containing self-stabilizing protocols
Information Sciences: an International Journal
From self- to snap- stabilization
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Self-stabilizing token circulation on uniform trees by using edge-tokens
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
An application of snap-stabilization: matching in bipartite graphs
ACMOS'07 Proceedings of the 9th WSEAS international conference on Automatic control, modelling and simulation
A snap-stabilizing DFS with a lower space requirement
SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
Snap-Stabilizing detection of cutsets
HiPC'05 Proceedings of the 12th international conference on High Performance Computing
Snap-stabilizing depth-first search on arbitrary networks
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Request-based token passing for self-stabilizing mutual exclusion
Information Sciences: an International Journal
The Worst-Case Stabilization Time of a Self-Stabilizing Algorithm under the Weakly Fair Daemon Model
International Journal of Artificial Life Research
| Hi-index | 0.00 |
This paper proposes a self-stabilizing protocol which circulates a token on a connected network in nondeterministic depth-first-search order, rooted at a special node. Starting with any initial state in which the network may have no token at all or more than one token, the protocol eventually makes the system stabilize in states having exactly one circulating token. With a slight modification to the protocol - by removing nondeterminism in the search - a depth-first-search tree on the network can be constructed. The proposed protocol runs on systems that allow parallel operations.