Abstract
In this paper, which is a follow up to [8], we are con- cerned with the problem of generating minimal experiments to locate and diagnose faults in combinational tree networks. We establish lower bounds on the necessary number of fault-locating tests and show how, in a systematic way, such experiments can be obtained. Two types of testing procedures are considered-adaptive and preset. Copyright © 1975 by The Institute of Electrical and Electronics Engineers, Inc.