Abstract We present , a tool that uses neural networks for predicting reachable sets from executions of dynamical system. Unlike existing reachability tools, computes function outputs an accurate over-approximation the set any initial in parameterized family. Such functions are useful online monitoring, verification, and safe planning. implements empirical risk minimization learning functions. ...

Abstract Numerous tasks in program analysis and synthesis reduce to deciding reachability possibly infinite graphs such as those induced by Petri nets. However, the net problem has recently been shown require non-elementary time, which raises questions about practical applicability of nets target models. In this paper, we introduce a novel approach for efficiently semi-deciding practice. Our ke...

Hybrid automata model systems with both digital and analog components, such as embedded control programs. Many veri cation tasks for such programs can be expressed as reachability problems for hybrid automata. By improving on previous decidability and undecidability results, we identify a boundary between decidability and undecidability for the reachability problem of hybrid automata. On the po...

We consider the following matrix reachability problem: given r square matrices with entries in a semiring, is there a product of these matrices which attains a prescribed matrix? We define similarly the vector (resp. scalar) reachability problem, by requiring that the matrix product, acting by right multiplication on a prescribed row vector, gives another prescribed row vector (resp. when multi...

Time Petri nets were introduced by Merlin in [5] in order to study recoverability problems in computer systems and the design of communication protocols. Berthomieu and Menasche in [2] res. Berthomieu and Diaz in [1] provide a method for the analysis of the qualitative behavior of the net. They divide the state spaces in state classes which are describe by a marking and time domain given by ine...

--This paper presents a game theoretic approach to fault detection of reachability testing. Physical systems are susceptible to fault at any time. Due to this reason the problem of determining and reacting to fault detection has received a greater attention in today’s era. In this paper we study the fault detection of reachability tesing from a game theoretic point of view. Reachability testing...

A reachability problem is a problem used to decide whether s is reachable to t by R or not for a given two terms s, t and a term rewriting system R. Since it is known that this problem is undecidable, effort has been devoted to finding subclasses of term rewriting systems in which the reachability is decidable. However few works on decidability exist for innermost reduction strategy or context-...

Modular design aims at building complex reactive systems by assembling components, possibly taken off-the-shelf. This approach can be supported by a specification theory in which requirements correspond to specifications while components are models of the specifications. In this article, we consider components which have to fulfill a reachability objective. A difficulty is then induced by the f...

The paper studies the problem of reachability for linear systems in the presence of uncertain (unknown but bounded) input disturbances, which may also be interpreted as the action of an adversary in a gametheoretic setting. It defines possible notions of reachability under uncertainty emphasizing the differences between open-loop and closed-loop control. Solution schemes for calculating reachab...