This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Remark on the Nonminimality of Certain Multiple Fault Detection Algorithms
August 1980 (vol. 29 no. 8)
pp. 757-759
W. Coy, Department of Informatics, University of Dortmund, Dortmund, West Germany and the Faculty of Mathematics and Informatics, University of Bremen
Poage has constructed a complex fault detection algorithm which generates a complete and minimal test set of all multiple stuck-at faults of a given combinational network. Several authors have derived from his method fast and simple multiple fault detection algorithms, which are claimed to generate complete test sets with a "near-minimal" or "near-optimal" number of tests. We show that the algorithms by Bossen and Hong and the algorithm by Yang and Yau may generate test sets with an exponential number of tests (relative to the number of inputs) where a linear number of tests is sufficient for a complete multiple fault detection test set.
Index Terms:
redundant networks, Algorithms, cause-effect analysis, combinational networks, fault detection, fault functions, multiple stuck-at faults, test complexity, test pattern generation
Citation:
W. Coy, "A Remark on the Nonminimality of Certain Multiple Fault Detection Algorithms," IEEE Transactions on Computers, vol. 29, no. 8, pp. 757-759, Aug. 1980, doi:10.1109/TC.1980.1675666
Usage of this product signifies your acceptance of the Terms of Use.