Two Recursive Algorithms for Computing the Reliability of k-out-of-n Systems
- 1 June 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Reliability
- Vol. R-36 (2) , 261-265
- https://doi.org/10.1109/tr.1987.5222362
Abstract
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.Keywords
This publication has 9 references indexed in Scilit:
- The Availability of a k-out-of-n:G NetworkIEEE Transactions on Reliability, 1985
- Recursive Algorithm for Reliability Evaluation of k-out-of-n:G SystemIEEE Transactions on Reliability, 1985
- Comments on: Improved Method of Inclusion-Exclusion Applied to k-out-of-n SystemsIEEE Transactions on Reliability, 1984
- Computing k-out-of-n System ReliabilityIEEE Transactions on Reliability, 1984
- The Gamma NetworkIEEE Transactions on Computers, 1984
- Improved Method of Inclusion-Exclusion Applied to k-out-of-n SystemsIEEE Transactions on Reliability, 1982
- Reliability Evaluation in Computer-Communication NetworksIEEE Transactions on Reliability, 1981
- A Recursive Method Based on Case Analysis for Computing Network Terminal ReliabilityIEEE Transactions on Communications, 1978
- ``An Algorithm to Determine Parallel System Reliability''IEEE Transactions on Reliability, 1975