Incremental Computation of Succinct Abstractions for Hybrid Systems

0365291 - ÚI 2012 RIV DE eng C - Conference Paper (international conference)
Dzetkulič, Tomáš - Ratschan, Stefan
Incremental Computation of Succinct Abstractions for Hybrid Systems.
Formal Modeling and Analysis of Timed Systems. Berlin: Springer, 2011 - (Fahrenberg, U.; Tripakis, s.), s. 271-285. Lecture Notes in Computer Science, 6919. ISBN 978-3-642-24309-7. ISSN 0302-9743.
[FORMATS 2011. International Conference on Formal Modeling and Analysis of Timed Systems /9./. Aalborg (DK), 21.09.2011-23.09.2011]
R&D Projects: GA ČR GC201/08/J020; GA ČR GD201/09/H057; GA MŠMT OC10048
Institutional research plan: CEZ:AV0Z10300504
Keywords : abstraction * incremental refinement * hybrid system * safety property
Subject RIV: IN - Informatics, Computer Science

In this paper, we introduce a new approach to computing abstractions for hybrid dynamical systems whose continuous behavior is governed by non-linear ordinary differential equations. The abstractions try to capture the reachability information relevant for a given safety property as succinctly as possible. This is achieved by an incremental refinement of the abstractions, simultaneously trying to avoid increases in their size as much as possible. The approach is independent of a concrete technique for computing reachability information, and can hence be combined with whatever technique suitable for the problem class at hand. We illustrate the usefulness of the technique with computational experiments.
Permanent Link: http://hdl.handle.net/11104/0200568