Verification of Polyhedral-Invariant Hybrid Automata Using Polygonal Flow Pipe Approximations
HSCC '99 Proceedings of the Second International Workshop on Hybrid Systems: Computation and Control
Ellipsoidal Techniques for Reachability Analysis
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
Approximate Reachability Analysis of Piecewise-Linear Dynamical Systems
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
Verification of Hybrid Systems with Linear Differential Inclusions Using Ellipsoidal Approximations
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
Convex Optimization
PHAVer: algorithmic verification of hybrid systems past HyTech
International Journal on Software Tools for Technology Transfer (STTT)
Zonotope/Hyperplane Intersection for Hybrid Systems Reachability Analysis
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Efficient representation and computation of reachable sets for hybrid systems
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
Efficient computation of reachable sets of linear time-invariant systems with inputs
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Reachability of uncertain linear systems using zonotopes
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Using redundant constraints for refinement
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
A dynamic algorithm for approximate flow computations
Proceedings of the 14th international conference on Hybrid systems: computation and control
SpaceEx: scalable verification of hybrid systems
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Formal verification of hybrid systems
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Choice of directions for the approximation of reachable sets for hybrid systems
EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part I
Proceedings of the 49th Annual Design Automation Conference
Verification of Safety and Liveness Properties of Metric Transition Systems
ACM Transactions on Embedded Computing Systems (TECS) - Special Section on CAPA'09, Special Section on WHS'09, and Special Section VCPSS' 09
The Complete Proof Theory of Hybrid Systems
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Reachability analysis of polynomial systems using linear programming relaxations
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Limited-information control of hybrid systems via reachable set propagation
Proceedings of the 16th international conference on Hybrid systems: computation and control
Flowpipe approximation and clustering in space-time
Proceedings of the 16th international conference on Hybrid systems: computation and control
ABCD-L: approximating continuous linear systems using boolean models
Proceedings of the 50th Annual Design Automation Conference
Finite data-rate feedback stabilization of switched and hybrid linear systems
Automatica (Journal of IFAC)
| Hi-index | 0.00 |
This paper deals with conservative reachability analysis of a class of hybrid systems with continuous dynamics described by linear differential inclusions, convex invariants and guards, and linear reset maps. We present an approach for computing over-approximations of the set of reachable states. It is based on the notion of support function and thus it allows us to consider invariants, guards and constraints on continuous inputs and initial states defined by arbitrary compact convex sets. We show how the properties of support functions make it possible to derive an effective algorithm for approximate reachability analysis of hybrid systems. We use our approach on some examples including the navigation benchmark for hybrid systems verification.