Reachability analysis of linear hybrid systems via block decomposition

Reachability analysis aims at identifying states reachable by a system within a given time horizon. This task is known to be computationally expensive for linear hybrid systems. Reachability analysis works by iteratively applying continuous and discrete post operators to compute states reachable according to continuous and discrete dynamics, respectively. In this paper, we enhance both of these operators and make sure that most of the involved computations are performed in low-dimensional state space. In particular, we improve the continuous-post operator by performing computations in high-dimensional state space only for time intervals relevant for the subsequent application of the discrete-post operator. Furthermore, the new discrete-post operator performs low-dimensional computations by leveraging the structure of the guard and assignment of a considered transition. We illustrate the potential of our approach on a number of challenging benchmarks.Comment: Accepted at EMSOFT 202

Reach Set Approximation through Decomposition with Low-dimensional Sets and High-dimensional Matrices

Approximating the set of reachable states of a dynamical system is an algorithmic yet mathematically rigorous way to reason about its safety. Although progress has been made in the development of efficient algorithms for affine dynamical systems, available algorithms still lack scalability to ensure their wide adoption in the industrial setting. While modern linear algebra packages are efficient for matrices with tens of thousands of dimensions, set-based image computations are limited to a few hundred. We propose to decompose reach set computations such that set operations are performed in low dimensions, while matrix operations like exponentiation are carried out in the full dimension. Our method is applicable both in dense- and discrete-time settings. For a set of standard benchmarks, it shows a speed-up of up to two orders of magnitude compared to the respective state-of-the art tools, with only modest losses in accuracy. For the dense-time case, we show an experiment with more than 10.000 variables, roughly two orders of magnitude higher than possible with previous approaches

Perturbed eigenvalues of polyharmonic operators in domains with small holes

We study singular perturbations of eigenvalues of the polyharmonic operator on bounded domains under removal of small interior compact sets. We consider both homogeneous Dirichlet and Navier conditions on the external boundary, while we impose homogeneous Dirichlet conditions on the boundary of the removed set. To this aim, we develop a notion of capacity which is suitable for our higher-order context, and which permits to obtain a description of the asymptotic behaviour of perturbed simple eigenvalues in terms of a capacity of the removed set, in dependence of the respective normalized eigenfunction. Then, in the particular case of a subset which is scaling to a point, we apply a blow-up analysis to detect the precise convergence rate, which turns out to depend on the order of vanishing of the eigenfunction. In this respect, an important role is played by Hardy-Rellich inequalities in order to identify the appropriate functional space containing the limiting profile. Remarkably, for the biharmonic operator this turns out to be the same, regardless of the boundary conditions prescribed on the exterior boundary

Asymptotic Control for a Class of Piecewise Deterministic Markov Processes Associated to Temperate Viruses

We aim at characterizing the asymptotic behavior of value functions in the control of piece-wise deterministic Markov processes (PDMP) of switch type under nonexpansive assumptions. For a particular class of processes inspired by temperate viruses, we show that uniform limits of discounted problems as the discount decreases to zero and time-averaged problems as the time horizon increases to infinity exist and coincide. The arguments allow the limit value to depend on initial configuration of the system and do not require dissipative properties on the dynamics. The approach strongly relies on viscosity techniques, linear programming arguments and coupling via random measures associated to PDMP. As an intermediate step in our approach, we present the approximation of discounted value functions when using piecewise constant (in time) open-loop policies.Comment: In this revised version, statements of the main results are gathered in Section 3. Proofs of the main results (Theorem 4 and Theorem 7) make the object of separate sections (Section 5, resp. Section 6). The biological example makes the object of Section 4. Notations are gathered in Subsection 2.1. This is the final version to be published in SICO

Homogenization Techniques for Periodic Structures

International audienceWe describe a selection of mathematical techniques and results that suggest interesting links between the theory of gratings and the theory of homogenization, including a brief introduction to the latter. We contrast the "classical" homogenization, which is well suited for the description of composites as we have known them since their advent until about a decade ago, and the "non-standard" approaches, high-frequency homogenization and high-contrast homogenization, developing in close relation to the study of photonic crystals and metamaterials, which exhibit properties unseen in conventional composite media, such as negative refraction allowing for super-lensing through a flat heterogeneous lens, and cloaking, which considerably reduces the scattering by finite size objects (invisibility) in certain frequency range. These novel electromagnetic paradigms have renewed the interest of physicists and applied mathematicians alike in the theory of gratings