1 citations · 1 across the 1 of their papers we have counts for
1 paper
Aakash Deshpande, Frédéric Herbreteau, B. Srivathsan +2
We propose a new efficient algorithm for detecting if a cycle in a timed automaton can be iterated infinitely often. Existing methods for this problem have a complexity which is ex…