2 papers
cs.CC2021
On the Complexity of the Escape Problem for Linear Dynamical Systems over Compact Semialgebraic Sets
Julian D'Costa, Engel Lefaucheux, Eike Neumann +2
We study the computational complexity of the Escape Problem for discrete-time linear dynamical systems over compact semialgebraic sets, or equivalently the Termination Problem for…
math.DS2020
How Fast Can You Escape a Compact Polytope?
Julian D'Costa, Engel Lefaucheux, Joël Ouaknine +1
The Continuous Polytope Escape Problem (CPEP) asks whether every trajectory of a linear differential equation initialised within a convex polytope eventually escapes the polytope.…