scispace - formally typeset
Open AccessBook ChapterDOI

Numerical vs. Statistical Probabilistic Model Checking: An Empirical Study ?

Reads0
Chats0
TLDR
This study relies on highly efficient sequential acceptance sampling tests, which enables statistical solution techniques to quickly return a result with some uncertainty in CSL model checking, and proposes a novel combination of the two solution techniques for verifying CSL queries with nested probabilistic operators.
Abstract
Numerical analysis based on uniformisation and statistical techniques based on sampling and simulation are two distinct approaches for transient analysis of stochastic systems. We compare the two solution techniques when applied to the verification of time-bounded until formulae in the temporal stochastic logic CSL. This study differs from most previous comparisons of numerical and statistical approaches in that CSL model checking is a hypothesis testing problem rather than a parameter estimation problem. We can therefore rely on highly efficient sequential acceptance sampling tests, which enables statistical solution techniques to quickly return a result with some uncertainty. This suggests that statistical techniques can be useful as a first resort during system prototyping, rather than as a last resort as often suggested. We also propose a novel combination of the two solution techniques for verifying CSL queries with nested probabilistic operators.

read more

Content maybe subject to copyright    Report

Citations
More filters
Book ChapterDOI

Statistical model checking of black-box probabilistic systems

TL;DR: In this article, the authors propose a new statistical approach to analyze stochastic systems against specifications given in a sublogic of CSL, where the system under investigation is an unknown, deployed black-box that can be passively observed to obtain sample traces, but cannot be controlled.
Book ChapterDOI

On statistical model checking of stochastic systems

TL;DR: A statistical model checking algorithm that also verifies CSL formulas with unbounded untils, based on Monte Carlo simulation of the model and hypothesis testing of the samples, as opposed to sequential hypothesis testing is presented.
Journal Article

Statistical model checking of black-box probabilistic systems

TL;DR: In this article, the authors propose a new statistical approach to analyze stochastic systems against specifications given in a sublogic of CSL, where the system under investigation is an unknown, deployed black-box that can be passively observed to obtain sample traces, but cannot be controlled.

Verification and planning for stochastic processes with asynchronous events

TL;DR: It is demonstrated that the introduction of phases permits us to take history into account when making action choices, and this can result in policies of higher quality than the authors would get if they ignored history dependence.
Proceedings ArticleDOI

Specification patterns for probabilistic quality properties

TL;DR: This paper presents a specification pattern system of common probabilistic properties called ProProST, developed based on a survey of 152 properties from academic examples and 48 properties of real-word quality requirements from avionic, defence and automotive systems and a structured English grammar that can guide in the specification of probabilism properties is given.
References
More filters
Journal ArticleDOI

Graph-Based Algorithms for Boolean Function Manipulation

TL;DR: In this paper, the authors present a data structure for representing Boolean functions and an associated set of manipulation algorithms, which have time complexity proportional to the sizes of the graphs being operated on, and hence are quite efficient as long as the graphs do not grow too large.
Book ChapterDOI

A Temporal Logic of Nested Calls and Returns

TL;DR: This work introduces a temporal logic of calls and returns (CaRet) for specification and algorithmic verification of correctness requirements of structured programs and presents a tableau construction that reduces the model checking problem to the emptiness problem for a Buchi pushdown system.
Book ChapterDOI

Sequential Tests of Statistical Hypotheses

TL;DR: A sequential test of a statistical hypothesis is defined as any statistical test procedure which gives a specific rule, at any stage of the experiment (at the n-th trial for each integral value of n), for making one of the following three decisions: (1) to accept the hypothesis being tested (null hypothesis), (2) to reject the null hypothesis, (3) to continue the experiment by making an additional observation.
Journal ArticleDOI

Model-checking algorithms for continuous-time Markov chains

TL;DR: The problem of model-checking time-bounded until properties can be reduced to the problem of computing transient state probabilities for CTMCs and a variant of lumping equivalence (bisimulation) preserves the validity of all formulas in the logic.
Related Papers (5)