Benchmarking combinations of learning and testing algorithms for active automata learning
From MaRDI portal
Publication:6487258
DOI10.1007/978-3-030-50995-8_1zbMATH Open1511.68136MaRDI QIDQ6487258FDOQ6487258
Authors: Bernhard K. Aichernig, Martin Tappler 
Publication date: 9 November 2022
Recommendations
- Benchmarks for automata learning and conformance testing
- Combining black-box and white-box techniques for learning register automata
- Efficient active automata learning via mutation testing
- \(L^\ast\)-based learning of Markov decision processes (extended version)
- Improving active Mealy machine learning for protocol conformance testing
Cites Work
- Learning regular sets from queries and counterexamples
- Testing Software Design Modeled by Finite-State Machines
- Inference of finite automata using homing sequences
- Insights to Angluin's learning
- Benchmarks for automata learning and conformance testing
- Efficient active automata learning via mutation testing
Cited In (10)
- Active model learning of stochastic reactive systems
- Benchmarks for automata learning and conformance testing
- Compositional learning for interleaving parallel automata
- Learning I/O automata
- Enhancing Automata Learning by Log-Based Metrics
- Learning finite state models from recurrent neural networks
- Improving active Mealy machine learning for protocol conformance testing
- Compositional automata learning of synchronous systems
- Combining black-box and white-box techniques for learning register automata
- Active automata learning as black-box search and lazy partition refinement
This page was built for publication: Benchmarking combinations of learning and testing algorithms for active automata learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487258)
