Verification tools for linear hybrid automata

Goran FrehseCambridge 2009 · DOI · OpenAlex

Abstract

Linear hybrid automata are of interest in verification because sets of successor states can be computed exactly and efficiently using integer arithmetic. This fact is exploited in a number of formal verification algorithms that upon termination give a mathematically sound answer on whether a property holds or not. This chapter gives an overview of verification algorithms for safety properties of linear hybrid automata, and some of the over-approximation techniques that help to make the tools applicable in practice.
BibTeX
@inproceedings{frehse2009verification,
  author = {Goran Frehse},
  title = {{Verification tools for linear hybrid automata}},
  booktitle = {Cambridge},
  year = {2009},
  doi = {10.1017/cbo9780511807930.010},
}

Loading related content...

Figure