Bounds on the reliability of binary coherent systems

The structure function of a binary coherent system is approximated by using only a few of its minimal path sets and minimal cut sets. These two incomplete structure functions are represented as disjoint sums. The average of each is a lower and upper bound, respectively, for the system reliability. The usefulness of these bounds is demonstrated on example networks.<
>