ACM Computing Surveys (CSUR)
Composition and behaviors of probabilistic I/O automata
Theoretical Computer Science
Self-stabilization
Model-checking continuous-time Markov chains
ACM Transactions on Computational Logic (TOCL)
Self-stabilizing systems in spite of distributed control
Communications of the ACM
A Compositional Trace-Based Semantics for Probabilistic Automata
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Tolerance to Unbounded Byzantine Faults
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
A self-stabilizing algorithm for coloring planar graphs
Distributed Computing - Special issue: Self-stabilization
Feasibility and complexity of broadcasting with random transmission failures
Theoretical Computer Science
Interactive Markov chains: and the quest for quantified quality
Interactive Markov chains: and the quest for quantified quality
Bisimulation minimisation mostly speeds up probabilistic model checking
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Ymer: a statistical model checker
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
PRISM: a tool for automatic verification of probabilistic systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
IEEE Communications Magazine
| Hi-index | 0.00 |
For large distributed systems built from inexpensive components, one expects to see incessant failures. This paper proposes two models for such faults and analyzes two well-known self-stabilizing algorithms under these fault models. For a small number of processes, the properties of interest are verified automatically using probabilistic model-checking tools. For a large number of processes, these properties are characterized using asymptotic bounds from a direct Markov chain analysis and approximated by numerical simulations.