Linear hybrid system falsification through local search

Houssam Abbas, Georgios Fainekos

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

13 Citations (Scopus)

Abstract

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 publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages503-510
Number of pages8
Volume6996 LNCS
DOIs
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)03029743
ISSN (Electronic)16113349

Other

Other9th International Symposium on Automated Technology for Verification and Analysis, ATVA 2011
CountryTaiwan, Province of China
CityTaipei
Period10/11/1110/14/11

Fingerprint

Hybrid systems
Hybrid Systems
Local Search
Linear Systems
Stochastic Algorithms
Stochastic Optimization
Optimization Algorithm
Hybrid Automata
Return Time
Discrete Dynamics
Complex Dynamics
Search Methods
Differentiable
High-dimensional
Trajectories
Trajectory
Optimization Problem
Experimental Results
Simulation

Keywords

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

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Abbas, H., & Fainekos, G. (2011). Linear hybrid system falsification through local search. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6996 LNCS, pp. 503-510). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6996 LNCS). https://doi.org/10.1007/978-3-642-24372-1_39

Linear hybrid system falsification through local search. / Abbas, Houssam; Fainekos, Georgios.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6996 LNCS 2011. p. 503-510 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6996 LNCS).

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

Abbas, H & Fainekos, G 2011, Linear hybrid system falsification through local search. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 6996 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6996 LNCS, pp. 503-510, 9th International Symposium on Automated Technology for Verification and Analysis, ATVA 2011, Taipei, Taiwan, Province of China, 10/11/11. https://doi.org/10.1007/978-3-642-24372-1_39
Abbas H, Fainekos G. Linear hybrid system falsification through local search. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6996 LNCS. 2011. p. 503-510. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-24372-1_39
Abbas, Houssam ; Fainekos, Georgios. / Linear hybrid system falsification through local search. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6996 LNCS 2011. pp. 503-510 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{71bdcd4d21d048188794ad5c7ed10bd8,
title = "Linear hybrid system falsification through local search",
abstract = "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.",
keywords = "Hybrid systems, Model Validation and Analysis, Robustness, Simulation",
author = "Houssam Abbas and Georgios Fainekos",
year = "2011",
doi = "10.1007/978-3-642-24372-1_39",
language = "English (US)",
isbn = "9783642243714",
volume = "6996 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "503--510",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Linear hybrid system falsification through local search

AU - Abbas, Houssam

AU - Fainekos, Georgios

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

KW - Hybrid systems

KW - Model Validation and Analysis

KW - Robustness

KW - Simulation

UR - http://www.scopus.com/inward/record.url?scp=80054086526&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80054086526&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-24372-1_39

DO - 10.1007/978-3-642-24372-1_39

M3 - Conference contribution

SN - 9783642243714

VL - 6996 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 503

EP - 510

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -