MPI-INF Logo
Publications

Server    halma.mpi-inf.mpg.de

Proceedings Article, Paper


@InProceedings
Beitrag in Tagungsband, Workshop
Author, Editor
Author(s):
Ratschan, Stefan
She, Zhikun		dblp
dblp
Editor(s):
Calmet, Jacques
Ida, Tetsuo
Wang, Dongming		dblp
dblp
dblp
Not MPII Editor(s):
Calmet, Jacques
Ida, Tetsuo
Wang, Dongming
BibTeX cite key*:
She2005
Title, Booktitle
Title*:
Constraints for Continuous Reachability in the Verification of Hybrid Systems
Booktitle*:
Artificial Intelligence and Symbolic Computation, 8th International Conference, AISC 2006
Event, URLs
Conference URL::
Downloading URL:
http://www.springerlink.com/content/8g8284x84g74r205/fulltext.pdf
Event Address*:
Beijing, China
Language:
English
Event Date*
(no longer used):
Organization:
Event Start Date:
20 September 2006
Event End Date:
22 September 2006
Publisher
Name*:
Springer
URL:
Address*:
Berlin, Germany
Type:
Vol, No, Year, pp.
Series:
Lecture Notes in Artificial Intelligence
Volume:
4120
Number:
Month:
September
Pages:
196-210
Year*:
2006
VG Wort Pages:
ISBN/ISSN:
978-3-540-39728-1;
3-540-39728-0
Sequence Number:
DOI:
Note, Abstract, ©
Note:

This work was partly supported by the German Research Council (DFG) as part of the Transregional Collaborative Research Center "Automatic Verification and Analysis of Complex Systems" (SFB/TR 14 AVACS). See www.avacs.org for more information.
(LaTeX) Abstract:

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.
URL for the Abstract:
http://dx.doi.org/10.1007/11856290_18
Download
Access Level:
Public

Correlation
MPG Unit:
Max-Planck-Institut für Informatik
MPG Subunit:
Programming Logics Group
Appearance:
MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, CCL bibliography, VG Wort



BibTeX Entry:
@INPROCEEDINGS{She2005,
AUTHOR = {Ratschan, Stefan and She, Zhikun},
 EDITOR = {Calmet, Jacques and Ida, Tetsuo and Wang, Dongming},
 TITLE = {Constraints for Continuous Reachability in the Verification of Hybrid Systems},
 BOOKTITLE = {Artificial Intelligence and Symbolic Computation, 8th International Conference, AISC 2006},
 PUBLISHER = {Springer},
 YEAR = {2006},
 VOLUME = {4120},
 PAGES = {196--210},
 SERIES = {Lecture Notes in Artificial Intelligence},
 ADDRESS = {Beijing, China},
 MONTH = {September},
 ISBN = {978-3-540-39728-1},
; ISBN = {
3-540-39728-0},
 NOTE = {This work was partly supported by the German Research Council (DFG) as part of the Transregional Collaborative Research Center "Automatic Verification and Analysis of Complex Systems" (SFB/TR 14 AVACS). See www.avacs.org for more information.},
}

Entry last modified by Uwe Brahm, 01/28/2008
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Zhikun She		Created
11/22/2006 12:15:07 PM
Revisions
5.
4.
3.
2.
1.		Editor(s)
Uwe Brahm
Christine Kiesel
Zhikun She
Zhikun She
Zhikun She		Edit Dates
2007-04-20 15:03:30
16.02.2007 23:18:18
11/22/2006 12:39:56 PM
11/22/2006 12:17:54 PM
11/22/2006 12:16:59 PM