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

IEEE Transactions on Reliability

Volumn 42, Issue 1, 1993, Pages 163-164

  Wu, Jer Shyan ^a   Chen, Rong Jaye ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

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

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBABILITY;

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

RELIABILITY THEORY;

EID: 0027554658     PISSN: 00189529     EISSN: 15581721     Source Type: Journal    
DOI: 10.1109/24.210290     Document Type: Article

References (6)

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. D. T. Chiang, S. C. Niu, “Reliability of consecutive-k-out-of-n:F system”, IEEE Trans. Reliability, vol R-30, 1981 Apr, pp 87–89.
3. 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.
4. F. K. Hwang, “Fast solutions for consecutive-k-out-of-n:F system”, IEEE Trans. Reliability, vol R-31, 1982 Dec, pp 447–448.
5. J. G. Shanthikumar, “Recursive algorithm to evaluate the reliability of a consecutive-k-out-of-n:F system”, IEEE Trans. Reliability, vol R-31, 1982 Dec, pp 442–443.
6. J. S. Wu, R. J. Chen, “An O(kn) recursive algorithm for circular consecutive-k-out-of-n:F system”, IEEE Trans. Reliability, vol 41, 1992 Jun, pp 303–305.