By Topic

Recursive Algorithm for Reliability Evaluation of Non-Repairable Phased Mission Systems With Binary Elements

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

3 Author(s)
Levitin, G. ; Collaborative Autonomic Comput. Lab., Univ. of Electron. Sci. & Technol. of China, Chengdu, China ; Liudong Xing ; Amari, S.V.

Many practical systems are phased-mission systems (PMS), where the mission consists of multiple, consecutive, and non-overlapping phases of operation. An accurate reliability analysis of a PMS must consider the statistical dependencies of component states across phases, as well as dynamics in system configurations, success criteria, and component behavior. In this paper, we propose a method for exact reliability evaluation of arbitrary binary or multi-state PMS consisting of non-identical binary non-repairable elements. The method is invariant to changes in system structure and demand among missions, and takes into account the time-varying and phase-dependent failure rates and associated cumulative damage effects. The proposed method is based on conditional probabilities, and an efficient recursive formula to compute these probabilities based on branch and bound. The main advantage of this method is that it does not require composition of decision diagrams, and can be fully automated. The method is illustrated using both an analytical example, and a numerical example.

Published in:

Reliability, IEEE Transactions on  (Volume:61 ,  Issue: 2 )