Conference item
The pseudo-reachability problem for diagonalisable linear dynamical systems
- Abstract:
- 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 o-minimality of Rexp we prove decidability of the discrete-time pseudo-reachability problem with arbitrary semialgebraic targets for diagonalisable linear dynamical systems. We also show that our method can be used to reduce the continuous-time pseudo-reachability problem to the (classical) time-bounded reachability problem, which is known to be conditionally decidable.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Version of record, pdf, 730.0KB, Terms of use)
-
- Publisher copy:
- 10.4230/LIPIcs.MFCS.2022.40
Authors
- Publisher:
- Schloss Dagstuhl – Leibniz-Zentrum für Informatik
- Host title:
- Leibniz International Proceedings in Informatics (LIPIcs)
- Volume:
- 241
- Pages:
- 40:1–40:13
- Article number:
- 40
- Publication date:
- 2022-08-22
- Event title:
- 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
- Event location:
- Vienna, Austria
- Event website:
- https://ac.tuwien.ac.at/mfcs2022/
- Event start date:
- 2022-08-22
- Event end date:
- 2022-08-26
- DOI:
- ISSN:
-
1868-8969
- ISBN:
- 9783959772563
- Language:
-
English
- Keywords:
- Pubs id:
-
1280036
- Local pid:
-
pubs:1280036
- Deposit date:
-
2023-07-18
Terms of use
- Copyright holder:
- D'Costa et al.
- Copyright date:
- 2022
- Rights statement:
- © Julian D’Costa, Toghrul Karimov, Rupak Majumdar, Joël Ouaknine, Mahmoud Salamati, and James Worrell; licensed under Creative Commons License CC-BY 4.0.
- Licence:
- CC Attribution (CC BY)
If you are the owner of this record, you can report an update to it here: Report update to this record