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, Z. Kohavi, "Fault Detection in Fanout-Free Combinational Networks", IEEE Transactions on Computers, vol.22, no. 10, pp. 908-914, October 1973, doi:10.1109/T-C.1973.223617