Timer-based composition of fault-containing self-stabilizing protocols
From MaRDI portal
Recommendations
- Timer-Based Composition of Fault-Containing Self-stabilizing Protocols
- Fault-containing self-stabilizing distributed protocols
- An exercise in fault-containment: Self-stabilizing leader election
- Fault containment in weakly stabilizing systems
- Computing fault-containment times of self-stabilizing algorithms using lumped Markov chains
Cites work
- scientific article; zbMATH DE number 2036567 (Why is no real title available?)
- A self-stabilizing algorithm for coloring bipartite graphs
- A self-stabilizing algorithm for constructing spanning trees
- A self-stabilizing algorithm for maximal matching
- A self-stabilizing distributed approximation algorithm for the minimum connected dominating set
- Algorithmic Aspects of Wireless Sensor Networks
- An exercise in fault-containment: Self-stabilizing leader election
- Fault-containing self-stabilization using priority scheduling
- Fault-containing self-stabilizing algorithms
- Parallel composition for time-to-fault adaptive stabilization
- Request-based token passing for self-stabilizing mutual exclusion
- Robust self-stabilizing weight-based clustering algorithm
- Self-stabilization
- Self-stabilization of dynamic systems assuming only read/write atomicity
- Self-stabilizing depth-first token circulation on networks
- Self-stabilizing systems in spite of distributed control
- Snap-stabilization and PIF in tree networks
- Timer-Based Composition of Fault-Containing Self-stabilizing Protocols
Cited in
(3)
This page was built for publication: Timer-based composition of fault-containing self-stabilizing protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q985053)