By Topic

Restricted Checking Sequences for Sequential Machines

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Friedman, Arthur D. ; Department of Electrical Engineering and Computer Science, University of Southern California ; Menon, P.R.

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.

Published in:

Computers, IEEE Transactions on  (Volume:C-22 ,  Issue: 4 )