This paper investigates, in the context of discrete-time switched systems, the problem of
comparison for path-complete stability certificates. We introduce and study abstract …

As part of the development of Lyapunov techniques for cyber-physical systems, we study
and compare graph-based stability certificates with respect to their conservatism. Previous …

In the context of discrete-time switched systems, we study the comparison of stability
certificates based on path-complete Lyapunov methods. A characterization of this general …

In the framework of discrete-time switching systems, we analyze and compare various
stability certificates relying on graph constructions. To this aim, we define several abstract …

The goal of this paper is to advertise the tight links between the theory of Discrete-Event
Systems and Path-Complete Lyapunov Functions. These are algebro-combinatorial stability …

In this paper, we address the safety verification problem of switched linear dynamical
systems under arbitrary switching via barrier functions. Our approach is based on a notion of …

We study the stability of switching dynamical systems with the following dynamics: x (t+ 1)=
fσ (t) x (t), where σ (t)∈{1,..., M}:=〈 M〉 is the mode of the system, with an integer M> 0. We …