An O(k^2·log(n)) algorithm for computing the reliability of consecutive-k-out-of-n: F systems

This study presents an O(k²·log(n)) algorithm for computing the reliability of a linear as well as a circular consecutive-k-out-of-n: F system. The proposed algorithm is more efficient and much simpler than the O(k³·log(n/k)) algorithm of Hwang & Wright.


Download