Constraints for Continuous Reachability in the Verification of Hybrid Systems

0339966 - ÚI 2010 RIV DE eng C - Konferenční příspěvek (zahraniční konf.)
Ratschan, Stefan - She, Z.
Constraints for Continuous Reachability in the Verification of Hybrid Systems.
Artificial Intelligence and Symbolic Computation. Berlin: Springer, 2006 - (Calmet, J.; Ida, T.; Wang, D.), s. 196-210. Lecture Notes in Artificial Intelligence, 4120. ISBN 3-540-39728-0.
[AISC 2006. International Conference on Artificial Intelligence and Symbolic Computation /8./. Beijing (CN), 20.09.2006-22.09.2006]
Grant ostatní: AVACS(DE) SFB/TR 14 AVACS
Výzkumný záměr: CEZ:AV0Z10300504
Klíčová slova: hybrid systems * verification * constraint solving
Kód oboru RIV: BA - Obecná matematika

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.
Trvalý link: http://hdl.handle.net/11104/0183323