Abstract

A consecutive κ-within- m-out-of- n:F system consists of n linearly ordered components e 1,3. e n . The system fails if among any m subsequent components there are k or more failed ones. A recursive algorithm is presented evaluating the reliability of the system whose components are independent and have unequal failure probabilities. This algorithm is computer implementable for “not too large m” (e.g. m ≤ 15 for PC machines).

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.