default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSatya Prakash Nayak
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c12]Anne-Kathrin Schmuck
, Philippe Heim, Rayna Dimitrova, Satya Prakash Nayak:
Localized Attractor Computations for Infinite-State Games. CAV (3) 2024: 135-158- [c11]Ashwani Anand, Anne-Kathrin Schmuck, Satya Prakash Nayak:
Contract-Based Distributed Logical Controller Synthesis. HSCC 2024: 11:1-11:11 - [c10]Ameneh Nejati, Satya Prakash Nayak, Anne-Kathrin Schmuck:
Context-triggered Games for Reactive Synthesis over Stochastic Systems via Control Barrier Certificates. HSCC 2024: 21:1-21:12 - [c9]Satya Prakash Nayak, Anne-Kathrin Schmuck:
Most General Winning Secure Equilibria Synthesis in Graph Games. TACAS (3) 2024: 173-193 - [c8]Anne-Kathrin Schmuck, K. S. Thejaswini, Irmak Saglam, Satya Prakash Nayak:
Solving Two-Player Games Under Progress Assumptions. VMCAI (1) 2024: 208-231 - [i9]Satya Prakash Nayak, Anne-Kathrin Schmuck:
Most General Winning Secure Equilibria Synthesis in Graph Games. CoRR abs/2401.09957 (2024) - [i8]Anne-Kathrin Schmuck, Philippe Heim, Rayna Dimitrova, Satya Prakash Nayak:
Localized Attractor Computations for Infinite-State Games (Full Version). CoRR abs/2405.09281 (2024) - 2023
- [c7]Ashwani Anand, Satya Prakash Nayak, Anne-Kathrin Schmuck:
Synthesizing Permissive Winning Strategy Templates for Parity Games. CAV (1) 2023: 436-458 - [c6]Lucas Neves Egidio, Satya Prakash Nayak, Matteo Della Rossa, Anne-Kathrin Schmuck, Raphaël M. Jungers:
Poster Abstract: Towards Seamless Reactivity of Hybrid Control. HSCC 2023: 27:1-27:2 - [c5]Ashwani Anand, Satya Prakash Nayak, Anne-Kathrin Schmuck:
Poster Abstract: Permissiveness for Strategy Adaptation. HSCC 2023: 29:1-29:2 - [c4]Ashwani Anand, Kaushik Mallik, Satya Prakash Nayak, Anne-Kathrin Schmuck:
Computing Adequately Permissive Assumptions for Synthesis. TACAS (2) 2023: 211-228 - [i7]Ashwani Anand, Kaushik Mallik, Satya Prakash Nayak, Anne-Kathrin Schmuck:
Computing Adequately Permissive Assumptions for Synthesis. CoRR abs/2301.07563 (2023) - [i6]Satya Prakash Nayak, Lucas Neves Egidio, Matteo Della Rossa, Anne-Kathrin Schmuck, Raphaël M. Jungers:
Context-triggered Abstraction-based Control Design. CoRR abs/2305.03399 (2023) - [i5]Ashwani Anand, Satya Prakash Nayak, Anne-Kathrin Schmuck:
Synthesizing Permissive Winning Strategy Templates for Parity Games. CoRR abs/2305.14026 (2023) - [i4]Ashwani Anand, Satya Prakash Nayak, Anne-Kathrin Schmuck:
Contract-Based Distributed Synthesis in Two-Objective Parity Games. CoRR abs/2307.06212 (2023) - [i3]Anne-Kathrin Schmuck, K. S. Thejaswini, Irmak Saglam, Satya Prakash Nayak:
Solving Two-Player Games under Progress Assumptions. CoRR abs/2310.12767 (2023) - 2022
- [c3]Satya Prakash Nayak, Daniel Neider, Martin Zimmermann:
Robustness-by-Construction Synthesis: Adapting to the Environment at Runtime. ISoLA (1) 2022: 149-173 - [c2]Satya Prakash Nayak, Daniel Neider, Rajarshi Roy, Martin Zimmermann:
Robust Computation Tree Logic. NFM 2022: 538-556 - [i2]Satya Prakash Nayak, Daniel Neider, Rajarshi Roy, Martin Zimmermann:
Robust Computation Tree Logic. CoRR abs/2201.07116 (2022) - [i1]Satya Prakash Nayak, Daniel Neider, Martin Zimmermann:
Robustness-by-Construction Synthesis: Adapting to the Environment at Runtime. CoRR abs/2204.10912 (2022) - 2021
- [c1]Satya Prakash Nayak, Daniel Neider, Martin Zimmermann:
Adaptive strategies for rLTL games. HSCC 2021: 32:1-32:2
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
