Reachability analysis of linear systems

Abstract

In this paper, we propose a decision procedure of reachability for a linear system \(\xi '=A\xi +u\), where the matrix \(A's\) eigenvalues can be arbitrary algebraic number and the input u is a vector of trigonometric-exponential polynomials. If the initial set contains only one point, the reachability problem under consideration is reduced to the decidability of the sign of trigonometric-exponential polynomial and then achieved by being reduced to verification of a series of univariate polynomial inequalities through Taylor expansions of the related exponential functions and trigonometric functions. If the initial set is open semi-algebraic, we will propose a decision procedure based on OpenCAD and an algorithm of real root isolation derived from the sign-deciding procedure for the trigonometric-exponential polynomials. The experimental results indicate the efficiency of our approach. Under the assumption of Schanuel’s Conjecture, the above procedures are complete for bounded time except for several cases.