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...
Prif Awduron: | Karimov, T, Lefaucheux, E, Ouaknine, J, Purser, D, Varonka, A, Whiteland, MA, Worrell, J |
---|---|
Fformat: | Conference item |
Iaith: | English |
Cyhoeddwyd: |
Association for Computing Machinery
2022
|
Eitemau Tebyg
-
The 2-dimensional constraint loop problem is decidable
gan: Guilmant, Q, et al.
Cyhoeddwyd: (2024) -
The Orbit Problem for parametric linear dynamical systems
gan: Baier, C, et al.
Cyhoeddwyd: (2021) -
Deciding ω-regular properties on linear recurrence sequences
gan: Almagor, S, et al.
Cyhoeddwyd: (2021) -
Porous invariants for linear systems
gan: Lefaucheux, E, et al.
Cyhoeddwyd: (2024) -
Parameter synthesis for parametric probabilistic dynamical systems and prefix-independent specifications
gan: Baier, C, et al.
Cyhoeddwyd: (2022)