### Abstract

Original language | English |
---|---|

Title of host publication | Proceedings of the 5th International NASA Formal Methods Symposium (NFM 2013) |

Editors | Guillaume Brat, Neha Rungta, Arnaud Venet |

Place of Publication | Berlin, Heidelberg |

Publisher | Springer |

Pages | 337-351 |

Number of pages | 15 |

ISBN (Electronic) | 978-3-642-38088-4 |

ISBN (Print) | 978-3-642-38087-7 |

DOIs | |

Publication status | Published - 2013 |

### Publication series

Name | Lecture Notes in Computer Science |
---|---|

Publisher | Springer |

Volume | 7871 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Fingerprint

### Cite this

*Proceedings of the 5th International NASA Formal Methods Symposium (NFM 2013)*(pp. 337-351). (Lecture Notes in Computer Science; Vol. 7871). Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-642-38088-4_23

}

*Proceedings of the 5th International NASA Formal Methods Symposium (NFM 2013).*Lecture Notes in Computer Science, vol. 7871, Springer, Berlin, Heidelberg, pp. 337-351. https://doi.org/10.1007/978-3-642-38088-4_23

**On-the-Fly Confluence Detection for Statistical Model Checking.** / Hartmanns, Arnd ; Timmer, Mark .

Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

TY - CHAP

T1 - On-the-Fly Confluence Detection for Statistical Model Checking

AU - Hartmanns, Arnd

AU - Timmer, Mark

PY - 2013

Y1 - 2013

N2 - Statistical model checking is an analysis method that circumvents the state space explosion problem in model-based verification by combining probabilistic simulation with statistical methods that provide clear error bounds. As a simulation-based technique, it can only provide sound results if the underlying model is a stochastic process. In verification, however, models are usually variations of nondeterministic transition systems. The notion of confluence allows the reduction of such transition systems in classical model checking by removing spurious nondeterministic choices. In this paper, we show that confluence can be adapted to detect and discard such choices on-the-fly during simulation, thus extending the applicability of statistical model checking to a subclass of Markov decision processes. In contrast to previous approaches that use partial order reduction, the confluence-based technique can handle additional kinds of nondeterminism. In particular, it is not restricted to interleavings. We evaluate our approach, which is implemented as part of the modes simulator for the Modest modelling language, on a set of examples that highlight its strengths and limitations and show the improvements compared to the partial order-based method.

AB - Statistical model checking is an analysis method that circumvents the state space explosion problem in model-based verification by combining probabilistic simulation with statistical methods that provide clear error bounds. As a simulation-based technique, it can only provide sound results if the underlying model is a stochastic process. In verification, however, models are usually variations of nondeterministic transition systems. The notion of confluence allows the reduction of such transition systems in classical model checking by removing spurious nondeterministic choices. In this paper, we show that confluence can be adapted to detect and discard such choices on-the-fly during simulation, thus extending the applicability of statistical model checking to a subclass of Markov decision processes. In contrast to previous approaches that use partial order reduction, the confluence-based technique can handle additional kinds of nondeterminism. In particular, it is not restricted to interleavings. We evaluate our approach, which is implemented as part of the modes simulator for the Modest modelling language, on a set of examples that highlight its strengths and limitations and show the improvements compared to the partial order-based method.

U2 - 10.1007/978-3-642-38088-4_23

DO - 10.1007/978-3-642-38088-4_23

M3 - Chapter

SN - 978-3-642-38087-7

T3 - Lecture Notes in Computer Science

SP - 337

EP - 351

BT - Proceedings of the 5th International NASA Formal Methods Symposium (NFM 2013)

A2 - Brat, Guillaume

A2 - Rungta, Neha

A2 - Venet, Arnaud

PB - Springer

CY - Berlin, Heidelberg

ER -