This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On Minimizing the Lengths of Checking Sequences
January 1997 (vol. 46 no. 1)
pp. 93-99

Abstract—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.

[1] A.V. Aho, A.T. Dahbura, D. Lee, and M.U. Uyar, “An Optimization Technique for Protocol Conformance Test Sequence Generation Based on UIO Sequences and Rural Chinese Postman Tours,” IEEE Trans. Comm., vol. 39, pp. 1604-1615, 1991.
[2] J.A. Bondy and U.S.R. Murty, Graph Theory With Applications.New York: Elsevier North Holland, 1976.
[3] S.C. Boyd and H. Ural, "On the Complexity of Generating Optimal Test Sequences," IEEE Trans. Software Eng., vol. 17, no. 9, pp. 976-978, Sept. 1991.
[4] A.T. Dahbura, K.K. Sabnani, and M.U. Uyar, “Formal Methods for Generating Protocol Conformance Test Sequences,” Proc. IEEE, vol. 78, pp. 1317-1325, 1990.
[5] J. Edmonds and E.L. Johnson, "Matching, Euler Tours and the Chinese Postman," Mathematical Programming, vol. 5, pp. 88-124, 1973.
[6] A. Gill, Introduction to the Theory of Finite-State Machines.New York: McGraw-Hill, 1962.
[7] G. Gonenc, "A Method for the Design of Fault Detection Experiments," IEEE Trans. Computers, vol. 19, no. 6, pp. 551-558, June 1970.
[8] F.C. Hennie, "Fault Detecting Experiments for Sequential Circuits," Proc. Fifth Ann. Symp. Switching Circuit Theory and Logical Design, pp. 95-110,Princeton, N.J., 1964.
[9] M.K. Kuan, "Graphic Programming Using Odd or Even Points," Chinese Math., vol. 1, pp. 273-277, 1962.
[10] D. Lee and M. Yannakakis, Testing Finite-State Machines: State Identification and Verification IEEE Trans. Computers, vol. 43, no. 3, pp. 306-320, Mar. 1994.
[11] E.L. Lowler, Combinatorial Optimization: Networks and Matroids.New York: Holt, Rinehart, and Winston, 1976.
[12] Y.-N. Shen, F. Lombardi, and A.T. Dahbura, “Protocol Conformance Testing Using Multiple UIO Sequences,” IEEE Trans. Comm., vol. 40, no. 8, pp. 1,282-1,287, Aug. 1992.
[13] D.P. Sidhu and T.K. Leung, Formal Methods for Protocol Testing: A Detailed Study IEEE Trans. Software Eng., vol. 15, no. 4, pp. 413-426, Apr. 1991.
[14] M.P. Vasilevskii, "Failure Diagnosis of Automata," Kibernetika, vol. 4, pp. 98-108, 1973.
[15] M. Yannakakis and D. Lee, “Testing Finite State Machines: Fault Detection,” J. Computer and System Sciences, vol. 50, pp. 209-227, 1995.

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, Jan. 1997, doi:10.1109/12.559807
Usage of this product signifies your acceptance of the Terms of Use.