One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 7559498
- The efficiency of identifying timed automata and the power of clocks
- Universality analysis for one-clock timed automata
- Model Checking One-clock Priced Timed Automata
- Model-Checking One-Clock Priced Timed Automata
- On parametric timed automata and one-counter machines
- Event-clock automata: a determinizable class of timed automata
- CONCUR 2004 - Concurrency Theory
- Grammatical Inference: Algorithms and Applications
- Determinisability of register and timed automata
Cites work
- 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
- Language identification in the limit
- Polynomial Distinguishability of Timed Automata
- Uppaal in a nutshell
Cited in
(10)- Polynomial Distinguishability of Timed Automata
- A likelihood-ratio test for identifying probabilistic deterministic real-time automata from positive data
- Efficiently identifying deterministic real-time automata from labeled data
- Learning one-clock timed automata
- The efficiency of identifying timed automata and the power of clocks
- Equivalence checking and intersection of deterministic timed finite state machines
- Learning deterministic one-clock timed automata via mutation testing
- Active learning of one-clock timed automata using constraint solving
- Automata with timers
- Learning deterministic multi-clock timed automata
This page was built for publication: One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3618628)
