Probabilistic self-stabilization
From MaRDI portal
Publication:911752
DOI10.1016/0020-0190(90)90107-9zbMATH Open0697.68027OpenAlexW1992996044MaRDI QIDQ911752FDOQ911752
Publication date: 1990
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(90)90107-9
Cites Work
Cited In (42)
- EVENTUAL DETERMINISM: USING PROBABILISTIC MEANS TO ACHIEVE DETERMINISTIC ENDS
- Bounds on Herman's algorithm
- Title not available (Why is that?)
- RANDOMIZED SELF-STABILIZING LEADER ELECTION IN PREFERENCE-BASED ANONYMOUS TREES
- A SELF-STABILIZING ALGORITHM FOR FINDING ARTICULATION POINTS
- Model checking finite-horizon Markov chains with probabilistic inference
- Parameter synthesis for Markov models: covering the parameter space
- Probabilistic verification of Herman's self-stabilisation algorithm
- A self-stabilizing enumeration algorithm.
- Analysis of Distributed Token Circulation Algorithm with Faulty Random Number Generator
- On the expected time for Herman's probabilistic self-stabilizing algorithm
- An elementary proof that Herman's ring is \(\Theta (N^{2})\)
- Randomization adaptive self-stabilization
- Self-stabilizing ring orientation using constant space
- A tighter bound for the self-stabilization time in Herman's algorithm
- On Stabilization in Herman’s Algorithm
- Fair Termination for Parameterized Probabilistic Concurrent Systems
- Randomized uniform self-stabilizing mutual exclusion
- Self-stabilization over unreliable communication media
- Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination
- Three tokens in Herman's algorithm
- Coupling and self-stabilization
- Observing self-stabilization
- On probabilistic snap-stabilization
- A self-stabilizing algorithm for maximal matching
- Synthesizing optimal bias in randomized self-stabilization
- Inductive synthesis for probabilistic programs reaches new horizons
- Deterministic, constant space, self-stabilizing leader election on uniform rings
- Torus orientation
- Binary self-stabilization in distributed systems
- Model Checking Parameterised Multi-token Systems via the Composition Method
- Title not available (Why is that?)
- Self-stabilization
- Weak vs. Self vs. Probabilistic Stabilization
- A Framework for Certified Self-Stabilization
- Self-stabilization: Randomness to reduce space
- Are Parametric Markov Chains Monotonic?
- A nearly optimal upper bound for the self-stabilization time in Herman's algorithm
- Automated Analysis of Impact of Scheduling on Performance of Self-stabilizing Protocols
- Probabilistic communicating processes
- Parameter synthesis in Markov models: a gentle survey
- Stochastic self-stabilization
Recommendations
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)