Bounding the Escape Time of a Linear Dynamical System over a Compact Semialgebraic Set - Archive ouverte HAL Access content directly
Conference Papers Year : 2022

Bounding the Escape Time of a Linear Dynamical System over a Compact Semialgebraic Set

Abstract

We study the Escape Problem for discrete-time linear dynamical systems over compact semialgebraic sets. We establish a uniform upper bound on the number of iterations it takes for every orbit of a rational matrix to escape a compact semialgebraic set defined over rational data. Our bound is doubly exponential in the ambient dimension, singly exponential in the degrees of the polynomials used to define the semialgebraic set, and singly exponential in the bitsize of the coefficients of these polynomials and the bitsize of the matrix entries. We show that our bound is tight by providing a matching lower bound.
Fichier principal
Vignette du fichier
main.pdf (652.41 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03712991 , version 1 (04-07-2022)

Identifiers

Cite

Julian d'Costa, Engel Lefaucheux, Eike Neumann, Joël Ouaknine, James Worrell. Bounding the Escape Time of a Linear Dynamical System over a Compact Semialgebraic Set. 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022), Aug 2022, Vienna, Austria. pp.14, ⟨10.4230/LIPIcs⟩. ⟨hal-03712991⟩
53 View
30 Download

Altmetric

Share

Gmail Facebook X LinkedIn More