On the decidability of reachability in linear time-invariant systems

@article{Fijalkow2019OnTD,
  title={On the decidability of reachability in linear time-invariant systems},
  author={Nathana{\"e}l Fijalkow and J. Ouaknine and A. Pouly and J. S. Pinto and J. Worrell},
  journal={Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control},
  year={2019}
}
  • Nathanaël Fijalkow, J. Ouaknine, +2 authors J. Worrell
  • Published 2019
  • Mathematics, Computer Science
  • Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control
  • We consider the decidability of state-to-state reachability in linear time-invariant control systems over discrete time. We analyse this problem with respect to the allowable control sets, which in general are assumed to be defined by boolean combinations of linear inequalities. Decidability of the version of the reachability problem in which control sets are affine subspaces of Rn is a fundamental result in control theory. Our first result is that reachability is undecidable if the set of… CONTINUE READING
    6 Citations
    A Necessary Condition on Chain Reachable Robustness of Dynamical Systems
    PIRK: Scalable Interval Reachability Analysis for High-Dimensional Nonlinear Systems
    Estimating Reachable Sets with Scenario Optimization
    • 5
    • PDF

    References

    Introduction to formal language theory
    • 1,183
    • Highly Influential