The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (2002 vol.51)
pp: 254-268
ABSTRACT
<p>The transient analysis of large continuous time Markov reliability models of repairable fault-tolerant systems is computationally expensive due to model stiffness. In this paper, we develop and analyze a method to compute bounds for a measure defined on a particular, but quite wide, class of continuous time Markov models, encompassing both exact and bounding continuous time Markov reliability models of fault-tolerant systems. The method is numerically stable and computes the bounds with well-controlled and specifiable-in-advance error. Computational effort can be traded off with bounds accuracy. For a class of continuous time Markov models, class <tmath>$\rm C^{\prime\prime}$</tmath>, including typical failure/repair reliability models with exponential failure and repair time distributions and repair in every state with failed components, the method can yield reasonably tight bounds at a very small computational cost. The method builds upon a recently proposed numerical method for the transient analysis of continuous time Markov models called regenerative randomization.</p>
INDEX TERMS
fault-tolerant systems, repairable systems, reliability, continuous time Markov models, bounds, randomization
CITATION
J.A. Carrasco, "Computationally Efficient and Numerically Stable Reliability Bounds for Repairable Fault-Tolerant Systems", IEEE Transactions on Computers, vol.51, no. 3, pp. 254-268, March 2002, doi:10.1109/12.990125
32 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool