scientific article; zbMATH DE number 7559425

DOI10.4230/LIPIcs.MFCS.2020.54MaRDI QIDQ5089224

Toghrul Karimov, Joël Ouaknine, James Worrell

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/2007.02911

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

linear dynamical systemsorbit problemLTL model checking

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

What's decidable about discrete linear dynamical systems? ⋮ Algebraic model checking for discrete linear dynamical systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Occurrence of zero in a linear recursive sequence
• A brief account of runtime verification
• On the Complexity of the Orbit Problem
• Decidable Theories of the Ordering of Natural Numbers with Unary Predicates
• Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences
• The Polyhedron-Hitting Problem
• The orbit problem in higher dimensions
• Approximate Verification of the Symbolic Dynamics of Markov Chains

This page was built for publication: