An Algorithmic Approach to Stability Verification of Hybrid Systems: A Summary

8 pages•Published: December 18, 2015

Pavithra Prabhakar and Miriam García Soto

Abstract

This paper summarizes results related to a novel algorithmic approach for verifying stability of hybrid systems. The traditional approach based on Lyapunov function search suffers from several disadvantages --- it relies on the user expertise to obtain good templates for the Lyapunov function; further, an unsuccessful attempt at instantiating the templates provides no insights into the choice of better templates. To overcome these difficulties, the algorithmic approach relies on an abstraction refinement framework which systematically searches for a proof and provides insights to the user in the event of a failure to prove stability. We summarize the new foundations, techniques and software tools that we have developed for the algorithmic approach to stability verification.

Keyphrases: abstraction refinement, hybrid system, model checking, quantitative abstractions, stability analysis

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

Links:	https://easychair.org/publications/paper/zpM
	https://doi.org/10.29007/sj95

BibTeX entry

@inproceedings{SNR2015:Algorithmic_Approach_Stability_Verification,
  author    = {Pavithra Prabhakar and Miriam García Soto},
  title     = {An Algorithmic Approach to Stability Verification of Hybrid Systems: A Summary},
  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},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/zpM},
  doi       = {10.29007/sj95},
  pages     = {32-39},
  year      = {2015}}

Download PDF Open PDF in browser