Minimization of Boolean Sum of Products with Applications to the Computation of Reliability of General Networks

摘要

The evaluation of the reliability of general networks is based on a few principles coming from the basic probability theory. The complexity of the networks inevitably requires the use of a computerized approach. Discussion leads to the long Boolean expressions (Boolean sum-of-products) which can include hundreds of product terms for fairly small networks. In the study a new binary vector method is presented for the computerized search of minimum ties of a general network. The resolved minimum ties are utilized in generating a network's probability space, i.e., the set of points of success and points of failure. The data file of these points is interpreted as the network's Boolean system function. The new minimization algorithm of the Boolean SOP-expression is discussed in detail. (Copyright (c) Valtion teknillinen tutkimuskeskus (VTT) 1988.)