Publications (7)
On Path-Complete Lyapunov Functions: Geometry and Comparison
Matthew Philippe, Nikolaos Athanasopoulos, David Angeli +1
We study optimization-based criteria for the stability of switching systems, known as Path-Complete Lyapunov Functions, and ask the question "can we decide algorithmically when a c…
Deciding the boundedness and dead-beat stability of constrained switching systems
Matthew Philippe, Gilles Millerioux, Raphaël M. Jungers
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 decid…
Extremal storage functions and minimal realizations of discrete-time linear switching systems
Matthew Philippe, Ray Essick, Geir Dullerud +1
We study the induced gain of discrete-time linear switching systems with graph-constrained switching sequences. We first prove that, for stable systems in a minimal…
Being correct is not enough: efficient verification using robust linear temporal logic
Tzanis Anevlavis, Matthew Philippe, Daniel Neider +1
While most approaches in formal methods address system correctness, ensuring robustness has remained a challenge. In this paper we present and study the logic rLTL which provides a…
Path-Complete Graphs and Common Lyapunov Functions
David Angeli, Matthew Philippe, Nikolaos Athanasopoulos +1
A Path-Complete Lyapunov Function is an algebraic criterion composed of a finite number of functions, called its pieces, and a directed, labeled graph defining Lyapunov inequalitie…
Stability of discrete-time switching systems with constrained switching sequences
Matthew Philippe, Ray Essick, Geir Dullerud +1
We introduce a novel framework for the stability analysis of discrete-time linear switching systems with switching sequences constrained by an automaton. The key element of the fra…