Learning one-clock timed automata
From MaRDI portal
Recommendations
- Active learning of one-clock timed automata using constraint solving
- One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- Learning deterministic one-clock timed automata via mutation testing
- The efficiency of identifying timed automata and the power of clocks
Cites work
- \(L^\ast\)-based learning of Markov decision processes (extended version)
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
- A theory of timed automata
- Active learning for extended finite state machines
- Combining black-box and white-box techniques for learning register automata
- Efficiently identifying deterministic real-time automata from labeled data
- Event-clock automata: a determinizable class of timed automata
- Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
- Formal Methods for the Design of Real-Time Systems
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- Inferring canonical register automata
- Learning I/O automata
- Learning of event-recording automata
- Learning register automata with fresh value generation
- Learning regular languages over large ordered alphabets
- Learning regular sets from queries and counterexamples
- Learning symbolic automata
- One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit
- Real-time automata
- The efficiency of identifying timed automata and the power of clocks
- The learnability of symbolic automata
- Time to learn -- learning timed automata from tests
Cited in
(21)- Active learning of timed automata with unobservable resets
- Inferring switched nonlinear dynamical systems
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
- Time to learn -- learning timed automata from tests
- Learning Mealy machines with one timer
- Inference of timed transition systems
- An efficient algorithm for learning event-recording automata
- Polynomial Distinguishability of Timed Automata
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- Learning of event-recording automata
- Efficient learning of real time one-counter automata
- Compositional learning for interleaving parallel automata
- 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
- Learning realtime one-counter automata
- Active learning of deterministic timed automata with Myhill-Nerode style characterization
- Learning assumptions for compositional verification of timed automata
- Automata with timers
- Learning deterministic multi-clock timed automata
- A Myhill-Nerode style characterization for timed automata with integer resets
This page was built for publication: Learning one-clock timed automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5039523)
