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

Fuld beskrivelse

Bibliografiske detaljer
Main Authors:	Karimov, T, Lefaucheux, E, Ouaknine, J, Purser, D, Varonka, A, Whiteland, MA, Worrell, J
Format:	Conference item
Sprog:	English
Udgivet:	Association for Computing Machinery 2022

Lignende værker

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

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

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

Porous invariants for linear systems
af: Lefaucheux, E, et al.
Udgivet: (2024)

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

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

Porous invariants
af: Lefaucheux, E, et al.
Udgivet: (2021)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Decidability boundaries in linear dynamical systems
af: de Sousa Pinto, J
Udgivet: (2017)

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

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

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

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

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

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

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

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

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

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

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