On the minimal test set for single fault location

A new heuristic algorithm (based on the fault dictionary approach) that finds the minimal test set for locating single faults (of the stuck-at type) in a digital circuit, thus reducing the size of the fault dictionary, is presented. The proposed algorithm is based on finding the transitive closure of the vectors in the test set with respect to the functional dominancies using Warshall´s algorithm for binary matrices. The space complexity of the proposed algorithm is O(max{n × f², n²}), while the time complexity is O(max{n × f², n³}), where n is the number of vectors in the test set and f is the cardinality of the fault set