An efficient method for constructing checking sequences for strongly connected reduced, synchronous, completely specified, deterministic, sequential machines processing linking homing sequences (LHS) has been described. For machines not possessing an LHS, the only method for constructing a checking sequence requires the use of locating sequences which are often very long. In this correspondence a general method for constructing efficient checking sequences using multiple linking boming sequences instead of locating sequences is presented.

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.