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

作者:

Highlights:

摘要

Fault tolerance measures of distributed systems can be calculated precisely by state space analysis of the Markov chain corresponding to the product of the system components. The power of such an approach is inherently confined by the state space explosion, i.e. the exponential growth of the Markov chain in the size of the underlying system. We propose a decompositional method to alleviate this limitation. Lumping is a well-known reduction technique facilitating computation of the relevant measures on the quotient of the Markov chain under lumping equivalence. In order to avoid computation of lumping equivalences on intractably large Markov chains, we propose a system decomposition supporting local lumping on the considerably smaller Markov chains of the subsystems. Recomposing the lumped Markov chains of the subsystems constructs a lumped transition model of the whole system, thus avoiding the construction of the full product chain. An example demonstrates how the limiting window availability (i.e. a particular fault tolerance measure) can be computed for a self-stabilizing system exploiting lumping and decomposition.

论文关键词:Fault tolerance,Self stabilization,Probabilistic model checking,Probabilistic bisimilarity,Markov chains,Limiting window availability

论文评审过程:Received 25 June 2012, Revised 13 December 2012, Accepted 25 January 2013, Available online 1 February 2013.

论文官网地址:https://doi.org/10.1016/j.jcss.2013.01.022