Probabilistic symbolic model checking with PRISM: a hybrid approach

@article{Kwiatkowska2004ProbabilisticSM,
  title={Probabilistic symbolic model checking with PRISM: a hybrid approach},
  author={M. Kwiatkowska and Gethin Norman and D. Parker},
  journal={International Journal on Software Tools for Technology Transfer},
  year={2004},
  volume={6},
  pages={128-142}
}
In this paper we present efficient symbolic techniques for probabilistic model checking. These have been implemented in PRISM, a tool for the analysis of probabilistic models such as discrete-time Markov chains, continuous-time Markov chains and Markov decision processes using specifications in the probabilistic temporal logics PCTL and CSL. Motivated by the success of model checkers such as SMV which use BDDs (binary decision diagrams), we have developed an implementation of PCTL and CSL model… 

Figures and Tables from this paper

Probabilistic Symbolic Model Checking with PRISM: A Hybrid Approach
TLDR
A novel hybrid technique which combines aspects of symbolic and explicit approaches to overcome performance problems in probabilistic model checking, and achieves a dramatic improvement over the purely symbolic approach.
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.
Implementation of symbolic model checking for probabilistic systems
TLDR
This thesis proposes a novel, hybrid approach, combining features of both symbolic and explicit implementations and shows that this technique can almost match the speed of sparse matrix based implementations, but uses significantly less memory.
Quantitative Analysis With the Probabilistic Model Checker PRISM
Advances in probabilistic model checking with PRISM: variable reordering, quantiles and weak deterministic Büchi automata
TLDR
This article provides support for automatic variable reordering within the symbolic engines of PRISM and allow users to manually control the variable ordering at a fine-grained level and provides extensions in the realm of reward-bounded properties.
Model-checking large structured Markov chains
Advances in Symbolic Probabilistic Model Checking with PRISM
TLDR
The popular probabilistic model checker PRISM is extended with support for automatic variable reordering in its multi-terminal-BDD-based engines and extensions additionally allow the user to manually control the variable ordering at a finer-grained level.
Approximate Probabilistic Model Checking
TLDR
An approximation method to verify quantitative properties on discrete Markov chains using a randomized algorithm to approximate the probability that a property expressed by some positive LTL formula is satisfied with high confidence by a probabilistic system.
Bounded probabilistic model checking with the murφ verifier
TLDR
The experimental results show that FHP-Murφ can effectively handle verification of BPCTL formulas for systems that are out of reach for PRISM, namely those involving arithmetic operations on the state variables (e.g. hybrid systems).
Diagnosis, Synthesis and Analysis of Probabilistic Models
  • Tingting Han
  • Computer Science, Mathematics
    Ausgezeichnete Informatikdissertationen
  • 2009
This dissertation considers three important aspects of model checking Markov models: diagnosis — generating counterexamples, synthesis — providing valid parameter values and analysis — verifying
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 76 REFERENCES
Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation
TLDR
An experimental model checker is implemented using the CUDD package and it is demonstrated that model construction and reachability-based model checking is possible in a matter of seconds for certain classes of systems consisting of up to 1030 states.
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.
Implementation of symbolic model checking for probabilistic systems
TLDR
This thesis proposes a novel, hybrid approach, combining features of both symbolic and explicit implementations and shows that this technique can almost match the speed of sparse matrix based implementations, but uses significantly less memory.
Faster and Symbolic CTMC Model Checking
TLDR
It is shown that all CSL operators can be treated using standard operations on MTBDDs, thus allowing a rather straightforward implementation of symbolic CSL model checking on existing MTBDD-based platforms such as the verifier PRISM.
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.
Symbolic Model Checking of Concurrent Probabilistic Systems Using MTBDDs and Simplex
TLDR
This paper considers models for concurrent probabilistic systems similar to those of [28, 7, 5] and the concurrent Markov chains of [35, 13], which extend the purely Probabilistic processes through the addition of nondeterministic choice.
Symbolic model checking: 10/sup 20/ states and beyond
TLDR
It is shown how the novel mu-calculus model checking algorithm can be used to derive efficient decision procedures for CTL model checking, satisfiability of linear-time temporal logic formulas, strong and weak observational equivalence of finite transition systems, and language containment of finite omega -automata.
ProbVerus: Probabilistic Symbolic Model Checking
TLDR
With ProbVerus, the tool is able to analyze, within minutes, the safety logic of a railway interlocking controller with 1027 states and is an implementation of probabilistic computation tree logic (PCTL) model checking using symbolic techniques.
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.
...
1
2
3
4
5
...