English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Safety Verification of Hybrid Systems by Constraint Propagation Based Abstraction Refinement

MPS-Authors
/persons/resource/persons45262

Ratschan,  Stefan
Programming Logics, MPI for Informatics, Max Planck Society;

/persons/resource/persons45471

She,  Zhikun
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Ratschan, S., & She, Z. (2005). Safety Verification of Hybrid Systems by Constraint Propagation Based Abstraction Refinement. In Hybrid Systems: Computation and Control: 8th International Workshop, HSCC 2005 (pp. 573-589). Berlin, Germany: Springer.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-279C-5
Abstract
This paper deals with the problem of safety verification of non-linear hybrid systems. We start from a classical method that uses interval arithmetic to check whether trajectories can move over the boundaries in a rectangular grid. We put this method into an abstraction refinement framework and improve it by developing an additional refinement step that employs constraint propagation to add information to the abstraction without introducing new grid elements. Moreover, the resulting method allows switching conditions, initial states and unsafe states to be described by complex constraints instead of sets that correspond to grid elements. Nevertheless, the method can be easily implemented since it is based on a well-defined set of constraints, on which one can run any constraint propagation based solver. First tests of such an implementation are promising.