This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Complexity of Generating Optimal Test Sequences
September 1991 (vol. 17 no. 9)
pp. 976-978

The authors investigate whether maximal overlapping of protocol test subsequences can be achieved in polynomial time. They review the concepts related to FSM (finite state machine)-based test sequence generation and then define the optimal test sequence generation (OTSG) problem. It is proved that the OTSG problem is NP-complete. Therefore an efficient solution to the problem should not be expected in the general case.

[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," inProtocol Specification, Testing, and Verification, vol. 8, S. Aggarwal and K. Sabnani, Eds. Amsterdam: North-Holland, 1988, pp. 75-86.
[2] T. S. Chow, "Testing software design modeled by finite-state machines,"IEEE Trans. Software Eng., vol. SE-4, pp. 178-187, Mar. 1978.
[3] J. Edmonds and E. L Johnson, "Matching Euler tours and the Chinese postman,"Math. Program., vol. 5, pp. 88-124, 1973.
[4] J. Edmonds and R. M. Karp, "Theoretical improvements in algorithmic efficiency for network flow problems,"J. Ass. Comput. Mach., vol. 19, no. 2, pp. 248-264, Apr. 1972.
[5] G. Gonenc, "A method for the design of fault-detection experiments,"IEEE Trans. Computers, vol. C-19, no. 6, pp. 551-558, 1970.
[6] R. M. Karp, "Reducibility among combinatorial problems," inComplexity of Computer Computations, R. E. Miller and J. W. Thatcher, Eds. New York: Plenum, 1972, pp. 85-103.
[7] Z. Kohavi,Switching and Finite Automata Theory. New York: McGraw-Hill, 1978.
[8] M. K. Kuan, "Graphic programming using odd or even points,"Chinese Math., vol. 1, pp. 273-277, 1962.
[9] K. Sabnani and A. Dahbura, "A new technique for generating protocol tests," inProc. 9th Data Commun. Symp., Sept. 1985, pp. 178-187.
[10] K. Sabnani and A. Dahbura, "A protocol test generation procedure,"Comput. Networks ISDN Syst., North-Holland, no. 15, pp. 285-297, 1988.
[11] Y. N. Shen, F. Lambardi, and A. T. Dahbura, "Protocol conformance testing using multiples UIO sequences," inProtocol Specification, Testing and Verification, E. Brinksma, G. Scollo, and C. A. Vissers, Eds. Amsterdam: North-Holland, 1989, pp. 131-143.
[12] D. P. Sidhu and T. K. Leung, "Formal methods for protocol testing: a detailed study,"IEEE Trans. Software Eng., vol. SE-15 no. 4, pp. 413-426, 1989.
[13] M. U. Uyar and A. T. Dahbura, "Optimal test sequence generation for protocols: the Chinese postman algorithm applied to Q.931," inProc. IEEE Global Telecomm. Conf., 1986, pp. 68-72.
[14] B. Wang and D. Hutchinson, "Protocol testing techniques,"Comput. Commun., vol. 10, no. 2, pp. 79-87, 1987.

Index Terms:
protocol testing; communications protocols; maximal overlapping; test subsequences; polynomial time; FSM; finite state machine; optimal test sequence generation; OTSG problem; NP-complete; computational complexity; finite automata; program testing; protocols
Citation:
S.C. Boyd, H. Ural, "On the Complexity of Generating Optimal Test Sequences," IEEE Transactions on Software Engineering, vol. 17, no. 9, pp. 976-978, Sept. 1991, doi:10.1109/32.92918
Usage of this product signifies your acceptance of the Terms of Use.