On the decidability of reachability in continuous time linear time-invariant systems
DOI10.1145/3447928.3456705arXiv2006.09132MaRDI QIDQ6201599
Publication date: 21 February 2024
Published in: Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.09132
reachabilitydecidabilitycontrol theorylinear differential equationexponentialLTI systemstheory of the reals
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the decidability and complexity of problems for restricted hierarchical hybrid systems
- Low dimensional hybrid systems -- decidable, undecidable, don't know
- Continuous-time orbit problems are decidable in polynomial-time
- The continuous Skolem-Pisot problem
- Control theory in the plane.
- Controllable regions of linear systems with bounded inputs
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
- A controllability minimum principle
- Complexity of stability and controllability of elementary hybrid systems
- State estimation of linear dynamical systems under bounded control
- Computability with low-dimensional dynamical systems
- Reachability analysis of dynamical systems having piecewise-constant derivatives
- An explicit description of null controllable regions of linear systems with saturating actuators.
- Null controllable region of LTI discrete-time systems with input saturation
- On the computational power of neural nets
- Unbounded-Time Analysis of Guarded LTI Systems with Inputs by Abstract Acceleration
- Reachability Problems for One-Dimensional Piecewise Affine Maps
- An algebraic approach to bounded controllability of linear systems†
- Decidability of the Reachability for a Family of Linear Vector Fields
- Reachability in Linear Dynamical Systems
- Zonotope/Hyperplane Intersection for Hybrid Systems Reachability Analysis
- REACHABILITY PROBLEMS IN LOW-DIMENSIONAL ITERATIVE MAPS
- Computation in One-Dimensional Piecewise Maps
- Constrained controllability of discrete-time systems†
- On the behaviour of dynamical systems subject to bounded disturbances
- Null Controllability of Linear Systems with Constrained Controls
- Overview of complexity and decidability results for three classes of elementary nonlinear systems
- The removal of $\pi $ from some undecidable problems involving elementary functions
- Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs
- On the decidability of reachability in linear time-invariant systems
- A Modified Riccati Transformation for Decentralized Computation of the Viability Kernel Under LTI Dynamics
- Mathematical Description of Linear Dynamical Systems
- Some undecidable problems involving elementary functions of a real variable
- On Zonotopes
- Hybrid Systems: Computation and Control
- Algorithms in real algebraic geometry
- A survey of computational complexity results in systems and control
- Symbolic reachability computation for families of linear vector fields
This page was built for publication: On the decidability of reachability in continuous time linear time-invariant systems
