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 2020Show all

7 papers · 1 filter

cs.LO2020

Deciding -Regular Properties on Linear Recurrence Sequences

Shaull Almagor, Toghrul Karimov, Edon Kelmendi +2

We consider the problem of deciding -regular properties on infinite traces produced by linear loops. Here we think of a given loop as producing a single infinite trace that enco…

cs.CC2020★ 1 cited

Reachability in Dynamical Systems with Rounding

Christel Baier, Florian Funke, Simon Jantsch +6

We consider reachability in dynamical systems with discrete linear updates, but with fixed digital precision, i.e., such that values of the system are rounded at each step. Given a…

math.NT2020

On Positivity and Minimality for Second-Order Holonomic Sequences

George Kenison, Oleksiy Klurman, Engel Lefaucheux +5

An infinite sequence of real numbers is holonomic (also known as P-recursive or P-finite) if it satisfies a linear recurrence relation with p…

cs.LO2020

On LTL Model Checking for Low-Dimensional Discrete Linear Dynamical Systems

Toghrul Karimov, Joël Ouaknine, James Worrell

Consider a discrete dynamical system given by a square matrix and a starting point . The orbit of such a system is the infinite…

math.NT2020★ 2 cited

On the Skolem Problem and Prime Powers

George Kenison, Richard Lipton, Joël Ouaknine +1

The Skolem Problem asks, given a linear recurrence sequence , whether there exists such that . In this paper we consider the following specialisation…

cs.LO2020

Invariants for Continuous Linear Dynamical Systems

Shaull Almagor, Edon Kelmendi, Joël Ouaknine +1

Continuous linear dynamical systems are used extensively in mathematics, computer science, physics, and engineering to model the evolution of a system over time. A central techniqu…

math.DS2020

How Fast Can You Escape a Compact Polytope?

Julian D'Costa, Engel Lefaucheux, Joël Ouaknine +1

The Continuous Polytope Escape Problem (CPEP) asks whether every trajectory of a linear differential equation initialised within a convex polytope eventually escapes the polytope.…