Hybrid Automata; Reachability; Semi-Algebraic First-Order formulae

We consider the reachability problem on semi-algebraic hybrid automata. In particular, we deal with the effective cost that has to be afforded to solve reachability through first-order satisfiability. The analysis we perform with some existing tools …