This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Easily Testable Sequential Machines with Extra Inputs
August 1975 (vol. 24 no. 8)
pp. 821-826
H. Fujiwara, Department of Electronic Engineering, Osaka University
In this paper, an easily testable machine is defined as one which possesses: 1) a distinguishing sequence of length [log2 n] which forces the machine into a specific state S1, and 2) transfer sequences of length at most [1og2 n] to carry the machine from state S1 to state Si for all i. A design procedure is presented in which an arbitrary machine is augmented to an easily testable machine by adding two special input symbols to the original machine. An efficient procedure is also described for designing checking experiments for the easily testable machines. For an n-state, m-input symbol machine, this procedure gives a bound on the length of the checking experiment that is approximately mn[log2,n]. Furthermore, the total checking experiments are preset.
Index Terms:
Checking experiments, distinguishing sequences, easily testable machines, fault detection, sequential machines, shift register, transition checking.
Citation:
H. Fujiwara, Y. Nagao, T. Sasao, K. Kinoshita, "Easily Testable Sequential Machines with Extra Inputs," IEEE Transactions on Computers, vol. 24, no. 8, pp. 821-826, Aug. 1975, doi:10.1109/T-C.1975.224313
Usage of this product signifies your acceptance of the Terms of Use.