In this paper, we propose a decision procedure of reachability for a linear system ξ ′ = A ξ + 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. [ABSTRACT FROM AUTHOR]

Copyright of Acta Informatica is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)