Fast detection of cycles in timed automata

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…