\(L^\ast\)-based learning of Markov decision processes (extended version)
From MaRDI portal
Publication:1982638
DOI10.1007/s00165-021-00536-5OpenAlexW3132992873MaRDI QIDQ1982638
Martin Tappler, Bernhard K. Aichernig, Giovanni Bacci, Maria Eichlseder, Kim Guldstrand Larsen
Publication date: 14 September 2021
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1906.12239
Related Items (6)
Learning probabilistic automata using residuals ⋮ Learning of Structurally Unambiguous Probabilistic Grammars ⋮ Learning One-Clock Timed Automata ⋮ Active model learning of stochastic reactive systems ⋮ Fingerprinting and analysis of Bluetooth devices with automata learning ⋮ Learning weighted automata over principal ideal domains
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Active learning for extended finite state machines
- FM 2009: Formal methods. Second world congress, Eindhoven, The Netherlands, November 2--6, 2009. Proceedings
- Learning regular sets from queries and counterexamples
- Learning probabilistic automata and Markov chains via queries
- Learning deterministic probabilistic automata from a model checking perspective
- Probabilistic black-box reachability checking (extended version)
- Efficient active automata learning via mutation testing
- Inference of finite automata using homing sequences
- Computing Behavioral Distances, Compositionally
- Learning Probability Distributions Generated by Finite-State Machines
- Learning Probabilistic Systems from Tree Samples
- Efficient noise-tolerant learning from statistical queries
- Learning-Based Compositional Verification for Synchronous Probabilistic Systems
- Linear Automaton Transformations
- Fast randomized consensus using shared memory
- A theory of the learnable
- Testing Software Design Modeled by Finite-State Machines
- Learning deterministic regular grammars from stochastic samples in polynomial time
- Automated Verification and Strategy Synthesis for Probabilistic Systems
- Validation of Stochastic Systems
- On-the-Fly Exact Computation of Bisimilarity Distances
- Probability Inequalities for Sums of Bounded Random Variables
- Learning Behaviors of Automata from Multiplicity and Equivalence Queries
- Computer Aided Verification
This page was built for publication: \(L^\ast\)-based learning of Markov decision processes (extended version)
