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. dblp, Google Scholar.
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.
P. Ashok, Y. Butkova, H. Hermanns, J. Křetínský. Continuous-Time Markov Decisions based on Partial Exploration. ATVA 2018. (pre-print).
P. Ashok, T. Brázdil, J. Křetínský, O. Slámečka. Monte Carlo Tree Search for Verifying Reachability in Markov Decision Processes. ISoLA 2018. (pre-print).
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).