activity
20112024
most citedValue Iteration for Simple Stochastic Games: Stopping Criterion and Learning Algorithm

28 citations · 43 across the 11 of their papers we have counts for

collaborators
Showing math.DSShow all

2 papers · 1 filter

math.DS2023

Reachability in Injective Piecewise Affine Maps

Faraz Ghahremani, Edon Kelmendi, Joël Ouaknine

One of the most basic, longstanding open problems in the theory of dynamical systems is whether reachability is decidable for one-dimensional piecewise affine maps with two interva…

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…