Passive learning of Timed Automata from logs (Student Abstract)

No. 18: AAAI-21 Student Papers and Demonstrations

Volume

Proceedings of the AAAI Conference on Artificial Intelligence, 35

AAAI Student Abstract and Poster Program

We propose a novel algorithm to passively learn deterministic Timed Automata from events sequences associated with the delay occurring between them. This algorithm produces models that are more specific than State-of-the-Art algorithms and that has a better identification of the temporal constraints applying on the systems.

10.1609/aaai.v35i18.17883