By Topic

Two Recursive Algorithms for Computing the Reliability of k-out-of-n Systems

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

4 Author(s)
Rai, S. ; North Carolina State University, Raleigh; Reader; Department of Electronics and Communication Engineering; University of Roorkee; Roorkee - 247 667 INDIA. ; Sarje, A.K. ; Prasad, E.V. ; Kumar, Arun

The paper presents two recursive methods to compute reliability of a k-out-of-n system. The method is simple and computationally efficient when compared with other current methods. Examples illustrate the technique. The algorithms are presented in a recursive language with an Algol-like notation. The algorithms are easy to remember and can be used for manual computations.

Published in:

Reliability, IEEE Transactions on  (Volume:R-36 ,  Issue: 2 )