The Skolem Problem asks to determine whether a given integer linear
recu...
One of the most basic, longstanding open problems in the theory of dynam...
We consider linear dynamical systems under floating-point rounding. In t...
We study the Escape Problem for discrete-time linear dynamical systems o...
We survey the state of the art on the algorithmic analysis of discrete l...
The celebrated Skolem-Mahler-Lech Theorem states that the set of zeros o...
We study fundamental reachability problems on pseudo-orbits of linear
dy...
We study the computational complexity of the Escape Problem for discrete...
We introduce the notion of porous invariants for multipath (or
branching...
We study a parametric version of the Kannan-Lipton Orbit Problem for lin...
We consider the problem of deciding ω-regular properties on infinite
tra...
We consider reachability in dynamical systems with discrete linear updat...
An infinite sequence ⟨u_n⟩_n∈ℕ of real numbers
is holonomic (also known ...
Consider a discrete dynamical system given by a square matrix M ∈ℚ^d × d...
The Skolem Problem asks, given a linear recurrence sequence (u_n), wheth...
Continuous linear dynamical systems are used extensively in mathematics,...
The Monniaux Problem in abstract interpretation asks, roughly speaking,
...
The concept of decomposition in computer science and engineering is
cons...
We exhibit an algorithm to compute the strongest algebraic (or polynomia...
We consider the Membership and the Half-space Reachability Problems for
...
We consider the problem of deciding termination of single-path while loo...
We consider the problem of determining termination of single-path loops ...
We study the growth behaviour of rational linear recurrence sequences. W...
We explore language semantics for automata combining probabilistic and
n...
It is known that Metric Temporal Logic (MTL) is strictly less expressive...
The termination analysis of linear loops plays a key role in several are...
We consider the decidability of state-to-state reachability in linear
ti...
We exhibit an algorithm to compute the strongest polynomial (or algebrai...
The Orbit Problem consists of determining, given a linear
transformation...