L^*-based learning of Markov decision processes
From MaRDI portal
Publication:6535974
Recommendations
- \(L^\ast\)-based learning of Markov decision processes (extended version)
- Active learning of nondeterministic finite state machines
- Active automata learning as black-box search and lazy partition refinement
- Learning deterministic probabilistic automata from a model checking perspective
- Efficient learning of typical finite automata from random walks
Cites work
- scientific article; zbMATH DE number 938070 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- A theory of the learnable
- Active learning for extended finite state machines
- Computing behavioral distances, compositionally
- Domain-specific optimization in automata learning.
- Efficient active automata learning via mutation testing
- Formal methods for eternal networked software systems. 11th international school on formal methods for the design of computer, communication and software systems, SFM 2011, Bertinoro, Italy, June 13--18, 2011. Advanced lectures
- Inference of finite automata using homing sequences
- Learning Behaviors of Automata from Multiplicity and Equivalence Queries
- Learning deterministic probabilistic automata from a model checking perspective
- Learning deterministic regular grammars from stochastic samples in polynomial time
- Learning probabilistic automata and Markov chains via queries
- Learning probability distributions generated by finite-state machines
- Learning regular sets from queries and counterexamples
- Learning-based compositional verification for synchronous probabilistic systems
- Linear Automaton Transformations
- Probabilistic black-box reachability checking (extended version)
- Probability Inequalities for Sums of Bounded Random Variables
Cited in
(6)- Analyzing robustness of Angluin's \(\mathrm{L}^\ast\) algorithm in presence of noise
- A new approach for active automata learning based on apartness
- Analyzing robustness of Angluin's \(L^*\) algorithm in presence of noise
- Active automata learning as black-box search and lazy partition refinement
- Parameter synthesis for Markov models: covering the parameter space
- Regular decision processes
This page was built for publication: \(L^*\)-based learning of Markov decision processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535974)
