By Topic

A Lower Bound for System Availability Computation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Florescu, Radu A. ; Telrad Telecommunication and Electronic Industries Ltd., Lod

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.

Published in:

Reliability, IEEE Transactions on  (Volume:35 ,  Issue: 5 )