A Fast Algorithm for Reliability Evaluation
ABSTRACT An algorithm is developed to obtain a simplified reliability expression for a general network. All the success paths of the network are determined; then they are modified to be mutually disjoint. The reliability expression follows directly from the disjoint paths. The algorithm is easy and computationally economical. The reliability expression involves fewer terms and arithmetic operations than any of the existing methods. This is an advantage, considering the size of the system a reliability engineer normally handles and the frequency with which the expression is used for reliability studies.
- [show abstract] [hide abstract]
ABSTRACT: A method is presented for computing system reliability in terms of the reliabilities of constituent elements. The method is applicable to both series parallel as well as nonseries-parallel systems of any complexity. A technique of finding out all transmission paths of a general network is provided, which leads to the network reliability expression. A minimization technique is introduced to simplify this expression, which will have a lesser number of terms than obtained by any existing method. The reduced expression helps a design engineer to evaluate the system reliability speedily.Microelectronics Reliability. 01/1973;
Article: Probability Maps[show abstract] [hide abstract]
ABSTRACT: A map method, similar to Boolean-algebra-type truth maps, is presented for solving probability combinatorial problems. This map technique is shown to be of universal application and simplicity, being equally useful for both series-parallel and nonseries-parallel types of probability combinations. Moreover, it is extendable, in two dimensions, to any finite number of variables.IEEE Transactions on Reliability 10/1963; · 2.29 Impact Factor