This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Restricted Checking Sequences for Sequential Machines
April 1973 (vol. 22 no. 4)
pp. 397-399
A.D. Friedman, Department of Electrical Engineering and Computer Science, University of Southern California
This paper shows that the imposition of some restrictions on the realization of a sequential machine facilitates the derivation of efficient checking sequences for some machines. Specifically, it is assumed that the state logic or the output logic may be faulty, but both of them cannot be faulty at the same time. This condition is satisfied if there is no shared logic between the state and output logic and at most a single fault in the circuit. It is also assumed that the normal machine has a synchronizing sequence. With these restrictions on the realization, the machine identification approach may be used to derive checking sequences that are often shorter than those without the restrictions and detect a larger set of faults than with the circuit testing approach.
Index Terms:
Checking sequences, fault detection, machine identification, sequential machines.
Citation:
A.D. Friedman, P.R. Menon, "Restricted Checking Sequences for Sequential Machines," IEEE Transactions on Computers, vol. 22, no. 4, pp. 397-399, April 1973, doi:10.1109/T-C.1973.223727
Usage of this product signifies your acceptance of the Terms of Use.