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…