AVAILABILITY OF CONTINUOUS SERVICE AND COMPUTING LONG-RUN MTBF AND RELIABILITY FOR MARKOV SYSTEMS

Authors:
John E. Angus
Affiliations:
Claremont Graduate University, Claremont, California 91711, E-mail: john.angus@cgu.edu
Venue:
Probability in the Engineering and Informational Sciences
Year:
2001

Citing 4
Cited 0

Some bounds on the error in approximating transition probabilities in continuous-time Markov processes

SIAM Review
Engineering reliability

Engineering reliability
ON MEASURE OF SYSTEM INTERVAL AVAILABILITY

Probability in the Engineering and Informational Sciences
Introduction to Probability Models, Ninth Edition

Introduction to Probability Models, Ninth Edition

Quantified Score

Hi-index	0.00

Visualization

Abstract

Steady-state availability has long been a popular descriptor of effectiveness for repairable systems because it captures both the operability and repairability aspects of the system. A related measure of effectiveness is the availability of continuous service, which is particularly relevant for safety critical applications. In this article, two different measures of this quantity are described for a repairable system whose state is described by an ergodic finite-state-space continuous-time Markov chain. Using these ideas, formulas for computing system long-run mean time between failures and the long-run system reliability function are derived.