Token systems that self-stabilize

DOI10.1109/12.24293zbMath1395.68026OpenAlexW2163350150MaRDI QIDQ5375479

Geoffrey M. Brown, Chuanlin Wu, Mohamed G. Gouda

Publication date: 14 September 2018

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.24293

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (21)

A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph ⋮ The local detection paradigm and its applications to self-stabilization ⋮ The triumph and tribulation of system stabilization ⋮ Probabilistic self-stabilization ⋮ Stabilizing unison ⋮ Self-stabilizing multi-token rings ⋮ Self-stabilizing token circulation in uniform networks ⋮ Self-stabilizing depth-first token circulation in arbitrary rooted networks ⋮ Self-stabilization of wait-free shared memory objects ⋮ A self-stabilizing algorithm for constructing spanning trees ⋮ Binary self-stabilization in distributed systems ⋮ A self-stabilizing algorithm for finding a minimal 2-dominating set assuming the distributed demon model ⋮ A self-stabilizing algorithm for constructing breadth-first trees ⋮ Game theoretic analysis of self-stabilizing systems on arrays ⋮ A distributed self-stabilizing solution to the dining philosophers problem ⋮ Short correctness proofs for two self-stabilizing algorithms under the distributed daemon model ⋮ A transformation of self-stabilizing serial model programs for asynchronous parallel computing environments ⋮ An optimal self-stabilizing strarvation-free alternator ⋮ A self-stabilizing distributed algorithm to find the median of a tree graph ⋮ A self-stabilizing distributed algorithm for minimal spanning tree problem in a symmetric graph ⋮ A self-stabilizing algorithm for the shortest path problem assuming the distributed demon

This page was built for publication: Token systems that self-stabilize