Related papers: Reachability in 3-VASS is Elementary
We generalize the three two-particle Bethe-Salpeter equations to ten three-particle ladders. These equations are exact and yield the exact three-particle vertex, if we knew the three-particle vertex irreducible in one of the ten channels.…
A control system consists of a plant component and a controller which periodically computes a control input for the plant. We consider systems where the controller is implemented by a feedforward neural network with ReLU activations. The…
In this work, we analyze an efficient sampling-based algorithm for general-purpose reachability analysis, which remains a notoriously challenging problem with applications ranging from neural network verification to safety analysis of…
A method is presented to obtain an inner-approximation of the backward reachable set (BRS) of a given target tube, along with an admissible controller that maintains trajectories inside this tube. The proposed optimization algorithms are…
In this work, we extend undecidability of language equivalence for two-dimensional Vector Addition System with States (VASS) accepting by coverability condition. We show that the problem is undecidable even when one of the two-dimensional…
Neural Networks (NNs) can provide major empirical performance improvements for robotic systems, but they also introduce challenges in formally analyzing those systems' safety properties. In particular, this work focuses on estimating the…
In a recent work, Jungnickel, Magliveras, Tonchev, and Wassermann derived an overexponential lower bound on the number of nonisomorphic resolvable Steiner triple systems (STS) of order $v$, where $v=3^k$, and $3$-rank $v-k$. We develop an…
We show that certain types of the three-legged accessibility property of a partially hyperbolic diffeomorphism imply the existence of a unique minimal set for one strong foliation and the transitivity of the other one. In case the center…
Intractable is the problem of finding two link-disjoint paths of minimal cost if the path cost is limited since it can be a special case of the partition problem. In optical networks, this limit can be introduced by the signal modulation…
In this article, we study the hierarchical structure of metastability in the reversible inclusion process. We fully characterize the third time scale of metastability subject to any underlying geometry of the system and prove that this is…
This article is devoted to the Relativistic Vlasov-Maxwell system in space dimension three. We prove the local smooth solvability for weak topologies (and its long time version for small data). This result is derived from a representation…
We present a new technique for demonstrating the reachability of states in deterministic finite automata representing the concatenation of two languages. Such demonstrations are a necessary step in establishing the state complexity of the…
Given a linear system, we consider the problem of finding a small set of variables to affect with an input so that the resulting system is controllable. We show that this problem is NP-hard; indeed, we show that even approximating the…
We abstract and study \emph{reachability preservers}, a graph-theoretic primitive that has been implicit in prior work on network design. Given a directed graph $G = (V, E)$ and a set of \emph{demand pairs} $P \subseteq V \times V$, a…
We study linear-time temporal logics interpreted over data words with multiple attributes. We restrict the atomic formulas to equalities of attribute values in successive positions and to repetitions of attribute values in the future or…
Consider an agent traversing a graph of "gadgets", each with local state that changes with each traversal by the agent. We characterize the complexity of universal traversal, where the goal is to traverse every gadget at least once, for DAG…
In this paper, we propose a scalable and highly efficient index structure for the reachability problem over graphs. We build on the well-known node interval labeling scheme where the set of vertices reachable from a particular node is…
Iterative imperative programs can be considered as infinite-state systems computing over possibly unbounded domains. Studying reachability in these systems is challenging as it requires to deal with an infinite number of states with…
We address an optimal reachability problem for a planar manipulator in a constrained environment. After introducing the optmization problem in full generality, we practically embed the geometry of the workspace in the problem, by…
Reachability analysis is a popular method to give safety guarantees for stochastic cyber-physical systems (SCPSs) that takes in a symbolic description of the system dynamics and uses set-propagation methods to compute an overapproximation…