By Topic

A direct algorithm for computing reliability of a consecutive-k cycle

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
$33 $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

2 Author(s)
D. Z. Du ; MIT, Cambridge, MA, USA ; F. K. Hwang

A consecutive-k cycle is a circular system such that the system fails if and only if any i consecutive components all fail. Reliabilities for consecutive-k cycles are usually computed by recursive equations. However, most recursive equations proposed so far for the cycle involve reliabilities for consecutive-k lines, requiring two passes where the first pass computes only the line reliabilities. A recursive equation involving cycles only is proposed that is simpler in form but much harder to understand on intuitive grounds. Another advantage is that the proposed cycle recursion has the same form as a line recursion previously proposed. Thus a uniform treatment of lines and cycles is possible. This uniform approach is used to obtain some explicit solutions of both line and cycle reliabilities for 2⩽k⩽4

Published in:

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