35 citations · 83 across the 19 of their papers we have counts for
4 papers · 1 filter
Using non-convex approximations for efficient analysis of timed automata
Frédéric Herbreteau, Dileep Kini, B. Srivathsan +1
The reachability problem for timed automata asks if there exists a path from an initial state to a target state. The standard solution to this problem involves computing the zone g…
Better 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. These abstracti…
Coarse abstractions make Zeno behaviours difficult to detect
Frédéric Herbreteau, B Srivathsan
An infinite run of a timed automaton is Zeno if it spans only a finite amount of time. Such runs are considered unfeasible and hence it is important to detect them, or dually, find…
Efficient Emptiness Check for Timed Büchi Automata (Extended version)
Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
The Büchi non-emptiness problem for timed automata refers to deciding if a given automaton has an infinite non-Zeno run satisfying the Büchi accepting condition. The standard solut…