Failure Distributions of Consecutive-k-out-of-n:F Systems

Most literature on consecutive-k-out-of-n:F systems gives recursive equations for computing the system reliability. This paper gives a formula for computing the system reliability directly. Using this formula, the system failure distribution is derived. Upper and lower bounds for the system reliability or the system failure distribution are given. Some numerical examples are included.

[1]  Shun-Chen Niu,et al.  Reliability of Consecutive-k-out-of-n:F System , 1981, IEEE Transactions on Reliability.

[2]  Richard C. Bollinger,et al.  Direct Computation for Consecutive-k-out-of-n: F Systems , 1982, IEEE Transactions on Reliability.

[3]  F. Hwang,et al.  Fast Solutions for Consecutive-k-out-of-n: F System , 1982, IEEE Transactions on Reliability.

[4]  A.A. Salvia,et al.  Consecutive-k-out-of-n: F Networks , 1982, IEEE Transactions on Reliability.

[5]  Anthony A. Salvia.  Simple Inequalities for Consecutive-k-out of-n:F Networks , 1982, IEEE Transactions on Reliability.

[6]  J.M. Kontoleon,et al.  Reliability Determination of a r-Successive-out-of-n:F System , 1980, IEEE Transactions on Reliability.

[7]  J. George Shanthikumar,et al.  Recursive Algorithm to Evaluate the Reliability of a Consecutive-k-out-of-n:F System , 1982, IEEE Transactions on Reliability.

[8]  Gerald J. Lieberman,et al.  On the Consecutive-k-of-n:F System , 1982, IEEE Transactions on Reliability.