Matthew Philippe

Learn More
We study computational questions related with the stability of discrete-time linear switching systems with switching sequences constrained by an automaton. We first present a decidable sufficient condition for their boundedness when the maximal exponential growth rate equals one. The condition generalizes the notion of the irreducibility of a matrix set,(More)
We study the boundedness of products of matrices associated with words in a regular language. This question naturally arises in the stability analysis of switching systems with constrained switching sequences. Our main contribution is a sufficient condition for the boundedness of all the possible products of matrices that may occur in a marginally unstable(More)
  • 1