What's decidable about linear loops?

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...

Descripció completa

Dades bibliogràfiques
Autors principals:	Karimov, T, Lefaucheux, E, Ouaknine, J, Purser, D, Varonka, A, Whiteland, MA, Worrell, J
Format:	Conference item
Idioma:	English
Publicat:	Association for Computing Machinery 2022

Ítems similars

The 2-dimensional constraint loop problem is decidable
per: Guilmant, Q, et al.
Publicat: (2024)

The Orbit Problem for parametric linear dynamical systems
per: Baier, C, et al.
Publicat: (2021)

Deciding ω-regular properties on linear recurrence sequences
per: Almagor, S, et al.
Publicat: (2021)

Porous invariants for linear systems
per: Lefaucheux, E, et al.
Publicat: (2024)

Parameter synthesis for parametric probabilistic dynamical systems and prefix-independent specifications
per: Baier, C, et al.
Publicat: (2022)

On the decidability of Presburger arithmetic expanded with powers
per: Karimov, T, et al.
Publicat: (2025)

Porous invariants
per: Lefaucheux, E, et al.
Publicat: (2021)

On the decidability of reachability in linear time-invariant systems
per: Fijalkow, N, et al.
Publicat: (2019)

The pseudo-Skolem Problem is decidable
per: D'Costa, J, et al.
Publicat: (2021)

On the decidability of monadic second-order logic with arithmetic predicates
per: Berthé, V, et al.
Publicat: (2024)

Safety metric temporal logic is fully decidable
per: Ouaknine, J, et al.
Publicat: (2006)

On the decidability of Metric Temporal Logic
per: Ouaknine, J, et al.
Publicat: (2005)

O-minimal invariants for linear loops
per: Almagor, S, et al.
Publicat: (2018)

Termination of linear loops over the integers
per: Hosseini, M, et al.
Publicat: (2019)

ON THE DECIDABILITY AND COMPLEXITY OF METRIC TEMPORAL LOGIC OVER FINITE WORDS
per: Ouaknine, J, et al.
Publicat: (2007)

On the decidability of membership in matrix-exponential semigroups
per: Ouaknine, J, et al.
Publicat: (2019)

What is Decidable about Strings?
per: Ganesh, Vijay, et al.
Publicat: (2011)

On LTL model-checking for low-dimensional discrete linear dynamical systems
per: Karimov, T, et al.
Publicat: (2020)

On the decidability and complexity of Metric Temporal Logic over finite words
per: Joel Ouaknine, et al.
Publicat: (2007-02-01)

On the complexity of the Escape Problem for linear dynamical systems over compact semialgebraic sets
per: D'Costa, J, et al.
Publicat: (2021)

On positivity and minimality for second-order holonomic sequences
per: Kenison, G, et al.
Publicat: (2021)

Bounding the escape time of a linear dynamical system over a compact semialgebraic set
per: D'Costa, J, et al.
Publicat: (2022)

Decidability and complexity results for timed automata via channel machines
per: Abdulla, P, et al.
Publicat: (2005)

What can you Decide about Resetable Arrays?
per: Roscoe, A, et al.
Publicat: (2001)

How fast can you escape a compact polytope?
per: D'Costa, J, et al.
Publicat: (2020)

What is decidable about string constraints with ReplaceAll function
per: Chen, T, et al.
Publicat: (2017)

The pseudo-reachability problem for diagonalisable linear dynamical systems
per: D'Costa, J, et al.
Publicat: (2022)

Decision Problems for Linear Recurrence Sequences.
per: Ouaknine, J, et al.
Publicat: (2012)

Decidability boundaries in linear dynamical systems
per: de Sousa Pinto, J
Publicat: (2017)

Deciding Bit−Vector Arithmetic with Abstraction
per: Bryant, R, et al.
Publicat: (2007)

Invariants for continuous linear dynamical systems
per: Kelmendi, E, et al.
Publicat: (2020)

On the Monniaux Problem in abstract interpretation
per: Fijalkow, N, et al.
Publicat: (2019)

On recurrent reachability for continuous linear dynamical systems
per: Ouaknine, J, et al.
Publicat: (2016)

On the skolem problem for continuous linear dynamical systems
per: Chonev, V, et al.
Publicat: (2016)

On the Skolem Problem for continuous linear dynamical systems
per: Ouaknine, J, et al.
Publicat: (2016)

On recurrent reachability for continuous linear dynamical systems
per: Chonev, V, et al.
Publicat: (2016)

How to read a paper. Getting your bearings (deciding what the paper is about).
per: Greenhalgh, T
Publicat: (1997)

Algebraic model checking for discrete linear dynamical systems
per: Luca, F, et al.
Publicat: (2022)

Decidable Expansions of Labelled Linear Orderings
per: Alexis Bes, et al.
Publicat: (2011-05-01)

When is containment decidable for probabilistic automata?
per: Daviaud, L, et al.
Publicat: (2018)