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