Name
Abstract | ||
|---|---|---|
Active inference algorithms that are used to extract behavioural models of software systems usually assume that the System Under Inference (SUI) can be reset. Two approaches have been proposed to infer systems that cannot be reset. Rivest and Schapire proposed an adaptation of the L* algorithm that relies on having a homing sequence for the SUI. We detail here another approach that is based on characterization sequences. More precisely, we assume classical testing hypotheses, namely that we are given a bound n on the number of states and a set W of characterizing sequences to distinguish states. Contrary to L*, it does not require an external oracle to decide on equivalence. The length of the test sequence is polynomial in n and the exponent depends on the cardinality vertical bar W vertical bar of the characterization set. For systems where resetting is impossible or expensive, this approach can be a viable alternative to classical learning methods. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-96562-8_7 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Discrete mathematics,Exponent,Polynomial,Inference,Computer science,Test sequence,Oracle,Cardinality,Software system,Equivalence (measure theory) | Conference | 11026 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Roland Groz | 1 | 496 | 50.60 |
| Adenilso Da Silva Simão | 2 | 216 | 23.24 |
| A. Petrenko | 3 | 565 | 31.37 |
| Catherine Oriat | 4 | 55 | 9.54 |