Related papers: Box-Reachability in Vector Addition Systems
We provide a tutorial introduction to reachability computation, a class of computational techniques that exports verification technology toward continuous and hybrid systems. For open under-determined systems, this technique can sometimes…
Reachability analysis is a formal method to guarantee safety of dynamical systems under the influence of uncertainties. A substantial bottleneck of all reachability algorithms is the necessity to adequately tune specific algorithm…
A map $\varphi:K\to R^2$ of a graph $K$ is approximable by embeddings, if for each $\varepsilon>0$ there is an $\varepsilon$-close to $\varphi$ embedding $f:K\to R^2$. Analogous notions were studied in computer science under the names of…
Two boxes in $\mathbb{R}^d$ are comparable if one of them is a subset of a translation of the other one. The comparable box dimension of a graph $G$ is the minimum integer $d$ such that $G$ can be represented as a touching graph of…
Variational Bayes (VB) is rapidly becoming a popular tool for Bayesian inference in statistical modeling. However, the existing VB algorithms are restricted to cases where the likelihood is tractable, which precludes the use of VB in many…
Approximating PDEs on surfaces by the diffuse interface approach allows us to use standard numerical tools to solve these problems. This makes it an attractive numerical approach. We extend this approach to vector-valued surface PDEs and…
Geometric morphisms between realizability toposes are studied in terms of morphisms between partial combinatory algebras (pcas). The morphisms inducing geometric morphisms (the {\em computationally dense\/} ones) are seen to be the ones…
Let $G$ be a graph with a vertex set $V$. The graph $G$ is path-proximinal if there are a semimetric $d \colon V \times V \to [0, \infty[$ and disjoint proximinal subsets of the semimetric space $(V, d)$ such that $V = A \cup B$, and…
The free topological vector space $V(X)$ over a Tychonoff space $X$ is a pair consisting of a topological vector space $V(X)$ and a continuous map $i=i_{X}: X\rightarrow V(X)$ such that every continuous mapping $f$ from $X$ to a topological…
Set membership of points in the plane can be visualized by connecting corresponding points via graphical features, like paths, trees, polygons, ellipses. In this paper we study the \emph{bus embeddability problem} (BEP): given a set of…
We consider the task of fitting low-dimensional embeddings to high-dimensional data. In particular, we study the $k$-Euclidean Metric Violation problem ($\textsf{$k$-EMV}$), where the input is $D \in \mathbb{R}^{\binom{n}{2}}_{\geq 0}$ and…
In case of a standard form vN-algebra, the Bures distance is the natural distance between the fibres of implementing vectors at normal positive linear forms. Thereby, it is well-known that to each two normal positive linear forms…
Navigation mesh (Navmesh) inconsistencies affect the player experience by directly impacting the navigation systems used by non-playable characters (NPCs) in game environments. While navmeshes are generated from world geometry using…
Motivated by recent work of Bukh and Nivasch on one-sided $\varepsilon$-approximants, we introduce the notion of \emph{weighted $\varepsilon$-nets}. It is a geometric notion of approximation for point sets in $\mathbb{R}^d$ similar to…
A vector space is commonly defined as a set that satisfies several conditions related to addition and scalar multiplication. However, for beginners, it may be hard to immediately grasp the essence of these conditions. There are probably a…
We present a method to compute the stochastic reachability safety probabilities for high-dimensional stochastic dynamical systems. Our approach takes advantage of a nonparametric learning technique known as conditional distribution…
In this paper, we study the reachability of two closely related matrices appearing in the analysis of linear time-varying (LTV) systems over a finite time interval, namely, its closed-loop state transition matrix via a state feedback…
In this paper we introduce a new network reachability problem where the goal is to find the most reliable path between two nodes in a network, represented as a directed acyclic graph. Individual edges within this network may fail according…
We study the complexity of the Hitting Set problem in set systems (hypergraphs) that avoid certain sub-structures. In particular, we characterize the classical and parameterized complexity of the problem when the Vapnik-Chervonenkis…
There are different solution concepts for convex vector optimization problems (CVOPs) and a recent one, which is motivated from a set optimization point of view, consists of finitely many efficient solutions that generate polyhedral inner…