2 citations · 2 across the 3 of their papers we have counts for
5 papers · 1 filter
Multiple Reachability in Linear Dynamical Systems
Toghrul Karimov, Edon Kelmendi, Joël Ouaknine +1
We consider reachability decision problems for linear dynamical systems: Given a linear map on , together with source and target sets, determine whether there is a p…
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…
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…
MSO+nabla is undecidable
Mikołaj Bojańczyk, Edon Kelmendi, Michał Skrzypczak
This paper is about an extension of monadic second-order logic over the full binary tree, which has a quantifier saying ``almost surely a branch π \in {0, 1}^w satisfies a formula…
Value Iteration for Simple Stochastic Games: Stopping Criterion and Learning Algorithm
Edon Kelmendi, Julia Krämer, Jan Kretinsky +1
Simple stochastic games can be solved by value iteration (VI), which yields a sequence of under-approximations of the value of the game. This sequence is guaranteed to converge to…