@inproceedings{615e5b962a50496cb8efbf9dcc843735,
title = "Constraints for continuous reachability in the verification of hybrid systems",
abstract = "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.",
author = "Stefan Ratschan and Zhikun She",
year = "2006",
doi = "10.1007/11856290\_18",
language = "英语",
isbn = "3540397280",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "196--210",
booktitle = "Artificial Intelligence and Symbolic Computation - 8th International Conference, AISC 2006, Proceedings",
address = "德国",
note = "8th International Conference on Artificial Intelligence and Symbolic Computation, AISC 2006 ; Conference date: 20-09-2006 Through 22-09-2006",
}