This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fault Diagnosis in Combinational Tree Networks
December 1975 (vol. 24 no. 12)
pp. 1161-1167
Z. Kohavi, Department of Computer Science, University of Utah
In this paper, which is a follow up to [8], we are concerned 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.
Index Terms:
Fault detection, maxivertex, minivertex, tree networks.
Citation:
Z. Kohavi, I. Berger, "Fault Diagnosis in Combinational Tree Networks," IEEE Transactions on Computers, vol. 24, no. 12, pp. 1161-1167, Dec. 1975, doi:10.1109/T-C.1975.224159
Usage of this product signifies your acceptance of the Terms of Use.