Complexity of stability and controllability of elementary hybrid systems

In this paper, we consider simple classes of nonlinear systems and prove that basic questions related to their stability and controllability are either undecidable or computationally intractable (NP-hard). As a special case, we consider a class of hybrid systems in which the state space is partitioned into two halfspaces, and the dynamics in each halfspace correspond to a different linear system. 1999 Elsevier Science Ltd. All rights reserved.

• Type: Journal
• Year: 1999
• Where: AUTOMATICA
• Authors: Vincent D. Blondel, John N. Tsitsiklis
• Keywords: AUTOMATICA 1999, Computationally Intractable, Elsevier Science Ltd, Simple Classes