An improved algorithm to evaluate the reliability of a circular consecutive 2-out-of-r-from-n:F system

A circular consecutive k-out-of-r from-n:F system consists of n components ordered oil a circle. The svstem falls if and onlN, if there are r consecutive corriponerits at least k of which are falled. The time complexity of a recentIy publislied algorithm for circular consecutive k-out-of r-from-n-:F system is O(nr). This paper proposes a method to Improve upon this O(nr) algorithm.