The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January (1997 vol.46)
pp: 93-99
ABSTRACT
<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>
INDEX TERMS
Finite state machines, fault detection, checking experiments, checking sequences, testing.
CITATION
Hasan Ural, Xiaolin Wu, Fan Zhang, "On Minimizing the Lengths of Checking Sequences", IEEE Transactions on Computers, vol.46, no. 1, pp. 93-99, January 1997, doi:10.1109/12.559807
44 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool