Issue No. 01 - January (1997 vol. 46)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.559807
<p><b>Abstract</b>—A general model for constructing minimal length checking sequences employing a distinguishing sequence is proposed. The model is based on characteristics of checking sequences and a set of state recognition sequences. Some existing methods are shown to be special cases of the proposed model and are proven to construct checking sequences. The minimality of the resulting checking sequences is discussed and a heuristic algorithm for the construction of minimal length checking sequences is given.</p>
Finite state machines, fault detection, checking experiments, checking sequences, testing.
F. Zhang, X. Wu and H. Ural, "On Minimizing the Lengths of Checking Sequences," in IEEE Transactions on Computers, vol. 46, no. , pp. 93-99, 1997.