On the identifiability in the limit of timed automata

Title

On the identifiability in the limit of timed automata

 Author

Verwer, S.E.
De Weerdt, M.M.
Witteveen, C.

Faculty

Electrical Engineering, Mathematics and Computer Science

 Department

Software Computer Technology

 Date

2006-11-20

 Abstract

We are interested in identifying a model for discrete event systems from observations. A common way to model discrete event systems is by using deterministic finite state automata (DFA). When observing a system, however, there often is information in addition to the system events, namely, their times of occurrence. If this time information is important, a DFA is too limited. For example, it is impossible to distinguish between events that occur quickly after each other, and events that occur after each other with a significant delay between them. Consequently, we would like a model that can also deal with time information.

 To reference this document use:

http://resolver.tudelft.nl/uuid:fbb832cf-fde3-4435-a186-05692f3cd057

 Source

GI Workshop: Grammatical Inference: workshop on open problems and new directions, Saint-Étienne, France, 20-22 November 2006

 Part of collection

Institutional Repository

 Document type

conference paper

 Rights

(c) 2006 The Author(s)
Files
PDF verwer06giworkshop1.pdf 116.17 KB
Close viewer