Reachability in Linear Dynamical Systems

DOI10.1007/978-3-540-69407-6_28zbMath1142.93314OpenAlexW1575739325MaRDI QIDQ3507439

Emmanuel Hainry

Publication date: 19 June 2008

Published in: Logic and Theory of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69407-6_28

zbMATH Keywords

ReachabilitySkolem-Pisot problemDynamical SystemsGelfond-Schneider Theorem

Mathematics Subject Classification ID

Controllability (93B05) Linear systems in control theory (93C05) Undecidability and degrees of sets of sentences (03D35)

Related Items (6)

Synthesis of hybrid automata with affine dynamics from time-series data ⋮ On the decidability of reachability in continuous time linear time-invariant systems ⋮ Continuous-time orbit problems are decidable in polynomial-time ⋮ Unnamed Item ⋮ The continuous Skolem-Pisot problem ⋮ Computational bounds on polynomial differential equations

Cites Work

• Reachability analysis of dynamical systems having piecewise-constant derivatives
• The presence of a zero in an integer linear recurrent sequence is NP-hard to decide
• Irreducibles and the composed product for polynomials over a finite field
• Polynomial-time algorithm for the orbit problem
• An Inequality About Factors of Polynomials
• Deux propriétés décidables des suites récurrentes linéaires
• Deterministic Nonperiodic Flow
• New Computational Paradigms
• A survey of computational complexity results in systems and control
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Reachability in Linear Dynamical Systems