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

Item

ITEM ACTIONSEXPORT

Released

Journal Article

PTIME parametric verification of safety properties for 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). PTIME parametric verification of safety properties for reasonable linear hybrid automata. Mathematics in Computer Science, 5(4), 469-497. doi:10.1007/s11786-011-0098-x.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0010-14F3-4
Abstract
This paper identifies an industrially relevant class of linear hybrid automata (LHA) called reasonable LHA for which parametric verification of convex safety properties with exhaustive entry states can be verified in polynomial time and time-bounded reachability can be decided in nondeterministic polynomial time for non-parametric verification and in exponential time for parametric verification. Properties with exhaustive entry states are restricted to runs originating in a (specified) inner envelope of some mode-invariant. Deciding whether an LHA is reasonable is shown to be decidable in polynomial time.