What's Decidable about Discrete Linear Dynamical Systems?
Dynamical Systems
2022-09-21 v2 Logic in Computer Science
Abstract
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 questions, both unconditionally as well as relative to oracles for the Skolem Problem.
Cite
@article{arxiv.2206.11412,
title = {What's Decidable about Discrete Linear Dynamical Systems?},
author = {Toghrul Karimov and Edon Kelmendi and Joël Ouaknine and James Worrell},
journal= {arXiv preprint arXiv:2206.11412},
year = {2022}
}