Efficient Algorithm for Reliability of a Circular Consecutive-k-out-of-n:F System

Jer Shyan Wu, Rong-Jaye Chen

Research output: Contribution to journalArticlepeer-review

17 Scopus citations


The time complexities of previously published algorithms for circular consecutive-k-out-of-n:F system are O(n · k2) and O(n · k). This paper proposes a method to improve upon the original O(n k2) algorithm and hence derives an O(n · k) algorithm.

Original languageEnglish
Pages (from-to)163-164
Number of pages2
JournalIEEE Transactions on Reliability
Issue number1
StatePublished - 1 Jan 1993


  • Algorithm
  • Circular consecutive-k-out-of-n
  • F system
  • System reliability

Cite this