Context independent unique state identification sequences for testing communication protocols modelled as extended finite state machines

A number of test sequence generation methods proposed for communication protocols represented as Extended Finite State Machines (EFSMs) use state identification sequences for checking the states. However, neither a formal definition nor a method of computation of these sequences for an EFSM state is known. In this paper, we first define a new type of state identification sequence, called Context Independent Unique Sequence (CIUS) and present an algorithm for computing it. To demonstrate the usefulness of these sequences, we then briefly describe a unified method based on CIUSs for automatically generating executable test cases for both control flow and data flow aspects of an EFSM. In control flow testing, CIUSs are very useful in confirming the tail states of the transitions. In data flow testing, CIUSs improve the observability of the test cases for the def-use associations of different variables used in the EFSM. Unlike general state identification sequences, the use of CIUSs does not increase the complexity of the already intractable feasibility testing problem in test case generation. Moreover, the feasibility problem encountered in both the CIUS computation and the test case generation methods is amenable to an incremental solution. We demonstrate this by presenting a method to solve a particular case of this problem in which the variables are of only integer, real or Boolean type and the predicates are linear.

[1]  Itu-T.  Specification and Description Language (SDL) , 1999 .

[2]  Lâaszlâo Csaba,et al.  Computer Network Usage: Recent Experiences , 1986 .

[3]  C.A. Vissers,et al.  Formal description techniques , 1983, Proceedings of the IEEE.

[4]  Hasan Ural,et al.  Test Generation by Exposing Control and Data Dependencies Within System Specifications in SDL , 1993, FORTE.

[5]  Krishnaiyan Thulasiraman,et al.  On Testing and Diagnosis of Communication Protocols Based on the FSM Model , 1995, Comput. Commun..

[6]  Gregor von Bochmann,et al.  Specifications of a Simplified Transport Protocol Using Different Formal Description Techniques , 1990, Comput. Networks ISDN Syst..

[7]  Elaine J. Weyuker,et al.  Selecting Software Test Data Using Data Flow Information , 1985, IEEE Transactions on Software Engineering.

[8]  Kenneth J. Turner,et al.  Using Formal Description Techniques: An Introduction to Estelle, Lotos, and SDL , 1993 .

[9]  Bo Yang,et al.  A test sequence selection method for protocol testing , 1991, IEEE Trans. Commun..

[10]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[11]  W. Y. L. Chan,et al.  An improved protocol test generation procedure based on UIOS , 1989, SIGCOMM 1989.

[12]  Samuel T. Chanson,et al.  A unified approach to protocol test sequence generation , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[13]  Samuel T. Chanson,et al.  Automatic protocol test suite derivation , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[14]  Elaine J. Weyuker.  The Complexity of Data Flow Criteria for Test Data Selection , 1984, Inf. Process. Lett..

[15]  Krishnaiyan Thulasiraman,et al.  Fault Detection and Diagnosis Capabilities of Test Sequence Selection Methods Based on the FSM Model , 1995, Comput. Commun..

[16]  Paul D. Amer,et al.  Test Case Generation for Protocols Specified in Estelle , 1990, FORTE.

[17]  Hasan Ural,et al.  Test generation based on control and data dependencies within system specifications in SDL , 2000, Comput. Commun..