Constraints for Continuous Reachability in the Verification of Hybrid Systems

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F06%3A00339966" target="_blank" >RIV/67985807:_____/06:00339966 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Constraints for Continuous Reachability in the Verification of Hybrid Systems

Original language description

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 usingconstraints 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.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2006

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Artificial Intelligence and Symbolic Computation

ISBN

3-540-39728-0

ISSN

—

e-ISSN

—

Number of pages

15

Pages from-to

—

Publisher name

Springer

Place of publication

Berlin

Event location

Beijing

Event date

Sep 20, 2006

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

000242127700016