New algorithm to reduce the number of computing steps in reliability formula of weighted-k-out-of-n system

In the disjoint products version of reliability analysis of weighted–k–out–of–n systems, it is necessary to determine the order in which the weight of components is to be considered. The k–out–of–n:G(F) system consists of n components; each com-ponent has its own probability and positive integer weight such that the system is operational (failed) if and only if the total weight of some operational (failure) components is at least k. This paper designs a method to compute the reliability in O(nk) computing time and in O(nk) memory space. The proposed method expresses the system reliability in fewer product terms than those already published