Checking Completeness of Tests for Finite State Machines

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on computers 2010-08, Vol.59 (8), p.1023-1032
Hauptverfasser: Simao, Adenilso, Petrenko, Alexandre
Format: Artikel
Sprache:eng
Schlagworte:
Algorithm design and analysis
Algorithms
Automata
Completeness
Data mining
Decision support systems
fault coverage
Fault detection
Finite State Machine
Finite state machines
test analysis
test completeness conditions
test generation
Testing
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0018-9340
1557-9956
DOI:10.1109/TC.2010.17