Related papers: Box-Reachability in Vector Addition Systems
Let $U$ and $V$ be finite-dimensional vector spaces over a (commutative) field $\mathbb{K}$, and $\mathcal{S}$ be a linear subspace of the space $\mathcal{L}(U,V)$ of all linear operators from $U$ to $V$. A map $F : \mathcal{S} \rightarrow…
In real world applications, uncertain parameters are the rule rather than the exception. We present a reachability algorithm for linear systems with uncertain parameters and inputs using set propagation of polynomial zonotopes. In contrast…
We consider the decidability of state-to-state reachability in linear time-invariant control systems over continuous time. We analyse this problem with respect to the allowable control sets, which are assumed to be the image under a linear…
In this work, we present a numerical optimal control framework for reachable set computation using \emph{normotopes}, a new set representation as a norm ball with a shaping matrix. In reachable set computations, we expect to continuously…
In the $2$-reachability problem we are given a directed graph $G$ and we wish to determine if there are two (edge or vertex) disjoint paths from $u$ to $v$, for a given pair of vertices $u$ and $v$. In this paper, we present an algorithm…
We consider the decidability of state-to-state reachability in linear time-invariant control systems over discrete time. We analyse this problem with respect to the allowable control sets, which in general are assumed to be defined by…
A new framework is proposed for analyzing staggered-grid finite difference finite volume methods on unstructured meshes. The new framework employs the concept of external approximation of function spaces, and gauge convergence of numerical…
Autonomous systems are increasingly implemented using end-to-end learning-based controllers. Such controllers make decisions that are executed on the real system, with images as one of the primary sensing modalities. Deep neural networks…
In this paper we propose a convex programming based method to address a long-standing problem of inner-approximating backward reachable sets of state-constrained polynomial systems subject to time-varying uncertainties. The backward…
We study the properties of several proximity measures for the vertices of weighted multigraphs and multidigraphs. Unlike the classical distance for the vertices of connected graphs, these proximity measures are applicable to weighted…
The convergence of the projection algorithm for solving the convex feasibility problem for a family of closed convex sets, is in connection with the regularity properties of the family. In the paper [18] are pointed out four cases of such a…
A turn sequence of left and right turns is realized as a simple rectilinear chain of integral segments whose turns at its bends are the same as the turn sequence. The chain starts from the origin and ends at some point which we call a…
We aim to find orientations of mixed graphs optimizing the total reachability, a problem that has applications in causality and biology. For given a digraph $D$, we use $P(D)$ for the set of ordered pairs of distinct vertices in $V(D)$ and…
The invisibility graph $I(X)$ of a set $X \subseteq \mathbb{R}^d$ is a (possibly infinite) graph whose vertices are the points of $X$ and two vertices are connected by an edge if and only if the straight-line segment connecting the two…
Motivated by questions in mass-action kinetics, we introduce the notion of vertexical family of differential inclusions. Defined on open hypercubes, these families are characterized by particular good behavior under projection maps. The…
The last decade has seen the development of path homology and magnitude homology -- two homology theories of directed graphs, each satisfying classic properties such as Kunneth and Mayer-Vietoris theorems. Recent work of Asao has shown that…
We provide a new characterization of enriched accessible categories by introducing the two new notions of virtual reflectivity and virtual orthogonality as a generalization of the usual reflectivity and orthogonality conditions for locally…
Reachability analysis is a fundamental problem for safety verification and falsification of Cyber-Physical Systems (CPS) whose dynamics follow physical laws usually represented as differential equations. In the last two decades, numerous…
Variational Bayes (VB) has become a widely-used tool for Bayesian inference in statistics and machine learning. Nonetheless, the development of the existing VB algorithms is so far generally restricted to the case where the variational…
A $k$-regular graph is called a divisible design graph if its vertex set can be partitioned into $m$ classes of size $n$, such that two distinct vertices from the same class have exactly $\lambda_1$ common neighbours, and two vertices from…