By Topic

Checking Experiments ror 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
$33 $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

1 Author(s)
E. P. Hsieh ; IEEE

Some new procedures for designing efficient checking experiments for sequential machines are described. These procedures are based on the use of four types of sequences introduced, namely, the compound DS, the resolving sequence (RS), the compound. RS, and the simple I/O sequence. Significant reduction in the bound on the length of checking experiments is achieved. Along a parallel line of development, a new procedure, called the state counting method, is presented for detecting faults that can cause an increase in the number of states. For an n-state, m-input symbol machine, this procedure gives a bound on the length of checking experiments that is approximately mΔn. n times the bound for conventional checking experiments designed strictly under the assumption that no faults increase the number of states, where m > 1 and Δn is the maximum anticipated increase in the number of states due to faults.

Published in:

IEEE Transactions on Computers  (Volume:C-20 ,  Issue: 10 )