On the Decidability of Reachability in Linear Time-Invariant Systems

02/19/2018
by   Nathanaël Fijalkow, et al.
0

We consider the decidability of state-to-state reachability in linear time-invariant control systems, with control sets defined by boolean combinations of linear inequalities. Decidability of the sub-problem in which control sets are linear subspaces is a fundamental result in control theory. We first show that reachability is undecidable if the set of controls is a finite union of affine subspaces. We then consider two simple subclasses of control sets---unions of two affine subspaces and bounded convex polytopes respectively---and show that in these two cases the reachability problem for LTI systems is as hard as certain longstanding open decision problems concerning linear recurrence sequences. Finally we present some spectral assumptions on the transition matrix of an LTI system under which reachability becomes decidable with bounded convex polytopes as control sets.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/16/2020

On the Decidability of Reachability in Continuous Time Linear Time-Invariant Systems

We consider the decidability of state-to-state reachability in linear ti...
research
09/26/2019

Affine Extensions of Integer Vector Addition Systems with States

We study the reachability problem for affine Z-VASS, which are integer v...
research
09/05/2019

The Complexity of Reachability in Affine Vector Addition Systems with States

We give a trichotomy on the complexity of integer reachability in vector...
research
01/23/2023

Reachability in Injective Piecewise Affine Maps

One of the most basic, longstanding open problems in the theory of dynam...
research
12/27/2021

Under-Approximate Reachability Analysis for a Class of Linear Uncertain Systems

Under-approximations of reachable sets and tubes have received recent re...
research
12/01/2017

Reachability Analysis of Large Linear Systems with Uncertain Inputs in the Krylov Subspace

One often wishes for the ability to formally analyze large-scale systems...
research
11/02/2021

Conservative Time Discretization: A Comparative Study

We present the first review of methods to overapproximate the set of rea...

Please sign up or login with your details

Forgot password? Click here to reset