Theoretical Computer Science
What's decidable about hybrid automata?
Journal of Computer and System Sciences
An Algorithm for the Approximative Analysis of Rectangular Automata
FTRTFT '98 Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Convex Optimization
Efficient representation and computation of reachable sets for hybrid systems
HSCC'03 Proceedings of the 6th 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
Automatic rectangular refinement of affine hybrid systems
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
PHAVer: algorithmic verification of hybrid systems past hytech
HSCC'05 Proceedings of the 8th 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
Reachability analysis of nonlinear systems using conservative polynomialization and non-convex sets
Proceedings of the 16th international conference on Hybrid systems: computation and control
| Hi-index | 0.00 |
We present a new approach to compute the reachable set with a bounded number of jumps for a rectangular automaton. The reachable set under a flow transition is computed as a polyhedron which is represented by a conjunction of finitely many linear constraints. If the bound is viewed as a constant, the computation time is polynomial in the number of variables.