Related papers: Finite Bisimulations for Switched Linear Systems
This paper provides a first example of constructing Lyapunov functions in a class of piecewise linear systems with limit cycles. The method of construction helps analyze and control complex oscillating systems through novel geometric means.…
We present a procedure for reducing the number of continuous states of discrete-time linear switched systems, such that the reduced system has the same behavior as the original system for a subset of switching sequences. The proposed method…
This paper investigates the finite time stabilization problem for a class of nonlinear systems with unknown control directions and unstructured uncertainties. The unstructured uncertainties indicate that not only the parameters but also the…
There has been a great deal of recent interest in methods for performing lifted inference; however, most of this work assumes that the first-order model is given as input to the system. Here, we describe lifted inference algorithms that…
We present a new approach for constructing polytope Lyapunov functions for continuous-time linear switching systems (LSS). This allows us to decide the stability of LSS and to compute the Lyapunov exponent with a good precision in…
We present a new data-driven method to provide probabilistic stability guarantees for black-box switched linear systems. By sampling a finite number of observations of trajectories, we construct approximate Lyapunov functions and deduce the…
Deciding in an efficient way weak probabilistic bisimulation in the context of Probabilistic Automata is an open problem for about a decade. In this work we close this problem by proposing a procedure that checks in polynomial time the…
Motivated by the widespread use of temporal-difference (TD-) and Q-learning algorithms in reinforcement learning, this paper studies a class of biased stochastic approximation (SA) procedures under a mild "ergodic-like" assumption on the…
The design of provably correct controllers for continuous-state stochastic systems crucially depends on approximate finite-state abstractions and their accuracy quantification. For this quantification, one generally uses approximate…
Given a family of systems, identifying stabilizing switching signals in terms of infinite walks constructed by concatenating cycles on the underlying directed graph of a switched system that satisfy certain conditions, is a well-known…
Bisimulation is a concept that captures behavioural equivalence. It has been studied extensively on nonprobabilistic systems and on discrete-time Markov processes and on so-called continuous-time Markov chains. In the latter time is…
This paper deals with input/output-to-state stability (IOSS) of switched nonlinear systems in the discrete-time setting. We present an algorithm to construct periodic switching signals that obey pre-specified restrictions on admissible…
Finite time analysis of the continuous system is investigated through both stability and stabilization based on Sum of squares programming. A systematic approach is proposed to construct Lyapunov function and Control Lyapunov function for…
Controller synthesis techniques for continuous systems with respect to temporal logic specifications typically use a finite-state symbolic abstraction of the system. Constructing this abstraction for the entire system is computationally…
In this paper, we consider linear switched systems $\dot x(t)=A_{u(t)} x(t)$, $x\in\R^n$, $u\in U$, and the problem of asymptotic stability for arbitrary switching functions, uniform with respect to switching ({\bf UAS} for short). We first…
This article deals with stability of continuous-time switched linear systems under constrained switching. Given a family of linear systems, possibly containing unstable dynamics, we characterize a new class of switching signals under which…
While distributed systems with transfer of processes have become pervasive, methods for reasoning about their behaviour are underdeveloped. In this paper we propose a bisimulation technique for proving behavioural equivalence of such…
The topic of this manuscript is the stability analysis of continuous-time switched nonlinear systems with constraints on the admissible switching signals. Our particular focus lies in considering signals characterized by upper and lower…
The utilization of model checking has been suggested as a formal verification technique for analyzing critical systems. However, the primary challenge in applying to complex systems is state space explosion problem. To address this issue,…
We propose a way of reasoning about minimal and maximal values of the weights of transitions in a weighted transition system (WTS). This perspective induces a notion of bisimulation that is coarser than the classic bisimulation: it relates…