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.
Author supplied keywords
Cite
CITATION STYLE
APA
Karimov, T., Kelmendi, E., Ouaknine, J., & Worrell, J. (2022). What’s Decidable About Discrete Linear Dynamical Systems? In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 13660 LNCS, pp. 21–38). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-22337-2_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free