An 0(kn)-Time Algorithm foR computing the Reliability of a Circular Consecutive-k-out-of-n:F System

IEEE Transactions on Reliability

Volumn 42, Issue 1, 1993, Pages 161-162

  Hwang, F K ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

Algorithm complexity; Circular consecutive k out of n; F system; System reliability

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBABILITY;

ALGORITHM COMPLEXITY; CIRCULAR CONSECUTIVE-K-OUT-OF-N:F SYSTEM; SYSTEM RELIABILITY;

RELIABILITY THEORY;

EID: 0027561389     PISSN: 00189529     EISSN: 15581721     Source Type: Journal    
DOI: 10.1109/24.210289     Document Type: Article

References (4)

1. I. Antonopoulou, S. Papastavridis, “Fast recursive algorithm to evaluate the reliability of a circular consecutive-k-out-of-n:F system”, IEEE Trans. Reliability, vol R-36, 1987 Apr, pp 83–84.
2. C. Derman, G. Lieberman, S. Ross, “On the consecutive-k-out-of-n:F system”, IEEE Trans. Reliability, vol R-31, 1982 Apr, pp 57–63.
3. F. K. Hwang, “Fast solutions for consecutive-k-out-of-n:F system”, IEEE Trans. Reliability, vol R-31, 1982 Dec, pp 447–448.
4. J. S. Wu, R. J. Chen, “An 0(kn) recursive algorithm for circular consecutive-k-out-of-n:F systems”, IEEE Trans. Reliability, vol 42, 1993 Mar.