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

Bibliográfalaš dieđut
Váldodahkkit:	Karimov, T, Lefaucheux, E, Ouaknine, J, Purser, D, Varonka, A, Whiteland, MA, Worrell, J
Materiálatiipa:	Conference item
Giella:	English
Almmustuhtton:	Association for Computing Machinery 2022

Geahča maid

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

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

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

Porous invariants for linear systems
Dahkki: Lefaucheux, E, et al.
Almmustuhtton: (2024)

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

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

Porous invariants
Dahkki: Lefaucheux, E, et al.
Almmustuhtton: (2021)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Decidability boundaries in linear dynamical systems
Dahkki: de Sousa Pinto, J
Almmustuhtton: (2017)

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

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

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

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

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

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

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

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

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

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

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