35 citations · 83 across the 19 of their papers we have counts for
1 paper · 1 filter
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…