arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2204.12253cs.LO
收藏

可对角化线性动力系统的伪可达性问题

The Pseudo-Reachability Problem for Diagonalisable Linear Dynamical Systems

Julian D'Costa, Toghrul Karimov, Rupak Majumdar, Joël Ouaknine, Mahmoud Salamati, James Worrell

摘要:

本文研究线性动力系统伪轨道上的基本可达性问题。伪轨道可以被看作是一个有限精度的计算模型,而伪可达性可以被看作是经典可达性的一个鲁棒版本。利用基于$o$ -极小性的$\reals_{\exp}$,我们证明了可对角化线性动力系统的任意半代数目标的离散时间伪可达性问题的可判定性。我们还表明,我们的方法可以用来减少连续时间的伪可达性问题的(经典)时间有界的可达性问题,这是已知的条件判定。

英文摘要:

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 $\reals_{\exp}$ 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