Active model learning of stochastic reactive systems
DOI10.1007/978-3-030-92124-8_27zbMath1522.68348OpenAlexW4206634491MaRDI QIDQ6045066
Edi Muškardin, Bernhard K. Aichernig, Ingo Pill, Martin Tappler
Publication date: 26 May 2023
Published in: Software Engineering and Formal Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-92124-8_27
Markov decision processesprobabilistic verificationactive automata learningmodel miningstochastic Mealy machines
Computational learning theory (68Q32) Formal languages and automata (68Q45) Markov and semi-Markov decision processes (90C40) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Cites Work
- Unnamed Item
- Learning of event-recording automata
- Learning regular sets from queries and counterexamples
- Learning deterministic probabilistic automata from a model checking perspective
- \(L^\ast\)-based learning of Markov decision processes (extended version)
- Probabilistic black-box reachability checking (extended version)
- Inference of finite automata using homing sequences
- Machine Translation with Inferred Stochastic Finite-State Transducers
- Linear Automaton Transformations
- Learning deterministic regular grammars from stochastic samples in polynomial time
- Probability Inequalities for Sums of Bounded Random Variables
- Computer Aided Verification
This page was built for publication: Active model learning of stochastic reactive systems
