The non-deterministic behaviors in telecommunication services are well-known as one of the most typical Feature Interactions, and they should be detected and eliminated from the telecommunication service specifications. The conventional analysis method of this nondeterminism is based on reachability analysis. Since the method must exhaustively enumerate all reachable global states, it cannot be...

We consider a multiparameter discrete inclusion and we prove that the reachable set of a certain variational multiparameter discrete inclusion is a derived cone in the sense of Hestenes to the reachable set of the discrete inclusion. This result allows to obtain sufficient conditions for local controllability along a reference trajectory and a new proof of the minimum principle for an optimizat...

Neural networks have been widely used to solve complex real-world problems. Due to the complicate, nonlinear, non-convex nature of neural networks, formal safety guarantees for the output behaviors of neural networks will be crucial for their applications in safety-critical systems. In this paper, the output reachable set computation and safety verification problems for a class of neural networ...

We consider the analysis of innnite half-duplex systems which consists of nite state machines that communicate over unbounded channels. The property half-duplex for two machines and two channels (one in each direction) says that each reachable state has at least one channel empty. The contributions of this paper are (a) to give a nite description of the reachability set of such systems , which ...

Several existing and emerging applications of Space Situational Awareness (SSA) relate directly to spacecraft Rendezvous, Proximity Operations, and Docking (RPOD) and Formation / Cluster Flight (FCF). Observation correlation of nearby objects, control authority estimation, sensor-track re-acquisition, formation re-configuration feasibility, ‘stuck’ thrusters, and worst-case passive safety analy...

Constructor-based term rewriting systems are a useful subclass of TRS, in particular for programming purposes. In this kind of systems constructors determine a universe of values, which are the expected output of the computations. Then it would be natural to think of a semantics associating each expression to the set of its reachable values. Somehow surprisingly, the resulting semantics has poo...

Constructor-based term rewriting systems are a useful subclass of TRS, in particular for programming purposes. In this kind of systems constructors determine a universe of values, which are the expected output of the computations. Then it would be natural to think of a semantics associating each expression to the set of its reachable values. Somehow surprisingly, the resulting semantics has poo...

We consider symbolic on-they veriication methods for systems of nite-state machines that communicate by exchanging messages via unbounded and lossy FIFO queues. We propose a novel representation formalism, called simple regular expressions (SREs), for representing sets of states of protocols with lossy FIFO channels. We show that the class of languages representable by SREs is exactly the class...

We present a novel approach for verifying safety properties of finite state machines communicating over unbounded FIFO channels that is based on applying machine learning techniques. We assume that we are given a model of the system and learn the set of reachable states from a sample set of executions of the system, instead of attempting to iteratively compute the reachable states. The learnt s...

Building on previous results of the author this paper presents two new error estimates for the reachable set of an affine control system if only piece-wise constant admissible controls on a uniform mesh are used instead of all measurable admissible controls. It is natural to expect that the resulting " shrinkage " of the reachable set is of the order of the mesh size. In this paper it is proved...