Reachability Games with Relaxed Energy Constraints. - Loïc Hélouët; Nicolas Markey; Ritam Raha (GandALF, 2019)

Revisiting Synthesis for One-Counter Automata. - Guillermo A. Pérez 001; Ritam Raha (CoRR, 2020)

Scalable Anytime Algorithms for Learning Formulas in Linear Temporal Logic. - Ritam Raha; Rajarshi Roy 002; Nathanaël Fijalkow; Daniel Neider (CoRR, 2021)

Revisiting Parameter Synthesis for One-Counter Automata. - Guillermo A. Pérez 001; Ritam Raha (CSL, 2022)

Scalable Anytime Algorithms for Learning Fragments of Linear Temporal Logic. - Ritam Raha; Rajarshi Roy 002; Nathanaël Fijalkow; Daniel Neider (TACAS (1), 2022)

A Framework for the Competitive Analysis of Model Predictive Controllers. - Stijn Bellis; Joachim Denil; Ramesh Krishnamurthy; Tim Leys; Guillermo A. Pérez 001; Ritam Raha (RP, 2023)

Learning and verifying temporal specifications for cyber-physical systems - Ritam Raha (2023)

Synthesizing Efficiently Monitorable Formulas in Metric Temporal Logic. - Ritam Raha; Rajarshi Roy 002; Nathanaël Fijalkow; Daniel Neider; Guillermo A. Pérez 001 (VMCAI (2), 2024)

Scarlet: Scalable Anytime Algorithms for Learning Fragments of Linear Temporal Logic. - Ritam Raha; Rajarshi Roy 002; Nathanaël Fijalkow; Daniel Neider (J. Open Source Softw., 2024)

Fair Quantitative Games. - Ashwani Anand; Satya Prakash Nayak; Ritam Raha; Irmak Saglam; Anne-Kathrin Schmuck (FoSSaCS, 2025)

Parikh one-counter automata. - Michaël Cadilhac; Arka Ghosh 002; Guillermo A. Pérez 001; Ritam Raha (Inf. Comput., 2025)

Quantitative Strategy Templates. - Ashwani Anand; Satya Prakash Nayak; Ritam Raha; Irmak Saglam; Anne-Kathrin Schmuck (CoRR, 2025)

Follow the STARs: Dynamic ω-Regular Shielding of Learned Policies. - Ashwani Anand; Satya Prakash Nayak; Ritam Raha; Anne-Kathrin Schmuck (CoRR, 2025)