A Lower Bound for System Availability Computation

This paper discusses a simplified lower bound approximation for system availability computations. The analysis of system availability via Markov model computation becomes simpler by using this lower bound together with an upper bound. Such approximate studies are useful for systems which contain many states, but only if the interval between the two bounds is narrow enough. Based upon the Boole inequality, one can obtain a lower bound of system availability useful in engineering practice.