Abstract | ||
---|---|---|
In this paper, we consider conformance testing of communication systems modeled by I/O automata. A framework is proposed for testing I/O automata with full fault coverage for implementations with at most m states. The notion of state identification, which was originally is defined in the realm of I/O finite state machines, is applied. Based on this notion, a test derivation algorithm is given for test suites which guarantee fault coverage. This algorithm is an analogue of the so-called FSM-based HSI-method. |
Year | DOI | Venue |
---|---|---|
1998 | 10.1007/978-0-387-35381-4_6 | IWTCS |
Keywords | Field | DocType |
test generation,output automata,input output | Fault coverage,Computer science,Automaton,Communications system,Algorithm,Finite-state machine,Conformance testing,Input/output,Implementation,Communications protocol | Conference |
ISBN | Citations | PageRank |
0-412-84430-3 | 10 | 1.06 |
References | Authors | |
8 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Q. M. Tan | 1 | 20 | 2.29 |
Alexandre Petrenko | 2 | 176 | 15.90 |