Name
Abstract | ||
|---|---|---|
We extend Angluin's algorithm for on-line learning of regular languages to the setting of timed transition systems. More specifically, we describe a procedure for inferring systems that can be described by event-recording automata by asking a sequence of membership queries (does the system accept a given timed word?) and equivalence queries (is a hypothesized description equivalent to the correct one?). In the inferred description, states are identified by sequences of symbols together with timing information. The number of membership queries is polynomially in the region graph and in the biggest constant of the automaton to learn. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1016/j.entcs.2005.02.062 | Electr. Notes Theor. Comput. Sci. |
Keywords | DocType | Volume |
event-recording automaton,region graph,model learning,inferring system,membership query,description equivalent,equivalence query,timing information,regular language,model inference,timed systems,transition system,timed transition,on-line learning | Journal | 138 |
Issue | ISSN | Citations |
3 | Electronic Notes in Theoretical Computer Science | 4 |
PageRank | References | Authors |
0.41 | 22 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Olga Grinchtein | 1 | 115 | 7.91 |
| bengt jonsson | 2 | 3637 | 263.46 |
| Martin Leucker | 3 | 1639 | 112.68 |