Learning Mealy machines with one timer
From MaRDI portal
Publication:2232274
DOI10.1007/978-3-030-68195-1_13OpenAlexW3126328623MaRDI QIDQ2232274
Masoud Ebrahimi, Roderick Bloem, Frits W. Vaandrager
Publication date: 4 October 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-68195-1_13
Related Items (6)
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
Cites Work
- Learning of event-recording automata
- A theory of timed automata
- Active learning of timed automata with unobservable resets
- Combining black-box and white-box techniques for learning register automata
- Time to learn -- learning timed automata from tests
- Inference of finite automata using homing sequences
- Learning One-Clock Timed Automata
- Inference of Event-Recording Automata Using Timed Decision Trees
This page was built for publication: Learning Mealy machines with one timer
