activity
20202026
most citedReachability in Dynamical Systems with Rounding

1 citations · 3 across the 13 of their papers we have counts for

collaborators
Showing 2024Show all

6 papers · 1 filter

cs.LO2024

Verification of Linear Dynamical Systems via O-Minimality of the Real Numbers

Toghrul Karimov

A discrete-time linear dynamical system (LDS) is given by an update matrix , and has the trajectories for $s \in…

cs.LO2024

On the Decidability of Presburger Arithmetic Expanded with Powers

Toghrul Karimov, Florian Luca, Joris Nieuwveld +2

We prove that for any integers , the existential fragment of the first-order theory of the structure …

cs.LO2024

Model Checking Markov Chains as Distribution Transformers

Rajab Aghamov, Christel Baier, Toghrul Karimov +4

The conventional perspective on Markov chains considers decision problems concerning the probabilities of temporal properties being satisfied by traces of visited states. However,…

cs.LO2024★ 1 cited

On the Decidability of Monadic Theories of Arithmetic Predicates

Valérie Berthé, Toghrul Karimov, Joris Nieuwveld +3

We investigate the decidability of the monadic second-order (MSO) theory of the structure , for various unary predicates $P_1,\ldots,P…

math.DS2024

Linear dynamical systems with continuous weight functions

Rajab Aghamov, Christel Baier, Toghrul Karimov +2

In discrete-time linear dynamical systems (LDSs), a linear map is repeatedly applied to an initial vector yielding a sequence of vectors called the orbit of the system. A weight fu…

cs.LO2024

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…