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...
Hlavní autoři: | D'Costa, J, Lefaucheux, E, Neumann, E, Ouaknine, J, Worrell, J |
---|---|
Médium: | Conference item |
Jazyk: | English |
Vydáno: |
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
2022
|
Témata: |
Podobné jednotky
-
On the complexity of the Escape Problem for linear dynamical systems over compact semialgebraic sets
Autor: D'Costa, J, a další
Vydáno: (2021) -
Reachability and escape problems in linear dynamical systems
Autor: Dcosta, J
Vydáno: (2024) -
How fast can you escape a compact polytope?
Autor: D'Costa, J, a další
Vydáno: (2020) -
The Semialgebraic Orbit Problem
Autor: Almagor, S, a další
Vydáno: (2019) -
Parameter synthesis for parametric probabilistic dynamical systems and prefix-independent specifications
Autor: Baier, C, a další
Vydáno: (2022)