Loading [a11y]/accessibility-menu.js
An Improved Algorithm for Deriving Checking Experiments | IEEE Journals & Magazine | IEEE Xplore

An Improved Algorithm for Deriving Checking Experiments


Abstract:

This correspondence provides improvements to the design of checking experiments for sequential machines. Checking experiments can be divided into three parts: an initiali...Show More

Abstract:

This correspondence provides improvements to the design of checking experiments for sequential machines. Checking experiments can be divided into three parts: an initialization part, a validating part, and a diagnosing part. For synchronous machines not possessing a distinguishing sequence, the longest part of a checking experiment usually is the validating part. Using linking homing sequences as a replacement for locating sequences [1] or valid homing sequences [2], this correspondence shows that the validating part of an experiment can be significantly reduced for such machines.
Published in: IEEE Transactions on Computers ( Volume: C-28, Issue: 2, February 1979)
Page(s): 153 - 156
Date of Publication: 28 February 1979

ISSN Information:


References

References is not available for this document.