Partial Order Methods for Statistical Model Checking and Simulation - Archive ouverte HAL Access content directly
Conference Papers Year : 2011

Partial Order Methods for Statistical Model Checking and Simulation

(1) , (1) , (1) , (1)


Statistical model checking has become a promising technique to circumvent the state space explosion problem in model-based verification. It trades time for memory, via a probabilistic simulation and exploration of the model behaviour—often combined with effective a posteriori hypothesis testing. However, as a simulation-based approach, it can only provide sound verification results if the underlying model is a stochastic process. This drastically limits its applicability in verification, where most models are indeed variations of nondeterministic transition systems. In this paper, we describe a sound extension of statistical model checking to scenarios where nondeterminism is present. We focus on probabilistic automata, and discuss how partial order reduction can be twisted such as to apply statistical model checking to models with spurious nondeterminism. We report on an implementation of this technique and on promising results in the context of verification and dependability analysis of distributed systems.
Fichier principal
Vignette du fichier
978-3-642-21461-5_4_Chapter.pdf (166.44 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01583327 , version 1 (07-09-2017)


Attribution - CC BY 4.0



Jonathan Bogdoll, Luis María Ferrer Fioriti, Arnd Hartmanns, Holger Hermanns. Partial Order Methods for Statistical Model Checking and Simulation. 13th Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS) / 31th International Conference on FORmal TEchniques for Networked and Distributed Systems (FORTE), Jun 2011, Reykjavik,, Iceland. pp.59-74, ⟨10.1007/978-3-642-21461-5_4⟩. ⟨hal-01583327⟩
412 View
154 Download



Gmail Facebook Twitter LinkedIn More