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)