
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
S.C. Boyd, H. Ural, "On the Complexity of Generating Optimal Test Sequences," IEEE Transactions on Software Engineering, vol. 17, no. 9, pp. 976978, September, 1991.  
BibTex  x  
@article{ 10.1109/32.92918, author = {S.C. Boyd and H. Ural}, title = {On the Complexity of Generating Optimal Test Sequences}, journal ={IEEE Transactions on Software Engineering}, volume = {17}, number = {9}, issn = {00985589}, year = {1991}, pages = {976978}, doi = {http://doi.ieeecomputersociety.org/10.1109/32.92918}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Software Engineering TI  On the Complexity of Generating Optimal Test Sequences IS  9 SN  00985589 SP976 EP978 EPD  976978 A1  S.C. Boyd, A1  H. Ural, PY  1991 KW  protocol testing; communications protocols; maximal overlapping; test subsequences; polynomial time; FSM; finite state machine; optimal test sequence generation; OTSG problem; NPcomplete; computational complexity; finite automata; program testing; protocols VL  17 JA  IEEE Transactions on Software Engineering ER   
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 NPcomplete. 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: NorthHolland, 1988, pp. 7586.
[2] T. S. Chow, "Testing software design modeled by finitestate machines,"IEEE Trans. Software Eng., vol. SE4, pp. 178187, Mar. 1978.
[3] J. Edmonds and E. L Johnson, "Matching Euler tours and the Chinese postman,"Math. Program., vol. 5, pp. 88124, 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. 248264, Apr. 1972.
[5] G. Gonenc, "A method for the design of faultdetection experiments,"IEEE Trans. Computers, vol. C19, no. 6, pp. 551558, 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. 85103.
[7] Z. Kohavi,Switching and Finite Automata Theory. New York: McGrawHill, 1978.
[8] M. K. Kuan, "Graphic programming using odd or even points,"Chinese Math., vol. 1, pp. 273277, 1962.
[9] K. Sabnani and A. Dahbura, "A new technique for generating protocol tests," inProc. 9th Data Commun. Symp., Sept. 1985, pp. 178187.
[10] K. Sabnani and A. Dahbura, "A protocol test generation procedure,"Comput. Networks ISDN Syst., NorthHolland, no. 15, pp. 285297, 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: NorthHolland, 1989, pp. 131143.
[12] D. P. Sidhu and T. K. Leung, "Formal methods for protocol testing: a detailed study,"IEEE Trans. Software Eng., vol. SE15 no. 4, pp. 413426, 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. 6872.
[14] B. Wang and D. Hutchinson, "Protocol testing techniques,"Comput. Commun., vol. 10, no. 2, pp. 7987, 1987.