Reachability analysis of hybrid system imposes restrictions on the continuous and discrete behavior. In this paper a method is proposed to approximate the reachable set of linear systems by linear inequalities. It allows to use the full continuous dynamics of hybrid systems for reachability analysis. This method is applied to an automotive control problem, which was presented by Stauner et al. ...

For LTI control systems, we provide mathematical tools – in terms of Linear Matrix Inequalities – for computing outer ellipsoidal bounds on the reachable sets that attacks can induce in the system when they are subject to the physical limits of the actuators. Next, for a given set of dangerous states, states that (if reached) compromise the integrity or safe operation of the system, we provide ...

As an important approach to analyzing safety of a dynamic system, this paper considers the task of computing overapproximations of reachable sets, i.e. the set of states which is reachable from a given initial set of states. The class of systems under investigation are linear, time-invariant systems with parametric uncertainties and uncertain but bounded input. The possible set of system matric...

We give a full characterization of the range operator which associates, to any initial condition, viscosity solution at time T Hamilton–Jacobi equation with convex Hamiltonian. Our main motivation is be able treat case Hamiltonians no further regularity assumptions. special attention H(p)=|p|, for we provide rather geometrical description by means an interior ball condition on sublevel sets. Fr...

This paper considers the problem of computing the state reachable points (from the origin) of a linear constant coefficient second order descriptor system. A new method is proposed to compute the reachable set in a numerically stable way. The original descriptor system is transformed into a strangeness-free system within the behavioral framework followed by a projection that separates the syste...

We introduce a new framework for Property Checking (PC) of sequential circuits. It is based on a method called Logic Relaxation (LoR). Given a safety property, the LoR method relaxes the transition system at hand, which leads to expanding the set of reachable states. For j-th time frame, the LoR method computes a superset Aj of the set of bad states reachable in j transitions only by the relaxe...