Combining decomposition and reduction for state space analysis of a self-stabilizing system
Markov chainsfault tolerancelimiting window availabilityprobabilistic bisimilarityprobabilistic model checkingself stabilization
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Reliability, testing and fault tolerance of networks and computer systems (68M15) Specification and verification (program logics, model checking, etc.) (68Q60) Distributed systems (68M14) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
- Computing the fault-containment time of self-stabilizing algorithms using Markov chains and lumping
- Computing fault-containment times of self-stabilizing algorithms using lumped Markov chains
- Decomposition in Reliability Analysis of Fault-Tolerant Systems
- scientific article; zbMATH DE number 1786480
- scientific article; zbMATH DE number 1089092
- scientific article; zbMATH DE number 1696500 (Why is no real title available?)
- scientific article; zbMATH DE number 1285311 (Why is no real title available?)
- A Symbolic Algorithm for Optimal Markov Chain Lumping
- Finite Continuous Time Markov Chains
- Optimal state-space lumping in Markov chains
- Three-valued abstraction for probabilistic systems
This page was built for publication: Combining decomposition and reduction for state space analysis of a self-stabilizing system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q394332)