This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Reduced Length Checking Sequences
September 2002 (vol. 51 no. 9)
pp. 1111-1117

Abstract—Here, the method proposed in [13] for constructing minimal-length checking sequences based on distinguishing sequences is improved. The improvement is based on optimizations of the state recognition sequences and their use in constructing test segments. It is shown that the proposed improvement further reduces the length of checking sequences produced from minimal, completely specified, and deterministic finite state machines.

[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] F. Belina and D. Hogrefe, “The CCITT-Specification and Description Language SDL,” Computer Networks and ISDN Systems, vol. 16, pp. 311-341, 1989.
[3] S. Budkowski and P. Dembinski, “An Introduction to Estelle: A Specification Language for Distributed Systems,” Computer Networks and ISDN Systems, vol. 14, no. 1, pp. 3–23, 1987.
[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] A. Gill, Introduction to the Theory of Finite-State Machines. New York: McGraw-Hill, 1962.
[6] G. Gonenc, “A Method for the Design of Fault Detection Experiments,” IEEE Trans. Computers, vol. 19, pp. 551-558, 1970.
[7] D. Harel, “Statecharts: A Visual Approach to Complex Systems,” Science of Computer Programming, Vol. 8, No. 3, pp. 231–274, 1987.
[8] F.C. Hennie, “Fault Detecting Experiments for Sequential Circuits,” Proc. Fifth Ann. Symp. Switching Circuit Theory and Logical Design, pp. 95-110, 1964.
[9] 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.
[10] D. Lee and M. Yannakakis, Principles and Methods of Testing Finite State Machines, a Survey Proc. IEEE, vol. 84, no. 8, pp. 1090-1123, Aug. 1996.
[11] I. Pomeranz and S.M. Reddy, “Test Generation for Multiple State-Table Faults in Finite-State Machines,” IEEE Trans. Computers, vol. 46, pp. 783-794, 1997.
[12] 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.
[13] H. Ural, X. Wu, and F. Zhang, “On Minimizing the Lengths of Checking Sequences,” IEEE Trans. Computers, vol. 46, pp. 93-99, 1997.
[14] 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 machine, checking sequence, test minimization, distinguishing sequence.
Citation:
Robert M. Hierons, Hasan Ural, "Reduced Length Checking Sequences," IEEE Transactions on Computers, vol. 51, no. 9, pp. 1111-1117, Sept. 2002, doi:10.1109/TC.2002.1032630
Usage of this product signifies your acceptance of the Terms of Use.