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

113 citations · 317 across the 70 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…

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…

cs.CC2020

Cyclotomic Identity Testing and Applications

Nikhil Balaji, Sylvain Perifel, Mahsa Shirmohammadi +1

We consider the cyclotomic identity testing (CIT) problem: given a polynomial , decide whether is zero, where i…

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…