Publications

Journal Articles

[8] R. Keerthan, B. Srivathsan, R. Venkatesh, Sagar Verma. Deterministic Suffix-reading Automata.
Logical Methods in Computer Science 22(3), 2026

arXiv
[7] S. Akshay, Paul Gastin, R. Govind, B. Srivathsan. Simulations for Event-clock Automata.
Logical Methods in Computer Science 20(3), 2024

PDF arXiv
[6] B. Srivathsan. Reachability in Timed Automata. Invited survey.
ACM SIGLOG News 9(3): 6–28, 2022

PDF
[5] F. Herbreteau, T.T. Tran, B. Srivathsan, I. Walukiewicz. Why Liveness for Timed Automata is Hard, and What We Can Do About It?
ACM Transactions on Computational Logic 21(3), 17:1–17:18, 2020

PDF
[4] F. Herbreteau, B. Srivathsan, I. Walukiewicz. Better Abstractions for Timed Automata.
Information and Computation 251, 67–90, 2016

arXiv
[3] F. Herbreteau, B. Srivathsan. Coarse Abstractions Make Zeno Behaviors Difficult to Detect.
Logical Methods in Computer Science 9(1), 2013

arXiv
[2] F. Herbreteau, B. Srivathsan, I. Walukiewicz. Efficient Emptiness Check for Timed Büchi Automata.
Formal Methods in System Design 40(2), 122–146, Springer, 2012

arXiv
[1] B. Srivathsan, I. Walukiewicz. An Alternate Proof of Statman's Finite Completeness Theorem.
Information Processing Letters 112(14–15), 612–616, 2012

HAL

Refereed International Conferences

[32] R. Govind, S. Krishna, Sanchari Sil, B. Srivathsan. Verifying Sequential Consistency under Bounded Preemptions. Best Paper
NETYS 2026

arXiv
[31] R. Govind, S. Krishna, Sanchari Sil, B. Srivathsan. Complexity of Consistency Testing for the Release-Acquire Semantics.
FM 2026, Springer LNCS 16557, 234–251

arXiv
[30] Béatrice Bérard, Benjamin Monmege, B. Srivathsan, Arnab Sur. Synthesising Asynchronous Automata from Fair Specifications.
FoSSaCS 2026, Springer LNCS 16503, 133–152

arXiv
[29] Kyveli Doveri, Pierre Ganty, B. Srivathsan. A Myhill–Nerode Characterization and Active Learning for One-Clock Timed Automata.
TACAS 2026, Springer LNCS 16505, 419–437

arXiv
[28] S. Akshay, Prerak Contractor, Paul Gastin, R. Govind, B. Srivathsan. TEMPORA: Efficient Verification of Metric Temporal Properties with Past in the Pointwise Semantics. Distinguished Paper
TACAS 2026, Springer LNCS 16505, 640–659

arXiv
[27] R. Keerthan, B. Srivathsan, R. Venkatesh. An Automaton Model to Succinctly Represent Suffix-based Specifications of a Concurrent System. Best Paper
NETYS 2025, Springer LNCS 15736, 129–145

Publisher
[26] Abhinav Garg, Madhavan Mukund, Adwitee Roy, B. Srivathsan, Gautham Viswanathan. Using Communication to Bound Clock Drift in Local-Timed Negotiations.
QEST+FORMATS 2025, Springer LNCS 16143, 353–370

Publisher
[25] Patricia Bouyer, B. Srivathsan, Vaishnavi Vishwanath. Model-checking Real-Time Systems: Revisiting the Alternating Automaton Route. EATCS Best Theory Paper
FoSSaCS 2025, Springer LNCS 15691, 399–421

arXiv
[24] Hugo Gimbert, Soumyajit Paul, B. Srivathsan. Simplifying Imperfect Recall Games.
AAMAS 2025, 895–903

arXiv
[23] S. Akshay, P. Gastin, R. Govind, B. Srivathsan. MITL Model-checking via Generalized Timed Automata and a New Liveness Algorithm.
CONCUR 2024, LIPIcs 311, 5:1–5:19

LIPIcs arXiv
[22] Kyveli Doveri, Pierre Ganty, B. Srivathsan. A Myhill–Nerode Characterization for Timed Automata with Integer Resets.
FSTTCS 2024, LIPIcs 323, 21:1–21:18

LIPIcs arXiv
[21] R. Keerthan, B. Srivathsan, R. Venkatesh, S. Verma. Deterministic Suffix-reading Automata.
GandALF 2024, EPTCS 409, 70–87

