2024/01/16 by Kazuki Watanabe, Watanabe, Kazuki, Marck van der Vegt +7 · 1 citation
Computer Science · #FOS: Computer and information sciences #Formal Methods in Verification #Logic in Computer Science (cs.LO) #Security and Verification in Computing #Software Testing and Debugging Techniques
paper · pdf · doi:10.48550/arxiv.2401.08377
openalex publication_date 2024/01/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Computing schedulers that optimize reachability probabilities in MDPs is a standard verification task. To address scalability concerns, we focus on MDPs that are compositionally described in a high-level description formalism. In particular, this paper considers string diagrams, which specify an algebraic, sequential composition of subMDPs. Towards their compositional verification, the key challenge is to locally optimize schedulers on subMDPs without considering their context in the string diagram. This paper proposes to consider the schedulers in a subMDP which form a Pareto curve on a combination of local objectives. While considering all such schedulers is intractable, it gives rise to a highly efficient sound approximation algorithm. The prototype on top of the model checker Storm demonstrates the scalability of this approach.