14 citations · 35 across the 10 of their papers we have counts for
7 papers · 1 filter
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…
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…
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…
New Algorithms for Combinations of Objectives using Separating Automata
Ashwani Anand, Nathanaël Fijalkow, Aliénor Goubault-Larrecq +2
The notion of separating automata was introduced by Bojanczyk and Czerwinski for understanding the first quasipolynomial time algorithm for parity games. In this paper we show that…