Benchmarking combinations of learning and testing algorithms for automata learning
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1916673 (Why is no real title available?)
- scientific article; zbMATH DE number 795584 (Why is no real title available?)
- Active model learning of stochastic reactive systems
- Benchmarking combinations of learning and testing algorithms for active automata learning
- Benchmarks for automata learning and conformance testing
- CGE: a sequential learning algorithm for Mealy automata
- DKL: an efficient algorithm for learning deterministic Kripke structures
- Efficient active automata learning via mutation testing
- Fundamental Approaches to Software Engineering
- Grammatical inference. Learning automata and grammars.
- Incremental learning-based testing for reactive systems
- Inference of finite automata using homing sequences
- Inferring Network Invariants Automatically
- Insights to Angluin's learning
- Learning Meets Verification
- Learning Moore machines from input-output traces
- Learning finite state models from recurrent neural networks
- Learning regular sets from queries and counterexamples
- Model learning as a satisfiability modulo theories problem
- Probabilistic black-box reachability checking (extended version)
- Property-directed verification and robustness certification of recurrent neural networks
- Testing Software Design Modeled by Finite-State Machines
This page was built for publication: Benchmarking combinations of learning and testing algorithms for automata learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7028283)
