Title :
An O(k2·log(n)) algorithm for computing the reliability of consecutive-k-out-of-n: F systems
Author_Institution :
Dept. of Electr. Eng., Nat. Taipei Univ. of Technol., Taiwan
fDate :
3/1/2004 12:00:00 AM
Abstract :
This study presents an O(k2·log(n)) algorithm for computing the reliability of a linear as well as a circular consecutive-k-out-of-n: F system. The proposed algorithm is more efficient and much simpler than the O(k3·log(n/k)) algorithm of Hwang & Wright.
Keywords :
computational complexity; consecutive system reliability; O(k2 · log(n)) algorithm; O(k3 · log(n/k)) algorithm; circular consecutive-k-out-of-n: F system; linear consecutive-k-out-of-n: F system; system reliability computing; Boundary conditions; Computer network reliability; Computer networks; Difference equations; Linear systems; Petroleum; Pipelines; Probability; Telecommunication computing; Telecommunication network reliability;
Journal_Title :
Reliability, IEEE Transactions on
DOI :
10.1109/TR.2004.823845
