By Topic

An O(k2·log(n)) algorithm for computing the reliability of consecutive-k-out-of-n: F systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Min-Sheng Lin ; Dept. of Electr. Eng., Nat. Taipei Univ. of Technol., Taiwan

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.

Published in:

Reliability, IEEE Transactions on  (Volume:53 ,  Issue: 1 )