Assume-Guarantee Abstraction Refinement Meets Hybrid Systems

Assume-Guarantee Abstraction Refinement Meets Hybrid Systems

Compositional verification techniques in the assume- guarantee style have been successfully applied to transition systems to efficiently reduce the search space by leveraging the compositional nature of the systems under consideration. We adapt these techniques to the domain of hybrid systems with a...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Bogomolov, Sergiy, Frehse, Goran, Greitschus, Marius, Grosu, Radu, Pasareanu, Corina S., Podelski, Andreas, Strump, Thomas
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Computer Programming And Software
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Bogomolov, Sergiy
Frehse, Goran
Greitschus, Marius
Grosu, Radu
Pasareanu, Corina S.
Podelski, Andreas
Strump, Thomas
description Compositional verification techniques in the assume- guarantee style have been successfully applied to transition systems to efficiently reduce the search space by leveraging the compositional nature of the systems under consideration. We adapt these techniques to the domain of hybrid systems with affine dynamics. To build assumptions we introduce an abstraction based on location merging. We integrate the assume-guarantee style analysis with automatic abstraction refinement. We have implemented our approach in the symbolic hybrid model checker SpaceEx. The evaluation shows its practical potential. To the best of our knowledge, this is the first work combining assume-guarantee reasoning with automatic abstraction-refinement in the context of hybrid automata.
format Conference Proceeding
fullrecord <record><control><sourceid>nasa_CYI</sourceid><recordid>TN_cdi_nasa_ntrs_20150021848</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>20150021848</sourcerecordid><originalsourceid>FETCH-nasa_ntrs_201500218483</originalsourceid><addsrcrecordid>eNrjZLBxLC4uzU3VdS9NLErMK0lNVXBMKi4pSkwuyczPUwhKTcvMS81NzStR8E1NLSlW8KhMKspMUQiuLC5JzS3mYWBNS8wpTuWF0twMMm6uIc4eunmJxYnxeSVFxfFGBoamBgZGhhYmFsYEpAHzoivF</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Assume-Guarantee Abstraction Refinement Meets Hybrid Systems</title><source>NASA Technical Reports Server</source><creator>Bogomolov, Sergiy ; Frehse, Goran ; Greitschus, Marius ; Grosu, Radu ; Pasareanu, Corina S. ; Podelski, Andreas ; Strump, Thomas</creator><creatorcontrib>Bogomolov, Sergiy ; Frehse, Goran ; Greitschus, Marius ; Grosu, Radu ; Pasareanu, Corina S. ; Podelski, Andreas ; Strump, Thomas</creatorcontrib><description>Compositional verification techniques in the assume- guarantee style have been successfully applied to transition systems to efficiently reduce the search space by leveraging the compositional nature of the systems under consideration. We adapt these techniques to the domain of hybrid systems with affine dynamics. To build assumptions we introduce an abstraction based on location merging. We integrate the assume-guarantee style analysis with automatic abstraction refinement. We have implemented our approach in the symbolic hybrid model checker SpaceEx. The evaluation shows its practical potential. To the best of our knowledge, this is the first work combining assume-guarantee reasoning with automatic abstraction-refinement in the context of hybrid automata.</description><language>eng</language><publisher>Ames Research Center</publisher><subject>Computer Programming And Software</subject><creationdate>2014</creationdate><rights>Copyright Determination: PUBLIC_USE_PERMITTED</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>309,780,800</link.rule.ids><linktorsrc>$$Uhttps://ntrs.nasa.gov/citations/20150021848$$EView_record_in_NASA$$FView_record_in_$$GNASA$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Bogomolov, Sergiy</creatorcontrib><creatorcontrib>Frehse, Goran</creatorcontrib><creatorcontrib>Greitschus, Marius</creatorcontrib><creatorcontrib>Grosu, Radu</creatorcontrib><creatorcontrib>Pasareanu, Corina S.</creatorcontrib><creatorcontrib>Podelski, Andreas</creatorcontrib><creatorcontrib>Strump, Thomas</creatorcontrib><title>Assume-Guarantee Abstraction Refinement Meets Hybrid Systems</title><description>Compositional verification techniques in the assume- guarantee style have been successfully applied to transition systems to efficiently reduce the search space by leveraging the compositional nature of the systems under consideration. We adapt these techniques to the domain of hybrid systems with affine dynamics. To build assumptions we introduce an abstraction based on location merging. We integrate the assume-guarantee style analysis with automatic abstraction refinement. We have implemented our approach in the symbolic hybrid model checker SpaceEx. The evaluation shows its practical potential. To the best of our knowledge, this is the first work combining assume-guarantee reasoning with automatic abstraction-refinement in the context of hybrid automata.</description><subject>Computer Programming And Software</subject><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2014</creationdate><recordtype>conference_proceeding</recordtype><sourceid>CYI</sourceid><recordid>eNrjZLBxLC4uzU3VdS9NLErMK0lNVXBMKi4pSkwuyczPUwhKTcvMS81NzStR8E1NLSlW8KhMKspMUQiuLC5JzS3mYWBNS8wpTuWF0twMMm6uIc4eunmJxYnxeSVFxfFGBoamBgZGhhYmFsYEpAHzoivF</recordid><startdate>20141118</startdate><enddate>20141118</enddate><creator>Bogomolov, Sergiy</creator><creator>Frehse, Goran</creator><creator>Greitschus, Marius</creator><creator>Grosu, Radu</creator><creator>Pasareanu, Corina S.</creator><creator>Podelski, Andreas</creator><creator>Strump, Thomas</creator><scope>CYE</scope><scope>CYI</scope></search><sort><creationdate>20141118</creationdate><title>Assume-Guarantee Abstraction Refinement Meets Hybrid Systems</title><author>Bogomolov, Sergiy ; Frehse, Goran ; Greitschus, Marius ; Grosu, Radu ; Pasareanu, Corina S. ; Podelski, Andreas ; Strump, Thomas</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-nasa_ntrs_201500218483</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Computer Programming And Software</topic><toplevel>online_resources</toplevel><creatorcontrib>Bogomolov, Sergiy</creatorcontrib><creatorcontrib>Frehse, Goran</creatorcontrib><creatorcontrib>Greitschus, Marius</creatorcontrib><creatorcontrib>Grosu, Radu</creatorcontrib><creatorcontrib>Pasareanu, Corina S.</creatorcontrib><creatorcontrib>Podelski, Andreas</creatorcontrib><creatorcontrib>Strump, Thomas</creatorcontrib><collection>NASA Scientific and Technical Information</collection><collection>NASA Technical Reports Server</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Bogomolov, Sergiy</au><au>Frehse, Goran</au><au>Greitschus, Marius</au><au>Grosu, Radu</au><au>Pasareanu, Corina S.</au><au>Podelski, Andreas</au><au>Strump, Thomas</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Assume-Guarantee Abstraction Refinement Meets Hybrid Systems</atitle><date>2014-11-18</date><risdate>2014</risdate><abstract>Compositional verification techniques in the assume- guarantee style have been successfully applied to transition systems to efficiently reduce the search space by leveraging the compositional nature of the systems under consideration. We adapt these techniques to the domain of hybrid systems with affine dynamics. To build assumptions we introduce an abstraction based on location merging. We integrate the assume-guarantee style analysis with automatic abstraction refinement. We have implemented our approach in the symbolic hybrid model checker SpaceEx. The evaluation shows its practical potential. To the best of our knowledge, this is the first work combining assume-guarantee reasoning with automatic abstraction-refinement in the context of hybrid automata.</abstract><cop>Ames Research Center</cop><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_nasa_ntrs_20150021848
source NASA Technical Reports Server
subjects Computer Programming And Software
title Assume-Guarantee Abstraction Refinement Meets Hybrid Systems
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-24T15%3A18%3A03IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-nasa_CYI&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Assume-Guarantee%20Abstraction%20Refinement%20Meets%20Hybrid%20Systems&rft.au=Bogomolov,%20Sergiy&rft.date=2014-11-18&rft_id=info:doi/&rft_dat=%3Cnasa_CYI%3E20150021848%3C/nasa_CYI%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true