Quasi-self-stabilization of a distributed system assuming read/write atomicity
From MaRDI portal
Recommendations
- Self-stabilization of dynamic systems assuming only read/write atomicity
- Binary self-stabilization in distributed systems
- A quorum-based self-stabilizing distributed mutual exclusion algorithm
- A class of absolutely stable distributed systems
- scientific article; zbMATH DE number 512850
- Fault-containing self-stabilizing distributed protocols
- Synthesis of self-stabilising and Byzantine-resilient distributed systems
- scientific article; zbMATH DE number 1696677
- scientific article; zbMATH DE number 1919504
Cites work
- scientific article; zbMATH DE number 3784244 (Why is no real title available?)
- A belated proof of self-stabilization
- 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
- Self-stabilization
- Self-stabilization of dynamic systems assuming only read/write atomicity
- Self-stabilizing depth-first search
- Self-stabilizing systems in spite of distributed control
Cited in
(6)- scientific article; zbMATH DE number 2006654 (Why is no real title available?)
- Loosely-stabilizing leader election in population protocol model
- Loosely-stabilizing maximal independent set algorithms with unreliable communications
- Loosely-stabilizing leader election in a population protocol model
- Optical soliton solutions to the \((2+1)\)-dimensional Chaffee-Infante equation and the dimensionless form of the Zakharov equation
- Self-stabilization of dynamic systems assuming only read/write atomicity
This page was built for publication: Quasi-self-stabilization of a distributed system assuming read/write atomicity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1029860)