A belated proof of self-stabilization
Distributed Computing
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
Memory-efficient self stabilizing protocols for general networks
Proceedings of the 4th international workshop on Distributed algorithms
Stabilizing Communication Protocols
IEEE Transactions on Computers - Special issue on protocol engineering
A self-stabilizing algorithm for constructing spanning trees
Information Processing Letters
Self-stabilization by local checking and correction (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of 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
Messages, Clocks, and Gravitation
CEEMAS '01 Revised Papers from the Second International Workshop of Central and Eastern Europe on Multi-Agent Systems: From Theory to Practice in Multi-Agent Systems
Self-stabilizing token circulation on uniform trees by using edge-tokens
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
| Hi-index | 0.00 |
A self-stabilizing protocol for token circulation in a connected, uniform network of nodes with prime size is proposed. A network of nodes is said to be uniform if all nodes are logically equivalent and identically programmed. The protocol has the ability to handle any arbitrary initial state in which more than one token or no token at all exist in the network and makes the network eventually have one and only one token fairly circulating among the nodes of the network. The protocol is deterministic, its self-stabilization property is proven under the assumption of a serial and fair scheduler.