Assume-Guarantee Abstraction Refinement Meets Hybrid Systems

  • Sergiy Bogomolov
  • Goran Frehse
  • Marius Greitschus
  • Radu Grosu
  • Corina Pasareanu
  • Andreas Podelski
  • Thomas Strump
Conference paper

DOI: 10.1007/978-3-319-13338-6_10

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8855)
Cite this paper as:
Bogomolov S. et al. (2014) Assume-Guarantee Abstraction Refinement Meets Hybrid Systems. In: Yahav E. (eds) Hardware and Software: Verification and Testing. HVC 2014. Lecture Notes in Computer Science, vol 8855. Springer, Cham

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Sergiy Bogomolov
    • 1
  • Goran Frehse
    • 2
  • Marius Greitschus
    • 1
  • Radu Grosu
    • 3
  • Corina Pasareanu
    • 4
  • Andreas Podelski
    • 1
  • Thomas Strump
    • 1
  1. 1.University of FreiburgGermany
  2. 2.Université Joseph Fourier Grenoble 1 – VerimagFrance
  3. 3.Vienna University of TechnologyAustria
  4. 4.NASA Ames Research CenterUSA

Personalised recommendations