Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2410.13053 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917172557643776 |
|---|---|
| author | Karimov, Toghrul |
| author_facet | Karimov, Toghrul |
| contents | A discrete-time linear dynamical system (LDS) is given by an update matrix $M \in \mathbb{R}^{d\times d}$, and has the trajectories $\langle s, Ms, M^2s, \ldots \rangle$ for $s \in \mathbb{R}^d$. Reachability-type decision problems of linear dynamical systems, most notably the Skolem Problem, lie at the forefront of decidability: typically, sound and complete algorithms are known only in low dimensions, and these rely on sophisticated tools from number theory and Diophantine approximation. Recently, however, o-minimality has emerged as a counterpoint to these number-theoretic tools that allows us to decide certain modifications of the classical problems of LDS without any dimension restrictions. In this paper, we first introduce the Decomposition Method, a framework that captures all applications of o-minimality to decision problems of LDS that are currently known to us. We then use the Decomposition Method to show decidability of the Robust Safety Problem (restricted to bounded initial sets) in arbitrary dimension: given a matrix $M$, a bounded semialgebraic set $S$ of initial points, and a semialgebraic set $T$ of unsafe points, it is decidable whether there exists $\varepsilon > 0$ such that all orbits that begin in the $\varepsilon$-ball around $S$ avoid $T$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_13053 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Verification of Linear Dynamical Systems via O-Minimality of the Real Numbers Karimov, Toghrul Logic in Computer Science A discrete-time linear dynamical system (LDS) is given by an update matrix $M \in \mathbb{R}^{d\times d}$, and has the trajectories $\langle s, Ms, M^2s, \ldots \rangle$ for $s \in \mathbb{R}^d$. Reachability-type decision problems of linear dynamical systems, most notably the Skolem Problem, lie at the forefront of decidability: typically, sound and complete algorithms are known only in low dimensions, and these rely on sophisticated tools from number theory and Diophantine approximation. Recently, however, o-minimality has emerged as a counterpoint to these number-theoretic tools that allows us to decide certain modifications of the classical problems of LDS without any dimension restrictions. In this paper, we first introduce the Decomposition Method, a framework that captures all applications of o-minimality to decision problems of LDS that are currently known to us. We then use the Decomposition Method to show decidability of the Robust Safety Problem (restricted to bounded initial sets) in arbitrary dimension: given a matrix $M$, a bounded semialgebraic set $S$ of initial points, and a semialgebraic set $T$ of unsafe points, it is decidable whether there exists $\varepsilon > 0$ such that all orbits that begin in the $\varepsilon$-ball around $S$ avoid $T$. |
| title | Verification of Linear Dynamical Systems via O-Minimality of the Real Numbers |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2410.13053 |