15 citations · 55 across the 16 of their papers we have counts for
16 papers
Context-Triggered Robust MPC for Temporal Logic Specifications
Arash Bahari Kordabad, Satya Prakash Nayak, Sadegh Soudjani +1
We consider the problem of synthesizing robust feedback controllers for discrete-time linear systems that ensure the satisfaction of context-dependent linear temporal logic specifi…
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…
Universal Safety Controllers with Learned Prophecies
Bernd Finkbeiner, Niklas Metzger, Satya Prakash Nayak +1
\emph{Universal Safety Controllers (USCs)} are a promising logical control framework that guarantees the satisfaction of a given temporal safety specification when applied to any r…
Maximal Adaptation, Minimal Guidance: Permissive Reactive Robot Task Planning with Humans in the Loop
Oz Gitelson, Satya Prakash Nayak, Ritam Raha +1
We present a novel framework for human-robot \emph{logical} interaction that enables robots to reliably satisfy (infinite horizon) temporal logic tasks while effectively collaborat…
Follow the STARs: Dynamic -Regular Shielding of Learned Policies
Ashwani Anand, Satya Prakash Nayak, Ritam Raha +1
This paper presents a novel dynamic post-shielding framework that enforces the full class of -regular correctness properties over pre-computed probabilistic policies. This const…
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…
Synthesis of Universal Safety Controllers
Bernd Finkbeiner, Niklas Metzger, Satya Prakash Nayak +1
The goal of logical controller synthesis is to automatically compute a control strategy that regulates the discrete, event-driven behavior of a given plant s.t. a temporal logic sp…
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…
Localized Attractor Computations for Infinite-State Games (Full Version)
Anne-Kathrin Schmuck, Philippe Heim, Rayna Dimitrova +1
Infinite-state games are a commonly used model for the synthesis of reactive systems with unbounded data domains. Symbolic methods for solving such games need to be able to constru…
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…
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…
Context-triggered Abstraction-based Control Design
Satya Prakash Nayak, Lucas Neves Egidio, Matteo Della Rossa +2
We consider the problem of automatically synthesizing a hybrid controller for non-linear dynamical systems which ensures that the closed-loop fulfills an arbitrary \emph{Linear Tem…
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…
Robustness-by-Construction Synthesis: Adapting to the Environment at Runtime
Satya Prakash Nayak, Daniel Neider, Martin Zimmermann
While most of the current synthesis algorithms only focus on correctness-by-construction, ensuring robustness has remained a challenge. Hence, in this paper, we address the robust-…
Robust Computation Tree Logic
Satya Prakash Nayak, Daniel Neider, Rajarshi Roy +1
It is widely accepted that every system should be robust in that ``small'' violations of environment assumptions should lead to ``small'' violations of system guarantees, but it is…