Article ID: | iaor20001482 |
Country: | United Kingdom |
Volume: | 26 |
Issue: | 3 |
Start Page Number: | 211 |
End Page Number: | 218 |
Publication Date: | Mar 1999 |
Journal: | Computers and Operations Research |
Authors: | Marie Raymond, Abdallah Hascam, Sericola Bruno |
Keywords: | markov processes |
Interval availability is a dependability measure defined by the fraction of time during which a system is in operation over a finite observation period. The system is assumed to be modeled by a finite Markov process. Because the computation of the distribution of this random variable is very expensive, it is common to compute only its expectation. In this note, we propose a new algorithm to compute the expected interval availability and we compare it with respect to the standard uniformization technique from an execution time point of view. This new method is particularly interesting if the Markov chain is stiff. Moreover, a new algorithm for the stationarity detection is proposed in order to avoid excessive computation.