Learning deterministic multi-clock timed automata
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 1916673 (Why is no real title available?)
- scientific article; zbMATH DE number 795584 (Why is no real title available?)
- A theory of timed automata
- Active learning of deterministic timed automata with Myhill-Nerode style characterization
- Active learning of one-clock timed automata using constraint solving
- Active learning of timed automata with unobservable resets
- Complexity of automaton identification from given data
- Computer Aided Verification
- Efficiently identifying deterministic real-time automata from labeled data
- Event-clock automata: a determinizable class of timed automata
- Inference of Event-Recording Automata Using Timed Decision Trees
- Inferring switched nonlinear dynamical systems
- Learning Mealy machines with one timer
- Learning Meets Verification
- Learning deterministic one-clock timed automata via mutation testing
- Learning of event-recording automata
- Learning one-clock timed automata
- Learning regular sets from queries and counterexamples
- On the complexity of minimum inference of regular sets
- 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
- Time to learn -- learning timed automata from tests
This page was built for publication: Learning deterministic multi-clock timed automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6993510)
