
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
T. Ramalingom, Krishnaiyan Thulasiraman, Anindya Das, "A MatroidTheoretic Solution to an Assignment Problem in the Conformance Testing of Communication Protocols," IEEE Transactions on Computers, vol. 49, no. 4, pp. 317330, April, 2000.  
BibTex  x  
@article{ 10.1109/12.844345, author = {T. Ramalingom and Krishnaiyan Thulasiraman and Anindya Das}, title = {A MatroidTheoretic Solution to an Assignment Problem in the Conformance Testing of Communication Protocols}, journal ={IEEE Transactions on Computers}, volume = {49}, number = {4}, issn = {00189340}, year = {2000}, pages = {317330}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.844345}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  A MatroidTheoretic Solution to an Assignment Problem in the Conformance Testing of Communication Protocols IS  4 SN  00189340 SP317 EP330 EPD  317330 A1  T. Ramalingom, A1  Krishnaiyan Thulasiraman, A1  Anindya Das, PY  2000 KW  Protocol KW  communication KW  communication protocol KW  protocol testing KW  graph theory KW  matroids KW  algorithms. VL  49 JA  IEEE Transactions on Computers ER   
Abstract—The minimum length test sequence generation method proposed in [2] for conformance testing of a protocol uses Unique Input Sequences (UIS) for state identification. This method, called the Umethod, requires that the test graph, a graph derived from the protocol, be connected. This requirement also needs to be satisfied in the case of the MUmethod [31], [30], which assumes that the multiple UISs are available for each state. Thus, the Umethod and the MUmethod may not provide minimum length test sequences in cases where the test graph is not connected. Nevertheless, these methods generate minimum length test sequences with high fault coverage whenever the test graph is connected. This raises an important problem: Does there exist an assignment of UISs to the transitions such that the resulting test graph is connected? In this paper, we formulate this problem as a maximum cardinality two matroid intersection problem and discuss an efficient algorithmic solution. We also point out the role of the work in the minimum length test sequence generation problem.
[1] R. Anido and A. Cavalli, “Guaranteeing Full Fault Coverage for UIO Based Methods,” Proc. Eighth Int'l Workshop Protocol Test Systems, Sept. 1995.
[2] 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,” Protocol Specification, Testing and Verification, VIII, S. Aggarwal and K. Sabnani, eds., pp. 7586, NorthHolland: Elsevier Science Publishers B.V., 1988.
[3] G. v. Bochmann, R. Dssouli, and J. Zhao, "Trace Analysis for Conformance and Arbitration Testing," IEEE Trans. Software. Eng., vol. 15, no. 11, pp. 1,3471,356, Nov. 1989.
[4] M.S. Chen, Y. Choi, and A. Kershenbaum, “Approaches Utilizing Segment Overlap to Minimize Test Sequences,” Proc. 10th Int'l Symp. Protocol Specification, Testing, and Verification, pp. 6784, June 1990.
[5] A. Chung and D. Sidhu, “Applications of Sufficient Conditions for Efficient Protocol Test Generation,” Proc. Fifth Int'l Workshop Protocol Test Systems, pp. 196205, Sept. 1992.
[6] A.T. Dahbura, K.K. Sabnani, and M.U. Uyar, “Formal Methods for Generating Protocol Conformance Test Sequences,” Proc. IEEE, vol. 78, pp. 13171325, 1990.
[7] J. Edmonds, “Matroids and Greedy Algorithm,” Math. Programming, vol. 1, pp. 127136, 1971.
[8] J. Edmonds, “Matroid Intersection,” Annals of Discrete Math., vol. 4, pp. 3949, 1979.
[9] J. Edmonds and E.L. Johnson, “Matching, Euler Tours and the Chinese Postman,” Math. Programming, vol. 5, pp. 88124, 1973.
[10] D. Hogrefe, “OSI Formal Specification Case Study: The Inres Protocol and Service, Revised,” technical report, Inst. for Informatics, Univ. of Berne, May 1992.
[11] M.K. Kuan, “Graphic Programming Using Odd or Even Points,” Chinese Math., vol. 1, pp. 273277, 1962.
[12] E.L. Lawler, “Matroid Intersection Algorithms,” Math. Programming, vol. 9, pp. 3156, 1975.
[13] E.L. Lawler, Combinatorial Optimization: Networks and Matroids. New York: Holt, Reinhart and Winston, 1976.
[14] Z. Lidong, L. Jiren, and L. Huatian, “A Further Optimization Technique for Conformance Testing Based on Multiple UIO Sequences,” Proc. Fifth Int'l Workshop Protocol Test Systems, pp. 206211, Sept. 1992.
[15] J.K. Lenstra and A.H.G. Rinnooy Kan, “On General Routing Problems,” Networks, vol. 6, no. 3, pp. 273280, July 1976.
[16] H. Motteler, A. Chung, and D. Sidhu, “Fault Coverage of UIOBased Methods for Protocol Testing,” Proc. Sixth Int'l Workshop Protocol Test Systems, pp. 2335, Sept. 1993.
[17] R.E. Miller and S. Paul, “Generating Minimal Length Test Sequences Conformance Testing of Communication Protocols,” Proc. Int’l Phoenix Conf. on Computers and Comm., CS Press, 1991, pp. 970979.
[18] G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization. New York: Wiley, 1988.
[19] C.H. Papadimitriou, “On the Complexity of Edge Traversing,” J. ACM, vol. 23, no. 3, pp. 544554, July 1976.
[20] R.G. Parker and R.L. Rardin, Discrete Optimization. San Diego, Calif.: Academic Press, 1988.
[21] C.H. Papadimitriu and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Prentice Hall, 1987.
[22] T. Ramalingam, “Test Case Generation and Fault Diagnosis Methods for Communication Protocols Based on FSM and EFSM Models,” PhD thesis, Concordia Univ., Montreal, Canada, 1994.
[23] T. Ramalingam, A. Das, and K. Thulasiraman, “Fault Detection and Diagnosis Capabilities of Test Sequence Selection Methods Based on the FSM Model,” Computer Comm., vol. 18, no. 2, pp. 113122, Feb. 1995.
[24] T. Ramalingam, K. Thulasiraman, and A. Das, “A Generalization of the Multiple UIO Method of Test Sequence Selection for Protocols Represented in FSM,” Proc. Seventh Int'l Workshop Protocol Test Systems, Nov. 1994.
[25] M. Rodrigues and H. Ural, “Optimal Length Test Sequences: Lower Bounds on Their Length and Exact Solutions for Their Construction,” technical report, computer science, Univ. of Ottawa, Ottawa, Canada, 1992.
[26] K.K. Sabnani and A.T. Dahbura, “A New Technique for Generating Protocol Tests,” Proc. Ninth Data Comm. Symp., pp. 3643, Sept. 1985.
[27] K. Sabnani and A. Dahbura,“A protocol test generation procedure,”Comput. Networks and ISDN Syst.,vol. 15, pp. 285–297, 1988.
[28] D. Sidhu, “Protocol Testing: The First Ten Years, the Next Ten Years,” Proc. 10th Int'l IFIP Symp. Protocol Specifications, Testing, and Verification, June 1990.
[29] D.P. Sidhu and T.K. Leung, Formal Methods for Protocol Testing: A Detailed Study IEEE Trans. Software Eng., vol. 15, no. 4, pp. 413426, Apr. 1991.
[30] Y.N. Shen and F. Lombardi, “On Two Graph Algorithms for the Rural Chinese Postman Tour Problem in Protocol Verification and Validation,” technical report, Dept. of Computer Science, Texas A&M Univ., College Station, Tex., 1992.
[31] Y.N. Shen, F. Lombardi, and A.T. Dahbura, “Protocol Conformance Testing Using Multiple UIO Sequences,” IEEE Trans. Comm., vol. 40, no. 8, pp. 1,2821,287, Aug. 1992.
[32] X. Sun, Y. Shen, C. Feng, and F. Lombardi, Protocol Conformance Testing Using Unique Input/Output Sequences. World Scientific, 1998.
[33] K. Thulasiraman and M.N.S. Swamy, Graphs: Theory and Algorithms. Wiley and Sons, 1992.
[34] H. Ural, “Formal Methods for Test Sequence Generation,” Computer Comm., vol. 15, no. 5, pp. 311325, June 1992.
[35] D.B. West, Introduction to Graph Theory. Prentice Hall, 1996.
[36] H. Whitney, “On the Abstract Properties of Linear Dependence,” Am. J. Math., vol. 57, pp. 509533, 1935.