Revisiting the Complexity of Stability of Continuous and Hybrid Systems

Abstract : We develop a general framework for obtaining upper bounds on the practical computational complexity of stability problems, for a wide range of nonlinear continuous and hybrid systems. To do so, we describe stability properties of dynamical systems in first-order theories over the real numbers, and reduce stability problems to the d-decision problems of their descriptions. The framework allows us to give a precise characterization of the complexity of different notions of stability for nonlinear continuous and hybrid systems. We prove that bounded versions of the d-stability problems are generally decidable, and give upper bounds on their complexity. The unbounded versions are generally undecidable, for which we measure their degrees of unsolvability.

[1]  Akitoshi Kawamura.  Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete , 2009, Computational Complexity Conference.

[2]  Edmund M. Clarke,et al.  Delta-Decidability over the Reals , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[3]  Amir Ali Ahmadi.  Algebraic relaxations and hardness results in polynomial optimization and Lyapunov analysis , 2012, ArXiv.

[4]  Klaus Weihrauch,et al.  A Tutorial on Computable Analysis , 2008 .

[5]  John N. Tsitsiklis,et al.  Complexity of stability and controllability of elementary hybrid systems , 1999, Autom..

[6]  Klaus Weihrauch,et al.  Computable Analysis: An Introduction , 2014, Texts in Theoretical Computer Science. An EATCS Series.

[7]  Edmund M. Clarke,et al.  δ-Complete Decision Procedures for Satisfiability over the Reals , 2012, IJCAR.

[8]  Amir Ali Ahmadi,et al.  Complexity of ten decision problems in continuous time dynamical systems , 2012, 2013 American Control Conference.

[9]  Kristina Lerman,et al.  Analysis: An Introduction , 2013, Handbook of Human Computation.

[10]  Akitoshi Kawamura,et al.  Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.

[11]  John N. Tsitsiklis,et al.  A survey of computational complexity results in systems and control , 2000, Autom..

[12]  Mahesh Viswanathan,et al.  On the decidability of stability of hybrid systems , 2013, HSCC '13.

[13]  Amir Ali Ahmadi,et al.  Stability of Polynomial Differential Equations: Complexity and Converse Lyapunov Questions , 2013, ArXiv.

[14]  Ker-I Ko,et al.  Complexity Theory of Real Functions , 1991, Progress in Theoretical Computer Science.