Modular feedback logic for discrete event systems
SIAM Journal on Control and Optimization
Directed hypergraphs and applications
Discrete Applied Mathematics - Special issue: combinatorial structures and algorithms
Ordinary Differential Equations
Ordinary Differential Equations
Ellipsoidal Techniques for Reachability Analysis
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
The Mathematica Book
Diagnosis and Fault-Tolerant Control
Diagnosis and Fault-Tolerant Control
Convexity of reachable sets of nonlinear ordinary differential equations
Automation and Remote Control
Abstractions for hybrid systems
Formal Methods in System Design
Brief paper: Controller synthesis for safety and reachability via approximate bisimulation
Automatica (Journal of IFAC)
Hi-index | 0.00 |
In this paper, we present a new method for computing discrete abstractions of arbitrary memory span for nonlinear sampled systems with quantized output. In our method, abstractions are represented by collections of conservative approximations of reachable sets by polyhedra, which in turn are represented by collections of half-spaces. Important features of our approach are that half-spaces are shared among polyhedra, and that the determination of each half-space requires the solution of a single initial value problem in an ordinary differential equation over a single sampling interval only. Apart from these numerical integrations, the only nontrivial operation to be performed repeatedly is to decide whether a given polyhedron is empty. In particular, in contrast to previous approaches, there are no intermediate bloating steps, and convex hulls are never computed. Our method heavily relies on convexity of reachable sets and applies to any sufficiently smooth system if either the sampling period, or the system of level sets of the quantizer can be chosen freely. In particular, it is not required that the system to be abstracted have any stability properties.