Domain-specific optimization in automata learning.
From MaRDI portal
Recommendations
Cited in
(19)- \(L^\ast\)-based learning of Markov decision processes (extended version)
- Fundamental results for learning deterministic extended finite state machines from queries
- Generating models of infinite-state communication protocols using regular inference with abstraction
- Inferring canonical register automata
- Automata learning with automated alphabet abstraction refinement
- Learning Meets Verification
- Integration Testing of Distributed Components Based on Learning Parameterized I/O Models
- Learning finite cover automata from queries
- Active learning of nondeterministic finite state machines
- Learning register automata: from languages to program structures
- Improving active Mealy machine learning for protocol conformance testing
- Learning of event-recording automata
- Active model learning of stochastic reactive systems
- From languages to behaviors and back
- A Context-Free Symbiosis of Runtime Verification and Automata Learning
- L^*-based learning of Markov decision processes
- Unsupervised automata learning via discrete optimization
- \(SL^{\lambda}\): a scalable algorithm for register automata learning
- Active learning for extended finite state machines
This page was built for publication: Domain-specific optimization in automata learning.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5900687)
