Zobrazeno 1 - 10
of 5 277
pro vyhledávání: '"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
Autor:
Pradhan, Satya Prakash, Yavari, Arash
In this paper, we formulate a continuum theory of solidification within the context of finite-strain coupled thermoelasticity. We aim to fill a gap in the existing literature, as the existing studies on solidification typically decouple the thermal p
Externí odkaz:
http://arxiv.org/abs/2404.13121
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
Autor:
Roy, Rajarshi, Bhattacharjee, Kaustav, Pati, Satya Prakash, Biswas, Korak, Chattopadhyay, Kalyan Kumar
The observation of room temperature ferromagnetism along with a low temperature paramagnetic counterpart in undoped Cu-Cu2O-rGO nanocomposite was demonstrated. A phenomenological approach was taken to explain the observations based on 3D Ising model
Externí odkaz:
http://arxiv.org/abs/2307.13331
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