Name
Abstract | ||
|---|---|---|
We propose an approach which, given a state-transition model of a system, constructs, in parallel, an approximate automaton model and a test suite for the system. The approximate model construction relies on a variant of Angluin's automata learning algorithm, adapted to finite cover automata. A finite cover automaton represents an approximation of the system that only considers sequences of length... |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1093/comjnl/bxu032 | The Computer Journal |
Keywords | Field | DocType |
automata learning,model-based testing,formal methods,Event-B,Angluin's algorithm | Test suite,Random testing,Computer science,Upper and lower bounds,Automaton,Modeling language,Theoretical computer science,Automation,Counterexample,Model learning | Journal |
Volume | Issue | ISSN |
58 | 5 | 0010-4620 |
Citations | PageRank | References |
0 | 0.34 | 24 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Florentin Ipate | 1 | 419 | 43.20 |
| Alin Stefanescu | 2 | 209 | 17.79 |
| Ionut Dinca | 3 | 10 | 1.88 |