B Srivathsan
B Srivathsan
Chennai Mathematical Institute, Assistant 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
432016
Lazy abstractions for timed automata
F Herbreteau, B Srivathsan, I Walukiewicz
International Conference on Computer Aided Verification, 990-1005, 2013
302013
Using non-convex approximations for efficient analysis of timed automata
F Herbreteau, D Kini, B Srivathsan, I Walukiewicz
arXiv preprint arXiv:1110.3704, 2011
252011
Efficient on-the-fly emptiness check for timed Büchi automata
F Herbreteau, B Srivathsan
International Symposium on Automated Technology for Verification and …, 2010
182010
Efficient emptiness check for timed büchi automata
F Herbreteau, B Srivathsan, I Walukiewicz
International Conference on Computer Aided Verification, 148-161, 2010
182010
Efficient emptiness check for timed Büchi automata
F Herbreteau, B Srivathsan, I Walukiewicz
Formal Methods in System Design 40 (2), 122-146, 2012
172012
Why liveness for timed automata is hard, and what we can do about it
F Herbreteau, B Srivathsan, TT Tran, I Walukiewicz
36th IARCS Annual Conference on Foundations of Software Technology and …, 2016
112016
Reachability in timed automata with diagonal constraints
P Gastin, S Mukherjee, B Srivathsan
arXiv preprint arXiv:1806.11007, 2018
102018
Fast algorithms for handling diagonal constraints in timed automata
P Gastin, S Mukherjee, B Srivathsan
International Conference on Computer Aided Verification, 41-59, 2019
82019
Coarse abstractions make Zeno behaviours difficult to detect
F Herbreteau, B Srivathsan
International Conference on Concurrency Theory, 92-107, 2011
82011
Revisiting local time semantics for networks of timed automata
R Govind, F Herbreteau, B Srivathsan, I Walukiewicz
arXiv preprint arXiv:1907.02296, 2019
42019
Fast detection of cycles in timed automata
A Deshpande, F Herbreteau, B Srivathsan, TT Tran, I Walukiewicz
arXiv preprint arXiv:1410.4509, 2014
32014
A bridge between polynomial optimization and games with imperfect recall
H Gimbert, S Paul, B Srivathsan
22020
Abstractions for timed automata
B Srivathsan
Theses, Université De Bordeaux, 2012
22012
Nesting Depth of Operators in Graph Database Queries: Expressiveness vs. Evaluation Complexity
M Praveen, B Srivathsan
arXiv preprint arXiv:1603.00658, 2016
12016
An alternate proof of Statmanʼs finite completeness theorem
B Srivathsan, I Walukiewicz
Information Processing Letters 112 (14-15), 612-616, 2012
12012
Reachability for updatable timed automata made faster and more effective
P Gastin, S Mukherjee, B Srivathsan
arXiv preprint arXiv:2009.13260, 2020
2020
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
2020
Defining relations on graphs: how hard is it in the presence of node partitions?
M Praveen, B Srivathsan
Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2015
2015
Coarse abstractions make Zeno behaviours difficult to detect
B Srivathsan, F Herbreteau
Logical Methods in Computer Science 9, 2013
2013
The system can't perform the operation now. Try again later.
Articles 1–20