DeepAI AI Chat
Log In Sign Up

Causality-Based Game Solving

by   Christel Baier, et al.

We present a causality-based algorithm for solving two-player reachability games represented by logical constraints. These games are a useful formalism to model a wide array of problems arising, e.g., in program synthesis. Our technique for solving these games is based on the notion of subgoals, which are slices of the game that the reachability player necessarily needs to pass through in order to reach the goal. We use Craig interpolation to identify these necessary sets of moves and recursively slice the game along these subgoals. Our approach allows us to infer winning strategies that are structured along the subgoals. If the game is won by the reachability player, this is a strategy that progresses through the subgoals towards the final goal; if the game is won by the safety player, it is a permissive strategy that completely avoids a single subgoal. We evaluate our prototype implementation on a range of different games. On multiple benchmark families, our prototype scales dramatically better than previously available tools.


page 1

page 2

page 3

page 4


Reachability Switching Games

In this paper, we study the problem of deciding the winner of reachabili...

Synthesis of Deceptive Strategies in Reachability Games with Action Misperception

We consider a class of two-player turn-based zero-sum games on graphs wi...

Sampling-based Reactive Synthesis for Nondeterministic Hybrid Systems

This paper introduces a sampling-based strategy synthesis algorithm for ...

Canonical Representations for Direct Generation of Strategies in High-level Petri Games

Petri games are a multi-player game model for the synthesis of distribut...

Stubborn Set Reduction for Two-Player Reachability Games

Partial order reductions have been successfully applied to model checkin...

Synthesizing Permissive Winning Strategy Templates for Parity Games

We present a novel method to compute permissive winning strategies in tw...

Strategy Synthesis for General Deductive Games Based on SAT Solving

We propose a general framework for modelling and solving deductive games...