Probabilistic self-stabilization
From MaRDI portal
Recommendations
Cites work
Cited in
(57)- An elementary proof that Herman's ring is \(\Theta (N^{2})\)
- An exercise in proving self-stabilization with a variant function
- Binary self-stabilization in distributed systems
- A self-stabilizing algorithm for maximal matching
- Self-stabilization: Randomness to reduce space
- Self-stabilizing ring orientation using constant space
- Self-stabilization over unreliable communication media
- Self-stabilization of circular arrays of automata
- A self-stabilizing enumeration algorithm.
- The stabilizing token ring in three bits
- Probabilistic verification of Herman's self-stabilisation algorithm
- Three tokens in Herman's algorithm
- Coupling and self-stabilization
- The alternator
- Inductive synthesis for probabilistic programs reaches new horizons
- Synthesizing optimal bias in randomized self-stabilization
- Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination
- Making randomized algorithms self-stabilizing
- On probabilistic snap-stabilization
- Uniform self-stabilizing ring orientation
- A tighter bound for the self-stabilization time in Herman's algorithm
- Self-stabilization
- Model checking parameterised multi-token systems via the composition method
- Randomized uniform self-stabilizing mutual exclusion
- Weak vs. self vs. probabilistic stabilization
- On stabilization in Herman's algorithm
- Are parametric Markov chains monotonic?
- Fair termination for parameterized probabilistic concurrent systems
- Analysis of distributed token circulation algorithm with faulty random number generator
- Bounds on Herman's algorithm
- Stochastic self-stabilization
- scientific article; zbMATH DE number 2013825 (Why is no real title available?)
- scientific article; zbMATH DE number 2036570 (Why is no real title available?)
- scientific article; zbMATH DE number 1737293 (Why is no real title available?)
- Automated synthesis of distributed self-stabilizing protocols
- EVENTUAL DETERMINISM: USING PROBABILISTIC MEANS TO ACHIEVE DETERMINISTIC ENDS
- Randomized self-stabilizing leader election in preference-based anonymous trees
- A nearly optimal upper bound for the self-stabilization time in Herman's algorithm
- Self-stabilizing multi-token rings
- Torus orientation
- Automated Analysis of Impact of Scheduling on Performance of Self-stabilizing Protocols
- A self-stabilizing algorithm for finding articulation points
- Observing self-stabilization
- Distributed Computing
- Coupling and Self-stabilization
- Observations on non-silent self-stabilizing algorithms in sensor networks with probabilistically intermittent link failures
- scientific article; zbMATH DE number 2226803 (Why is no real title available?)
- Deterministic, constant space, self-stabilizing leader election on uniform rings
- Parameter synthesis in Markov models: a gentle survey
- Parameter synthesis for Markov models: covering the parameter space
- Probabilistic communicating processes
- Quantitative analysis with the probabilistic model checker PRISM
- An oracle-guided approach to constrained policy synthesis under uncertainty
- Randomization adaptive self-stabilization
- Analysis of toggle protocols
- On the expected time for Herman's probabilistic self-stabilizing algorithm
- Model checking finite-horizon Markov chains with probabilistic inference
This page was built for publication: Probabilistic self-stabilization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911752)
