15 citations · 61 across the 32 of their papers we have counts for
11 papers · 1 filter
Towards Actionable Strategy Certificates in Stochastic Parity Games
Christel Baier, Diane Cauquil, Calvin Chau +2
We propose a new approach for synthesizing large sets of winning strategies in stochastic parity games (2.5-player games) with quantitative objectives. Instead of computing a singl…
Concurrent Permissive Strategy Templates
Ashwani Anand, Christel Baier, Calvin Chau +4
Two-player games on finite graphs provide a rigorous foundation for modeling the strategic interaction between reactive systems and their environment. While concurrent game semanti…
Incremental Data-Driven Policy Synthesis via Game Abstractions
Irmak Sağlam, Mahdi Nazeri, Alessandro Abate +2
We address the synthesis of control policies for unknown discrete-time stochastic dynamical systems to satisfy temporal logic objectives. We present a data-driven, abstraction-base…
Quantitative Strategy Templates
Ashwani Anand, Satya Prakash Nayak, Ritam Raha +2
This paper presents (permissive) \emph{Quantitative Strategy Templates} (QaSTels) to succinctly represent infinitely many winning strategies in two-player energy and mean-payoff ga…
Fair Quantitative Games
Ashwani Anand, Satya Prakash Nayak, Ritam Raha +2
We examine two-player games over finite weighted graphs with quantitative (mean-payoff or energy) objective, where one of the players additionally needs to satisfy a fairness objec…
Most General Winning Secure Equilibria Synthesis in Graph Games
Satya Prakash Nayak, Anne-Kathrin Schmuck
This paper considers the problem of co-synthesis in -player games over a finite graph where each player has an individual -regular specification . In this context, a sec…
Solving Two-Player Games under Progress Assumptions
Anne-Kathrin Schmuck, K. S. Thejaswini, Irmak Sağlam +1
This paper considers the problem of solving infinite two-player games over finite graphs under various classes of progress assumptions motivated by applications in cyber-physical s…
Doubly Fair Parity Games
Daniel Hausmann, Nir Piterman, Irmak Sağlam +1
We consider two-player games over finite graphs in which both players are restricted by fairness constraints on their moves. Given a two player game graph and a set of fa…
Contract-Based Distributed Synthesis in Two-Objective Parity Games
Ashwani Anand, Satya Prakash Nayak, Anne-Kathrin Schmuck
We present a novel method to compute in non-zerosum two-player games over finite graphs where each player has a different -regular winning…
Synthesizing Permissive Winning Strategy Templates for Parity Games
Ashwani Anand, Satya Prakash Nayak, Anne-Kathrin Schmuck
We present a novel method to compute \emph{permissive winning strategies} in two-player games over finite graphs with -regular winning conditions. Given a game graph and a…
Computing Adequately Permissive Assumptions for Synthesis
Ashwani Anand, Kaushik Mallik, Satya Prakash Nayak +1
We solve the problem of automatically computing a new class of environment assumptions in two-player turn-based finite graph games which characterize an ``adequate cooperation'' ne…