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...
| Hoofdauteurs: | , , , , , |
|---|---|
| Formaat: | Conference item |
| Taal: | English |
| Gepubliceerd in: |
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
2022
|