142 research outputs found

    Algorithmic Verification of Continuous and Hybrid Systems

    Get PDF
    We provide a tutorial introduction to reachability computation, a class of computational techniques that exports verification technology toward continuous and hybrid systems. For open under-determined systems, this technique can sometimes replace an infinite number of simulations.Comment: In Proceedings INFINITY 2013, arXiv:1402.661

    State dependent NGMV control of delayed piecewise affine systems

    Get PDF
    A Nonlinear Generalized Minimum Variance (NGMV) control algorithm is introduced for the control of delayed piecewise affine (PWA) systems which are an important subclass of hybrid systems. Under some conditions, discrete-time PWA systems can be transferred into their equivalent state dependent nonlinear systems form. The equivalent state dependent systems that include reference and disturbances models are very general. The process is assumed to include common delays in input or output channels of magnitude k. Then the NGMV control strategy [16] can be applied. The NGMV controller is related to a well-known and accepted solution for time delay systems but has the advantage that it can stabilize open-loop unstable processes [17]

    Numerical Verification of Affine Systems with up to a Billion Dimensions

    Full text link
    Affine systems reachability is the basis of many verification methods. With further computation, methods exist to reason about richer models with inputs, nonlinear differential equations, and hybrid dynamics. As such, the scalability of affine systems verification is a prerequisite to scalable analysis for more complex systems. In this paper, we improve the scalability of affine systems verification, in terms of the number of dimensions (variables) in the system. The reachable states of affine systems can be written in terms of the matrix exponential, and safety checking can be performed at specific time steps with linear programming. Unfortunately, for large systems with many state variables, this direct approach requires an intractable amount of memory while using an intractable amount of computation time. We overcome these challenges by combining several methods that leverage common problem structure. Memory is reduced by exploiting initial states that are not full-dimensional and safety properties (outputs) over a few linear projections of the state variables. Computation time is saved by using numerical simulations to compute only projections of the matrix exponential relevant for the verification problem. Since large systems often have sparse dynamics, we use Krylov-subspace simulation approaches based on the Arnoldi or Lanczos iterations. Our method produces accurate counter-examples when properties are violated and, in the extreme case with sufficient problem structure, can analyze a system with one billion real-valued state variables

    A Framework for Worst-Case and Stochastic Safety Verification Using Barrier Certificates

    Get PDF
    This paper presents a methodology for safety verification of continuous and hybrid systems in the worst-case and stochastic settings. In the worst-case setting, a function of state termed barrier certificate is used to certify that all trajectories of the system starting from a given initial set do not enter an unsafe region. No explicit computation of reachable sets is required in the construction of barrier certificates, which makes it possible to handle nonlinearity, uncertainty, and constraints directly within this framework. In the stochastic setting, our method computes an upper bound on the probability that a trajectory of the system reaches the unsafe set, a bound whose validity is proven by the existence of a barrier certificate. For polynomial systems, barrier certificates can be constructed using convex optimization, and hence the method is computationally tractable. Some examples are provided to illustrate the use of the method

    Computational Methods for Optimal Control of Hybrid Systems

    Get PDF
    This thesis aims to find algorithms for optimal control of hybrid systems and explore them in sufficient detail to be able to implement the ideas in computational tools. By hybrid systems is meant systems with interacting continuous and discrete dynamics. Code for computations has been developed in parallel to the theory. The optimal control methods studied in this thesis are global, i.e. the entire state space is considered simultaneously rather than searching for locally optimal trajectories. The optimal value function that maps each state of the state space onto the minimal cost for trajectories starting in that state is central for global methods. It is often difficult to compute the value function of an optimal control problem, even for a purely continuous system. This thesis shows that a lower bound of the value function of a hybrid optimal control problem can be found via convex optimization in a linear program. Moreover, a dual of this optimization problem, parameterized in the control law, has been formulated via general ideas from duality in transportation problems. It is shown that the lower bound of the value function is tight for continuous systems and that there is no gap between the dual optimization problems. Two computational tools are presented. One is built on theory for piecewise affine systems. Various analysis and synthesis problems for this kind of systems are via piecewise quadratic Lyapunov-like functions cast into linear matrix inequalities. The second tool can be used for value function computation, control law extraction, and simulation of hybrid systems. This tool parameterizes the value function in its values in a uniform grid of points in the state space, and the optimization problem is formulated as a linear program. The usage of this tool is illustrated in a case study

    Nondeterministic hybrid dynamical systems

    Get PDF
    This thesis is concerned with the analysis, control and identification of hybrid dynamical systems. The main focus is on a particular class of hybrid systems consisting of linear subsystems. The discrete dynamic, i.e., the change between subsystems, is unknown or nondeterministic and cannot be influenced, i.e. controlled, directly. However changes in the discrete dynamic can be detected immediately, such that the current dynamic (subsystem) is known. In order to motivate the study of hybrid systems and show the merits of hybrid control theory, an example is given. It is shown that real world systems like Anti Locking Brakes (ABS) are naturally modelled by such a class of linear hybrids systems. It is shown that purely continuous feedback is not suitable since it cannot achieve maximum braking performance. A hybrid control strategy, which overcomes this problem, is presented. For this class of linear hybrid system with unknown discrete dynamic, a framework for robust control is established. The analysis methodology developed gives a robustness radius such that the stability under parameter variations can be analysed. The controller synthesis procedure is illustrated in a practical example where the control for an active suspension of a car is designed. Optimal control for this class of hybrid system is introduced. It is shows how a control law is obtained which minimises a quadratic performance index. The synthesis procedure is stated in terms of a convex optimisation problem using linear matrix inequalities (LMI). The solution of the LMI not only returns the controller but also the performance bound. Since the proposed controller structures require knowledge of the continuous state, an observer design is proposed. It is shown that the estimation error converges quadratically while minimising the covariance of the estimation error. This is similar to the Kalman filter for discrete or continuous time systems. Further, we show that the synthesis of the observer can be cast into an LMI, which conveniently solves the synthesis problem
    corecore