Issue No. 10 - October (1973 vol. 22)
I. Berger , IBM (Israel) Ltd., Scientific Center
In this paper, we are concerned with the problem of generating minimal fault-detection experiments for fanout-free combinational logic networks. We establish the greatest lower bound on the necessary number of fault-detecting tests and show in a systematic way how such experiments can be obtained.
Combinational logic, diagnosis, fault detection, testing, tree networks.
I. Berger and Z. Kohavi, "Fault Detection in Fanout-Free Combinational Networks," in IEEE Transactions on Computers, vol. 22, no. , pp. 908-914, 1973.