An O(kn)-time algorithm for computing the reliability of a circular consecutive-k-out-of-n:F system

I. Antonopoulou and S. Papastavridis (1987) published an algorithm for computing the reliability of a circular consecutive-k-out-of-n:F system which claimed O(kn) time. J.S. Wu and R.J. Chen (1993) correctly pointed out that the algorithm achieved only O(kn/sup 2/) time. The present study shows that the algorithm can be implemented for O(kn) time.<
>