Abstract
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 language | English |
---|---|
Pages (from-to) | 291-296 |
Number of pages | 6 |
Journal | Belgian/Netherlands Artificial Intelligence Conference |
Publication status | Published - 1 Dec 2005 |
Event | 17th Belgium-Netherlands Conference on Artificial Intelligence, BNAIC 2005 - Brussels, Belgium Duration: 17 Oct 2005 → 18 Oct 2005 |