L^*-based learning of Markov decision processes
From MaRDI portal
Publication:6535974
DOI10.1007/978-3-030-30942-8_38zbMATH Open1539.68123MaRDI QIDQ6535974FDOQ6535974
Authors: Martin Tappler, Bernhard K. Aichernig, Giovanni Bacci, Maria Eichlseder, Kim G. Larsen 
Publication date: 14 March 2024
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
Formal languages and automata (68Q45) Computational learning theory (68Q32) Markov and semi-Markov decision processes (90C40)
Cites Work
- Probabilistic black-box reachability checking (extended version)
- Probability Inequalities for Sums of Bounded Random Variables
- Learning regular sets from queries and counterexamples
- Title not available (Why is that?)
- A theory of the learnable
- Title not available (Why is that?)
- Learning deterministic regular grammars from stochastic samples in polynomial time
- 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
- Domain-specific optimization in automata learning.
- Linear Automaton Transformations
- Learning Behaviors of Automata from Multiplicity and Equivalence Queries
- Active learning for extended finite state machines
- Computing behavioral distances, compositionally
- Learning probabilistic automata and Markov chains via queries
- Learning deterministic probabilistic automata from a model checking perspective
- Learning-based compositional verification for synchronous probabilistic systems
- Learning probability distributions generated by finite-state machines
- Efficient active automata learning via mutation testing
Cited In (5)
- Parameter synthesis for Markov models: covering the parameter space
- Regular decision processes
- Analyzing robustness of Angluin's \(\mathrm{L}^\ast\) algorithm in presence of noise
- Active automata learning as black-box search and lazy partition refinement
- A new approach for active automata learning based on apartness
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)
