Comparing finite state machine test

To plan testing activities, testers face the challenge of determining a strategy, including a test coverage criterion that offers an acceptable compromise between the available resources and test goals. Known theoretical properties of coverage criteria do not always help and, thus, empirical data are needed. The results of an experimental evaluation of several coverage criteria for finite state machines (FSMs) are presented, namely, state and transition coverage; initialisation fault and transition fault coverage. The first two criteria focus on FSM structure, whereas the other two on potential faults in FSM implementations. The authors elaborate a comparison approach that includes random generation of FSM, construction of an adequate test suite and test minimisation for each criterion to ensure that tests are obtained in a uniform way. The last step uses an improved greedy algorithm.

[1]  Refael Hassin,et al.  The Set Cover with Pairs Problem , 2005, FSTTCS.

[2]  Alexandre Petrenko,et al.  Synthesis of test experiments in some classes of automata , 1991 .

[3]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

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

[5]  Claude Caci,et al.  Testing object-oriented systems , 2000, SOEN.

[6]  Nina Yevtushenko,et al.  An Improved Conformance Testing Method , 2005, FORTE.

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

[8]  Ana R. Cavalli,et al.  Experimental evaluation of FSM-based testing methods , 2005, Third IEEE International Conference on Software Engineering and Formal Methods (SEFM'05).

[9]  Alexandre Petrenko,et al.  On Fault Coverage of Tests for Finite State Specifications , 1996, Comput. Networks ISDN Syst..

[10]  Elaine J. Weyuker,et al.  A Formal Analysis of the Fault-Detecting Ability of Testing Methods , 1993, IEEE Trans. Software Eng..