On Statistical Model Checking of Stochastic Systems

@inproceedings{Sen2005OnSM,
  title={On Statistical Model Checking of Stochastic Systems},
  author={Koushik Sen and Mahesh Viswanathan and Gul A. Agha},
  booktitle={CAV},
  year={2005}
}
Statistical methods to model check stochastic systems have been, thus far, developed only for a sublogic of continuous stochastic logic (CSL) that does not have steady state operator and unbounded until formulas. In this paper, we present a statistical model checking algorithm that also verifies CSL formulas with unbounded untils. The algorithm is based on Monte Carlo simulation of the model and hypothesis testing of the samples, as opposed to sequential hypothesis testing. We have implemented… Expand
Statistical probabilistic model checking with a focus on time-bounded properties
TLDR
This work presents a statistical approach to probabilistic model checking, employing hypothesis testing and discrete-event simulation, and can at least bound the probability of generating an incorrect answer to a verification problem. Expand
Statistical Model Checking for SystemC Models
TLDR
This paper demonstrates the successful use of statistical model checking to carry out analysis of the probability of the system properties directly from large SystemC models and allows designers to express a wide range of useful properties. Expand
Statistical Model Checking: An Overview
TLDR
This tutorial surveys the statistical approach to model checking, and outlines its main advantages in terms of efficiency, uniformity, and simplicity. Expand
Simulation + Hypothesis Testing for Model Checking Probabilistic Systems A Tutorial
Quantitative properties of stochastic systems are usually specified in logics that allow one to compare the measure of executions satisfying certain temporal properties with thresholds. The modelExpand
Faster Statistical Model Checking for Unbounded Temporal Properties
TLDR
A new algorithm for the statistical model checking of Markov chains with respect to unbounded temporal properties, including full linear temporal logic, which is not only faster in many cases but also requires less information about the system, namely, only the minimum transition probability that occurs in the Markov chain. Expand
Faster Statistical Model Checking for Unbounded Temporal Properties
TLDR
A new algorithm for the statistical model checking of Markov chains with respect to unbounded temporal properties, including full linear temporal logic, which is not only faster in many cases but also requires less information about the system, namely, only the minimum transition probability that occurs in the Markov chain. Expand
Bayesian statistical model checking with application to Stateflow/Simulink verification
TLDR
It is proved that Bayesian SMC can make the probability of giving a wrong answer arbitrarily small, which is essential for scaling up to large Stateflow/Simulink models. Expand
The Bouquet Algorithm for Model Checking Unbounded Until Properties
  • Shiraj Arora, M. P. Rao
  • Computer Science
  • 2020 International Symposium on Theoretical Aspects of Software Engineering (TASE)
  • 2020
TLDR
An algorithm is discussed for verifying the “Unbounded Until” fragment in temporal logic formulas that combines ideas from graph theory, statistical model checking and numerical model checking, and it is shown that this approach outperforms the standard statistical model Checking algorithm for verifying unbounded until for low density Discrete Time Markov Chains. Expand
Statistical Model Checking Approach for Stationary Dependability Verication
TLDR
This work proposes to perform statistical probabilistic model checking by using perfect simulation in order to verify steady-state and unbounded until formulas over Markov chains by combining perfect simulation and statistical hypothesis testing. Expand
Dynamic Verification of SystemC with Statistical Model Checking
TLDR
This work proposes a verification framework based on Statistical Model Checking that is able to evaluate probabilistic and temporal properties on large systems modelled in SystemC, a standard system-level modelling language. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 28 REFERENCES
Statistical Model Checking of Black-Box Probabilistic Systems
TLDR
The authors' algorithm checks, based on statistical hypothesis testing, whether the sample provides evidence to conclude the satisfaction or violation of a property, and computes a quantitative measure (p-value of the tests) of confidence in its answer, and may, at least in some cases, be faster than previous analysis methods. Expand
Numerical vs. Statistical Probabilistic Model Checking: An Empirical Study
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. Expand
Probabilistic Verification of Discrete Event Systems Using Acceptance Sampling
TLDR
A model independent procedure for verifying properties of discrete event systems based on Monte Carlo simulation and statistical hypothesis testing that is probabilistic in two senses and carried out in an anytime manner. Expand
Approximate Symbolic Model Checking of Continuous-Time Markov Chains
TLDR
A symbolic approximate method for solving the integrals using MTDDs (multi-terminal decision diagrams), a generalisation of MTBDDs, suitable for numerical integration using quadrature formulas based on equally-spaced abscissas, like trapezoidal, Simpson and Romberg integration schemes. Expand
Beyond Memoryless Distributions: Model Checking Semi-Markov Chains
TLDR
This paper investigates model checking of semi-Markov chains, a model in which state holding times are governed by general distributions, and reports on the semantical issues of adopting CSL for specifying properties of SMCs and presents model checking algorithms for this logic. Expand
Model-Checking for Probabilistic Real-Time Systems (Extended Abstract)
TLDR
This paper extends model-checking to stochastic real-time systems, whose behavior depends on probabilistic choice and quantitative time, with a model that can express constraints like “the delay between the request and the response is distributed uniformly between 2 to 4 seconds”. Expand
Symbolic Model Checking for Probabilistic Processes
TLDR
A symbolic model checking procedure for Probabilistic Computation Tree Logic PCTL over labelled Markov chains as models is introduced, based on the algorithm used by Hansson and Jonsson [24], and is efficient because it avoids explicit state space construction. Expand
A Markov Chain Model Checker
TLDR
A prototype model checker for discrete and continuous-time Markov chains, the Erlangen-Twente Markov Chain Checker (E ⊢ MC2), where properties are expressed in appropriate extensions of CTL, is described. Expand
PRISM: Probabilistic Symbolic Model Checker
TLDR
PRISM has been successfully used to analyse probabilistic termination, performance, and quality of service properties for a range of systems, including randomized distributed algorithms, manufacturing systems and workstation clusters. Expand
The complexity of probabilistic verification
TLDR
This work determines the complexity of testing whether a finite state, sequential or concurrent probabilistic program satisfies its specification expressed in linear-time temporal logic and addresses questions for specifications described by ω-automata or formulas in extended temporal logic. Expand
...
1
2
3
...