The pseudo-reachability problem for diagonalisable linear dynamical systems
We study fundamental reachability problems on pseudo-orbits of linear dynamical systems. Pseudo-orbits can be viewed as a model of computation with limited precision and pseudo-reachability can be thought of as a robust version of classical reachability. Using an approach based on <i>o</i&g...
Główni autorzy: | D'Costa, J, Karimov, T, Majumdar, R, Ouaknine, J, Salamati, M, Worrell, J |
---|---|
Format: | Conference item |
Język: | English |
Wydane: |
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
2022
|
Podobne zapisy
-
The pseudo-Skolem Problem is decidable
od: D'Costa, J, i wsp.
Wydane: (2021) -
Reachability and escape problems in linear dynamical systems
od: Dcosta, J
Wydane: (2024) -
On recurrent reachability for continuous linear dynamical systems
od: Ouaknine, J, i wsp.
Wydane: (2016) -
On recurrent reachability for continuous linear dynamical systems
od: Chonev, V, i wsp.
Wydane: (2016) -
On the complexity of the Escape Problem for linear dynamical systems over compact semialgebraic sets
od: D'Costa, J, i wsp.
Wydane: (2021)