Počet záznamů: 1
Constraints for Continuous Reachability in the Verification of Hybrid Systems
- 1.
SYSNO ASEP 0339966 Druh ASEP C - Konferenční příspěvek (mezinárodní konf.) Zařazení RIV D - Článek ve sborníku Název Constraints for Continuous Reachability in the Verification of Hybrid Systems Tvůrce(i) Ratschan, Stefan (UIVT-O) SAI, RID, ORCID
She, Z. (DE)Zdroj.dok. Artificial Intelligence and Symbolic Computation. - Berlin : Springer, 2006 / Calmet J. ; Ida T. ; Wang D. - ISBN 3-540-39728-0 Rozsah stran s. 196-210 Poč.str. 15 s. Akce AISC 2006. International Conference on Artificial Intelligence and Symbolic Computation /8./ Datum konání 20.09.2006-22.09.2006 Místo konání Beijing Země CN - Čína Typ akce WRD Jazyk dok. eng - angličtina Země vyd. DE - Německo Klíč. slova hybrid systems ; verification ; constraint solving Vědní obor RIV BA - Obecná matematika CEZ AV0Z10300504 - UIVT-O (2005-2011) UT WOS 000242127700016 EID SCOPUS 33749619997 DOI 10.1007/11856290_18 Anotace 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. Pracoviště Ústav informatiky Kontakt Tereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800 Rok sběru 2010
Počet záznamů: 1