Efficiently identifying deterministic real-time automata from labeled data

DOI10.1007/S10994-011-5265-4zbMATH Open1238.68135OpenAlexW2133625193MaRDI QIDQ420918FDOQ420918

Authors: Sicco Verwer, Mathijs M. de Weerdt, 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

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

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)

Cites Work

• Uppaal in a nutshell
• Title not available (Why is that?)
• Pattern recognition and machine learning.
• A theory of timed automata
• Title not available (Why is that?)
• Teaching a smarter learner.
• Complexity of automaton identification from given data
• Characteristic sets for polynomial grammatical inference
• 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
• Real-time automata
• Title not available (Why is that?)
• Polynomial Distinguishability of Timed Automata
• One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit
• Title not available (Why is that?)
• KI 2004: Advances in Artificial Intelligence
• The efficiency of identifying timed automata and the power of clocks
• Inference of Event-Recording Automata Using Timed Decision Trees
• Testing timed automata

Cited In (6)

• Learning one-clock timed automata
• Active learning of timed automata with unobservable resets
• 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

Uses Software

• Uppaal
• PRMLT

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)