On robustness for the skolem and positivity problems
The Skolem problem is a long-standing open problem in linear dynamical systems: can a
linear recurrence sequence (LRS) ever reach 0 from a given initial configuration? Similarly …
linear recurrence sequence (LRS) ever reach 0 from a given initial configuration? Similarly …
On the complexity of robust eventual inequality testing for C-finite functions
E Neumann - International Conference on Reachability Problems, 2023 - Springer
We study the computational complexity of a robust version of the problem of testing two
univariate C-finite functions for eventual inequality at large times. Specifically, working in the …
univariate C-finite functions for eventual inequality at large times. Specifically, working in the …
The orbit problem for parametric linear dynamical systems
We study a parametric version of the Kannan-Lipton Orbit Problem for linear dynamical
systems. We show decidability in the case of one parameter and Skolem-hardness with two …
systems. We show decidability in the case of one parameter and Skolem-hardness with two …
Robust Positivity Problems for Linear Recurrence Sequences: The Frontiers of Decidability for Explicitly Given Neighbourhoods
M Vahanwala - 43rd IARCS Annual Conference on Foundations …, 2023 - drops.dagstuhl.de
Abstract Linear Recurrence Sequences (LRS) are a fundamental mathematical primitive for
a plethora of applications such as the verification of probabilistic systems, model checking …
a plethora of applications such as the verification of probabilistic systems, model checking …
Model Checking Linear Dynamical Systems under Floating-point Rounding
We consider linear dynamical systems under floating-point rounding. In these systems, a
matrix is repeatedly applied to a vector, but the numbers are rounded into floating-point …
matrix is repeatedly applied to a vector, but the numbers are rounded into floating-point …
Robust positivity problems for linear recurrence sequences
M Vahanwala - arXiv preprint arXiv:2305.04870, 2023 - arxiv.org
Linear Recurrence Sequences (LRS) are a fundamental mathematical primitive for a
plethora of applications such as the verification of probabilistic systems, model checking …
plethora of applications such as the verification of probabilistic systems, model checking …
On robustness for the skolem, positivity and ultimate positivity problems
The Skolem problem is a long-standing open problem in linear dynamical systems: can a
linear recurrence sequence (LRS) ever reach 0 from a given initial configuration? Similarly …
linear recurrence sequence (LRS) ever reach 0 from a given initial configuration? Similarly …