About Me

Hello! Since September 2016, I’m a Doctoral candidate advised by Prof. Jan Křetínský in the Chair for Foundations of Software Reliability and Theoretical Computer Science at the Technical University of Munich. My current work revolves around formal methods and verification and lately, its interactions with machine learning. Read more about my research activities.

Past

Previously, I was a master’s student at Chennai Mathematical Institute, where I worked under Prof. B. Srivathsan on Probabilistic Timed Automata. Prior to this, I earned a bachelor’s degree in Computer Science and Engineering from National Institute of Technology, Calicut. After a brief stint as a developer at Commvault Systems, Hyderabad, I found my way back to academia. I am excited by algorithms and like building tools with strong theoretical frameworks. More on my academic and professional pursuits is detailed in my curriculum vitae.

Publications

  1. P Ashok, K Chatterjee, P Daca, J Křetínský, T Meggendorfer. Value Iteration for Long-run Average Reward in Markov Decision Processes. CAV 2017. (pre-print).

Talks

  1. Monte-Carlo Tree Search in Verification of Markov Decision Processes at LiVe 2018 @ ETAPS. April 2018. Slides.
  2. Value Iteration for Long-run Average Reward in Markov Decision Processes at AVM 2017. September 2017. Slides.
  3. Long-Run Average Reward in MDP at DEIS Retreat, Aalborg University. August 2017. Slides.
  4. Mean-payoff Objectives for Markov Decision Processes at QAPL 2017. April 2017. Slides.
  5. Mean-payoff Objectives for Markov Decision Processes at Masaryk University. April 2017.

Professional Activities