A Boolean algebra method for computing the terminal reliability in a communication network

Given the set of all simple paths between two nodes in a network, the terminal reliability can be symbolically computed by transforming a Boolean sum of products into an equivalent form in which all terms are disjoint. This new approach seems to be promising in respect to existing 4[ 6 methods both for the exact and for the approximate computation of the terminal reliability.