Unconstrained algorithm for multiple fault detection in combinational networks (Q1058448)

We consider an approach to multiple fault detection in combinational networks utilizing groups of test combinations to identify the faultfree lines. An algorithm is proposed synthesizing complete multiple fault detection tests from these groups of combinations and it is proved that the identification of faultfree lines from the responses of a faulty circuit to test combinations makes it possible to attain maximum detection depth for multiple faults in an arbitrary combinational network. The detection algorithm is unconstrained; it does not require analyzing the circuit topology or processing large amounts of information.