Issue No. 08 - August (2010 vol. 59)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2010.17
Adenilso Simao , Universidade de Sao Paulo, Sao Carlos
Alexandre Petrenko , CRIM, Montreal
In testing from a Finite State Machine (FSM), the generation of test suites which guarantee full fault detection, known as complete test suites, has been a long-standing research topic. In this paper, we present conditions that are sufficient for a test suite to be complete. We demonstrate that the existing conditions are special cases of the proposed ones. An algorithm that checks whether a given test suite is complete is given. The experimental results show that the algorithm can be used for relatively large FSMs and test suites.
Finite State Machine, test analysis, fault coverage, test completeness conditions, test generation.
Adenilso Simao, Alexandre Petrenko, "Checking Completeness of Tests for Finite State Machines", IEEE Transactions on Computers, vol. 59, no. , pp. 1023-1032, August 2010, doi:10.1109/TC.2010.17