14 citations · 35 across the 10 of their papers we have counts for
4 papers · 1 filter
Priority Downward Closures
Ashwani Anand, Georg Zetzsche
When a system sends messages through a lossy channel, then the language encoding all sequences of messages can be abstracted by its downward closure, i.e. the set of all (not neces…
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…