Efficiently identifying deterministic real-time automata from labeled data

DOI10.1007/S10994-011-5265-4MaRDI QIDQ420918zbMATH OpenOpenAlexFDO

Authors Sicco Verwer, Mathijs M. de Weerdt, Cees Witteveen

Publication date 23 May 2012

Published in Machine Learning (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

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

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

Recommendations

• A likelihood-ratio test for identifying probabilistic deterministic real-time automata from positive data
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit
• The efficiency of identifying timed automata and the power of clocks
• Learning of event-recording automata

Cites work

• scientific article; zbMATH DE number 5957212 (Why is no real title available?)
• scientific article; zbMATH DE number 5595151 (Why is no real title available?)
• scientific article; zbMATH DE number 1179314 (Why is no real title available?)
• scientific article; zbMATH DE number 2019601 (Why is no real title available?)
• A theory of timed automata
• Characteristic sets for polynomial grammatical inference
• Complexity of automaton identification from given data
• Inference of Event-Recording Automata Using Timed Decision Trees
• Inference of regular languages using state merging algorithms with search
• KI 2004: Advances in Artificial Intelligence
• Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms
• One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit
• Pattern recognition and machine learning.
• Polynomial Distinguishability of Timed Automata
• Real-time automata
• Teaching a smarter learner.
• Testing timed automata
• The efficiency of identifying timed automata and the power of clocks
• Uppaal in a nutshell

Cited in

(6)

• Active learning of timed automata with unobservable resets
• Learning one-clock timed automata
• Active learning of one-clock timed automata using constraint solving
• Improving active Mealy machine learning for protocol conformance testing
• Inferring switched nonlinear dynamical systems
• A likelihood-ratio test for identifying probabilistic deterministic real-time automata from positive data

Describes a project that uses

Uses Software

• PRMLT
• Uppaal

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q420918)