Inference of Timed Transition Systems | Zendy

Olga Grinchtein | Zendy; Bengt Jönsson | Zendy; Martin Leucker | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Inference of Timed Transition Systems

Author(s) -

Olga Grinchtein,

Bengt Jönsson,

Martin Leucker

Publication year - 2005

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2005.02.062

Subject(s) - automaton , equivalence (formal languages) , computer science , theoretical computer science , timed automaton , inference , graph , constant (computer programming) , transition system , regular language , regular expression , word (group theory) , event (particle physics) , artificial intelligence , mathematics , discrete mathematics , programming language , physics , geometry , quantum mechanics

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research