PDF
[20] S. Akshay, P. Gastin, R. Govind, A. R. Joshi, B. Srivathsan. A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation.
CAV 2023, Springer LNCS 13964, 266–288

arXiv
[19] M. Mukund, A. Roy, B. Srivathsan. A Local-Time Semantics for Negotiations.
FORMATS 2023, Springer LNCS 14138, 105–121

arXiv
[18] F. Herbreteau, B. Srivathsan, I. Walukiewicz. Checking Timed Büchi Automata Emptiness Using the Local-Time Semantics.
CONCUR 2022, LIPIcs 243, 12:1–12:24

LIPIcs
[17] S. Akshay, P. Gastin, R. Govind, B. Srivathsan. Simulations for Event-Clock Automata.
CONCUR 2022, LIPIcs 243, 13:1–13:18

LIPIcs
[16] P. Bouyer, Paul Gastin, F. Herbreteau, O. Sankur, B. Srivathsan. Zone-based Verification of Timed Automata: Extrapolations, Simulations and What Next? Invited article.
FORMATS 2022, Springer LNCS 13465, 16–42

arXiv
[15] R. Govind, F. Herbreteau, B. Srivathsan, I. Walukiewicz. Abstractions for the Local-Time Semantics of Timed Automata: A Foundation for Partial-Order Methods.
LICS 2022, 24:1–24:14

HAL
[14] P. Gastin, S. Mukherjee, B. Srivathsan. Reachability in Updatable Timed Automata Made Faster and More Effective.
FSTTCS 2020, LIPIcs 182, 47:1–47:17

arXiv
[13] H. Gimbert, S. Paul, B. Srivathsan. A Bridge Between Polynomial Optimization and Games with Imperfect Recall.
AAMAS 2020, 456–464

arXiv
[12] R. Govind, F. Herbreteau, B. Srivathsan, I. Walukiewicz. Revisiting Local Time Semantics for Networks of Timed Automata.
CONCUR 2019, LIPIcs 140, 16:1–16:15

arXiv
[11] P. Gastin, S. Mukherjee, B. Srivathsan. Fast Algorithms for Handling Diagonal Constraints in Timed Automata.
CAV 2019, Springer LNCS 11561, 41–59

arXiv
[10] P. Gastin, S. Mukherjee, B. Srivathsan. Reachability in Timed Automata with Diagonal Constraints.
CONCUR 2018, LIPIcs 118, 28:1–28:17

arXiv
[9] F. Herbreteau, T.T. Tran, B. Srivathsan, I. Walukiewicz. Why Liveness for Timed Automata is Hard, and What We Can Do About It?
FSTTCS 2016, LIPIcs, 48:1–48:14
[8] M. Praveen, B. Srivathsan. Nesting Depth of Operators in Graph Database Queries — Expressiveness vs Evaluation Complexity.
ICALP 2016, LIPIcs, 117:1–117:14

arXiv
[7] M. Praveen, B. Srivathsan. Defining Relations on Graphs — How Hard Is It in the Presence of Node Partitions?
ACM PODS 2015, 159–172

arXiv
[6] F. Herbreteau, B. Srivathsan, I. Walukiewicz. Lazy Abstractions for Timed Automata.
CAV 2013, Springer LNCS 8044, 990–1005

arXiv
[5] F. Herbreteau, B. Srivathsan, I. Walukiewicz. Better Abstractions for Timed Automata.
IEEE LICS 2012, 375–384

arXiv
[4] F. Herbreteau, B. Srivathsan. Coarse Abstractions Make Zeno Behaviours Difficult to Detect.
CONCUR 2011, Springer LNCS 6901, 92–107

arXiv
[3] F. Herbreteau, B. Srivathsan, I. Walukiewicz. Using Non-convex Approximations for Efficient Analysis of Timed Automata.
FSTTCS 2011, LIPIcs, 78–89

HAL
[2] F. Herbreteau, B. Srivathsan. Efficient On-the-fly Emptiness Check for Timed Büchi Automata.
ATVA 2010, Springer LNCS 6252, 218–232

PDF
[1] F. Herbreteau, I. Walukiewicz. Efficient Emptiness Check for Timed Büchi Automata.
CAV 2010, Springer LNCS 6174, 148–161

HAL

Edited Volumes

Ph.D. Thesis

Journal Articles

Refereed International Conferences