Model Checking the Quantitative μ-Calculus on Linear Hybrid Systems

Abstract

AbstractIn this work, we consider the model-checking problem for a quantitative extension of the modal μ-calculus on a class of hybrid systems. Qualitative model checking has been proved decidable and implemented for several classes of systems, but this is not the case for quantitative questions, which arise naturally in this context. Recently, quantitative formalisms that subsume classical temporal logics and additionally allow to measure interesting quantitative phenomena were introduced. We show how a powerful quantitative logic, the quantitative μ-calculus, can be model-checked with arbitrary precision on initialised linear hybrid systems. To this end, we develop new techniques for the discretisation of continuous state spaces based on a special class of strategies in model-checking games and show decidability of a class of counter-reset games that may be of independent interest.KeywordsModel CheckHybrid SystemDiscrete StrategyHybrid AutomatonArbitrary PrecisionThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.