Computerized system reliability: Simplified Topological Reliability Analysis Program (STRAP1): Minimum Path Method (MPM)

Abstract

In 1978 Satyanarayana and Prabhaker (S&P) published a paper on topological reliability analysis for single source-to-single terminal networks as an alternative to classical inclusion-exclusion. The method uses a tree-search technique to develop a system reliability formula as a function of the component reliabilities. A shortcut, nested and factored system reliability formula is generated that is exactly equivalent to the inclusion-exclusion polynomial, but is much more efficient computationally. A FORTRAN program called the Topological Reliability Analysis Program (TRAP) was also presented in the archive documentation to support this project.

In 1983, C.C. Bolaki at Oklahoma State University prepared a PL/1 structured version of the topological technique, called the Structured Topological Reliability Analysis Program (STRAP). That program stored the complete search tree before generating the equation.

In this paper, we document a new PL/l computer program, STRAP1, that performs the same functions as STRAP, but is considerably shorter and runs faster on mainframe. This program differs from STRAP in that the equation generation and search-tree development are performed simultaneously so that the complete search tree is not stored. The result is a more efficient program. STRAP1 is a one-pass procedure which does not use the shortcut formula since this formula would be inefficient with this method.

A second program is provided which is a substitute for the existing inclusion-exclusion program, MAPS. This program is named MPM.