Short correctness proofs for two self-stabilizing algorithms under the distributed daemon model
From MaRDI portal
(Redirected from Publication:1003766)
Recommendations
- A self-stabilizing algorithm for the shortest path problem in a distributed system
- Daemon Conversions in Distributed Self-stabilizing Algorithms
- A self-stabilizing algorithm for the shortest path problem assuming the distributed demon
- scientific article; zbMATH DE number 2036570
- A \(4n\)-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon
Cites work
- A self-stabilizing algorithm for constructing breadth-first trees
- A self-stabilizing algorithm for the center-finding problem assuming read/write separate atomicity
- A self-stabilizing algorithm for the shortest path problem assuming read/write atomicity
- A self-stabilizing algorithm for the shortest path problem assuming the distributed demon
- A self-stabilizing algorithm for the shortest path problem in a distributed system
- A SELF-STABILIZING DISTRIBUTED ALGORITHM FOR ALL-PAIRS SHORTEST PATH PROBLEM
- An efficient fault-containing self-stabilizing algorithm for the shortest path problem
- Fault-containing self-stabilizing distributed protocols
- scientific article; zbMATH DE number 1919504 (Why is no real title available?)
- scientific article; zbMATH DE number 194437 (Why is no real title available?)
- Self-stabilization of dynamic systems assuming only read/write atomicity
- Self-Stabilizing Algorithms for Finding Centers and Medians of Trees
- Self-stabilizing systems in spite of distributed control
- The alternator
- Token systems that self-stabilize
Cited in
(3)
This page was built for publication: Short correctness proofs for two self-stabilizing algorithms under the distributed daemon model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1003766)