An Optimization Technique for Protocol Conformance Test Generation Based on UIO Sequences and Rural Chinese Postman Tours

IEEE Transactions on Communications

Volumn 39, Issue 11, 1991, Pages 1604-1615

  Aho, Alfred V ^a   Lee, David ^b   Dahbura, Anton T ^c   Uyar, M Umit ^b  

^a TELCORDIA TECHNOLOGIES   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c MOTOROLA INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRIC NETWORKS, COMMUNICATION - RELIABILITY; MATHEMATICAL TECHNIQUES - ALGORITHMS;

COMMUNICATION NETWORKS; COMMUNICATION PROTOCOLS; COMPUTER ALGORITHMS; PROTOCOL TESTING;

COMPUTER NETWORKS;

EID: 0026260631     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/26.111442     Document Type: Article

References (29)

1. A. V. Aho, A. T. Dahbura, D. Lee, and M. U. Uyar, “An optimization technique for protocol conformance test generation based on UIO sequences and rural Chinese postman tours,” in Protocol Specification, Testing, and Verification, VIII, S. Aggarwal and K. K. Sabnani, Eds. New York: Elsevier North-Holland, 1988, pp. 75-86.
2. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wesley, 1974.
3. A. V. Aho and D. Lee, “Efficient algorithms for constructing testing sets, covering paths, and minimum flows,” submitted for publication.
4. G.v. Bochmann and C.A. Sunshine, “A survey of formal methods,” in Computer Networks and Protocols, P. E. Green, ed. New York.Plenum, 1983, pp. 561-578.
5. J. A. Bondy and U. S. R. Murty, Graph Theory With Applications. New York: Elsevier North Holland, 1976.
6. A. T. Dahbura and K. K. Sabnani, “An experience in estimating the fault coverage of a protocol test,” in Proc. IEEE INFOCOM ‘88, 1988, pp. 71-79.
7. J. Edmonds and E. L. Johnson, “Matching, Euler tours and the Chinese postman,” Math. Program., vol. 5, pp. 88-124, 1973.
8. J. Edmonds and R. M. Karp, “Theoretical improvements in algorithmic efficiency for network flow problems,” J. Assoc. Comput. Mach., vol. 19, no. 2, pp. 248-264, 1972.
9. M. L. Fredman and R.E. Tarjan, “Fibonacci heaps and their uses in improved network optimization algorithms,” in Proc. 25th Ann. Symp. Foundation Comput. Sci., 1984, pp. 338-346.
10. A. D. Friedman and P. R. Menon, Fault Detection in Digital Circuits. Englewood Cliffs, NJ:Prentice-Hall, 1971.
11. A. Gibbons, Algorithmic Graph Theory. Cambridge, MA: Cambridge University Press, 1985.
12. F. C. Hennie, “Fault-detecting experiments for sequential circuits,” in Proc. 5th Annu. Symp. Switch. Circuit Theory Logic. Design, Nov. 1964, pp. 95-110.
13. E. P. Hsieh, “Checking experiments for sequential machines”, IEEE Trans. Comput., vol. C-20, pp. 1152-1166, Oct. 1971.
14. D.B. Johnson, “Efficient algorithms for shortest paths in sparse networks,”/. Assoc. Comput. Mach., vol. 24, pp. 1-13, 1977.
15. Z. Kohavi, Switching and Finite Automata Theory. New York: McGraw-Hill, 1978.
16. M. -K. Kuan, “Graphic programming using odd or even points,” Chinese Math., vol. 1, 273-277, 1962.
17. P. K. Lala, Fault Tolerant and Fault Testable Hardware Design. Englewood Cliffs, NJ: Prentice-Hall, 1985.
18. J. K. Lenstra and A. H. G. Rinnooy Kan, “On general routing problems,” Networks, vol. 6, pp. 273-280, 1976.
19. S. Naito and M. Tsunoyama, “Fault detection for sequential machines by transition tours,” in Proc. 11th IEEE Fault Tolerant Comput. Symp., IEEE Comput. Society Press, pp. 238-243, 1981.
20. K. K. Sabnani and A.T. Dahbura, “A new technique for generating protocol tests,” in Proc. 9th Data Commun. Symp., IEEE Computer Society Press, pp. 36-43, 1985. Also has appeared in Comput. Commun. Rev., vol. 15, no. 4, Dec. 1985.
21. —, “A protocol test generation procedure,” Comput. Networks, vol. 15, no. 4, pp. 285-297, 1988.
22. B. Sarikaya and G.v. Bochmann, “Synchronization and specification issues in protocol testing,” IEEE Trans. Commun., vol. COM-32, pp. 389-395, Apr. 1984.
23. D. Sidhu and T. Leung, “Fault coverage of protocol test methods,” in Proc. IEEE INFOCOM’88, pp. 80-85, 1988.
24. R. E. Taijan, Data Structures and Network Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics, 1983.
25. M. U. Uyar and A. T. Dahbura, “Optimal test sequence generation for protocols: The Chinese postman algorithm applied to Q.931,” in Proc. IEEE Global Telecommun. Conf, 1986, pp. 68-72.
26. B. Wang and D. Hutchinson, “Protocol testing techniques,” Comput. Commun., vol. 10, no. 2, pp. 79-87, April 1987.
27. AT&T 5ESS ® Switch- ISDN Basic Rate Interface Specification, 5E4 Generic Program, AT&T 5D5-900-301, Sept. 1985.
28. CCITT Red Book, vol. Ill, FASCICLE III.5- Integrated Services Digital Net work (ISDN) Recommendations (Study Group XVIII), 1984.
29. K. K. Sabnani and A. M. Lapone, “PAV-protocol analyzer and verifier,” in Protocol Specification, Testing, and Verification, VI, B. Sarikaya and G.v. Bochmann, Eds. New York: Elsevier North-Holland, 1987, pp. 29-34.