Nayak, Satya Prakash
1931  Ergebnisse:
Personensuche X
?
1

Robust computation tree logic:

Nayak, Satya Prakash ; Neider, Daniel ; Roy, Rajarshi.
Innovations in Systems and Software Engineering.  , 2024
 
?
2

Poster Abstract: Towards Seamless Reactivity of Hybrid Cont..:

, In: Proceedings of the 26th ACM International Conference on Hybrid Systems: Computation and Control,
 
?
3

Context-Triggered Abstraction-Based Control Design:

Nayak, Satya Prakash ; Egidio, Lucas N. ; Della Rossa, Matteo..
IEEE Open Journal of Control Systems.  2 (2023)  - p. 277-296 , 2023
 
?
4

Poster Abstract: Permissiveness for Strategy Adaptation:

, In: Proceedings of the 26th ACM International Conference on Hybrid Systems: Computation and Control,
 
?
5

Solving Two-Player Games Under Progress Assumptions:

, In: Lecture Notes in Computer Science; Verification, Model Checking, and Abstract Interpretation,
 
?
6

Robust Computation Tree Logic:

, In: Lecture Notes in Computer Science; NASA Formal Methods,
 
?
7

Robustness-by-Construction Synthesis: Adapting to the Envir..:

, In: Lecture Notes in Computer Science; Leveraging Applications of Formal Methods, Verification and Validation. Verification Principles,
 
?
8

Adaptive strategies for rLTL games:

, In: Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control,
 
?
9

Context-triggered Games for Reactive Synthesis over Stochas..:

, In: Proceedings of the 27th ACM International Conference on Hybrid Systems: Computation and Control,
 
?
10

Contract-Based Distributed Logical Controller Synthesis:

, In: Proceedings of the 27th ACM International Conference on Hybrid Systems: Computation and Control,
 
?
11

Robust computation tree logic:

Nayak, Satya Prakash ; Neider, Daniel ; Roy, Rajarshi.
https://vbn.aau.dk/da/publications/8664c9db-1f01-40a0-a5a3-05b2f6a01e05.  , 2024
 
?
14

Computing adequately permissive assumptions for synthesis ;..:

Anand, Ashwani ; Mallik, Kaushik ; Nayak, Satya Prakash.
info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-031-30820-8_15.  , 2023
 
1-15