Related papers: Controllability and reachability of singular linea…
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…
Reachability analysis, in general, is a fundamental method that supports formally-correct synthesis, robust model predictive control, set-based observers, fault detection, invariant computation, and conformance checking, to name but a few.…
This paper focuses on optimizing probabilities of events of interest defined over general controlled discrete-time Markov processes. It is shown that the optimization over a wide class of $\omega$-regular properties can be reduced to the…
Numerous complex systems, such as those arisen in ecological networks, genomic contact networks, and social networks, exhibit higher-order and time-varying characteristics, which can be effectively modeled using temporal hypergraphs.…
This paper deals with the controllability of linear one-dimensional hyperbolic systems. Reformulating the problem in terms of linear difference equations and making use of infinite-dimensional realization theory, we obtain both necessary…
This work addresses the exact characterization of the covariance dynamics related to linear discrete-time systems subject to both additive and parametric stochastic uncertainties that are potentially unbounded. Using this characterization,…
We survey the state of the art on the algorithmic analysis of discrete linear dynamical systems, focussing in particular on reachability, model-checking, and invariant-generation questions, both unconditionally as well as relative to…
Despite the possibility to quickly compute reachable sets of large-scale linear systems, current methods are not yet widely applied by practitioners. The main reason for this is probably that current approaches are not push-button-capable…
Over-approximating the reachable sets of dynamical systems is a fundamental problem in safety verification and robust control synthesis. The representation of these sets is a key factor that affects the computational complexity and the…
Hamilton-Jacobi reachability (HJR) is an exciting framework used for control of safety-critical systems with nonlinear and possibly uncertain dynamics. However, HJR suffers from the curse of dimensionality, with computation times growing…
In this work, we consider the controllability of a discrete-time linear dynamical system with sparse control inputs. Sparsity constraints on the input arises naturally in networked systems, where activating each input variable adds to the…
We consider reachability in dynamical systems with discrete linear updates, but with fixed digital precision, i.e., such that values of the system are rounded at each step. Given a matrix $M \in \mathbb{Q}^{d \times d}$, an initial vector…
The paper presents realization theory of discrete-time linear switched systems. A discrete-time linear switched system is a hybrid system, such that the continuous sub-system associated with each discrete state is linear. In this paper we…
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…
Time-Basic Petri nets, is a powerful formalism for model- ing real-time systems where time constraints are expressed through time functions of marking's time description associated with transition, representing possible firing times. We…
We discuss the observability of a one-dimensional Schr\"odinger equation on certain time dependent domain. In linear moving case, we give the exact boundary and pointwise internal observability for arbitrary time. For the general moving, we…
In this paper, we revisit energy-based concepts of controllability and reformulate them for control-affine nonlinear systems perturbed by white noise. Specifically, we discuss the relation between controllability of deterministic systems…
We provide algorithmically verifiable necessary and sufficient conditions for fundamental system theoretic properties of discrete time linear systems subject to data losses. More precisely, the systems in our modeling framework are subject…
We study boundary regional controllability problems for a class of semilinear fractional systems. Sufficient conditions for regional boundary controllability are proved by assuming that the associated linear system is approximately…
For large-scale network systems, network centrality based on control theory plays a crucial role in understanding their properties and controlling them efficiently. The controllability score is such a centrality index and can give a…