Abstract

In this paper, excitability properties of discrete-time positive switched systems are introduced and investigated. When moving from positive systems to positive switched systems, two possible extensions of excitability arise, leading to the concepts of strong and weak excitability. A family of algebraic characterizations for each property is first provided. Moreover, by exploiting their “structural nature”, strong and weak excitability are characterized in graph-theoretic terms. An algorithm is described, which allows to check whether the system is strongly excitable or not. Some examples illustrate the algorithm.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call