Symbolic Control for Stochastic Systems via Parity Games

by   Rupak Majumdar, et al.

We consider the problem of computing the maximal probability of satisfying an ω-regular specification for stochastic, continuous-state, nonlinear systems evolving in discrete time. The problem reduces, after automata-theoretic constructions, to finding the maximal probability of satisfying a parity condition on a (possibly hybrid) state space. While characterizing the exact satisfaction probability is open, we show that a lower bound on this probability can be obtained by (I) computing an under-approximation of the qualitative winning region, i.e., states from which the parity condition can be enforced almost surely, and (II) computing the maximal probability of reaching this qualitative winning region. The heart of our approach is a technique to symbolically compute the under-approximation of the qualitative winning region in step (I) via a finite-state abstraction of the original system as a 21/2-player parity game. Our abstraction procedure uses only the support of the probabilistic evolution; it does not use precise numerical transition probabilities. We prove that the winning set in the abstract 21/2-player game induces an under-approximation of the qualitative winning region in the original synthesis problem, along with a policy to solve it. By combining these contributions with (a) existing symbolic fixpoint algorithms to solve 21/2-player games and (b) existing techniques for reachability policy synthesis in stochastic nonlinear systems, we get an abstraction-based symbolic algorithm for finding a lower bound on the maximal satisfaction probability. We have implemented our approach and evaluated it on the nonlinear model of the perturbed Dubins vehicle.



There are no comments yet.



A Parity Game Tale of Two Counters

Parity games have important practical applications in formal verificatio...

Symbolic Parity Game Solvers that Yield Winning Strategies

Parity games play an important role for LTL synthesis as evidenced by re...

Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP

We study stochastic games with energy-parity objectives, which combine q...

Quasipolynomial Set-Based Symbolic Algorithms for Parity Games

Solving parity games, which are equivalent to modal μ-calculus model che...

Model-Free Reinforcement Learning for Stochastic Games with Linear Temporal Logic Objectives

We study the problem of synthesizing control strategies for Linear Tempo...

Solving Parity Games Using An Automata-Based Algorithm

Parity games are abstract infinite-round games that take an important ro...

Resource-Aware Automata and Games for Optimal Synthesis

We consider quantitative notions of parity automaton and parity game aim...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.