de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Decidability and complexity for the verification of safety properties of reasonable linear hybrid automata

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44669

Ihlemann,  Carsten
Automation of Logic, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45516

Sofronie-Stokkermans,  Viorica
Automation of Logic, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Damm, W., Ihlemann, C., & Sofronie-Stokkermans, V. (2011). Decidability and complexity for the verification of safety properties of reasonable linear hybrid automata. In E. Frazzoli, & R. Grosu (Eds.), HSCC’11: Proceedings of the 2011 ACM/SIGBED Hybrid Systems: Computation and Control (pp. 73-82). New York, NY: ACM.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0010-14EA-9
Abstract
We study linear hybrid automata with dynamics of the form $\sum a_i x_i \leq a$ and $\sum b_i {\dot x_i} \leq b$. We show that verification of safety properties for reasonable classes of such systems can be reduced to invariant checking and bounded model checking and, ultimately, to checking the validity of certain formulae (obtained using a polynomial reduction). We show that the problem of checking the validity of the formulae obtained this way is typically in NP, and identify verification tasks which can be performed in PTIME. These reductions can also be used for parametric systems, both for checking safety properties given constraints on parameters, and for deriving constraints of parameters that guarantee that safety properties hold.