Affiliation:
1. MPI-SWS, Germany
2. University of Oxford, UK
Abstract
We consider the MSO model-checking problem for simple linear loops, or equivalently discrete-time linear dynamical systems, with semialgebraic predicates (i.e., Boolean combinations of polynomial inequalities on the variables). We place no restrictions on the number of program variables, or equivalently the ambient dimension. We establish decidability of the model-checking problem provided that each semialgebraic predicate
either
has intrinsic dimension at most 1,
or
is contained within some three-dimensional subspace. We also note that lifting either of these restrictions and retaining decidability would necessarily require major breakthroughs in number theory.
Funder
Deutsche Forschungsgemeinschaft
Publisher
Association for Computing Machinery (ACM)
Subject
Safety, Risk, Reliability and Quality,Software
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Strong Invariants Are Hard: On the Hardness of Strongest Polynomial Invariants for (Probabilistic) Programs;Proceedings of the ACM on Programming Languages;2024-01-05
2. The Power of Positivity;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
3. What Else is Undecidable About Loops?;Relational and Algebraic Methods in Computer Science;2023
4. Model Checking Linear Dynamical Systems under Floating-point Rounding;Tools and Algorithms for the Construction and Analysis of Systems;2023
5. On the Skolem Problem and the Skolem Conjecture;Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science;2022-08-02