Constraint propagation with interval labels
Artificial Intelligence
Analytic constraint solving and interval arithmetic
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Reach Set Computations Using Real Quantifier Elimination
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
Counterexample-guided abstraction refinement for symbolic model checking
Journal of the ACM (JACM)
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)
Hybrid Systems: Computation and Control: 8th International Workshop, HSCC 2005, Zurich, Switzerland, March 9-11, 2005, Proceedings (Lecture Notes in Computer Science)
Approximate reachability for linear systems
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
Tightened reachability constraints for safety verification of linear hybrid systems
ISC '07 Proceedings of the 10th IASTED International Conference on Intelligent Systems and Control
Language-based abstraction refinement for hybrid system verification
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Symbolic reachability analysis of lazy linear hybrid automata
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
ΣK-constraints for hybrid systems
PSI'09 Proceedings of the 7th international Andrei Ershov Memorial conference on Perspectives of Systems Informatics
Reachability analysis of nonlinear systems using conservative polynomialization and non-convex sets
Proceedings of the 16th international conference on Hybrid systems: computation and control
Safety verification for linear systems
Proceedings of the Eleventh ACM International Conference on Embedded Software
Reachability Analysis of Linear Systems with Stepwise Constant Inputs
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
The method for verification of hybrid systems by constraint propagation based abstraction refinement that we introduced in an earlier paper is based on an over-approximation of continuous reachability information of ordinary differential equations using constraints that do not contain differentiation symbols. The method uses an interval constraint propagation based solver to solve these constraints. This has the advantage that—without complicated algorithmic changes—the method can be improved by just changing these constraints. In this paper, we discuss various possibilities of such changes, we prove some properties about the amount of over-approximations introduced by the new constraints, and provide some timings that document the resulting improvement.