Stability Analysis of Switched Linear Systems Defined by Regular Languages

In this work, we study the stability of an autonomous discrete-time linear switched system whose switching sequences are generated by a Muller automaton. This system arises in various engineering problems such as distributed communication and automotive engine control. The asymptotic stability of this system, referred to as regular asymptotic stability (RAS), generalizes two well-known definitions of stability of autonomous discrete-time linear switched systems, namely absolute asymptotic stability (AAS) and shuffle asymptotic stability (SAS). We also extend these stability definitions to robust versions. We show that absolute asymptotic stability, robust absolute asymptotic stability and robust shuffle asymptotic stability are equivalent to exponential stability. In addition, by using the Kronecker product, we prove that a robust regular asymptotic stability problem is equivalent to the conjunction of several robust absolute asymptotic stability problems.