Learning Mealy machines with one timer
From MaRDI portal
Recommendations
Cites work
- A theory of timed automata
- Active learning of timed automata with unobservable resets
- Combining black-box and white-box techniques for learning register automata
- Inference of Event-Recording Automata Using Timed Decision Trees
- Inference of finite automata using homing sequences
- Learning of event-recording automata
- Learning one-clock timed automata
- Time to learn -- learning timed automata from tests
Cited in
(10)- Equivalence checking and intersection of deterministic timed finite state machines
- Active automata learning as black-box search and lazy partition refinement
- Enhancing active model learning with equivalence checking using simulation relations
- Learning deterministic one-clock timed automata via mutation testing
- Active learning of one-clock timed automata using constraint solving
- Learning Mealy machines with one timer
- A new approach for active automata learning based on apartness
- Automata with timers
- Learning deterministic multi-clock timed automata
- \(SL^{\lambda}\): a scalable algorithm for register automata learning
This page was built for publication: Learning Mealy machines with one timer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2232274)
