35 citations · 83 across the 19 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.LO2020
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…
cs.GT2020
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…