3 citations · 5 across the 2 of their papers we have counts for
7 papers
Reachability for Updatable Timed Automata made faster and more effective
Paul Gastin, Sayan Mukherjee, B Srivathsan
Updatable timed automata (UTA) are extensions of classic timed automata that allow special updates to clock variables, like x:= x - 1, x := y + 2, etc., on transitions. Reachabilit…
A Bridge between Polynomial Optimization and Games with Imperfect Recall
Hugo Gimbert, Soumyajit Paul, B. Srivathsan
We provide several positive and negative complexity results for solving games with imperfect recall. Using a one-to-one correspondence between these games on one side and multivari…
Revisiting local time semantics for networks of timed automata
R. Govind, Frédéric Herbreteau, B. Srivathsan +1
We investigate a zone based approach for the reachability problem in timed automata. The challenge is to alleviate the size explosion of the search space when considering networks…
Fast algorithms for handling diagonal constraints in timed automata
Paul Gastin, Sayan Mukherjee, B Srivathsan
A popular method for solving reachability in timed automata proceeds by enumerating reachable sets of valuations represented as zones. A naïve enumeration of zones does not termina…
Reachability in timed automata with diagonal constraints
Paul Gastin, Sayan Mukherjee, B Srivathsan
We consider the reachability problem for timed automata having diagonal constraints (like x - y < 5) as guards in transitions. The best algorithms for timed automata proceed by enu…
Nesting Depth of Operators in Graph Database Queries: Expressiveness Vs. Evaluation Complexity
M. Praveen, B. Srivathsan
Designing query languages for graph structured data is an active field of research, where expressiveness and efficient algorithms for query evaluation are conflicting goals. To bet…