Abstract
This article compares the difficulties of deciding controllability and accessibility. These are standard properties of control systems, but complete algebraic characterizations of controllability have proved elusive. The article shows in particular that, for subsystems of bilinear systems, accessibility can be decided in polynomial time, but controllability is NP-hard.

This publication has 8 references indexed in Scilit: