Abstract | ||
---|---|---|
There exists a significant body of work devoted to so-called complete tests which guarantee the detection of all the faults in a given fault domain. Several methods for generating complete tests for finite state machines (FSMs) which are based on a distinguishing sequence (DS) have been proposed. These methods even if extended to use adaptive DSs apply only to deterministic FSMs and the question a... |
Year | DOI | Venue |
---|---|---|
2015 | 10.1093/comjnl/bxu113 | The Computer Journal |
Keywords | Field | DocType |
finite state machines,non-determinism,test generation | Computer science,Generalization,Theoretical computer science | Journal |
Volume | Issue | ISSN |
58 | 7 | 0010-4620 |
Citations | PageRank | References |
5 | 0.39 | 0 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
A. Petrenko | 1 | 565 | 31.37 |
Adenilso Simão | 2 | 26 | 1.87 |