Testing strategies for communicating FSMs

The paper addresses grey-box testing of a system of communicating finite state machines under the assumptions that the system’s structure is preserved in all potential implementations, and that at most one component can be faulty. Several possible testing strategies which rely on these assumptions in various manners are presented and compared. The ideas behind these strategies are explained on a simple serial composition of two communicating FSMs. The existing FSM-based test derivation methods are assessed for their applicability to solve the problems arising from grey-box testing.

[1]  Ferhat Khendek,et al.  Test Selection Based on Finite State Models , 1991, IEEE Trans. Software Eng..

[2]  Tsun S. Chow,et al.  Testing Software Design Modeled by Finite-State Machines , 1978, IEEE Transactions on Software Engineering.

[3]  David Lee,et al.  Conformance testing of protocols specified as communicating FSMs , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[4]  Alexandre Petrenko.  Checking Experiments with Protocol Machines , 1991, Protocol Test Systems.

[5]  M. P. Vasilevskii.  Failure diagnosis of automata , 1973 .

[6]  G. Bochmann,et al.  Conformance Relations and Test Derivation , 1993, Protocol Test Systems.

[7]  Arthur Gill,et al.  Introduction to the theory of finite-state machines , 1962 .

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

[9]  P. Das,et al.  Fault-Detection Experiments for Parallel-Decomposable Sequential Machines , 1975, IEEE Transactions on Computers.

[10]  Monty Newborn,et al.  The Simplification of Sequential Machines with Input Restrictions , 1972, IEEE Transactions on Computers.

[11]  Srinivas Devadas,et al.  Approaches to Multi-Level Sequential Logic Synthesis , 1989, 26th ACM/IEEE Design Automation Conference.

[12]  Alexandre Petrenko,et al.  Test Selection Based on Communicating Nondeterministic Finite-State Machines Using a Generalized WP-Method , 1994, IEEE Trans. Software Eng..

[13]  Boris Tamm,et al.  Concise Encyclopedia of Software Engineering , 1992 .

[14]  Helmut Jürgensen,et al.  A model for sequential machine testing and diagnosis , 1992, J. Electron. Test..

[15]  Khalil Drira,et al.  Testability of a Communicating System Through an Environment , 1993, TAPSOFT.

[16]  N. V. Evtushenko,et al.  Method of constructing a test experiment for an arbitrary deterministic automation , 1991 .

[17]  Fabio Somenzi,et al.  Don't care sequences and the optimization of interacting finite state machines , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[18]  N. V. Evtushenko.  Fault-detection capability of multiple experiments , 1989 .

[19]  Ousmane Koné,et al.  Deriving Coordinated Testers for Interoperability , 1993, Protocol Test Systems.

[20]  Nina Yevtushenko,et al.  Nondeterministic State Machines in Protocol Conformance Testing , 1993, Protocol Test Systems.

[21]  Nina Yevtushenko,et al.  Test Suite Generation from a FSM with a Given Type of Implementation Errors , 1992, PSTV.

[22]  Deepinder P. Sidhu,et al.  Formal Methods for Protocol Testing: A Detailed Study , 1989, IEEE Trans. Software Eng..