Inference of Timed Transition Systems
| Title | Inference of Timed Transition Systems |
| Publication Type | Conference Paper |
| Year of Publication | 2004 |
| Authors | Grinchtein, O, Jonsson, B, Leucker, M |
| Conference Name | 6th International Workshop on Verification of Infinite-State Systems |
| Series | Electronic Notes in Theoretical Computer Science |
| Volume | 138/4 |
| Publisher | Elsevier Science Publishers |
| 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. |
Bibtex:
@inproceedings {GrinchteinJL04b,
title = {Inference of Timed Transition Systems},
booktitle = {6th International Workshop on Verification of Infinite-State Systems},
series = {Electronic Notes in Theoretical Computer Science},
volume = {138/4},
year = {2004},
publisher = {Elsevier Science Publishers},
organization = {Elsevier Science Publishers},
abstract = {We extend Angluin{\textquoteright}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.},
author = {Olga Grinchtein and Bengt Jonsson and Martin Leucker}
}PDF:
Postscript:
