Optimal Length Test Sequence Generation Using Distinguishing Sequences

IEEE/ACM Transactions on Networking

Volumn 1, Issue 3, 1993, Pages 358-371

  Ural, Hasan ^a   Zhu, Keqin ^a  

^a UNIVERSITY OF OTTAWA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINARY SEQUENCES; FINITE AUTOMATA; NETWORK PROTOCOLS; OPTIMIZATION; PARAMETER ESTIMATION; STATISTICAL TESTS;

D-METHODS; DISTINGUISHING SEQUENCES; TEST SEQUENCE LENGTH;

DATA COMMUNICATION SYSTEMS;

EID: 0027612518     PISSN: 10636692     EISSN: 15582566     Source Type: Journal    
DOI: 10.1109/90.234857     Document Type: Article

References (22)

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. Commun., Vol. 39, pp. 1604-1615, Nov. 1991.
2. G. v. Bochmann and C. A. Sunshine, “A survey of formal methods,” in Computer Networks and Protocols, P.E. Green, Ed. New York: Plenum, 1982, pp. 561-578.
3. S. C. Boyd and H. Ural, “On the complexity of generating optimal test sequences,” IEEE Trans. Software Eng., Vol. SE-17, pp. 976-978, Sept. 1991.
4. W.Y.L. Chan, S. T. Vuong, and M. R. Ito, “An improved protocol test generation procedure based on UIOs,” in Proc. ACM SIGCOMM'89, Sept. 1989, pp. 283-292.
5. M. S. Chen, Y. Choi, and A. Kershenbaum, “Approaches utilizing segment overlap to minimize test sequences,” in Protocol Specification, Testing and Verification, X, L. Logrippo, R.L. Probert, and H. Ural, Eds. Amsterdam: North-Holland, 1990, pp. 85-98.
6. T. Chow, “Testing software desig modeled by finite state machines,” IEEE Trans. Software Eng., Vol. SE-4, pp. 178-187, Mar. 1978.
7. A. T. Dahbura, K. K. Sabnani, and M. U. Uyar, “Formal methods for generating protocol conformance test sequences,” Proc. IEEE, Vol. 78, No. 8, pp. 1317-1325, Aug. 1990.
8. J. Edmonds and E. L. Johnson, “Matching, Euler tours and the Chinese postman,” Math. Program., vol. 5, pp. 88–124, 1973.
9. A. Gill, Introduction to the Theory of Finite-State Machines. New York: McGraw-Hill, 1962.
10. G. Gonenc, “A method for the design of fault detection experiments,” IEEE Trans. Comput., Vol. C-19, pp. 551-558, June 1970.
11. Z. Kohavi, Switching and Finite Automata Theory. New York: McGraw-Hill, 1978.
12. M. K. Kuan, “Graphic programming using odd or even points,” Chinese Math., vol. 1, pp. 273–277, 1962.
13. J. K. Lenstra and A.H.G. Rinnooy Kan, “On general routing problems,” Netw., vol. 6, pp. 273–280, 1976.
14. R. E. Miller and S. Paul, “Generating minimal length test sequences for conformance testing of communication protocols,” in Proc. IEEE INFOCOMM '91, Apr. 1991.
15. S. Naito and M. Tsunoyama, “Fault detection for sequential machines by transition tours,” in Proc. 11th IEEE Fault Tolerant Comput. Symp., 1981, pp. 238-243.
16. D. Rayner, “OSI conformance testing,” Comput. Netw. and ISDN Syst., vol. 14, no. 1, pp. 79-98, 1987.
17. K. K. Sabnani and A. T. Dahbura, “A protocol test generation procedure,” Computer Netw. and ISDN Syst., vol. 15, no. 4, pp. 285-297, 1988.
18. Y. N. Shen, F. Lombardi, and A. T. Dahbura, “Protocol conformance testing using multiple UIO sequences,” in Protocol Specif., Test., and Verif IX, E. Brinksma, G. Scollo, and CA. Vissers, Eds. Amsterdam: North-Holland, 1989, pp. 131–143.
19. D. P. Sidhu and T. K. Leung, “Formal methods for protocol testing: A detailed study,” IEEE Trans. Software Eng., vol. SE-15, pp. 413–426, 1989.
20. D. P. Sidhu, “Protocol testing: The first ten years, the next ten years,” in Protocol Specif., Test., and Verif. X, L. Logrippo, R.L. Probert, and H. Ural, Eds. Amsterdam: North-Holland, 1990, pp. 47-68.
21. M. U. Uyar and A. T. Dahbura, “Optimal test sequence generation for protocols: The Chinese postman algorithm applied to Q.931,” in Proc. 1986 IEEE Global Telecommun. Conf., 1986, pp. 68-72.
22. B. Yang and H. Ural, “Protocol conformance test generation using multiple UIO sequences with overlapping,” in Proc. ACM SIGCOMM '90, Sept. 1990, pp. 118-125.