Practical methods of optimization; (2nd ed.)
Practical methods of optimization; (2nd ed.)
What's decidable about hybrid automata?
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
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
HSCC '98 Proceedings of the First International Workshop on Hybrid Systems: Computation and Control
Reachability Analysis via Face Lifting
HSCC '98 Proceedings of the First International Workshop on Hybrid Systems: Computation and Control
Verifying Safety Properties of Differential Equations
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Approximate Reachability Analysis of Piecewise-Linear Dynamical Systems
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
Safety verification of hybrid systems by constraint propagation-based abstraction refinement
ACM Transactions on Embedded Computing Systems (TECS)
Limited-information control of hybrid systems via reachable set propagation
Proceedings of the 16th international conference on Hybrid systems: computation and control
Reachability analysis of nonlinear analog circuits through iterative reachable set reduction
Proceedings of the Conference on Design, Automation and Test in Europe
Finite data-rate feedback stabilization of switched and hybrid linear systems
Automatica (Journal of IFAC)
| Hi-index | 0.00 |
The paper presents a concept for the reachability analysis of switched continuous systems in which switching only occurs when the continuous state trajectory crosses thresholds defined by a rectangular partitioning of the state space. It combines an existing approach for approximating such systems by rectangular automata with an existing reachability algorithm for this class of hybrid automata. Instead of creating a complete abstraction of the original system by a rectangular automaton first and then analyzing it, in the presented procedure the flow conditions of the visited locations are determinded on-the-fly during the course of the analysis. The algorithm is illustrated with the help of a simple physical example.