We propose a novel Lyapunov construction for continuous-time switched systems relying on
a graph theoretical Lyapunov construction. Starting with a finite family of continuously …

This paper presents novel stabilizability conditions for switched linear systems with arbitrary
and uncontrollable underlying switching signals. We distinguish and study two particular …

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 …

A novel Lyapunov methodology for the stability check of nonlinear discrete-time switching
systems, equipped with switches digraphs and nonuniform dwell-time ranges, is here …

We propose a novel framework for the Lyapunov analysis of a large class of hybrid systems,
inspired by the theory of symbolic dynamics and earlier results on the restricted class of …

Starting from a finite family of continuously differentiable positive definite functions, we study
conditions under which a function obtained by max–min combinations is a Lyapunov …

In this paper, we provide necessary and sufficient Lyapunov conditions for discrete-time
switching systems to be globally exponentially stable, when the switching signal obeys to a …

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 …

Modeling of many phenomena in nature escape the rather common frameworks of
continuous-time and discrete-time models. In fact, for many systems encountered in practice …

We study path-complete Lyapunov functions, which are stability criteria for switched
systems, described by a combinatorial component (namely, an automaton), and a functional …