Abstract—In this paper, reachability properties of discretetime positive switched systems are investigated. Sufficient conditions for positive reachability to hold, together with interesting examples, disproving some of the most natural conjectures, are provided. The concept of monomial reachability, which represents a necessary condition for reachability, is then explored, and a tight upper bound on the length of the shortest switching sequence which allows to reach a monomial vector is provided.
Reachability properties of discrete-time positive switched systems
SANTESSO, PAOLO;VALCHER, MARIA ELENA
2006
Abstract
Abstract—In this paper, reachability properties of discretetime positive switched systems are investigated. Sufficient conditions for positive reachability to hold, together with interesting examples, disproving some of the most natural conjectures, are provided. The concept of monomial reachability, which represents a necessary condition for reachability, is then explored, and a tight upper bound on the length of the shortest switching sequence which allows to reach a monomial vector is provided.File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
