Optimal structural diagnosis of wiring networks

We consider the problem of full diagnosis of all the short faults among a set of nets using the maximum number of parallel tests. The study adaptive and nonadaptive algorithms for structural diagnosis, using the information about the adjacency of the nets in the wiring network. The problem is formulated as a graph search problem and graph theory is used to derive optimal and near-optimal adaptive and non-adaptive algorithms. Our results indicate that adaptive diagnosis often uses exponentially fewer tests than traditional non-adaptive diagnosis, and structural diagnosis may use dramatically fewer tests than behavioral diagnosis.