1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.LO2015
Improving search order for reachability testing in timed automata
Frédéric Herbreteau, Thanh-Tung Tran
Standard algorithms for reachability analysis of timed automata are sensitive to the order in which the transitions of the automata are taken. To tackle this problem, we propose a…
cs.LO2014★ 1 cited
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…