Recursive Algorithm for Reliability Evaluation of k-out-of-n:G System
- 1 June 1985
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Reliability
- Vol. R-34 (2) , 144-150
- https://doi.org/10.1109/tr.1985.5221975
Abstract
An algorithm for computing recursively the exact system reliability of k-out-of-n systems is proposed. It is simple, easy to implement, fast, and memory efficient. It gives a reliability expression with minimal number of terms, C(k, n) and involves only a few multiplications. The reduction in number of terms and multiplications is over 50 percent compared to some methods. The recursive nature of the algorithm enables one to design easily the number of units in the system to meet a reliability target. An alternative representation of the algorithm which is easy to remember and good for manual computation is given. However, it involves a few more multiplications compared to the original one but fewer than those required with existing methods.Keywords
This publication has 6 references indexed in Scilit:
- 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
- Improved Method of Inclusion-Exclusion Applied to k-out-of-n SystemsIEEE Transactions on Reliability, 1982
- An Improved Algorithm for Network ReliabilityIEEE Transactions on Reliability, 1979
- ``An Algorithm to Determine Parallel System Reliability''IEEE Transactions on Reliability, 1975
- Algorithm 154: combination in lexicographical orderCommunications of the ACM, 1963