Sayan Mukherjee

contact sayan dot mukherjee at inria dot fr

Hi there!

I am a CNRS post-doctoral researcher with Thierry Jéron in the DEVINE group at IRISA/INRIA Rennes.

Before this, I was a post-doctoral fellow with Jean-François Raskin in the Formal Methods and Verification group at Université Libre de Bruxelles.

Even before this, I did my PhD in Computer Science from Chennai Mathematical Institute under the supervisions of Paul Gastin (LSV, ENS Paris-Saclay) and B Srivathsan (Chennai Mathematical Institute). During this time, I worked on verification of real-time systems that are modeled using Timed Automata.

Employment

present
  • Postdoctoral fellow
    Advisor: Prof. Thierry Jéron
    DEVINE, IRISA/INRIA Rennes
    • February, 2025

    December, 2024
  • Postdoctoral fellow
    Advisor: Prof. Jean-François Raskin
    Université Libre de Bruxelles
    • April, 2022

    Education

    2022
  • Ph.D. in Computer Science
    Advisors: Prof. Paul Gastin and Prof. B Srivathsan
    Chennai Mathematical Institute
    • 2016
  • M.Sc. in Applications of Mathematics
    Chennai Mathematical Institute
    • 2014
  • B.Sc. in Mathematics
    St. Xavier's College (Autonomous), Kolkata
    • 2011

    During May - July, 2015, I did a summer internship with Prof. Subhas Chandra Nandy, working on a problem in Computational geometry, at Indian Statistical Institute, Kolkata.

    Publications

    1. Greybox Learning of Languages Recognizable by Event-Recording Automata
      Anirban Majumdar, Sayan Mukherjee, Jean-François Raskin
      in proceedings of   ATVA 2024, LNCS 15054, 235 -- 256, Springer
      [ pre-print | conference version | doi: 10.1007/978-3-031-78709-6_12 | code ]
    2. Bi-Objective Lexicographic Optimization in Markov Decision Processes with Related Objectives
      Damien Busatto-Gaston, Debraj Chakraborty, Anirban Majumdar, Sayan Mukherjee, Guillermo A. Pérez, Jean-François Raskin
      in proceedings of   ATVA 2023, LNCS 14215, 203 -- 223, Springer
      [ pre-print | conference version | doi: 10.1007/978-3-031-45329-8_10 ]
    3. Reachability for Updatable Timed Automata Made Faster and More Effective
      Paul Gastin, Sayan Mukherjee, B Srivathsan
      in proceedings of   FSTTCS 2020, LIPIcs 182, 47:1 -- 47:17, Schloss Dagstuhl--Leibniz-Zentrum für Informatik
      [ pre-print | conference version | video | doi: 10.4230/LIPIcs.FSTTCS.2020.47 ]
    4. Fast Algorithms for Handling Diagonal Constraints in Timed Automata
      Paul Gastin, Sayan Mukherjee, B Srivathsan
      in proceedings of   CAV 2019, LNCS 11561, 41 -- 59, Springer
      [ pre-print | conference version | doi: 10.1007/978-3-030-25540-4_3 ]
    5. Reachability in Timed Automata with Diagonal Constraints
      Paul Gastin, Sayan Mukherjee, B Srivathsan
      in proceedings of   CONCUR 2018, LIPIcs 118, 28:1 -- 28:17, Schloss Dagstuhl--Leibniz-Zentrum für Informatik
      [ pre-print | conference version | doi: 10.4230/LIPIcs.CONCUR.2018.28 ]