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

Deskribapen osoa

Xehetasun bibliografikoak
Egile Nagusiak:	Karimov, T, Lefaucheux, E, Ouaknine, J, Purser, D, Varonka, A, Whiteland, MA, Worrell, J
Formatua:	Conference item
Hizkuntza:	English
Argitaratua:	Association for Computing Machinery 2022

Antzeko izenburuak

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

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

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

Porous invariants for linear systems
nork: Lefaucheux, E, et al.
Argitaratua: (2024)

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

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

Porous invariants
nork: Lefaucheux, E, et al.
Argitaratua: (2021)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Decidability boundaries in linear dynamical systems
nork: de Sousa Pinto, J
Argitaratua: (2017)

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

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

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

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

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

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

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

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

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

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

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