We argue that timed models are a suitable framework for the detection of behavior in real-world event systems. A timed model which detects behavior is constructive by a domain expert. The inference of these timed models from data is a hard problem. We prove the inference of a class of timed automata (event recording automata) to be harder than the inference of finite automata.

Original languageEnglish
Pages (from-to)291-296
Number of pages6
JournalBelgian/Netherlands Artificial Intelligence Conference
Publication statusPublished - 1 Dec 2005
Event17th Belgium-Netherlands Conference on Artificial Intelligence, BNAIC 2005 - Brussels, Belgium
Duration: 17 Oct 200518 Oct 2005

ID: 75415597