Reducing the Lengths of Checking Sequences by Overlapping
There are two main shortcomings in the existing models for generating checking sequences based on distinguishing sequences. First, these models require a priori selection of state recognition sequences (called α-sequences) which may not be the best selection for yielding substantial reduction in the length of checking sequences. Second, they do not take advantage of overlapping to further reduce the length of checking sequences. This paper proposes an optimization model that tackles these shortcomings to reduce the lengths of checking sequences beyond what is achieved by the existing models by replacing the state recognition sequences with a set of basic sequences called α-elements and by making use of overlapping.
KeywordsInput Sequence Finite State Machine Output Sequence State Recognition Test Segment
- 3.Chen, J., Hierons, R.M., Ural, H., Yenigun, H.: Eliminating redundant tests in a checkingsequence. In: Proc. of IFIP TestCom 2005, May 2005, pp. 146–158 (2005)Google Scholar
- 10.Hennie, F.C.: Fault detecting experiments for sequential circuits. In: Proc. 5th. Symp. Switching Circuit Theory and Logical Design, Princeton, N.J, pp. 95–110 (1964)Google Scholar
- 12.Hieron, R., Ural, H.: Optimizing the length of checking sequences. submitted to IEEE Trans. on Computers (2004)Google Scholar