| Reachability in timed automata with diagonal constraints P Gastin, S Mukherjee, B Srivathsan arXiv preprint arXiv:1806.11007, 2018 | 20 | 2018 |
| Fast algorithms for handling diagonal constraints in timed automata P Gastin, S Mukherjee, B Srivathsan International Conference on Computer Aided Verification, 41-59, 2019 | 16 | 2019 |
| Reachability for updatable timed automata made faster and more effective P Gastin, S Mukherjee, B Srivathsan 40th IARCS Annual Conference on Foundations of Software Technology and …, 2020 | 6 | 2020 |
| Bi-objective lexicographic optimization in markov decision processes with related objectives D Busatto-Gaston, D Chakraborty, A Majumdar, S Mukherjee, GA Pérez, ... International Symposium on Automated Technology for Verification and …, 2023 | 4 | 2023 |
| Reachability in timed automata with diagonal constraints and updates S Mukherjee Ph. D. thesis, Chennai Mathematical Institute, India, 2022 | 1 | 2022 |
Paul GastinProfessor, LMF, ENS Paris-SaclayVerified email at lmf.cnrs.fr
