Continuous-time Markov chains are commonly used for dependability modeling of repairable fault-tolerant computer systems. Realistic models of non-trivial fault-tolerant systems easily have very large state spaces. An attractive approach which has been proposed to deal with the largeness problem is the use of pruning-based methods which provide error bounds. Using results from Courtois and Semal, a method for bounding the steady-state availability has been recently developed by Muntz, de Souza e Silva, and Goyal. This paper presents a new method based on a different approach which exploits the concept of failure distance to better bound the behavior out of the non-generated state space. The proposed method yields tighter bounds.
Numerical analysis shows that the improvement is typically significant.
CitationCarrasco, J. Improving availability bounds using the failure distance concept. A: IFIP Working Conferences on Dependable Computing for Critical Applications. "Dependable computing for critical applications 4: [presented at the Fourth International IFIP Working Conference on Dependable Computing for Critical Applications held in San Diego, California on January 4 - 6, 1994]". Springer, 1994, p. 479-497.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: email@example.com