Zobrazeno 1 - 10
of 34
pro vyhledávání: '"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 to be able to construct intricate arguments to establish the existence of winning strategie
Externí odkaz:
http://arxiv.org/abs/2405.09281
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 $\phi_i$. In this context, a secure equilibrium (SE) is a Nash equilibrium w.r.t. the lexicogr
Externí odkaz:
http://arxiv.org/abs/2401.09957
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 system (CPS) design. Formally, we consider a game graph G, a temporal s
Externí odkaz:
http://arxiv.org/abs/2310.12767
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 $ \omega $-regular winning condition. Given a game graph $G$ and two parity winning condit
Externí odkaz:
http://arxiv.org/abs/2307.06212
We present a novel method to compute \emph{permissive winning strategies} in two-player games over finite graphs with $ \omega $-regular winning conditions. Given a game graph $G$ and a parity winning condition $\Phi$, we compute a \emph{winning stra
Externí odkaz:
http://arxiv.org/abs/2305.14026
Autor:
Nayak, Satya Prakash, Egidio, Lucas Neves, Della Rossa, Matteo, Schmuck, Anne-Kathrin, Jungers, Raphaël
Publikováno v:
IEEE Open Journal of Control Systems 2023
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 Temporal Logic} specification. Moreover, the specification may take into
Externí odkaz:
http://arxiv.org/abs/2305.03399
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'' needed from the environment to allow the system player to win. Given an
Externí odkaz:
http://arxiv.org/abs/2301.07563
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-by-construction synthesis problem by considering the specifications to
Externí odkaz:
http://arxiv.org/abs/2204.10912
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 less clear how to make this intuition mathematically precise. While s
Externí odkaz:
http://arxiv.org/abs/2201.07116
Publikováno v:
Nayak, S P, Neider, D & Zimmermann, M 2022, Robustness-by-Construction Synthesis : Adapting to the Environment at Runtime . in T Margaria & B Steffen (eds), Leveraging Applications of Formal Methods, Verification and Validation. Verification Principles-11th International Symposium, ISoLA 2022, Proceedings . Springer, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 13701 LNCS, pp. 149-173, 11th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation, ISoLA 2022, Rhodes, Greece, 22/10/2022 . https://doi.org/10.1007/978-3-031-19849-6_10
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-by-construction synthesis problem by considering the specifications to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::b11b1ff1bdf5b7b1f4537cf3e3d6c3cf
https://vbn.aau.dk/da/publications/635f0d7a-2b44-4439-8822-79a5f9023081
https://vbn.aau.dk/da/publications/635f0d7a-2b44-4439-8822-79a5f9023081