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...
| Main Authors: | , , , , , , |
|---|---|
| Formato: | Conference item |
| Idioma: | English |
| Publicado em: |
Association for Computing Machinery
2022
|
Registos relacionados
The 2-dimensional constraint loop problem is decidable
Por: Guilmant, Q, et al.
Publicado em: (2024)
Por: Guilmant, Q, et al.
Publicado em: (2024)