The vulnerability of artificial intelligence (AI) and machine learning (ML) against adversarial disturbances attacks significantly restricts their applicability in safety-critical systems including cyber-physical (CPS) equipped with neural network components at various stages sensing control. This article addresses the reachable set estimation safety verification problems for dynamical embedded...

This paper provides a systematic framework to determine switching control strategies to stabilize the system after a fault if the stabilization is possible. A method to compute the stability region of a stable equilibrium point with the purpose of power system stability analysis is proposed and the validity of discrete controls in transient stability design is studied. First, a Hamilton–Jacobi–...

Reachability analysis is a powerful formal method for analysis of concurrent and distributed nite state systems. It suuers from the state space explosion problem, however: the state space of a system can be far too large to be completely generated. This paper considers two promising methods, Valmari's stubborn set method and Godefroid's sleep set method, to avoid generating all of the state spa...

We present here a method for deriving a regular language that characterizes the set of reachable states of a given parametrized ring (made of N of identical components). The method basically proceeds in two steps: rst one generates a regular language L by inductive inference from a nite sample of reachable states; second one formally checks that L characterizes the whole set of reachable states.

Computing invariants is the key issue in the analysis of infinite-state systems whether analysis means testing, verification or parameter synthesis. In particular, methods that allow to treat combinations of loops are of interest. We present a set of algorithms and methods that can be applied to characterize over-approximations of the set of reachable states of combinations of self-loops. We pr...

We present an algorithm to find an overapproximation of the set of reachable states in a finite state machine. The algorithm works by inductively proving implications of the form a ⇒ b between pairs of nodes in the logic network. Because each implication proved is guaranteed to hold in every reachable state, the conjunction of the implications forms an over-approximation of the reachable state ...

In this paper, we generalize the technique of fair reachability analysis to multi-cyclic protocols modeled as networks of communicating nite state machines, where a number of cyclic protocols are interconnected in such a way that any two component cyclic protocols share at most one process and each channel in the protocol belongs to exactly one component cyclic protocol. By composing the fair r...

Pushdown Systems (PDSs) are an important formalism for modeling programs. Reachability analysis on PDSs has been used extensively for program verification. A key result, which made PDSs popular in the model-checking community was that the set of reachable stack configurations starting from a regular set of configurations is also regular. A more general result was given by Caucal [7] who showed ...

Despite researchers’ efforts in the last couple of decades, reachability analysis is still a challenging problem even for linear hybrid systems. Among the existing approaches, the most practical ones are mainly based on bounded-time reachable set over-approximations. For the purpose of unbounded-time analysis, one important strategy is to abstract the original system and find an invariant for t...

Limited capacity of communication channels has brought to the attention of many researchers the analysis of control systems subject to a quantized input set. In some fundamental cases such systems can be reduced to quantized control system of type x+ = x + u, where the u takes values in a set of 2m + 1 integer numbers, symmetric with respect to 0. In this paper we consider these types of system...