CONTROLLABILITY AND REACHABILITY CRITERIA FOR DISCRETE-TIME POSITIVE SYSTEMS

Discrete time positive systems have been the object of widespread inte rest in the literature. In the last decade particular attention has be en devoted to the analysis and characterization of the different notio ns of reachability and controllability which, in this context, make th eir appearance. In this paper, the properties of (ordinary and essenti al) controllability and reachability are analysed. Based on a graph-th eoretic approach, we provide practical criteria to verify whether a gi ven positive system (F, G) is endowed with these properties, together with canonical forms for describing reachable/controllable pairs.