Search Results - "Nayak, Satya Prakash"

Context-triggered Abstraction-based Control Design by Nayak, S.P., Egidio, L.N., Rossa, M. DELLA, Schmuck, A.-K., Jungers, R.M.

“…We consider the problem of automatically synthesizing a hybrid controller for non-linear dynamical systems which ensures that the closed-loop fulfills an…”
Get full text

Robust computation tree logic by Nayak, Satya Prakash, Neider, Daniel, Roy, Rajarshi, Zimmermann, Martin

“…It is widely accepted that every system should be robust in that “small” violations of environment assumptions should lead to “small” violations of system…”
Get full text

Most General Winning Secure Equilibria Synthesis in Graph Games by Nayak, Satya Prakash, Schmuck, Anne-Kathrin

“…This paper considers the problem of co-synthesis in $k$-player games over a finite graph where each player has an individual $\omega$-regular specification…”
Get full text

Localized Attractor Computations for Infinite-State Games (Full Version) by Schmuck, Anne-Kathrin, Heim, Philippe, Dimitrova, Rayna, Nayak, Satya Prakash

“…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…”
Get full text

Robustness-by-Construction Synthesis: Adapting to the Environment at Runtime by Nayak, Satya Prakash, Neider, Daniel, Zimmermann, Martin

“…While most of the current synthesis algorithms only focus on correctness-by-construction, ensuring robustness has remained a challenge. Hence, in this paper,…”
Get full text

Contract-Based Distributed Synthesis in Two-Objective Parity Games by Anand, Ashwani, Nayak, Satya Prakash, Schmuck, Anne-Kathrin

“…We present a novel method to compute $\textit{assume-guarantee contracts}$ in non-zerosum two-player games over finite graphs where each player has a different…”
Get full text

Robust Computation Tree Logic by Nayak, Satya Prakash, Neider, Daniel, Roy, Rajarshi, Zimmermann, Martin

“…It is widely accepted that every system should be robust in that ``small'' violations of environment assumptions should lead to ``small'' violations of system…”
Get full text

Synthesizing Permissive Winning Strategy Templates for Parity Games by Anand, Ashwani, Nayak, Satya Prakash, Schmuck, Anne-Kathrin

“…We present a novel method to compute \emph{permissive winning strategies} in two-player games over finite graphs with $ \omega $-regular winning conditions…”
Get full text

Computing Adequately Permissive Assumptions for Synthesis by Anand, Ashwani, Mallik, Kaushik, Nayak, Satya Prakash, Schmuck, Anne-Kathrin

“…We solve the problem of automatically computing a new class of environment assumptions in two-player turn-based finite graph games which characterize an…”
Get full text

Solving Two-Player Games under Progress Assumptions by Schmuck, Anne-Kathrin, Thejaswini, K. S, Sağlam, Irmak, Nayak, Satya Prakash

“…This paper considers the problem of solving infinite two-player games over finite graphs under various classes of progress assumptions motivated by…”
Get full text

Context-triggered Abstraction-based Control Design by Nayak, Satya Prakash, Egidio, Lucas Neves, Della Rossa, Matteo, Schmuck, Anne-Kathrin, Jungers, Raphaël

“…IEEE Open Journal of Control Systems 2023 We consider the problem of automatically synthesizing a hybrid controller for non-linear dynamical systems which…”
Get full text