论文信息 - Closed Formulas for the Failure Probability of a Strict-Consecutive-k-out-of-n:F System

Closed Formulas for the Failure Probability of a Strict-Consecutive-k-out-of-n:F System

A consecutive-k-out-of-n:F system is strict if it operates in such a way that isolated failure strings of length less than k (which do not cause system failure) do not occur, or are immediately corrected. This paper gives closed formulas for the failure probability of a strict-consecutive-k-out-of-n:F system.

Frosso S. Makri | Andreas N. Philippou

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

[2] Andreas N. Philippou,et al. LONGEST SUCCESS RUNS AND FIBONACCI-TYPE POLYNOMIALS , 1984 .

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

[4] Andreas N. Philippou. Distributions and Fibonacci Polynomials of Order k, Longest Runs, and Reliability of Consecutive-k-out-of-n : F Systems , 1986 .

[5] Andreas N. Philippou,et al. Waiting for the K-th consecutive success and the Fibonacci sequence of order K , 1982 .

[6] 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.

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

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

[9] Richard C. Bollinger. Strict Consecutive-k-out-of-n:F Systems , 1985, IEEE Transactions on Reliability.