Follow
B Srivathsan
B Srivathsan
Chennai Mathematical Institute, Associate Professor of Computer Science
Verified email at cmi.ac.in - Homepage
Title
Cited by
Cited by
Year
Better abstractions for timed automata
F Herbreteau, B Srivathsan, I Walukiewicz
Information and Computation 251, 67-90, 2016
632016
Lazy abstractions for timed automata
F Herbreteau, B Srivathsan, I Walukiewicz
Computer Aided Verification: 25th International Conference, CAV 2013, Saint …, 2013
462013
Using non-convex approximations for efficient analysis of timed automata
F Herbreteau, D Kini, B Srivathsan, I Walukiewicz
arXiv preprint arXiv:1110.3704, 2011
302011
Efficient emptiness check for timed Büchi automata
F Herbreteau, B Srivathsan, I Walukiewicz
Formal Methods in System Design 40, 122-146, 2012
202012
Efficient on-the-fly emptiness check for timed Büchi automata
F Herbreteau, B Srivathsan
International Symposium on Automated Technology for Verification and …, 2010
202010
Efficient emptiness check for timed büchi automata
F Herbreteau, B Srivathsan, I Walukiewicz
Computer Aided Verification: 22nd International Conference, CAV 2010 …, 2010
202010
Why liveness for timed automata is hard, and what we can do about it
F Herbreteau, B Srivathsan, TT Tran, I Walukiewicz
ACM Transactions on Computational Logic (TOCL) 21 (3), 1-28, 2020
192020
Reachability in timed automata with diagonal constraints
P Gastin, S Mukherjee, B Srivathsan
arXiv preprint arXiv:1806.11007, 2018
192018
Fast algorithms for handling diagonal constraints in timed automata
P Gastin, S Mukherjee, B Srivathsan
International Conference on Computer Aided Verification, 41-59, 2019
162019
Revisiting local time semantics for networks of timed automata
R Govind, F Herbreteau, B Srivathsan, I Walukiewicz
arXiv preprint arXiv:1907.02296, 2019
152019
Coarse abstractions make Zeno behaviours difficult to detect
F Herbreteau, B Srivathsan
Logical Methods in Computer Science 9, 2013
92013
Zone-based verification of timed automata: extrapolations, simulations and what next?
P Bouyer, P Gastin, F Herbreteau, O Sankur, B Srivathsan
International Conference on Formal Modeling and Analysis of Timed Systems, 16-42, 2022
72022
Reachability for updatable timed automata made faster and more effective
P Gastin, S Mukherjee, B Srivathsan
arXiv preprint arXiv:2009.13260, 2020
62020
Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods
R Govind, F Herbreteau, Srivathsan, I Walukiewicz
Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer …, 2022
52022
Simulations for event-clock automata
S Akshay, P Gastin, R Govind, B Srivathsan
arXiv preprint arXiv:2207.02633, 2022
52022
A bridge between polynomial optimization and games with imperfect recall
H Gimbert, S Paul, B Srivathsan
arXiv preprint arXiv:2002.09941, 2020
52020
Abstractions for timed automata
B Srivathsan
Theses, Université De Bordeaux, 2012
42012
Fast detection of cycles in timed automata
A Deshpande, F Herbreteau, B Srivathsan, TT Tran, I Walukiewicz
arXiv preprint arXiv:1410.4509, 2014
32014
Checking Timed Büchi Automata Emptiness Using the Local-Time Semantics
F Herbreteau, B Srivathsan, I Walukiewicz
33rd International Conference on Concurrency Theory (CONCUR 2022), 2022
22022
An alternate proof of Statmanʼs finite completeness theorem
B Srivathsan, I Walukiewicz
Information Processing Letters 112 (14-15), 612-616, 2012
22012
The system can't perform the operation now. Try again later.
Articles 1–20