A fast reliability-algorithm for the circular consecutive-weighted-k-out-of-n:F system

An O(T n) algorithm is presented for the circular consecutive-weighted-k-out-of-n:F system, where T/spl les/min[n,[(k-/spl omega//sub max/)//spl omega//sub min/]+1]; /spl omega//sub max/, /spl omega//sub min/ are the maximum, minimum weights of all components. This algorithm is simpler and more efficient than the Wu and Chen O(min[n,k] n) algorithm. When all weights are unity, this algorithm is simpler than other O(k-n) published algorithms.