Synthesizing Permissive Winning Strategy Templates for Parity Games

05/23/2023
by   Ashwani Anand, et al.
0

We present a novel method to compute permissive winning strategies in two-player games over finite graphs with ω-regular winning conditions. Given a game graph G and a parity winning condition Φ, we compute a winning strategy template Ψ that collects an infinite number of winning strategies for objective Φ in a concise data structure. We use this new representation of sets of winning strategies to tackle two problems arising from applications of two-player games in the context of cyber-physical system design – (i) incremental synthesis, i.e., adapting strategies to newly arriving, additional ω-regular objectives Φ', and (ii) fault-tolerant control, i.e., adapting strategies to the occasional or persistent unavailability of actuators. The main features of our strategy templates – which we utilize for solving these challenges – are their easy computability, adaptability, and compositionality. For incremental synthesis, we empirically show on a large set of benchmarks that our technique vastly outperforms existing approaches if the number of added specifications increases. While our method is not complete, our prototype implementation returns the full winning region in all 1400 benchmark instances, i.e., handling a large problem class efficiently in practice.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/12/2023

Contract-Based Distributed Synthesis in Two-Objective Parity Games

We present a novel method to compute assume-guarantee contracts in non-z...
research
01/18/2023

Computing Adequately Permissive Assumptions for Synthesis

We solve the problem of automatically computing a new class of environme...
research
05/25/2023

Solving Infinite-State Games via Acceleration

Two-player graph games have found numerous applications, most notably th...
research
02/02/2018

Strategy Representation by Decision Trees in Reactive Synthesis

Graph games played by two players over finite-state graphs are central i...
research
07/25/2023

Solving Odd-Fair Parity Games

This paper discusses the problem of efficiently solving parity games whe...
research
07/22/2019

Semantic Labelling and Learning for Parity Game Solving in LTL Synthesis

We propose "semantic labelling" as a novel ingredient for solving games ...
research
09/14/2017

Synthesizing Optimally Resilient Controllers

Recently, Dallal, Neider, and Tabuada studied a generalization of the cl...

Please sign up or login with your details

Forgot password? Click here to reset