Self-stabilization (in spite of distributed control) in tree-structured systems
From MaRDI portal
Publication:1252035
DOI10.1016/0020-0190(79)90151-0zbMath0393.68057OpenAlexW2026857988MaRDI QIDQ1252035
Publication date: 1979
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(79)90151-0
Discrete-time control/observation systems (93C55) Circuits, networks (94C99) Cellular automata (computational aspects) (68Q80) Applications of graph theory to circuits and networks (94C15)
Related Items (18)
Reliable synchronization in distributed systems ⋮ The local detection paradigm and its applications to self-stabilization ⋮ Snap-stabilization and PIF in tree networks ⋮ A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring ⋮ Self-stabilizing token circulation in uniform networks ⋮ Self-stabilizing depth-first token circulation in arbitrary rooted networks ⋮ A self-stabilizing algorithm for constructing spanning trees ⋮ Binary self-stabilization in distributed systems ⋮ A self-stabilizing algorithm for constructing breadth-first trees ⋮ SELF-STABILIZING DEPTH-FIRST MULTI-TOKEN CIRCULATION IN TREE NETWORKS ⋮ Game theoretic analysis of self-stabilizing systems on arrays ⋮ On the performance of Dijkstra's third self-stabilizing algorithm for mutual exclusion and related algorithms ⋮ A self-stabilizing graph algorithm: Finding the cutting center of a tree ⋮ A SELF-STABILIZING ALGORITHM FOR FINDING ARTICULATION POINTS ⋮ Self-stabilization of dynamic systems assuming only read/write atomicity ⋮ Self-stabilization over unreliable communication media ⋮ Self-stabilizing depth-first token circulation on networks ⋮ SELF-STABILIZING PROTOCOL FOR MUTUAL EXCLUSION AMONG NEIGHBORING NODES IN A TREE STRUCTURED DISTRIBUTED SYSTEM
Cites Work
This page was built for publication: Self-stabilization (in spite of distributed control) in tree-structured systems