2017/10/24 by Sebastian Junges, Junges, Sebastian, Nils Jansen +11
Computer Science · Engineering · #FOS: Computer and information sciences #FOS: Electrical engineering #Fault Detection and Control Systems #Formal Methods in Verification #Logic in Computer Science (cs.LO) #Reinforcement Learning in Robotics #Systems and Control (eess.SY) #electronic engineering #information engineering
paper · pdf · doi:10.48550/arxiv.1710.10294
openalex publication_date 2017/10/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We study finite-state controllers (FSCs) for partially observable Markov decision processes (POMDPs) that are provably correct with respect to given specifications. The key insight is that computing (randomised) FSCs on POMDPs is equivalent to - and computationally as hard as - synthesis for parametric Markov chains (pMCs). This correspondence allows to use tools for parameter synthesis in pMCs to compute correct-by-construction FSCs on POMDPs for a variety of specifications. Our experimental evaluation shows comparable performance to well-known POMDP solvers.