A generalized algorithm for constructing checking sequences
Robert D. Braun, Donald D. Givone · IEEE Transactions on Computers · 1981
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.