Probabilistic self-stabilization

DOI10.1016/0020-0190(90)90107-9zbMATH Open0697.68027OpenAlexW1992996044MaRDI QIDQ911752FDOQ911752

Authors: Ted Herman 

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

Recommendations

• scientific article; zbMATH DE number 1304100
• Self-stabilizing token circulation on asynchronous uniform unidirectional rings
• On the expected time for Herman's probabilistic self-stabilizing algorithm
• Computing and Combinatorics
• scientific article; zbMATH DE number 871956

zbMATH Keywords

distributed computingself-stabilizationprobabilistic algorithmsuniform rings

Mathematics Subject Classification ID

Distributed systems (68M14) Theory of software (68N99) Theory of operating systems (68N25)

Cites Work

• Self-stabilizing systems in spite of distributed control
• Uniform self-stabilizing ring orientation
• Token systems that self-stabilize

Cited In (50)

• EVENTUAL DETERMINISM: USING PROBABILISTIC MEANS TO ACHIEVE DETERMINISTIC ENDS
• Observations on non-silent self-stabilizing algorithms in sensor networks with probabilistically intermittent link failures
• Bounds on Herman's algorithm
• 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
• Self-stabilizing multi-token rings
• A self-stabilizing enumeration algorithm.
• On the expected time for Herman's probabilistic self-stabilizing algorithm
• Title not available (Why is that?)
• An elementary proof that Herman's ring is \(\Theta (N^{2})\)
• Randomization adaptive self-stabilization
• The alternator
• Self-stabilizing ring orientation using constant space
• Title not available (Why is that?)
• A tighter bound for the self-stabilization time in Herman's algorithm
• Randomized uniform self-stabilizing mutual exclusion
• An exercise in proving self-stabilization with a variant function
• On stabilization in Herman's algorithm
• Self-stabilization over unreliable communication media
• Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination
• Three tokens in Herman's algorithm
• Model checking parameterised multi-token systems via the composition method
• Coupling and self-stabilization
• A self-stabilizing algorithm for finding articulation points
• Automated synthesis of distributed self-stabilizing protocols
• Observing self-stabilization
• On probabilistic snap-stabilization
• Randomized self-stabilizing leader election in preference-based anonymous trees
• A self-stabilizing algorithm for maximal matching
• Weak vs. self vs. probabilistic stabilization
• Are parametric Markov chains monotonic?
• Synthesizing optimal bias in randomized self-stabilization
• Inductive synthesis for probabilistic programs reaches new horizons
• Distributed Computing
• Deterministic, constant space, self-stabilizing leader election on uniform rings
• Torus orientation
• Binary self-stabilization in distributed systems
• Title not available (Why is that?)
• Self-stabilization
• Self-stabilization: Randomness to reduce space
• Analysis of distributed token circulation algorithm with faulty random number generator
• 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
• Coupling and Self-stabilization
• Parameter synthesis in Markov models: a gentle survey
• Stochastic self-stabilization
• Title not available (Why is that?)
• Fair termination for parameterized probabilistic concurrent systems

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)