Self-stabilizing depth-first token circulation on networks
From MaRDI portal
Publication:1310571
DOI10.1007/BF02278857zbMath1282.68085MaRDI QIDQ1310571
Nian-Shing Chen, Shing-Tsaan Huang
Publication date: 22 November 1995
Published in: Distributed Computing (Search for Journal in Brave)
Related Items
Timer-based composition of fault-containing self-stabilizing protocols, Stabilizing maximum matching in bipartite networks, A self-stabilizing algorithm for strong fairness, Snap-stabilization and PIF in tree networks, Request-based token passing for self-stabilizing mutual exclusion, An optimal self-stabilizing strarvation-free alternator, A Framework for Certified Self-Stabilization
Cites Work
- A belated proof of self-stabilization
- An exercise in proving self-stabilization with a variant function
- A self-stabilizing algorithm for constructing spanning trees
- A self-stabilizing algorithm for constructing breadth-first trees
- Self-stabilization (in spite of distributed control) in tree-structured systems
- Self-stabilization of dynamic systems assuming only read/write atomicity
- Finding Dominators in Directed Graphs
- Self-stabilizing systems in spite of distributed control