Kim G. Larsen

L∗-based learning of Markov decision processes (extended version)

2021 · Formal Aspects of Computing

Abstract Automata learning techniques automatically generate systemmodels fromtest observations. Typically, these techniques fall into two categories: passive and active. On the one hand, passive learning assumes no interaction with the system under learning and uses …

Active Learning of Markov Decision Processes using Baum-Welch algorithm (Extended)

2021 · arXiv (Cornell University)

Cyber-physical systems (CPSs) are naturally modelled as reactive systems with nondeterministic and probabilistic dynamics. Model-based verification techniques have proved effective in the deployment of safety-critical CPSs. Central for a successful application of such techniques is …

Automata Learning meets Shielding

2022 · arXiv (Cornell University)

Safety is still one of the major research challenges in reinforcement learning (RL). In this paper, we address the problem of how to avoid safety violations of RL agents during exploration in probabilistic and partially …