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...
Egile Nagusiak: | D'Costa, J, Lefaucheux, E, Neumann, E, Ouaknine, J, Worrell, J |
---|---|
Formatua: | Conference item |
Hizkuntza: | English |
Argitaratua: |
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
2022
|
Gaiak: |
Antzeko izenburuak
-
On the complexity of the Escape Problem for linear dynamical systems over compact semialgebraic sets
nork: D'Costa, J, et al.
Argitaratua: (2021) -
Reachability and escape problems in linear dynamical systems
nork: Dcosta, J
Argitaratua: (2024) -
How fast can you escape a compact polytope?
nork: D'Costa, J, et al.
Argitaratua: (2020) -
The Semialgebraic Orbit Problem
nork: Almagor, S, et al.
Argitaratua: (2019) -
Parameter synthesis for parametric probabilistic dynamical systems and prefix-independent specifications
nork: Baier, C, et al.
Argitaratua: (2022)