Controllability and reachability criteria for discrete time positive systems
- 1 October 1996
- journal article
- Published by Taylor & Francis in International Journal of Control
- Vol. 65 (3) , 511-536
- https://doi.org/10.1080/00207179608921708
Abstract
Discrete time positive systems have been the object of widespread interest in the literature. In the last decade particular attention has been devoted to the analysis and characterization of the different notions of reachability and controllability which, in this context, make their appearance. In this paper, the properties of (ordinary and essential) controllability and reachability are analysed. Based on a graph-theoretic approach, we provide practical criteria to verify whether a given positive system (F, G) is endowed with these properties, together with canonical forms for describing reachable/controllable pairsKeywords
This publication has 11 references indexed in Scilit:
- Sign Controllability of a Nonnegative Matrix and a Positive VectorSIAM Journal on Matrix Analysis and Applications, 1993
- Combinatorial Matrix TheoryPublished by Cambridge University Press (CUP) ,1991
- Controllability of multi-input positive discrete-time systemsInternational Journal of Control, 1990
- Controllability of linear single-input positive discrete-time systemsInternational Journal of Control, 1989
- Controllability of positive linear discrete-time systemsInternational Journal of Control, 1989
- Positive input reachability and controllability of positive systemsLinear Algebra and its Applications, 1987
- Reachability, Observability, and Realizability of Continuous-Time Positive SystemsSIAM Journal on Control and Optimization, 1984
- Some Comments on Positive Orthant Controllability of Bilinear SystemsSIAM Journal on Control and Optimization, 1982
- About nonnegative realizationsSystems & Control Letters, 1982
- Positive realization of difference equationsIEEE Transactions on Circuits and Systems, 1981