Conformance testing of protocols specified as communicating finite state machines-a guided random walk based approach

We present a new approach for conformance testing of protocols specified as a collection of communicating finite state machines (FSMs). Our approach uses a guided random walk procedure. This procedure attempts to cover all transitions in the component FSMs. We also introduce the concept of observers that check some aspect of protocol behavior. We present the result of applying our method to two example protocols: full-duplex alternating bit protocol and the ATM-adaptation-layer-convergence protocol. Applying our procedure to the ATM adaptation layer, 99% of component FSMs edges can be covered in a test with 11692 input steps. Previous approaches cannot do conformance test generation for standard protocols (such as asynchronous transfer mode (ATM) adaptation layer) specified as a collection of communicating FSMs.

[1]  Krishan K. Sabnani,et al.  An experience in estimating fault coverage of a protocol test , 1988, IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?.

[2]  Sanjoy Paul,et al.  Generating minimal length test sequences for conformance testing of communication protocols , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[3]  Güney Gönenç,et al.  A Method for the Design of Fault Detection Experiments , 1970 .

[4]  Ming T. Liu,et al.  A Test Suite Generation Method for Extended Finite State Machines Using Axiomatic Semantics Approach , 1992, PSTV.

[5]  Guney Gonenc,et al.  A Method for the Design of Fault Detection Experiments , 1970, IEEE Transactions on Computers.

[6]  F. C. Hennine.  Fault detecting experiments for sequential circuits , 1964, SWCT 1964.

[7]  Hasan Ural,et al.  On the Complexity of Generating Optimal Test Sequences , 1991, IEEE Trans. Software Eng..

[8]  Gregor von Bochmann,et al.  Some Experience with Test Sequence Generation for Protocols , 1982, PSTV.

[9]  Alfred V. Aho,et al.  An optimization technique for protocol conformance test generation based on UIO sequences and rural Chinese postman tours , 1991, IEEE Trans. Commun..

[10]  Richard J. Lipton,et al.  Random walks, universal traversal sequences, and the complexity of maze problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[11]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[12]  Deepinder Sidhu,et al.  Fault coverage of protocol test methods , 1988, IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?.

[13]  David Lee,et al.  Testing finite state machines , 1991, STOC '91.

[14]  Krishan K. Sabnani,et al.  A Protocol Test Generation Procedure , 1988, Comput. Networks.

[15]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[16]  Gregor von Bochmann,et al.  A Survey of Formal Methods , 1982 .

[17]  Bruno O. Shubert,et al.  Random variables and stochastic processes , 1979 .

[18]  Edward F. Moore,et al.  Gedanken-Experiments on Sequential Machines , 1956 .

[19]  F. C. Hennie.  Fault detecting experiments for sequential circuits , 1964, SWCT.

[20]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[21]  Robert L. Probert,et al.  User-Guided Test Sequence Generation , 1983, Protocol Specification, Testing, and Verification.

[22]  John G. Proakis,et al.  Probability, random variables and stochastic processes , 1985, IEEE Trans. Acoust. Speech Signal Process..