| Computing adequately permissive assumptions for synthesis A Anand, K Mallik, SP Nayak, AK Schmuck International Conference on Tools and Algorithms for the Construction and …, 2023 | 16 | 2023 |
| Synthesizing permissive winning strategy templates for parity games A Anand, SP Nayak, AK Schmuck International Conference on Computer Aided Verification, 436-458, 2023 | 15 | 2023 |
| Priority downward closures A Anand, G Zetzsche arXiv preprint arXiv:2307.07460, 2023 | 3 | 2023 |
| Contract-based distributed logical controller synthesis A Anand, AK Schmuck, S Prakash Nayak Proceedings of the 27th ACM International Conference on Hybrid Systems …, 2024 | 2 | 2024 |
| Contract-based distributed synthesis in two-objective parity games A Anand, SP Nayak, AK Schmuck arXiv preprint arXiv:2307.06212, 2023 | 2 | 2023 |
| Verifying Unboundedness via Amalgamation A Anand, S Schmitz, L Schütze, G Zetzsche Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer …, 2024 | 1 | 2024 |
| Fair Quantitative Games A Anand, SP Nayak, R Raha, I Sağlam, AK Schmuck arXiv preprint arXiv:2501.17255, 2025 | | 2025 |
| Strategy Templates: –Robust Certified Interfaces for Interacting Systems A Anand, SP Nayak, AK Schmuck International Symposium on Automated Technology for Verification and …, 2024 | | 2024 |
| Permissiveness for Strategy Adaptation A Anand, SP Nayak, AK Schmuck Proceedings of the 26th ACM International Conference on Hybrid Systems …, 2023 | | 2023 |
| New Algorithms for Combinations of Objectives using Separating Automata A Anand, N Fijalkow, A Goubault-Larrecq, J Leroux, P Ohlmann arXiv preprint arXiv:2109.08322, 2021 | | 2021 |
| 3 Overview of Talks 3.1 To Assume, Or Not To Assume A Anand Automated Synthesis: Functional, Reactive and Beyond, 89, 0 | | |
