Conference proceedings

  1. 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.
  2. 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
  3. 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
  4. 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.
  5. 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
  6. 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

Journal articles

  1. 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
  2. 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

Tools

  1. SCARLET: Scalable Anytime Algorithm for Learning LTL
    R. Raha, R. Roy, N. Fijalkow, & D. Neider. (2022). Zenodo. https://doi.org/10.5281/zenodo.5890149
  2. TEAL: Synthesizing Efficiently Monitorable MTL
    R. Raha, R. Roy, N. Fijalkow, D. Neider, & G. Perez.

PhD Thesis

  1. 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

Masters Thesis

  1. Reachability Games with Strong and Relaxed Energy Constrainsts
    [Master's thesis] R. Raha. (2019).