Download PDFOpen PDF in browser

Symbolic-Numeric Reachability Analysis of Hybrid Systems

1 pagesPublished: December 18, 2015

Abstract

We consider the problem of reachability analysis in hybrid systems defined by the closed-loop interaction of a complex, continuous time plant model with a software-based controller. In practice, the plant model is, often, a coarse approximation of the real-world operating environment of the software, whereas the software itself is the artifact that ends up being deployed in the final system. In this talk, we summarize the state-of-the-art techniques for purely symbolic and purely numeric approaches to reachability analysis of hybrid systems. We make the case for approaches that combine simulation-based exploration of the plant state-space with a corresponding symbolic exploration of the controller. We propose a simple yet elegant method to carry out this joint symbolic-numeric exploration based on an abstraction of the plant model, and present promising experimental results on software-in-the-loop setups that are beyond the scope of many existing verification tools.

In: Sergiy Bogomolov and Ashish Tiwari (editors). Symbolic and Numerical Methods for Reachability Analysis, 1st International Workshop, SNR 2015, vol 37, pages 1--1

Links:
BibTeX entry
@inproceedings{SNR2015:Symbolic_Numeric_Reachability_Analysis_of,
  author    = {Sriram Sankaranarayanan},
  title     = {Symbolic-Numeric Reachability Analysis of Hybrid Systems},
  booktitle = {Symbolic and Numerical Methods for Reachability Analysis, 1st International Workshop, SNR 2015},
  editor    = {Sergiy Bogomolov and Ashish Tiwari},
  series    = {EPiC Series in Computing},
  volume    = {37},
  pages     = {1},
  year      = {2015},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {https://easychair.org/publications/paper/xbq8},
  doi       = {10.29007/249v}}
Download PDFOpen PDF in browser