What's decidable about linear loops?
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 equivale...
主要な著者: | Karimov, T, Lefaucheux, E, Ouaknine, J, Purser, D, Varonka, A, Whiteland, MA, Worrell, J |
---|---|
フォーマット: | Conference item |
言語: | English |
出版事項: |
Association for Computing Machinery
2022
|
類似資料
-
The 2-dimensional constraint loop problem is decidable
著者:: Guilmant, Q, 等
出版事項: (2024) -
The Orbit Problem for parametric linear dynamical systems
著者:: Baier, C, 等
出版事項: (2021) -
Deciding ω-regular properties on linear recurrence sequences
著者:: Almagor, S, 等
出版事項: (2021) -
Porous invariants for linear systems
著者:: Lefaucheux, E, 等
出版事項: (2024) -
Parameter synthesis for parametric probabilistic dynamical systems and prefix-independent specifications
著者:: Baier, C, 等
出版事項: (2022)