Linear hybrid system falsification through local search

Houssam Abbas, Georgios Fainekos

Research output: Chapter in Book/Report/Conference proceedingConference contribution

17 Scopus citations


In this paper, we address the problem of local search for the falsification of hybrid automata with affine dynamics. Namely, given a sequence of locations and a maximum simulation time, we return the trajectory that comes closest to the unsafe set. This problem is formulated as a differentiable optimization problem and solved. The purpose of developing such a local search method is to combine it with high level stochastic optimization algorithms in order to falsify hybrid systems with complex discrete dynamics and high dimensional continuous spaces. Experimental results indicate that the local search procedure improves upon the results of pure stochastic optimization algorithms.

Original languageEnglish (US)
Title of host publicationAutomated Technology for Verification and Analysis - 9th International Symposium, ATVA 2011, Proceedings
Number of pages8
StatePublished - 2011
Event9th International Symposium on Automated Technology for Verification and Analysis, ATVA 2011 - Taipei, Taiwan, Province of China
Duration: Oct 11 2011Oct 14 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6996 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other9th International Symposium on Automated Technology for Verification and Analysis, ATVA 2011
Country/TerritoryTaiwan, Province of China


  • Hybrid systems
  • Model Validation and Analysis
  • Robustness
  • Simulation

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Linear hybrid system falsification through local search'. Together they form a unique fingerprint.

Cite this