Failure distance based bounds for steady-state availability without the kwnowledge of minimal cuts
Document typeConference report
Rights accessOpen Access
We propose an algorithm to compute bounds for the steady-state unavailability using continuous-time Markov chains, which is based on the failure distance concept. The algorithm generates incrementally a subset of the state space until the tightness of the bounds is the specified one. In contrast with a previous algorithm also based on the failure distance concept, the proposed algorithm uses lower bounds for failure distances which are computed on the fault tree of the system, and does not require the knowledge of the minimal cuts. This is advantageous when the number of minimal cuts is large or their computation is time-consuming.
CitationSuñe, V.; Carrasco, J. Failure distance based bounds for steady-state availability without the kwnowledge of minimal cuts. A: IEEE International Symposium on Modelling, Analysis and Simulation of Computer and Telecommunication Systems. "Proc. 7th IEEE Int. Symp. on Modeling, Analysis and Simulation of Computer and Telecommunication Systems". 1999, p. 138-147.