Randomized finite-state distributed algorithms as Markov chains
From MaRDI portal
Recommendations
- Coupling and self-stabilization
- Coupling and self-stabilization
- On the expected time for Herman's probabilistic self-stabilizing algorithm
- On the expected time for Herman's probabilistic self-stabilizing algorithm
- Markov chains competing for transitions: application to large-scale distributed systems
Cited in
(13)- An elementary proof that Herman's ring is \(\Theta (N^{2})\)
- Layered reasoning for randomized distributed algorithms
- Coupling and self-stabilization
- Computing fault-containment times of self-stabilizing algorithms using lumped Markov chains
- On probabilistic snap-stabilization
- Distributed disk-based algorithms for model checking very large Markov chains
- An inductive technique for parameterised model checking of degenerative distributed randomised protocols
- Distributed algorithms in an ergodic Markovian environment
- Markov chains competing for transitions: application to large-scale distributed systems
- Markov chain analysis of self-organizing mobile nodes self-organizing mobile nodes
- Randomized dining philosophers without fairness assumption
- Game-Based Probabilistic Predicate Abstraction in PRISM
- Coupling and self-stabilization
This page was built for publication: Randomized finite-state distributed algorithms as Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4436055)