This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
D.A. Sheppard, Cybernetic Services, Canadian National Railway
An improved method for detection of faults in completely specified synchronous sequential machines is described. The technique is algorithmic, based on the concept of embedding the given binary machine into an easily testable R-valued machine. Heuristic optimization of additional permutation inputs is shown to lead to considerable reduction in the length of the fault sequence. A bound on the sequence length is derived, which in most cases is significantly lower than those of comparable methods.
Index Terms:
Fault detection, many-valued logic, permutation inputs, synchronous sequential machines, test machines.
Citation:
D.A. Sheppard, Z.G. Vranesic, "Fault Detection of Binary Sequential Machines Using R-Valued Test Machines," IEEE Transactions on Computers, vol. 23, no. 4, pp. 352-358, April 1974, doi:10.1109/T-C.1974.223949
Usage of this product signifies your acceptance of the Terms of Use.