Efficiently identifying deterministic real-time automata from labeled data

DOI10.1007/s10994-011-5265-4zbMath1238.68135OpenAlexW2133625193MaRDI QIDQ420918

Mathijs de Weerdt, Sicco Verwer, Cees Witteveen

Publication date: 23 May 2012

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-011-5265-4

zbMATH Keywords

supervised learningtimed automataidentification in the limitreal-time automata

Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45)

Related Items (5)

Learning One-Clock Timed Automata ⋮ Active learning of one-clock timed automata using constraint solving ⋮ Improving active Mealy machine learning for protocol conformance testing ⋮ Active learning of timed automata with unobservable resets ⋮ Inferring switched nonlinear dynamical systems

Uses Software

• Uppaal
• PRMLT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The efficiency of identifying timed automata and the power of clocks
• Teaching a smarter learner.
• A theory of timed automata
• Characteristic sets for polynomial grammatical inference
• Uppaal in a nutshell
• Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms
• Inference of regular languages using state merging algorithms with search
• Polynomial Distinguishability of Timed Automata
• One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit
• Complexity of automaton identification from given data
• KI 2004: Advances in Artificial Intelligence
• Inference of Event-Recording Automata Using Timed Decision Trees
• Testing timed automata

This page was built for publication: Efficiently identifying deterministic real-time automata from labeled data