论文信息 - Fast Recursive Algorithm to Evaluate the Reliability of a Circular Consecutive-k-out-of-n:F System

Fast Recursive Algorithm to Evaluate the Reliability of a Circular Consecutive-k-out-of-n:F System

A recursive algorithm obtains the reliability of a circular consecutive-k-out-of-n:F system. This algorithm works faster than those previously published.

Stavros Papastavridis | S. Papastavridis | Ira Antonopoulou | Ira Antonopoulou

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

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

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