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...
मुख्य लेखकों: | D'Costa, J, Karimov, T, Majumdar, R, Ouaknine, J, Salamati, M, Worrell, J |
---|---|
स्वरूप: | Conference item |
भाषा: | English |
प्रकाशित: |
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
2022
|
समान संसाधन
-
The pseudo-Skolem Problem is decidable
द्वारा: D'Costa, J, और अन्य
प्रकाशित: (2021) -
Reachability and escape problems in linear dynamical systems
द्वारा: Dcosta, J
प्रकाशित: (2024) -
On recurrent reachability for continuous linear dynamical systems
द्वारा: Ouaknine, J, और अन्य
प्रकाशित: (2016) -
On recurrent reachability for continuous linear dynamical systems
द्वारा: Chonev, V, और अन्य
प्रकाशित: (2016) -
On the complexity of the Escape Problem for linear dynamical systems over compact semialgebraic sets
द्वारा: D'Costa, J, और अन्य
प्रकाशित: (2021)