One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit

Authors:
Sicco Verwer;Mathijs Weerdt;Cees Witteveen
Affiliations:
Delft University of Technology,;Delft University of Technology,;Delft University of Technology,
Venue:
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Year:
2009

Citing 5
Cited 2

The minimum consistent DFA problem cannot be approximated within and polynomial

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A theory of timed automata

Theoretical Computer Science
Characteristic Sets for Polynomial Grammatical Inference

Machine Learning
Polynomial Distinguishability of Timed Automata

ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Inference of event-recording automata using timed decision trees

CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory

A likelihood-ratio test for identifying probabilistic deterministic real-time automata from positive data

ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Learning driving behavior by timed syntactic pattern recognition

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two

Quantified Score

Hi-index	0.02

Visualization

Abstract

We study the complexity of identifying (learning) timed automata in the limit from data. In previous work, we showed that in order for timed automata to be efficiently identifiable in the limit, it is necessary that they are deterministic and that they use at most one clock. In this paper, we show this is also sufficient: we provide an algorithm that identifies one-clock deterministic timed automata efficiently in the limit.