By Topic

On Reliability Evaluation by Network Decomposition

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)
Rushdi, A.M. ; Department of Electrical Engineering; King Abdul Aziz University; POBox 9027; Jeddah, Kingdom of SAUDI ARABIA.

A simple algorithm for evaluating the symbolic terminal-pair reliability of a complex system is presented. The system graph is decomposed into two subgraphs through a minimal cut. The system success is expressed in terms of certain successes of these subgraphs, and then changed into an equivalent disjoint expression which is directly converted on a one-to-one basis into a reliability expression. It yields unusually simple reliability expressions. The algorithm can be computerized but has not been done. Three examples illustrate the algorithm and compare it with other algorithms.

Published in:

Reliability, IEEE Transactions on  (Volume:R-33 ,  Issue: 5 )