B. Srivathsan

According to our database, B. Srivathsan authored at least 27 papers between 2010 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Simulations for Event-Clock Automata.

S. Akshay, Paul Gastin, R. Govind, B. Srivathsan

Log. Methods Comput. Sci., 2024

Deterministic Suffix-reading Automata.

R. Keerthan, B. Srivathsan, R. Venkatesh, Sagar Verma

Proceedings of the Proceedings Fifteenth International Symposium on Games, 2024

A Myhill-Nerode Style Characterization for Timed Automata with Integer Resets.

Kyveli Doveri, Pierre Ganty, B. Srivathsan

Proceedings of the 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2024

MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm.

S. Akshay, Paul Gastin, R. Govind, B. Srivathsan

Proceedings of the 35th International Conference on Concurrency Theory, 2024

2023

A Local-Time Semantics for Negotiations.

Madhavan Mukund, Adwitee Roy, B. Srivathsan

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2023

A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation.

S. Akshay, Paul Gastin, R. Govind, Aniruddha R. Joshi, B. Srivathsan

Proceedings of the Computer Aided Verification - 35th International Conference, 2023

2022

Reachability in timed automata.

B. Srivathsan

ACM SIGLOG News, 2022

Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods.

R. Govind, Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz

Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

Zone-Based Verification of Timed Automata: Extrapolations, Simulations and What Next?

Patricia Bouyer, Paul Gastin, Frédéric Herbreteau, Ocan Sankur, B. Srivathsan

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2022

Checking Timed Büchi Automata Emptiness Using the Local-Time Semantics.

Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz

Proceedings of the 33rd International Conference on Concurrency Theory, 2022

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

Reachability for Updatable Timed Automata Made Faster and More Effective.

Paul Gastin, Sayan Mukherjee, B. Srivathsan

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

A Bridge between Polynomial Optimization and Games with Imperfect Recall.

Hugo Gimbert, Soumyajit Paul, B. Srivathsan

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2019

Revisiting Local Time Semantics for Networks of Timed Automata.

R. Govind, Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz

Proceedings of the 30th International Conference on Concurrency Theory, 2019

Fast Algorithms for Handling Diagonal Constraints in Timed Automata.

Paul Gastin, Sayan Mukherjee, B. Srivathsan

Proceedings of the Computer Aided Verification - 31st International Conference, 2019

2018

Reachability in Timed Automata with Diagonal Constraints.

Paul Gastin, Sayan Mukherjee, B. Srivathsan

Proceedings of the 29th International Conference on Concurrency Theory, 2018

2016

Better abstractions for timed automata.

Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz

Inf. Comput., 2016

Nesting Depth of Operators in Graph Database Queries: Expressiveness vs. Evaluation Complexity.

M. Praveen, B. Srivathsan

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

Defining Relations on Graphs: How Hard is it in the Presence of Node Partitions?

M. Praveen, B. Srivathsan

Proceedings of the 34th ACM Symposium on Principles of Database Systems, 2015

2014

Fast detection of cycles in timed automata.

Aakash Deshpande, Frédéric Herbreteau, B. Srivathsan, Thanh-Tung Tran, Igor Walukiewicz

CoRR, 2014

2013

Lazy Abstractions for Timed Automata.

Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz

Proceedings of the Computer Aided Verification - 25th International Conference, 2013

2012

An alternate proof of Statman's finite completeness theorem.

B. Srivathsan, Igor Walukiewicz

Inf. Process. Lett., 2012

Efficient emptiness check for timed Büchi automata.

Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz

Formal Methods Syst. Des., 2012

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 (Extended version)

Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz

CoRR, 2011

Using non-convex approximations for efficient analysis of timed automata.

Frédéric Herbreteau, Dileep Kini, B. Srivathsan, Igor Walukiewicz

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

2010

Efficient On-the-Fly Emptiness Check for Timed Büchi Automata.

Frédéric Herbreteau, B. Srivathsan

Proceedings of the Automated Technology for Verification and Analysis, 2010