26 research outputs found
Optimal semicomputable approximations to reachable and invariant sets
In this paper we consider the computation of reachable, viable and invariant sets for discrete-time systems. We use the framework of type-two effectivity,
in which computations are performed by Turing machines with infinite input and output tapes, with the representations of computable topology. We see that the reachable set is lower-semicomputable, and the viability and invariance kernels are upper-semicomputable. We then define an upper-semicomputable over-approximation to the reachable set, and lower-semicomputable under-approximations to the viability and invariance kernels, and show that these approximations are optimal
Optimal semicomputable approximations to reachable and invariant sets
In this paper we consider the computation of reachable, viable and invariant sets for discrete-time systems. We use the framework of type-two effectivity, in which computations are performed by Turing machines with infinite input and output tapes, with the representations of computable topology. We see that the reachable set is lower-semicomputable, and the viability and invariance kernels are upper-semicomputable. We then define an upper-semicomputable over-approximation to the reachable set, and lower-semicomputable under-approximations to the viability and invariance kernels, and show that these approximations are optima
Semantics and computation of the evolution of hybrid systems with ariadne
In this talk we will present material on the semantics, computability, and algorithms for the evolution of hybrid dynamical systems, and an overview of the tool Ariadne for verification of hybrid systems [1]. Hybrid systems are characterised by undergoing continuous evolution interspersed by discrete jumps. They exhibit all the complexities of finite automata, nonlinear dynamic systems and differential equations, and are extremely difficult to analyze. We will consider hybrid systems in which the continuous dynamics is given by a differential equation x = f(x), with discrete jumps x' = ri(x) which occur as soon as a guard condition gi(x) = 0 is activated. It is clear that the evolution of a hybrid system undergoes discontinuities, but since only continuous functions are computable, it is not clear to what extent, if any, it is possible to perform a rigorous analysis of a hybrid system. We will first show that we can define lower and upper semantics of evolution under which it is possible to compute reachable sets, and that away from discontinuity points (such as grazing or corner collision points), these semantics agree [2]. In order to perform reachability analysis, it is necessary to define the evolution over bounded initial sets of states. We show that this can be done using the operations of range, compose, flow and solve operations on functions. We will see that constrained image sets of the form {f(x) | x ? D | g(x) ? C}, are sufficient to express the evolution exactly, except for the case of degenerate (non-transverse) cross- ings [3]. The flow operation is the most computationally demanding, and we will give some details of the implementation and efficiency considerations [4]. We will give examples of reachability analysis in Ariadne, including electrical power converters and heating systems. Finally, we will outline some areas of active research, including differential inclusions [5] and modular reasoning
Finding codes on infinite grids automatically
We apply automata theory and Karp's minimum mean weight cycle algorithm to
minimum density problems in coding theory. Using this method, we find the new
upper bound for the minimum density of an identifying
code on the infinite hexagonal grid, down from the previous record of .Comment: 18 pages, 5 figure
Reachability computation for hybrid systems with Ariadne
Ariadne is an in-progress open environment to design algorithms for computing with hybrid automata, that relies on a rigorous computable analysis theory to represent
geometric objects, in order to achieve provable approximation bounds along the computations. In this paper we discuss the problem of reachability analysis of hybrid automata to decide safety properties. We describe in details the algorithm used in Ariadne to compute over-approximations of reachable sets. Then we show how it works on a simple example. Finally, we discuss the lower-approximation approach to the reachability problem and how to extend
Ariadne to support it
The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems
This paper introduces a new algorithm dedicated to the rigorous reachability analysis of nonlinear dynamical systems. The algorithm is initially presented in the context of discrete time dynamical systems, and then extended to continuous time dynamical systems driven by ODEs. In continuous time, this algorithm is called the Reach and Evolve algorithm. The Reach and Evolve algorithm is based on interval analysis and a rigorous discretization of space and time. Promising numerical experiments are presented
A computable type theory for control systems
In this paper, we develop a theory of computable
types suitable for the study of control systems. The theory uses type-two effectivity as the underlying computational model, but we quickly develop a type system which can be manipulated abstractly, but for which all allowable operations are guaranteed to be computable. We apply the theory to the study of hybrid systems, reachability analysis, and control synthesis
A computable type theory for control systems
In this paper, we develop a theory of computable
types suitable for the study of control systems. The theory uses type-two effectivity as the underlying computational model, but we quickly develop a type system which can be manipulated abstractly, but for which all allowable operations are guaranteed to be computable. We apply the theory to the study of hybrid systems, reachability analysis, and control synthesis