Economical Design of Large Consecutive-k-out-of-n:F Systems

1 December 1984

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Reliability

Vol. R-33 (5) , 411-413
https://doi.org/10.1109/tr.1984.5221883

Abstract

We first employ the concept of taboo probability to find a general closed-form formula for the reliability of a consecutive-k-out-of n:F system. We prove that for 1 ≤ k ≤ 4, the lim R k,n = exp(-nq k )n→∞ where q is the component failure probability, and nqk is bounded. The limit formulas are used to design a large system where tradeoffs of costs can be considered.

Keywords

This publication has 8 references indexed in Scilit:

Fast Solutions for Consecutive-k-out-of-n: F System
IEEE Transactions on Reliability, 1982
Direct Computation for Consecutive-k-out-of-n: F Systems
IEEE Transactions on Reliability, 1982
Recursive Algorithm to Evaluate the Reliability of a Consecutive-k-out-of-n:F System
IEEE Transactions on Reliability, 1982
Consecutive-k-out-of-n: F Networks
IEEE Transactions on Reliability, 1982
On the Consecutive-k-of-n:F System
IEEE Transactions on Reliability, 1982
Reliability of Consecutive-k-out-of-n:F System
IEEE Transactions on Reliability, 1981
Reliability Determination of a r-Successive-out-of-n:F System
IEEE Transactions on Reliability, 1980
Analysis of a Dynamic Redundant System
IEEE Transactions on Reliability, 1978