| 2026 | FM | Complexity of Consistency Testing for the Release-Acquire Semantics. | R. Govind, S. Krishna, Sanchari Sil, B. Srivathsan |
| 2026 | FOSSACS | Synthesising Asynchronous Automata from Fair Specifications. | Batrice Brard, Benjamin Monmege, B. Srivathsan, Arnab Sur |
| 2026 | TACAS | TEMPORA: Efficient Verification of Metric Temporal Properties with Past in Pointwise Semantics. | S. Akshay, Prerak Contractor, Paul Gastin, R. Govind, B. Srivathsan |
| 2026 | TACAS | A Myhill-Nerode Characterization and Active Learning for One-Clock Timed Automata. | Kyveli Doveri, Pierre Ganty, B. Srivathsan |
| 2025 | FOSSACS | Model-Checking Real-Time Systems: Revisiting the Alternating Automaton Route. | Patricia Bouyer, B. Srivathsan, Vaishnavi Vishwanath |
| 2024 | CONCUR | MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm. | S. Akshay, Paul Gastin, R. Govind, B. Srivathsan |
| 2023 | CAV | A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation. | S. Akshay, Paul Gastin, R. Govind, Aniruddha R. Joshi, B. Srivathsan |
| 2022 | CONCUR | Simulations for Event-Clock Automata. | S. Akshay, Paul Gastin, R. Govind, B. Srivathsan |
| 2022 | CONCUR | Checking Timed Bchi Automata Emptiness Using the Local-Time Semantics. | Frdric Herbreteau, B. Srivathsan, Igor Walukiewicz |
| 2022 | LICS | Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods. | R. Govind, Frdric Herbreteau, B. Srivathsan, Igor Walukiewicz |
| 2019 | CAV | Fast Algorithms for Handling Diagonal Constraints in Timed Automata. | Paul Gastin, Sayan Mukherjee, B. Srivathsan |
| 2019 | CONCUR | Revisiting Local Time Semantics for Networks of Timed Automata. | R. Govind, Frdric Herbreteau, B. Srivathsan, Igor Walukiewicz |
| 2018 | CONCUR | Reachability in Timed Automata with Diagonal Constraints. | Paul Gastin, Sayan Mukherjee, B. Srivathsan |
| 2016 | ICALP | Nesting Depth of Operators in Graph Database Queries: Expressiveness vs. Evaluation Complexity. | M. Praveen, B. Srivathsan |
| 2015 | PODS | Defining Relations on Graphs: How Hard is it in the Presence of Node Partitions? | M. Praveen, B. Srivathsan |
| 2013 | CAV | Lazy Abstractions for Timed Automata. | Frdric Herbreteau, B. Srivathsan, Igor Walukiewicz |
| 2012 | LICS | Better Abstractions for Timed Automata. | Frdric Herbreteau, B. Srivathsan, Igor Walukiewicz |
| 2011 | CONCUR | Coarse Abstractions Make Zeno Behaviours Difficult to Detect. | Frdric Herbreteau, B. Srivathsan |
| 2010 | ATVA | Efficient On-the-Fly Emptiness Check for Timed Bchi Automata. | Frdric Herbreteau, B. Srivathsan |
| 2010 | CAV | Efficient Emptiness Check for Timed Bchi Automata. | Frdric Herbreteau, B. Srivathsan, Igor Walukiewicz |