An Improved Algorithm for Deriving Checking Experiments

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.