2 citations · 2 across the 2 of their papers we have counts for
4 papers
Certifying Emptiness of Timed Büchi Automata
Simon Wimmer, Frédéric Herbreteau, Jaco van de Pol
Model checkers for timed automata are widely used to verify safety-critical, real-time systems. State-of-the-art tools achieve scalability by intricate abstractions. We aim at furt…
Revisiting local time semantics for networks of timed automata
R. Govind, Frédéric Herbreteau, B. Srivathsan +1
We investigate a zone based approach for the reachability problem in timed automata. The challenge is to alleviate the size explosion of the search space when considering networks…
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…
Lazy abstractions for timed automata
Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
We consider the reachability problem for timed automata. A standard solution to this problem involves computing a search tree whose nodes are abstractions of zones. For efficiency…