The efficiency of identifying timed automata and the power of clocks

Authors:
Sicco Verwer;Mathijs de Weerdt;Cees Witteveen
Affiliations:
Eindhoven University of Technology, Department of Mathematics and Computer Science (EWI), P.O. 513, 5600 MB, Eindhoven, The Netherlands and Delft University of Technology, Department of Engineerin ...;Delft University of Technology, Department of Engineering, Mathematics and Computer Science, Mekelweg 4, 2628 CD, Delft, The Netherlands;Delft University of Technology, Department of Engineering, Mathematics and Computer Science, Mekelweg 4, 2628 CD, Delft, The Netherlands
Venue:
Information and Computation
Year:
2011

Citing 13
Cited 0

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 tutorial on hidden Markov models and selected applications in speech recognition

Readings in speech recognition
Minimal NFA problems are hard

SIAM Journal on Computing
A theory of timed automata

Theoretical Computer Science
On Polynomial-Time Learnability in the Limit of Strictly Deterministic Automata

Machine Learning
Teaching a smarter learner

Journal of Computer and System Sciences
Characteristic Sets for Polynomial Grammatical Inference

Machine Learning
Event-clock automata: a determinizable class of timed automata

Theoretical Computer Science
Timed regular expressions

Journal of the ACM (JACM)
Introduction to the Theory of Computation: Preliminary Edition

Introduction to the Theory of Computation: Preliminary Edition
Results of the Abbadingo One DFA Learning Competition and a New Evidence-Driven State Merging Algorithm

ICGI '98 Proceedings of the 4th International Colloquium on Grammatical Inference
Ensemble Methods in Machine Learning

MCS '00 Proceedings of the First International Workshop on Multiple Classifier Systems
Inference of event-recording automata using timed decision trees

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We develop theory on the efficiency of identifying (learning) timed automata. In particular, we show that: (i) deterministic timed automata cannot be identified efficiently in the limit from labeled data and (ii) that one-clock deterministic timed automata can be identified efficiently in the limit from labeled data. We prove these results based on the distinguishability of these classes of timed automata. More specifically, we prove that the languages of deterministic timed automata cannot, and that one-clock deterministic timed automata can be distinguished from each other using strings in length bounded by a polynomial. In addition, we provide an algorithm that identifies one-clock deterministic timed automata efficiently from labeled data. Our results have interesting consequences for the power of clocks that are interesting also out of the scope of the identification problem.