Efficient On-the-Fly Emptiness Check for Timed Büchi Automata. - Frédéric Herbreteau; B. Srivathsan (ATVA, 2010)

Using non-convex approximations for efficient analysis of timed automata. - Frédéric Herbreteau; Dileep Kini; B. Srivathsan; Igor Walukiewicz (FSTTCS, 2011)

Efficient Emptiness Check for Timed Büchi Automata (Extended version) - Frédéric Herbreteau; B. Srivathsan; Igor Walukiewicz (CoRR, 2011)

Coarse abstractions make Zeno behaviours difficult to detect - Frédéric Herbreteau; B. Srivathsan (Log. Methods Comput. Sci., 2011)

Efficient emptiness check for timed Büchi automata. - Frédéric Herbreteau; B. Srivathsan; Igor Walukiewicz (Formal Methods Syst. Des., 2012)

An alternate proof of Statman's finite completeness theorem. - B. Srivathsan; Igor Walukiewicz (Inf. Process. Lett., 2012)

Lazy Abstractions for Timed Automata. - Frédéric Herbreteau; B. Srivathsan; Igor Walukiewicz (CAV, 2013)

Fast detection of cycles in timed automata. - Aakash Deshpande; Frédéric Herbreteau; B. Srivathsan; Thanh-Tung Tran; Igor Walukiewicz (CoRR, 2014)

Defining Relations on Graphs: How Hard is it in the Presence of Node Partitions? - M. Praveen; B. Srivathsan (PODS, 2015)

Nesting Depth of Operators in Graph Database Queries: Expressiveness vs. Evaluation Complexity. - M. Praveen; B. Srivathsan (ICALP, 2016)

Better abstractions for timed automata. - Frédéric Herbreteau; B. Srivathsan; Igor Walukiewicz (Inf. Comput., 2016)

Reachability in Timed Automata with Diagonal Constraints. - Paul Gastin; Sayan Mukherjee 002; B. Srivathsan (CONCUR, 2018)

Fast Algorithms for Handling Diagonal Constraints in Timed Automata. - Paul Gastin; Sayan Mukherjee 002; B. Srivathsan (CAV (1), 2019)

Revisiting Local Time Semantics for Networks of Timed Automata. - R. Govind 001; Frédéric Herbreteau; B. Srivathsan; Igor Walukiewicz (CONCUR, 2019)

A Bridge between Polynomial Optimization and Games with Imperfect Recall. - Hugo Gimbert; Soumyajit Paul; B. Srivathsan (AAMAS, 2020)

Reachability for Updatable Timed Automata Made Faster and More Effective. - Paul Gastin; Sayan Mukherjee 002; B. Srivathsan (FSTTCS, 2020)

Why Liveness for Timed Automata Is Hard, and What We Can Do About It. - Frédéric Herbreteau; B. Srivathsan; Thanh-Tung Tran; Igor Walukiewicz (ACM Trans. Comput. Log., 2020)

Checking Timed Büchi Automata Emptiness Using the Local-Time Semantics. - Frédéric Herbreteau; B. Srivathsan; Igor Walukiewicz (CONCUR, 2022)

Zone-Based Verification of Timed Automata: Extrapolations, Simulations and What Next? - Patricia Bouyer; Paul Gastin; Frédéric Herbreteau; Ocan Sankur; B. Srivathsan (FORMATS, 2022)

Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods. - R. Govind 001; Frédéric Herbreteau; B. Srivathsan; Igor Walukiewicz (LICS, 2022)

Reachability in timed automata. - B. Srivathsan (ACM SIGLOG News, 2022)

A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation. - S. Akshay 001; Paul Gastin; R. Govind 001; Aniruddha R. Joshi; B. Srivathsan (CAV (1), 2023)

A Local-Time Semantics for Negotiations. - Madhavan Mukund; Adwitee Roy; B. Srivathsan (FORMATS, 2023)

MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm. - S. Akshay 001; Paul Gastin; R. Govind 001; B. Srivathsan (CONCUR, 2024)

A Myhill-Nerode Style Characterization for Timed Automata with Integer Resets. - Kyveli Doveri; Pierre Ganty; B. Srivathsan (FSTTCS, 2024)

Deterministic Suffix-reading Automata. - R. Keerthan; B. Srivathsan; R. Venkatesh 001; Sagar Verma (GandALF, 2024)

Simulations for Event-Clock Automata. - S. Akshay 001; Paul Gastin; R. Govind 001; B. Srivathsan (Log. Methods Comput. Sci., 2024)

Model-Checking Real-Time Systems: Revisiting the Alternating Automaton Route. - Patricia Bouyer; B. Srivathsan; Vaishnavi Vishwanath (FoSSaCS, 2025)

Simplifying Imperfect Recall Games. - Hugo Gimbert; Soumyajit Paul; B. Srivathsan (AAMAS, 2025)

Synthesising Asynchronous Automata from Fair Specifications. - Béatrice Bérard; Benjamin Monmege; B. Srivathsan; Arnab Sur (CoRR, 2025)