DocumentCode
312561
Title
An O(nrk) algorithm for computing the reliability of consecutive k-out-of-r-from-n:F system
Author
Higashiyama, Yoichi ; Kraetzl, Miro ; Caccetta, Lou
Author_Institution
Dept. of Electr. & Electron. Eng., Ehime Univ., Matsuyama, Japan
Volume
1
fYear
1996
fDate
26-29 Nov 1996
Firstpage
178
Abstract
A consecutive k-out-of-r-from-n:F system consists of n linearly or circularly ordered components such that the system fails if and only if there are r consecutive components at least k of which are failed. This paper studies a lower bound for the reliability of a consecutive k-out-of-r-from-n:F system in the more general case when the component probabilities can be different from each other. New recursive equations are proposed, which have time complexity of O(nrk) for the linear system, and O(nr2k) for the circular system
Keywords
computational complexity; consecutive system reliability; failure analysis; probability; reliability theory; O(nrk) algorithm; circular system; circularly ordered components; component probabilities; consecutive k-out-of-r-from-n:F system; linear system; linearly ordered components; lower bound; recursive equations; reliability; time complexity; Australia; Automotive engineering; Equations; Linear systems; Postal services; Power engineering and energy; Power system reliability; Radar detection; Reliability engineering; Systems engineering and theory;
fLanguage
English
Publisher
ieee
Conference_Titel
TENCON '96. Proceedings., 1996 IEEE TENCON. Digital Signal Processing Applications
Conference_Location
Perth, WA
Print_ISBN
0-7803-3679-8
Type
conf
DOI
10.1109/TENCON.1996.608779
Filename
608779
Link To Document