activity
20072026
most citedOn the decidability and complexity of Metric Temporal Logic over finite words

113 citations · 260 across the 57 of their papers we have counts for

collaborators
Showing 2022Show all

6 papers · 1 filter

cs.LO2022★ 1 cited

Model Checking Linear Dynamical Systems under Floating-point Rounding

Engel Lefaucheux, Joël Ouaknine, David Purser +1

We consider linear dynamical systems under floating-point rounding. In these systems, a matrix is repeatedly applied to a vector, but the numbers are rounded into floating-point re…

math.NT2022

On the -adic zeros of the Tribonacci sequence

Yuri Bilu, Florian Luca, Joris Nieuwveld +2

In this paper, we refute some conjectures of Marques and Lengyel concerning the -adic valuations of members of the Tribonacci sequence.

cs.CC2022

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

Julian D'Costa, Engel Lefaucheux, Eike Neumann +2

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…

math.DS2022★ 1 cited

What's Decidable about Discrete Linear Dynamical Systems?

Toghrul Karimov, Edon Kelmendi, Joël Ouaknine +1

We survey the state of the art on the algorithmic analysis of discrete linear dynamical systems, focussing in particular on reachability, model-checking, and invariant-generation q…

cs.LO2022

The Pseudo-Reachability Problem for Diagonalisable Linear Dynamical Systems

Julian D'Costa, Toghrul Karimov, Rupak Majumdar +3

We study fundamental reachability problems on pseudo-orbits of linear dynamical systems. Pseudo-orbits can be viewed as a model of computation with limited precision and pseudo-rea…

math.NT2022

On the transcendence of a series related to Sturmian words

Florian Luca, Joël Ouaknine, James Worrell

Let be an algebraic number with and a finite set of algebraic numbers. We study the transcendence of numbers of the form $\sum_{n=0}^\infty \frac{a_n}{b^n…