Enhancing active model learning with equivalence checking using simulation relations
From MaRDI portal
Recommendations
- Model learning as a satisfiability modulo theories problem
- Automata Learning through Counterexample Guided Abstraction Refinement
- Active model learning of stochastic reactive systems
- An automatic method for the dynamic construction of abstractions of states of a formal model
- \(L^\ast\)-based learning of Markov decision processes (extended version)
Cites work
- Active learning for extended finite state machines
- Automata Learning through Counterexample Guided Abstraction Refinement
- Automata learning with automated alphabet abstraction refinement
- Combining black-box and white-box techniques for learning register automata
- Deterministic finite automata with recursive calls and DPDAs
- Exact DFA Identification Using SAT Solvers
- Grey-Box Learning of Register Automata
- scientific article; zbMATH DE number 1670775 (Why is no real title available?)
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 1916673 (Why is no real title available?)
- Learning Mealy machines with one timer
- Learning regular languages over large ordered alphabets
- Learning regular sets from queries and counterexamples
- Learning the language of software errors
- Model checking
- On the Synthesis of Finite-State Machines from Samples of Their Behavior
- Sigma*
- Symbolic execution and program testing
- The learnability of symbolic automata
- Tools and algorithms for the construction and analysis of systems. 8th international conference, TACAS 2002. Held as part of the joint European conferences on theory and practice of software, ETAPS 2002, Grenoble, France, April 8--12, 2002
This page was built for publication: Enhancing active model learning with equivalence checking using simulation relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6151756)
