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...
Glavni autori: | Karimov, T, Lefaucheux, E, Ouaknine, J, Purser, D, Varonka, A, Whiteland, MA, Worrell, J |
---|---|
Format: | Conference item |
Jezik: | English |
Izdano: |
Association for Computing Machinery
2022
|
Slični predmeti
-
The 2-dimensional constraint loop problem is decidable
od: Guilmant, Q, i dr.
Izdano: (2024) -
The Orbit Problem for parametric linear dynamical systems
od: Baier, C, i dr.
Izdano: (2021) -
Deciding ω-regular properties on linear recurrence sequences
od: Almagor, S, i dr.
Izdano: (2021) -
Porous invariants for linear systems
od: Lefaucheux, E, i dr.
Izdano: (2024) -
Parameter synthesis for parametric probabilistic dynamical systems and prefix-independent specifications
od: Baier, C, i dr.
Izdano: (2022)