Pseudoexhaustive test techniques: a new algorithm to partition combinational networks

Pseudoexhaustive test techniques based on partition and segmentation are described. These methods provide a higher fault coverage than standard automatic-test-program generation programs, and neither fault simulation nor fault modeling is required. Finding optimal partitions of combinational networks is an np-complete problem; an algorithm based on a heuristic approach that is faster and more reliable than the simplified algorithm of F. Hirose and V. Singh (1982) is developed. The adopted criteria assure a CPU executing time proportional to the number of input signals. Experimental results obtained from its application to professional circuits are presented