Related papers: Non-Blocking Robustness Analysis in Discrete Event…
Fault-tolerant distributed algorithms are central for building reliable spatially distributed systems. Unfortunately, the lack of a canonical precise framework for fault-tolerant algorithms is an obstacle for both verification and…
We present an algorithm for synthesising a controller (supervisor) for a discrete event system (DES) based on the property-directed reachability (PDR) model checking algorithm. The discrete event systems framework is useful in both…
We introduce techniques for exploring the functionality of a neural network and extracting simple, human-readable approximations to its performance. By performing gradient ascent on the input space of the network, we are able to produce…
The present paper considers the model-based and data-driven control of unknown linear time-invariant discrete-time systems under event-triggering and self-triggering transmission schemes. To this end, we begin by presenting a dynamic…
This work aims to improve generalization and interpretability of dynamical systems by recovering the underlying lower-dimensional latent states and their time evolutions. Previous work on disentangled representation learning within the…
We analyze a power distribution line with high penetration of distributed generation and strong variations of power consumption and generation levels. In the presence of uncertainty the statistical description of the system is required to…
Among notions of detectability for a discrete-event system (DES), strong detectability implies that after a finite number of observations to every output/label sequence generated by the DES, the current state can be uniquely determined.…
In this paper, we present the discrete-time unbiased extremum seeking (ES) algorithm for n-dimensional (nD) static quadratic maps in the presence of unknown time-varying measurement delays bounded by known constants which can be large. The…
Switching systems are an important mathematical formalism when dealing with Cyber-Physical Systems (CPSs). In this paper we provide conditions for the exact reconstruction of the initial discrete state of a switching system, when only the…
In this paper, a novel closed-loop control framework for autonomous obstacle avoidance on a curve road is presented. The proposed framework provides two main functionalities; (i) collision free trajectory planning using MPC and (ii) a…
Systems whose time evolutions are entirely deterministic can nevertheless be studied probabilistically, i.e. in terms of the evolution of probability distributions rather than individual trajectories. This approach is central to the…
The increasing integration of automation in vehicles aims to enhance both safety and comfort, but it also introduces new risks, including driver disengagement, reduced situation awareness, and mode confusion. In this work, we propose the…
The dynamics of many open quantum systems are described by stochastic master equations. In the discrete-time case, we recall the structure of the derived quantum filter governing the evolution of the density operator conditioned to the…
Formally capturing the transition from a continuous model to a discrete model is investigated using model based refinement techniques. A very simple model for stopping (eg. of a train) is developed in both the continuous and discrete…
This paper is a computational bifurcation analysis of a non-linear partial differential equation (PDE) characterizing equilibrium configurations in Micro electromechanical Systems (MEMS). MEMS are engineering systems that utilize…
Hamilton Jacobi (HJ) Reachability is a formal verification tool widely used in robotic safety analysis. Given a target set as unsafe states, a dynamical system is guaranteed not to enter the target under the worst-case disturbance if it…
Robustness of linear systems with constant coefficients is considered. There exist methods and tools for analyzing the stability of systems with random or deterministic uncertainties. At the same time, there are no approaches for the…
The state-of-the-art error correcting codes are based on large random constructions (random graphs, random permutations, ...) and are decoded by linear-time iterative algorithms. Because of these features, they are remarkable examples of…
Given the complexity of power systems, particularly the high-dimensional variability of net loads, accurately depicting the entire operational range of net loads poses a challenge. To address this, recent methodologies have sought to gauge…
This paper introduces Nimbus, a robust technique to detect whether the cross traffic competing with a flow is "elastic", and shows that this elasticity detector improves congestion control. If cross traffic is inelastic, then a sender can…