Combining decomposition and reduction for state space analysis of a self-stabilizing system

DOI10.1016/J.JCSS.2013.01.022zbMath1311.68029OpenAlexW2033871598MaRDI QIDQ394332

Martin Fränzle, Nils Müllner, Oliver Theel

Publication date: 27 January 2014

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2013.01.022

zbMATH Keywords

Markov chainsfault tolerancelimiting window availabilityprobabilistic bisimilarityprobabilistic model checkingself stabilization

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Cites Work

• Unnamed Item
• Unnamed Item
• Three-valued abstraction for probabilistic systems
• Optimal state-space lumping in Markov chains
• Finite Continuous Time Markov Chains
• A Symbolic Algorithm for Optimal Markov Chain Lumping

This page was built for publication: Combining decomposition and reduction for state space analysis of a self-stabilizing system