Back to Search
Start Over
Checking Completeness of Tests for Finite State Machines.
- Source :
-
IEEE Transactions on Computers . Aug2010, Vol. 59 Issue 8, p1023-1032. 10p. - Publication Year :
- 2010
-
Abstract
- 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. [ABSTRACT FROM AUTHOR]
- Subjects :
- *TESTING
*ALGORITHMS
*MODELS & modelmaking
*COMPUTER programming
*COMPUTER science
Subjects
Details
- Language :
- English
- ISSN :
- 00189340
- Volume :
- 59
- Issue :
- 8
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Computers
- Publication Type :
- Academic Journal
- Accession number :
- 51999189
- Full Text :
- https://doi.org/10.1109/TC.2010.17