Model generation by moderated regular extrapolation
From MaRDI portal
Recommendations
Cited in
(14)- Generating models of infinite-state communication protocols using regular inference with abstraction
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
- Efficient unlinkable sanitizable signatures from signatures with re-randomizable keys
- Inferring canonical register automata
- Automata learning with automated alphabet abstraction refinement
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
- Demonstration of an operational procedure for the model-based testing of CTI systems
- Learning register automata: from languages to program structures
- Query learning of derived \(\omega\)-tree languages in polynomial time
- Learning of event-recording automata
- A Context-Free Symbiosis of Runtime Verification and Automata Learning
- Guarded Kleene algebra with tests: automata learning
- \(SL^{\lambda}\): a scalable algorithm for register automata learning
- Active learning for extended finite state machines
This page was built for publication: Model generation by moderated regular extrapolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4738314)