Constraint propagation with interval labels
Artificial Intelligence
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
Efficient solving of quantified inequality constraints over the real numbers
ACM Transactions on Computational Logic (TOCL)
Safety verification of hybrid systems by constraint propagation-based abstraction refinement
ACM Transactions on Embedded Computing Systems (TECS)
Approximate reachability for linear systems
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
Safety verification of hybrid systems by constraint propagation based abstraction refinement
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Constraints for continuous reachability in the verification of hybrid systems
AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
| Hi-index | 0.00 |
In this paper, we generalize reachability constraints that model the continuous flow for linear differential equations, tighten them by using the information on the multiplicity of the eigenvalues and eigenvectors of such equations, and then put them into our constraint based approach for safety verification of hybrid systems that employs recursive reasoning to improve the method of forward search based abstraction refinement.