Automated compositional importance splitting
| Title | Automated compositional importance splitting |
| Publication Type | Journal Article |
| Year of Publication | 2019 |
| Authors | Budde, CE, D'Argenio, PR, Hartmanns, A |
| Journal | Science of Computer Programming |
| Volume | 174 |
| Pagination | 90–108 |
| Abstract | In the formal verification of stochastic systems, statistical model checking uses simulation to overcome the state space explosion problem of probabilistic model checking. Yet its runtime explodes when faced with rare events, unless a rare event simulation method like importance splitting is used. The effectiveness of importance splitting hinges on nontrivial model-specific inputs: an importance function with matching splitting thresholds. This prevents its use by non-experts for general classes of models. In this paper, we present an automated method to derive the importance function. It considers both the structure of the model and of the formula characterising the rare event. It is memory-efficient by exploiting the compositional nature of formal models. We experimentally evaluate it in various combinations with two approaches to threshold selection as well as different splitting techniques for steady-state and transient properties. We find that Restart splitting combined with thresholds determined via a new expected success method most reliably succeeds and performs very well for transient properties. It remains competitive in the steady-state case, which is however challenging to all combinations we consider. All methods are implemented in the modes tool of the Modest Toolset and in the Fig rare event simulator. |
| URL | https://doi.org/10.1016/j.scico.2019.01.006 |
| DOI | 10.1016/j.scico.2019.01.006 |
PDF (Full text):
