Timed Automata for Behavioral Pattern Recognition

Conference paper (2005)
Department
Software Computer Technology (EEMCS) (TU Delft)
Copyright: © 2005 The Author(s)
More Info
expand_more

Published Date

17-10-2005

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Source:

BNAIC 2005: The 17th Belgium-Dutch Conference on Artificial Intelligence, Brussels, Belgium, 17-18 October 2005

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Software Computer Technology

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 constructible 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.

Files

Verwer05bnaic1.pdf
(pdf | 0.112 Mb)