相关论文: On the finiteness of accessibility test for nonlin…

Exploiting tools from algebraic geometry, the problem of finiteness of determination of accessibility/strong accessibility is investigated for polynomial systems and also for analytic systems that are immersible into polynomial systems. The…

One often wishes for the ability to formally analyze large-scale systems---typically, however, one can either formally analyze a rather small system or informally analyze a large-scale system. This work tries to further close this…

This paper is concerned with linear parameter-dependent systems and considers the notion uniform ensemble reachability. The focus of this work is on constructive methods to compute suitable parameter-independent open-loop inputs for such…

In this paper, the reachability of dimension-bounded linear systems is investigated.Since state dimensions of dimension-bounded linear systems vary with time, the expression of state dimension at each time is provided.A method for judging…

The main objective of this article is to develop a matrix pencil approach for the study of the controllability and reachability of a class of linear singular discrete time systems. The description equation of a practical system may be…

Reachability analysis aims at identifying states reachable by a system within a given time horizon. This task is known to be computationally expensive for linear hybrid systems. Reachability analysis works by iteratively applying continuous…

Temporal networks are a class of time-varying networks, which change their topology according to a given time-ordered sequence of static networks (known as subsystems). This paper investigates the reachability and controllability of…

Reachability analysis is a critical tool for the formal verification of dynamical systems and the synthesis of controllers for them. Due to their computational complexity, many reachability analysis methods are restricted to systems with…

Given a dynamical system with constrained outputs, the maximal admissible set (MAS) is defined as the set of all initial conditions such that the output constraints are satisfied for all time. It has been previously shown that for…

This paper proposes a computationally efficient framework, based on interval analysis, for rigorous verification of nonlinear continuous-time dynamical systems with neural network controllers. Given a neural network, we use an existing…

The reachable sets of nonlinear control systems can in general only be numerically approximated, and are often very expensive to calculate. In this paper, we propose an algorithm that tracks only the boundaries of the reachable sets and…

This paper deals with the problem of point-to-point reachability in multi-linear systems. These systems consist of a partition of the Euclidean space into a finite number of regions and a constant derivative assigned to each region in the…

In this paper, we characterize the accessibility of discrete-time linear control systems on Lie groups. Using an exceptional notion of derivative, we construct a subalgebra $\mathfrak{h}$ based on the infinitesimal automorphism of the…

A joint characterization of reachability (controllability) and observability (constructibility) for linear SISO nonuniformly sampled discrete systems is presented. The work generalizes to the nonuniform sampling the criterion known for the…

Reachable sets of nonlinear control systems can in general only be approximated numerically, and these approximations are typically very expensive to compute. In this paper, we explore a strategy for choosing the temporal and spatial…

In this paper we study reachability verification problems of stochastic discrete-time dynamical systems over the infinite time horizon. The reachability verification of interest in this paper is to certify specified lower and upper bounds…

In this work, we perform safety analysis of linear dynamical systems with uncertainties. Instead of computing a conservative overapproximation of the reachable set, our approach involves computing a statistical approximate reachable set. As…

We propose a new approach to compute an interval over-approximation of the finite time reachable set for a large class of nonlinear systems. This approach relies on the notions of sensitivity matrices, which are the partial derivatives…

The safety region of operation of a system is the subset of allowed outputs for which no undesirable outcome would occur. Knowing if a system would ever leave its safety regions of operation is important information for the planning and…

We consider the decidability of state-to-state reachability in linear time-invariant control systems over discrete time. We analyse this problem with respect to the allowable control sets, which in general are assumed to be defined by…