Follow the STARs: Dynamic ω-Regular Shielding of Learned Policies A. Anand, S. P. Nayak, R. Raha, & A.-K. Schmuck. (2025). In preprint.
@unpublished{shield,
author = {Anand, Ashwani and Nayak, Satya Prakash and Raha, Ritam and Schmuck, Anne{-}Kathrin},
title = {Follow the STARs: Dynamic ω-Regular Shielding of Learned Policies},
booktitle = {preprint},
year = {2025},
file = {shield.pdf}
}
Conference proceedings
Quantitative Strategy Templates A. Anand, S. P. Nayak, I. Sağlam, R. Raha, & A.-K. Schmuck. (2025). To Appear in ATVA 2025, abs/2504.16528.
@inproceedings{qastel,
author = {Anand, Ashwani and Nayak, Satya Prakash and Sa{\u{g}}lam, Irmak and Raha, Ritam and Schmuck, Anne{-}Kathrin},
title = {Quantitative Strategy Templates},
booktitle = {To appear in ATVA 2025},
volume = {abs/2504.16528},
year = {2025},
file = {qastel.pdf}
}
Fair Quantitative Games A. Anand, S. P. Nayak, R. Raha, I. Saglam, & A.-K. Schmuck. (2025). FoSSaCS, 15691, 331–354.
@inproceedings{Anand2025,
author = {Anand, Ashwani and Nayak, Satya Prakash and Raha, Ritam and Saglam, Irmak and Schmuck, Anne{-}Kathrin},
title = {Fair Quantitative Games},
booktitle = {FoSSaCS},
series = {Lecture Notes in Computer Science},
volume = {15691},
pages = {331--354},
publisher = {Springer},
year = {2025},
file = {fossacs2025.pdf}
}
Synthesizing Efficiently Monitorable Formulas in Metric Temporal Logic R. Raha, R. Roy, N. Fijalkow, D. Neider, & G. A. Pérez. (2024). In R. Dimitrova, O. Lahav, & S. Wolff (Eds.), Verification, Model Checking, and Abstract Interpretation (pp. 264–288). Springer Nature Switzerland; .
@inproceedings{RahaMTL24,
author = {Raha, Ritam and Roy, Rajarshi and Fijalkow, Nathana{\"e}l and Neider, Daniel and P{\'e}rez, Guillermo A.},
editor = {Dimitrova, Rayna and Lahav, Ori and Wolff, Sebastian},
title = {Synthesizing Efficiently Monitorable Formulas in Metric Temporal Logic},
booktitle = {Verification, Model Checking, and Abstract Interpretation},
year = {2024},
publisher = {Springer Nature Switzerland},
address = {Cham},
pages = {264--288},
isbn = {978-3-031-50521-8},
file = {MTL.pdf}
}
Parikh One-Counter Automata M. Cadilhac, A. Ghosh, G. A. Pérez, & R. Raha. (2023). In J. Leroux, S. Lombardy, & D. Peleg (Eds.), 48th International Symposium on Mathematical Foundations of Computer
Science, MFCS 2023, August 28 to September 1, 2023, Bordeaux, France (Vol. 272, pp. 30:1–30:15). Schloss Dagstuhl - Leibniz-Zentrum für Informatik; . https://doi.org/10.4230/LIPIcs.MFCS.2023.30
@inproceedings{Cadilhac23,
author = {Cadilhac, Micha{\"{e}}l and Ghosh, Arka and P{\'{e}}rez, Guillermo A. and Raha, Ritam},
editor = {Leroux, J{\'{e}}r{\^{o}}me and Lombardy, Sylvain and Peleg, David},
title = {Parikh One-Counter Automata},
booktitle = {48th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2023, August 28 to September 1, 2023, Bordeaux, France},
series = {LIPIcs},
volume = {272},
pages = {30:1--30:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2023.30},
doi = {10.4230/LIPIcs.MFCS.2023.30},
file = {ParOCA.pdf}
}
A Framework for the Competitive Analysis of Model Predictive Controllers S. Bellis, J. Denil, R. Krishnamurthy, T. Leys, G. A. Pérez, & R. Raha. (2023). In O. Bournez, E. Formenti, & I. Potapov (Eds.), Reachability Problems - 17th International Conference, RP 2023,
Nice, France, October 11-13, 2023, Proceedings (Vol. 14235, pp. 141–154). Springer; . https://doi.org/10.1007/978-3-031-45286-4_11
@inproceedings{Bellis2023,
author = {Bellis, Stijn and Denil, Joachim and Krishnamurthy, Ramesh and Leys, Tim and P{\'{e}}rez, Guillermo A. and Raha, Ritam},
editor = {Bournez, Olivier and Formenti, Enrico and Potapov, Igor},
title = {A Framework for the Competitive Analysis of Model Predictive Controllers},
booktitle = {Reachability Problems - 17th International Conference, {RP} 2023,
Nice, France, October 11-13, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14235},
pages = {141--154},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-45286-4\_11},
doi = {10.1007/978-3-031-45286-4\_11},
file = {MPC.pdf}
}
Scalable Anytime Algorithms for Learning Fragments of Linear Temporal Logic R. Raha, R. Roy, N. Fijalkow, & D. Neider. (2022). In D. Fisman & G. Rosu (Eds.), Tools and Algorithms for the Construction and Analysis of Systems (pp. 263–280). Springer International Publishing; .
@inproceedings{RRFN2022,
author = {Raha, Ritam and Roy, Rajarshi and Fijalkow, Nathana{\"e}l and Neider, Daniel},
editor = {Fisman, Dana and Rosu, Grigore},
title = {Scalable Anytime Algorithms for Learning Fragments of Linear Temporal Logic},
booktitle = {Tools and Algorithms for the Construction and Analysis of Systems},
year = {2022},
publisher = {Springer International Publishing},
address = {Cham},
pages = {263--280},
file = {scarlet.pdf},
isbn = {978-3-030-99524-9},
doi = {https://doi.org/10.1007/978-3-030-99524-9_14}
}
Revisiting Parameter Synthesis for One-Counter Automata G. Perez, & R. Raha. (2022). In F. Manea & A. Simpson (Eds.), 30th EACSL Annual Conference on Computer Science Logic (CSL 2022) (Vol. 216, pp. 33:1–33:18). https://drops.dagstuhl.de/opus/volltexte/2022/15753
@inproceedings{perez2022,
author = {Perez, Guillermo and Raha, Ritam},
title = {{Revisiting Parameter Synthesis for One-Counter Automata}},
booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)},
pages = {33:1--33:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
isbn = {978-3-95977-218-1},
issn = {1868-8969},
year = {2022},
volume = {216},
editor = {Manea, Florin and Simpson, Alex},
address = {Dagstuhl, Germany},
url = {https://drops.dagstuhl.de/opus/volltexte/2022/15753},
urn = {urn:nbn:de:0030-drops-157534},
doi = {10.4230/LIPIcs.CSL.2022.33},
file = {poca.pdf}
}
Reachability Games with Relaxed Energy Constraints L. Hélouët, N. Markey, & R. Raha. (2019). In J. Leroux & J.-F. Raskin (Eds.), Proceedings Tenth International Symposium on Games, Automata, Logics,
and Formal Verification, GandALF 2019, Bordeaux, France, 2-3rd September
2019 (Vol. 305, pp. 17–33). https://doi.org/10.4204/EPTCS.305.2
@inproceedings{Helouet2019,
author = {Hélouët, Loïc and Markey, Nicolas and Raha, Ritam},
editor = {Leroux, J{\'{e}}r{\^{o}}me and Raskin, Jean{-}Fran{\c{c}}ois},
title = {Reachability Games with Relaxed Energy Constraints},
booktitle = {Proceedings Tenth International Symposium on Games, Automata, Logics,
and Formal Verification, GandALF 2019, Bordeaux, France, 2-3rd September
2019},
series = {{EPTCS}},
volume = {305},
pages = {17--33},
year = {2019},
url = {https://doi.org/10.4204/EPTCS.305.2},
doi = {10.4204/EPTCS.305.2},
timestamp = {Mon, 15 Jun 2020 16:54:37 +0200},
file = {relax_conf.pdf}
}
Journal articles
Parikh One-Counter Automata M. Cadilhac, A. Ghosh, G. A. Pérez, & R. Raha. (2025). Information and Computation, 105322. https://www.sciencedirect.com/science/article/pii/S0890540125000586
@article{CADILHAC2025105322,
title = {Parikh One-Counter Automata},
journal = {Information and Computation},
pages = {105322},
year = {2025},
issn = {0890-5401},
doi = {https://doi.org/10.1016/j.ic.2025.105322},
url = {https://www.sciencedirect.com/science/article/pii/S0890540125000586},
author = {Cadilhac, Micha\"el and Ghosh, Arka and P\'erez, Guillermo A. and Raha, Ritam}
}
Scarlet: Scalable Anytime Algorithms for Learning Fragments of Linear Temporal Logic R. Raha, R. Roy, N. Fijalkow, & D. Neider. (2024). Journal of Open Source Software, 9(93), 5052. https://doi.org/10.21105/joss.05052
@article{JOSS2024,
doi = {10.21105/joss.05052},
url = {https://doi.org/10.21105/joss.05052},
year = {2024},
publisher = {The Open Journal},
volume = {9},
number = {93},
pages = {5052},
author = {Raha, Ritam and Roy, Rajarshi and Fijalkow, Nathanaël and Neider, Daniel},
title = {Scarlet: Scalable Anytime Algorithms for Learning Fragments of Linear Temporal Logic},
journal = {Journal of Open Source Software}
}
Reachability games with relaxed energy constraints L. Hélouët, N. Markey, & R. Raha. (2022). Information and Computation. https://www.sciencedirect.com/science/article/pii/S089054012100122X
@article{HELOUET2022,
title = {Reachability games with relaxed energy constraints},
journal = {Information and Computation},
year = {2022},
issn = {0890-5401},
file = {relax_jour.pdf},
doi = {https://doi.org/10.1016/j.ic.2021.104806},
url = {https://www.sciencedirect.com/science/article/pii/S089054012100122X},
author = {Hélouët, Loïc and Markey, Nicolas and Raha, Ritam},
keywords = {Games, Energy}
}
Tools
SCARLET: Scalable Anytime Algorithm for Learning
LTL R. Raha, R. Roy, N. Fijalkow, & D. Neider. (2022). Zenodo; . https://doi.org/10.5281/zenodo.5890149
@software{SCARLET,
author = {Raha, Ritam and Roy, Rajarshi and Fijalkow, Nathanaël and Neider, Daniel},
title = {{SCARLET: Scalable Anytime Algorithm for Learning
LTL}},
month = jan,
year = {2022},
publisher = {Zenodo},
doi = {10.5281/zenodo.5890149},
url = {https://doi.org/10.5281/zenodo.5890149},
github = {https://github.com/rajarshi008/Scarlet},
website = {https://scarlet.labri.fr/},
package = {https://pypi.org/project/Scarlet-ltl/0.0.1/}
}
TEAL: Synthesizing Efficiently Monitorable MTL
R. Raha, R. Roy, N. Fijalkow, D. Neider, & G. Perez.
@software{TEAL,
author = {Raha, Ritam and Roy, Rajarshi and Fijalkow, Nathanaël and Neider, Daniel and Perez, Guillermo},
title = {{TEAL: Synthesizing Efficiently Monitorable MTL
}},
github = {https://github.com/ritamraha/Teal}
}
PhD Thesis
Learning and Verifying Temporal Specifications for Cyber-physical
Systems [PhD thesis, University of Antwerp, Belgium & University of Bordeuax, France] R. Raha. (2023). https://hdl.handle.net/10067/1986580151162165141
@phdthesis{Phd,
author = {Raha, Ritam},
title = {Learning and Verifying Temporal Specifications for Cyber-physical
Systems},
school = {University of Antwerp, Belgium & University of Bordeuax, France},
year = {2023},
url = {https://hdl.handle.net/10067/1986580151162165141},
file = {raha_phd_thesis.pdf},
defenceslides = {https://1drv.ms/p/s!Ak7rtTf4AMy06m7f0lN_2syIEc3B}
}
Masters Thesis
Reachability Games with Strong and Relaxed Energy Constrainsts [Master's thesis] R. Raha. (2019).
@mastersthesis{Masters,
title = {Reachability Games with Strong and Relaxed Energy Constrainsts},
year = {2019},
author = {Raha, Ritam},
file = {master_thesis.pdf},
slides = {../thesis/index.html}
}