Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

An O(k3·log(n/k)) algorithm for the consecutive-k-out-of-n:F system

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.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Hwang, F.K. ; AT&T Bell Labs., Murray Hill, NJ, USA ; Wright, P.E.

The fastest generally-recognized algorithms for computing the reliability of consecutive-k-out-of-n:F systems require O(n) time, for both the linear and circular systems. The authors' new algorithm requires O(k3·log(n/k)) time. The algorithm can be extended to yield an O(n·max{k3·log(n/k), log(n))} total time procedure for solving the combinatorial problem of counting the number of working states, with w working and n-w failed components, w=1,2,...,n

Published in:

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