Weak vs. self vs. probabilistic stabilization
From MaRDI portal
Recommendations
Cites work
- Memory requirements for silent stabilization
- Probabilistic self-stabilization
- Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings
- Self-Stabilizing Algorithms for Finding Centers and Medians of Trees
- Self-stabilizing systems in spite of distributed control
- Stabilization and pseudo-stabilization
- Synchronous vs. asynchronous unison
Cited in
(8)- Parameterized synthesis of self-stabilizing protocols in symmetric networks
- Loosely-stabilizing leader election in population protocol model
- Automated Analysis of Impact of Scheduling on Performance of Self-stabilizing Protocols
- Partially ordered knowledge sharing and fractionated systems in the context of other models for distributed computing
- Decidability analysis of self-stabilization for infinite-state systems
- Dynamic FTSS in asynchronous systems: the case of unison
- Fault containment in weakly stabilizing systems
- A loosely self-stabilizing protocol for randomized congestion control with logarithmic memory
This page was built for publication: Weak vs. self vs. probabilistic stabilization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947955)