The Pseudo-Reachability Problem for Diagonalisable Linear Dynamical Systems

arxiv(2022)

引用 3|浏览13
暂无评分
摘要
We show that the discrete-time pseudo-reachability problem is decidable for diagonalisable linear dynamical systems. To do this we develop a new approach based on $o$-minimality of real numbers augmented with real exponentiation.
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要