B. Srivathsan

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 29

Top Topics

Reachability Analysis

Top Venues

Publications

S. Akshay, Paul Gastin, R. Govind, B. Srivathsan
MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm. CoRR (2024)
S. Akshay, Paul Gastin, R. Govind, B. Srivathsan
Simulations for Event-Clock Automata. Log. Methods Comput. Sci. 20 (3) (2024)
S. Akshay, Paul Gastin, R. Govind, B. Srivathsan
MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm. CONCUR (2024)
Madhavan Mukund, Adwitee Roy, B. Srivathsan
A Local-Time Semantics for Negotiations. CoRR (2023)
S. Akshay, Paul Gastin, R. Govind, Aniruddha R. Joshi, B. Srivathsan
A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation. CAV (1) (2023)
Madhavan Mukund, Adwitee Roy, B. Srivathsan
A Local-Time Semantics for Negotiations. FORMATS (2023)
S. Akshay, Paul Gastin, R. Govind, Aniruddha R. Joshi, B. Srivathsan
A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation. CoRR (2023)
Patricia Bouyer, Paul Gastin, Frédéric Herbreteau, Ocan Sankur, B. Srivathsan
Zone-based verification of timed automata: extrapolations, simulations and what next? CoRR (2022)
S. Akshay, Paul Gastin, R. Govind, B. Srivathsan
Simulations for Event-Clock Automata. CoRR (2022)
Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
Checking Timed Büchi Automata Emptiness Using the Local-Time Semantics. CONCUR (2022)
Patricia Bouyer, Paul Gastin, Frédéric Herbreteau, Ocan Sankur, B. Srivathsan
Zone-Based Verification of Timed Automata: Extrapolations, Simulations and What Next? FORMATS (2022)
B. Srivathsan
Reachability in timed automata. ACM SIGLOG News 9 (3) (2022)
S. Akshay, Paul Gastin, R. Govind, B. Srivathsan
Simulations for Event-Clock Automata. CONCUR (2022)
R. Govind, Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods. LICS (2022)
Paul Gastin, Sayan Mukherjee, B. Srivathsan
Reachability for Updatable Timed Automata Made Faster and More Effective. FSTTCS (2020)
Hugo Gimbert, Soumyajit Paul, B. Srivathsan
A Bridge between Polynomial Optimization and Games with Imperfect Recall. CoRR (2020)
Hugo Gimbert, Soumyajit Paul, B. Srivathsan
A Bridge between Polynomial Optimization and Games with Imperfect Recall. AAMAS (2020)
Frédéric Herbreteau, B. Srivathsan, Thanh-Tung Tran, Igor Walukiewicz
Why Liveness for Timed Automata Is Hard, and What We Can Do About It. ACM Trans. Comput. Log. 21 (3) (2020)
Paul Gastin, Sayan Mukherjee, B. Srivathsan
Reachability for Updatable Timed Automata made faster and more effective. CoRR (2020)
Paul Gastin, Sayan Mukherjee, B. Srivathsan
Fast Algorithms for Handling Diagonal Constraints in Timed Automata. CAV (1) (2019)
Paul Gastin, Sayan Mukherjee, B. Srivathsan
Fast algorithms for handling diagonal constraints in timed automata. CoRR (2019)
R. Govind, Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
Revisiting Local Time Semantics for Networks of Timed Automata. CONCUR (2019)
R. Govind, Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
Revisiting local time semantics for networks of timed automata. CoRR (2019)
Paul Gastin, Sayan Mukherjee, B. Srivathsan
Reachability in timed automata with diagonal constraints. CoRR (2018)
Paul Gastin, Sayan Mukherjee, B. Srivathsan
Reachability in Timed Automata with Diagonal Constraints. CONCUR (2018)
M. Praveen, B. Srivathsan
Nesting Depth of Operators in Graph Database Queries: Expressiveness vs. Evaluation Complexity. ICALP (2016)
M. Praveen, B. Srivathsan
Nesting Depth of Operators in Graph Database Queries: Expressiveness Vs. Evaluation Complexity. CoRR (2016)
Frédéric Herbreteau, B. Srivathsan, Thanh-Tung Tran, Igor Walukiewicz
Why Liveness for Timed Automata Is Hard, and What We Can Do About It. FSTTCS (2016)
Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
Better abstractions for timed automata. Inf. Comput. 251 (2016)
M. Praveen, B. Srivathsan
Defining Relations on Graphs: How Hard is it in the Presence of Node Partitions? PODS (2015)
Aakash Deshpande, Frédéric Herbreteau, B. Srivathsan, Thanh-Tung Tran, Igor Walukiewicz
Fast detection of cycles in timed automata. CoRR (2014)
M. Praveen, B. Srivathsan
Defining relations on graphs: how hard is it in the presence of node partitions? CoRR (2014)
Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
Lazy abstractions for timed automata CoRR (2013)
Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
Lazy Abstractions for Timed Automata. CAV (2013)
B. Srivathsan, Igor Walukiewicz
An alternate proof of Statman's finite completeness theorem. Inf. Process. Lett. 112 (14-15) (2012)
Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
Efficient emptiness check for timed Büchi automata. Formal Methods Syst. Des. 40 (2) (2012)
Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
Better Abstractions for Timed Automata. LICS (2012)
Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
Efficient Emptiness Check for Timed Büchi Automata (Extended version) CoRR (2011)
Frédéric Herbreteau, Dileep Kini, B. Srivathsan, Igor Walukiewicz
Using non-convex approximations for efficient analysis of timed automata CoRR (2011)
Frédéric Herbreteau, Dileep Kini, B. Srivathsan, Igor Walukiewicz
Using non-convex approximations for efficient analysis of timed automata. FSTTCS (2011)
Frédéric Herbreteau, B. Srivathsan
Coarse abstractions make Zeno behaviours difficult to detect Log. Methods Comput. Sci. 9 (1) (2011)
Frédéric Herbreteau, B. Srivathsan
Coarse Abstractions Make Zeno Behaviours Difficult to Detect. CONCUR (2011)
Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
Better abstractions for timed automata CoRR (2011)
Frédéric Herbreteau, B. Srivathsan
Efficient On-the-Fly Emptiness Check for Timed Büchi Automata. ATVA (2010)
Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
Efficient Emptiness Check for Timed Büchi Automata. CAV (2010)