Adwitee Roy (PhD Student, CMI)
Formal verification • Petri nets • Concurrency theory • Timed systems • Negotiations • Logic
Formal verification • Petri nets • Concurrency theory • Timed systems • Negotiations • Logic
I am a PhD candidate at Chennai Mathematical Institute (CMI) working in formal methods and theoretical computer science, advised by B Srivathsan. I was co-tutelled by Madhavan Mukund and Anca Muscholl earlier. I am expected to defend my thesis on January, 2027.
Before this, I did Masters in Computer Science from Chennai Mathematical Institute. My Master's thesis was supervised by Aiswarya Cyriac. During my Masters I did an internship with Laurent Doyen.
My research focuses on Theoretical Computer Science, specifically Concurrency Theory, Automata Theory, Logic and Verification.
My PhD work consists of models and algorithms for verifying concurrent systems, especially Negotiations (a Petri net like model) and their timed extensions, and their connections to automata-theoretic verification and counter-based systems.
During my Masters I worked on Graph Automata and Weighted Automata.
Currently, I am working on another model of timed concurrency and Constraint LTL.
Concurrency theory and formal verification
Petri nets, VASS, Counter systems
Quantitative systems: timed automata, weighted automata
A Local-Time Semantics for Negotiations. Madhavan Mukund, Adwitee Roy, B. Srivathsan; FORMATS 2023. [DOI][ArXiv]
Defines a local-time semantics for negotiations that preserves concurrency, and identifies decidable subclasses for reachability analysis in local-timed negotiations.
Using Communication to Bound Clock Drift in Local-Timed Negotiations. Abhinav Garg, Madhavan Mukund, Adwitee Roy, B. Srivathsan, Gautham Vishwanath; QEST+FORMATS 2025. [DOI]
Identifies communication-bounded fragments of local-timed negotiations in which clock drift is effectively controlled, yielding decidability and complexity bounds for reachability analysis.
Accelerated Reachability Checking for Deterministically Communicating Networks of Timed Automata. with Sayan Mukherjee, Govind R and B Srivathsan
Teaching assistant - Theory of Computation 2016, 2017, 2018, Weighted Automata 2017
One of the coordinator of Automates.
Volunteer - CAALM 2019, FSTTCS 2024
Outside research, I like nature, art and crafts, and reading. I used to take care of many street inhabiting pawed friends in Chennai.
My PhD timeline includes an approved period away from research and a parental leave. I’m happy to provide further details if useful.