Analyzing ultimate positivity for solvable systems

The positivity problem is a foundational decision problem. It asks whether a dynamical system would keep the observing expression (over its states) positive. It has a derivative-the ultimate positivity problem, which allows that the observing expression is non-positive within a bounded time interval. For the two problems, most existing results are established on discrete-time dynamical systems, specifically on linear recurrence sequences. In this paper, however, we study the ultimate positivity problem for a class of continuous-time dynamical systems, called solvable systems. They subsume linear systems. For the general solvable system, we present a sufficient condition for inferring ultimate positivity. The validity of the condition can be algorithmically checked. Once it is valid, we can further find the time threshold, after which the observing expression would be always positive. On the other hand, we show that the ultimate positivity problem is decidable for some special classes of solvable systems, such as linear systems of dimension up to five. We present sufficient conditions for the ultimate positivity of solvable systems.We algorithmically check the validity of those conditions.We decide the ultimate positivity of linear systems of dimension up to five.

[1]  Christel Baier,et al.  Model-Checking Algorithms for Continuous-Time Markov Chains , 2002, IEEE Trans. Software Eng..

[2]  A. Salomaa.  On exponential growth in Lindenmayer systems , 1973 .

[3]  Jean-Charles Delvenne,et al.  The continuous Skolem-Pisot problem , 2010, Theor. Comput. Sci..

[4]  Pascal Koiran,et al.  Quantum automata and algebraic groups , 2005, J. Symb. Comput..

[5]  Manuel Kauers,et al.  When can we detect that a P-finite sequence is positive? , 2010, ISSAC.

[6]  Zhenbing Zeng,et al.  Termination Analysis of Linear Loops , 2010, Int. J. Found. Comput. Sci..

[7]  Ming Xu,et al.  Some decidable results on reachability of solvable systems , 2013, Int. J. Gen. Syst..

[8]  George E. Collins,et al.  Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975, Automata Theory and Formal Languages.

[9]  JEREMY BOOHER,et al.  TRANSCENDENTAL NUMBERS , 2012 .

[10]  Georges Hansel.  A simple proof of the Skolem-Mahler-Lech Theorem , 1986 .

[11]  Georges Hansel,et al.  Une Démonstration Simple du Théorème de Skolem-Mahler-Lech , 1986, Theor. Comput. Sci..

[12]  Ming Xu,et al.  Symbolic termination analysis of solvable loops , 2013, J. Symb. Comput..

[13]  Ashish Tiwari,et al.  Termination of Linear Programs , 2004, CAV.

[14]  S. Prajna.  Barrier certificates for nonlinear model validation , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[15]  Vichian Laohakosol,et al.  Positivity of third order linear recurrence sequences , 2009, Discret. Appl. Math..

[16]  Joël Ouaknine,et al.  On the Positivity Problem for Simple Linear Recurrence Sequences, , 2013, ICALP.

[17]  V. Blondel,et al.  The presence of a zero in an integer linear recurrent sequence is NP-hard to decide , 2002 .

[18]  G. Hardy,et al.  An Introduction to the Theory of Numbers , 1938 .

[19]  Joël Ouaknine,et al.  Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences , 2013, ICALP.

[20]  Christer Lech,et al.  A note on recurring series , 1953 .

[21]  George E. Collins,et al.  Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .

[22]  George E. Collins,et al.  Cylindrical Algebraic Decomposition I: The Basic Algorithm , 1984, SIAM J. Comput..

[23]  T. Shorey,et al.  The distance between terms of an algebraic recurrence sequence. , 1984 .

[24]  Enric Rodríguez-Carbonell,et al.  Generating all polynomial invariants in simple loops , 2007, J. Symb. Comput..

[25]  G. Sacks.  A DECISION METHOD FOR ELEMENTARY ALGEBRA AND GEOMETRY , 2003 .

[26]  Marie-Françoise Roy,et al.  Real algebraic geometry , 1992 .

[27]  N. Vereshchagin.  Occurrence of zero in a linear recursive sequence , 1985 .

[28]  R. Loos.  Computing in Algebraic Extensions , 1983 .

[29]  Tero Harju,et al.  Positivity of second order linear recurrent sequences , 2006, Discret. Appl. Math..

[30]  Joël Ouaknine,et al.  Positivity Problems for Low-Order Linear Recurrence Sequences , 2013, SODA.