Efficient algorithm for reliability of a circular consecutive-k-out-of-n:F system

摘要

The time complexities of previously published algorithms for circular consecutive-k-out-of-n:F systems are O(nk/sup 2/) and O(nk). The authors propose a method to improve the original O(nk/sup 2/) algorithm, and hence derive an O(nk) algorithm.