Related papers: Deterministic and probabilistic algorithms for sta…
The behavior of complex systems is determined not only by the topological organization of their interconnections but also by the dynamical processes taking place among their constituents. A faithful modeling of the dynamics is essential…
The paper is concerned with asymptotic stability properties of linear switched systems. Under the hypothesis that all the subsystems share a non strict quadratic Lyapunov function, we provide a large class of switching signals for which a…
We give fast, simple, and implementable catalytic logspace algorithms for two fundamental graph problems. First, a randomized catalytic algorithm for $s\to t$ connectivity running in $\widetilde{O}(nm)$ time, and a deterministic catalytic…
Self-stabilization is a versatile methodology in the design of fault-tolerant distributed algorithms for transient faults. A self-stabilizing system automatically recovers from any kind and any finite number of transient faults. This…
We consider the distributed weight balancing problem in networks of nodes that are interconnected via directed edges, each of which is able to admit a positive integer weight within a certain interval, captured by individual lower and upper…
We investigate the stabilizability of discrete-time linear switched systems, when the sole control action of the controller is the switching signal, and when the controller has access to the state of the system in real time. Despite their…
This report presents an algorithm to statically schedule live and strongly connected Marked Graphs (MG). The proposed algorithm computes the best execution where the execution rate is maximal and place sizes are minimal. The proposed…
We use symbolic dynamics to study discrete-time dynamical systems with multiple time delays. We exploit the concept of avoiding sets, which arise from specific non-generating partitions of the phase space and restrict the occurrence of…
We develop a learning algorithm for closed signal flow graphs - a graphical model of signal transducers. The algorithm relies on the correspondence between closed signal flow graphs and weighted finite automata on a singleton alphabet. We…
We propose an adaptive control strategy for the simultaneous estimation of topology and synchronization in complex dynamical networks with unknown, time-varying topology. Our approach transforms the problem of time-varying topology…
Early warning indicators often suffer from the shortness and coarse-graining of real-world time series. Furthermore, the typically strong and correlated noise contributions in real applications are severe drawbacks for statistical measures.…
This paper considers the stabilization of unknown switched linear systems using data. Instead of a full system model, we have access to a finite number of trajectories of each of the different modes prior to the online operation of the…
This paper explores the application of a new algebraic method of edge coloring, called complex coloring, to the scheduling problems of input queued switches. The proposed distributed parallel scheduling algorithm possesses two important…
Switched systems constitute an important modeling paradigm faithfully describing many engineering systems in which software interacts with the physical world. Despite considerable progress on stability and stabilization of switched systems,…
Many natural and man-made network systems need to maintain certain patterns, such as working at equilibria or limit cycles, to function properly. Thus, the ability to stabilize such patterns is crucial. Most of the existing studies on…
In $d$-Scattered Set we are given an (edge-weighted) graph and are asked to select at least $k$ vertices, so that the distance between any pair is at least $d$, thus generalizing Independent Set. We provide upper and lower bounds on the…
This paper deals with the design of scheduling logics for Networked Control Systems (NCSs) whose communication networks have limited capacity. We assume that only a subset of the plants can communicate with their controllers at any time…
A symbolic approach to decentralized set-valued state estimation and prediction for systems that admit a hybrid state machine representations is proposed. The decentralized computational scheme represents a conj unction of a finite number…
In this paper, we study the application of switched systems stability criteria to derive delay-dependent conditions for systems affected by both a constant and a time-varying delay. The main novelty of our approach lies on the use of…
This study in centered on models accounting for stochastic deformations of sample paths of random walks, embedded either in $\mathbb{Z}^2$ or in $\mathbb{Z}^3$. These models are immersed in multi-type particle systems with exclusion.…