The complexity of Markov decision processes
Mathematics of Operations Research
Mathematical control theory: deterministic systems
Mathematical control theory: deterministic systems
Reachability analysis of dynamical systems having piecewise-constant derivatives
Theoretical Computer Science - Special issue on hybrid systems
Universal computation and other capabilities of hybrid and continuous dynamical systems
Theoretical Computer Science - Special issue on hybrid systems
On the computational power of neural nets
Journal of Computer and System Sciences
What's decidable about hybrid automata?
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Interconnected automata and linear systems: a theoretical framework in discrete-time
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
On the computational power of dynamical systems and hybrid systems
Theoretical Computer Science - Special issue on universal machines and computations
When is a pair of matrices mortal?
Information Processing Letters
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Decision Problems for Semi-Thue Systems with a Few Rules
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Formal languages and their relation to automata
Formal languages and their relation to automata
Survey A survey of computational complexity results in systems and control
Automatica (Journal of IFAC)
The Stability of Saturated Linear Dynamical Systems Is Undecidable
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Widening the Boundary between Decidable and Undecidable Hybrid Systems
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
Automatica (Journal of IFAC)
Automatica (Journal of IFAC)
Brief paper: On partitioned controllability of switched linear systems
Automatica (Journal of IFAC)
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Switched systems reduction framework based on convex combination of generalized gramians
Journal of Control Science and Engineering
Automatica (Journal of IFAC)
The discrete time behavior of lazy linear hybrid automata
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Lyapunov exponents of second order linear systems
CIMMACS'11/ISP'11 Proceedings of the 10th WSEAS international conference on Computational Intelligence, Man-Machine Systems and Cybernetics, and proceedings of the 10th WSEAS international conference on Information Security and Privacy
Controllability and reachability criteria for switched linear systems
Automatica (Journal of IFAC)
Brief Analysis of discrete-time piecewise affine and hybrid systems
Automatica (Journal of IFAC)
Survey A survey of computational complexity results in systems and control
Automatica (Journal of IFAC)
Automatica (Journal of IFAC)
Soft variable-structure controls: a survey
Automatica (Journal of IFAC)
Stabilization and optimization of switched linear systems
Automatica (Journal of IFAC)
On the decidability of stability of hybrid systems
Proceedings of the 16th international conference on Hybrid systems: computation and control
Robust optimization for hybrid MDPs with state-dependent noise
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 22.16 |
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.