Symbolic state-space exploration meets statistical model checking

Niehage, Mathis; Remke, Anne

Zusammenfassung

Efficient reachability analysis, as well as statistical model checking have been proposed for the evaluation of Hybrid Petri nets with general transitions (HPnGs). Both have different (dis-)advantages. The performance of statistical simulation suffers in large models and the number of required simulation runs to achieve a relatively small confidence interval increases considerably. The approach introduced for analytical reachability analysis of HPnGs, however, becomes infeasible for a large number of random variables. To overcome these limitations, this paper applies statistical model checking (SMC) for a stochastic variant of the Signal Temporal Logic (STL) to a pre-computed symbolic state-space representation of HPnGs, i.e., the Parametric Location Tree (PLT), which has previously been used for model checking HPnGs. Furthermore, we define how to reduce the PLT for a given state-based and path-based STL property, by introducing a three-valued interpretation of a given STL property for every location of the PLT. This paper applies learning in the presence of nondeterminism and considers four different scheduler classes. The proposed improvement is especially useful if a large number of training runs is necessary to optimize the probability that a given STL property holds. A case study on a water tank model shows the feasibility of the approach, as well as improved computation times, when applying the above-mentioned reduction for varying time bounds. We validate our results with existing analytical and simulation tools, as applicable for different types of schedulers.