Multiple bridging faults in monotone networks

Multiple bridging faults in monotone networks (networks with out negations) are investigated. Complete test sets of monotone networks for single and multiple bridging faults are constructed. It is shown that the test complexity of fanout free monotone networks for the class of multiple bridging faults has an upper bound that is seen to be linear in the number of network input lines. For monotone networks, the paper shows how to carry over Aker's method for generating universal test sets for stuck-at faults to the bridging faults as well.