Checking Completeness of Tests for Finite State Machines

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.Natural Sciences and Engineering Research Council of CanadaNatural Sciences and Engineering Research Council of Canada[OGP0194381]Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)CNPq[200032/2008-9