The efficiency of identifying timed automata and the power of clocks

DOI10.1016/J.IC.2010.11.023MaRDI QIDQ553334zbMATH OpenOpenAlexFDO

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

Publication date 27 July 2011

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL http://resolver.tudelft.nl/uuid:1b229891-aed4-4def-b022-c4dab1b94b08

zbMATH Keywords

complexityidentification in the limitdeterministic timed automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit
• Detecting quasi-equal clocks in timed automata
• The power of reachability testing for timed automata
• Synthesizing Clock-Efficient Timed Automata
• The timestamp of timed automata
• scientific article; zbMATH DE number 3480493
• The Power of Proofs: New Algorithms for Timed Automata Model Checking
• Event-clock automata: a determinizable class of timed automata
• On clock-aware LTL properties of timed automata
• scientific article; zbMATH DE number 7559498

Cites work

• scientific article; zbMATH DE number 5595151 (Why is no real title available?)
• A theory of timed automata
• CONCUR 2004 - Concurrency Theory
• Characteristic sets for polynomial grammatical inference
• Complexity of automaton identification from given data
• Event-clock automata: a determinizable class of timed automata
• Inference of Event-Recording Automata Using Timed Decision Trees
• Language identification in the limit
• Minimal NFA Problems are Hard
• On polynomial-time learnability in the limit of strictly deterministic automata
• Teaching a smarter learner.
• Timed regular expressions
• Uppaal in a nutshell

Cited in

(10)

• Inferring switched nonlinear dynamical systems
• Efficiently identifying deterministic real-time automata from labeled data
• Active learning of one-clock timed automata using constraint solving
• One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit
• Biased clocks: a novel approach to improve the ability to perform predicate detection with \(O(1)\) clocks
• Equivalence checking and intersection of deterministic timed finite state machines
• Learning one-clock timed automata
• A likelihood-ratio test for identifying probabilistic deterministic real-time automata from positive data
• scientific article; zbMATH DE number 1543364 (Why is no real title available?)
• Polynomial Distinguishability of Timed Automata

Describes a project that uses

Uses Software

• Uppaal

This page was built for publication: The efficiency of identifying timed automata and the power of clocks

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