Bounding the escape time of a linear dynamical system over a compact semialgebraic set
We study the Escape Problem for discrete-time linear dynamical systems over compact semialgebraic sets. We establish a uniform upper bound on the number of iterations it takes for every orbit of a rational matrix to escape a compact semialgebraic set defined over rational data. Our bound is doubly e...
Autors principals: | D'Costa, J, Lefaucheux, E, Neumann, E, Ouaknine, J, Worrell, J |
---|---|
Format: | Conference item |
Idioma: | English |
Publicat: |
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
2022
|
Matèries: |
Ítems similars
-
On the complexity of the Escape Problem for linear dynamical systems over compact semialgebraic sets
per: D'Costa, J, et al.
Publicat: (2021) -
Reachability and escape problems in linear dynamical systems
per: Dcosta, J
Publicat: (2024) -
How fast can you escape a compact polytope?
per: D'Costa, J, et al.
Publicat: (2020) -
The Semialgebraic Orbit Problem
per: Almagor, S, et al.
Publicat: (2019) -
Parameter synthesis for parametric probabilistic dynamical systems and prefix-independent specifications
per: Baier, C, et al.
Publicat: (2022)