PARAM: A Model Checker for Parametric Markov Models

@inproceedings{Hahn2010PARAMAM,
  title={PARAM: A Model Checker for Parametric Markov Models},
  author={Ernst Moritz Hahn and Holger Hermanns and Bj{\"o}rn Wachter and Lijun Zhang},
  booktitle={CAV},
  year={2010}
}
We present PARAM 1.0, a model checker for parametric discrete-time Markov chains (PMCs) PARAM can evaluate temporal properties of PMCs and certain extensions of this class Due to parametricity, evaluation results are polynomials or rational functions By instantiating the parameters in the result function, one can cheaply obtain results for multiple individual instantiations, based on only a single more expensive analysis In addition, it is possible to post-process the result function… 
Verification and Synthesis for Parametric Markov Chains
TLDR
The algorithm extends an existing approach for model checking DTMCs and is implemented in the tool COMICS and developed its own data structure to simplify rational functions more efficiently.
Fast Parametric Model Checking through Model Fragmentation
Parametric model checking (PMC) computes algebraic formulae that express key non-functional properties of a system (reliability, performance, etc.) as rational functions of the system and environment
FACT: A Probabilistic Model Checker for Formal Verification with Confidence Intervals
TLDR
FACT is a probabilistic model checker that computes confidence intervals for the evaluated properties of Markov chains with unknown transition probabilities when observations of these transitions are available, and can prevent invalid decisions in the construction and analysis of systems.
Parameter Synthesis for Probabilistic Systems
TLDR
This work focuses on so-called parametric Markov chains, where the model checking goal is to compute rational functions, i.
Parametric Markov Chains: PCTL Complexity and Fraction-free Gaussian Elimination
TLDR
It is shown that existing implementations for computing rational functions for reachability probabilities or expected costs in parametric Markov chains can be improved by using fraction-free Gaussian elimination, a long-known technique for linear equation systems with parametric coefficients.
Parameter Synthesis for Parametric Interval Markov Chains
Interval Markov Chains IMCs are the base of a classic probabilistic specification theory introduced by Larsen and Jonsson in 1991. They are also a popular abstraction for probabilistic systems. In
Efficient Parametric Model Checking Using Domain-Specific Modelling Patterns
TLDR
This paper precompute closed-form expressions for key QoS properties of domain-specific modelling patterns for the software components, and handles system-level PMC by combining these expressions into easy-to-evaluate systems of equations.
Model reduction techniques for probabilistic verification of Markov chains
TLDR
Two new model reduction techniques to improve the efficiency and scalability of verifying probabilistic systems, focusing on discrete-time Markov chains (DTMCs) are proposed, with an emphasis on verifying quantitative properties that bound the time or cost of an execution.
Symblicit exploration and elimination for probabilistic model checking
TLDR
This paper presents a new "symblicit" approach to checking Markov chains and related probabilistic models: a decision diagram that symbolically collects all reachable states and their predecessors and eliminates few explicit states from the explicit state space in a way that preserves all relevant probabilities and rewards.
Probabilistic reachability for parametric Markov models
TLDR
It turns out that the bottleneck lies in the growth of the regular expression relative to the number of states (nΘ(log n), so the approach is to arrive at an effective method that avoids this blow up in most practical cases.
...
...

References

SHOWING 1-10 OF 16 REFERENCES
Symbolic and Parametric Model Checking of Discrete-Time Markov Chains
TLDR
A language-theoretic approach to symbolic model checking of PCTL over discrete-time Markov chains, which allows for parametric model checking by evaluating the regular expression for different parameter values, to study the influence of a lossy channel in the overall reliability of a randomized protocol.
Model checking the probabilistic pi-calculus
TLDR
An automated procedure for constructing the Markov decision process representing a probabilistic pi-calculus process is shown and how for a large class of systems a more efficient, compositional approach can be applied, which uses the extension of MMC on each parallel component of the system and then translates the results into a high-level model description for the PRISM tool.
Probabilistic reachability for parametric Markov models
TLDR
It turns out that the bottleneck lies in the growth of the regular expression relative to the number of states (nΘ(log n), so the approach is to arrive at an effective method that avoids this blow up in most practical cases.
PRISM: A Tool for Automatic Verification of Probabilistic Systems
TLDR
This paper presents an overview of all the main features of PRISM, a probabilistic model checking tool which has already been successfully deployed in a wide range of application domains, from real-time communication protocols to biological signalling pathways.
Parametric probabilistic transition systems for system design and analysis
We develop a model of parametric probabilistic transition Systems (PPTSs), where probabilities associated with transitions may be parameters. We show how to find instances of the parameters that
Signature-based Symbolic Algorithm for Optimal Markov Chain Lumping
  • Salem Derisavi
  • Computer Science, Mathematics
    Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007)
  • 2007
TLDR
This work presents a new signature-based algorithm for computing the optimal (i.e., smallest possible) quotient Markov chain, proves its correctness, and implements it symbolically for Markov chains represented as Multi-Terminal BDDs (MTBDDs).
Weak Bisimulation for Fully Probabilistic Processes
TLDR
This paper gives an algorithm to decide weak (and branching) bisimulation with a time complexity cubic in the number of states of the fully probabilistic system, and illustrates that due to these properties, weak bisimulations provides all the crucial ingredients for mechanised compositional veri�cation of Probabilistic transition systems.
Probabilistic Model Checking of an Anonymity System
TLDR
A demonstration of how certain forms of probabilistic anonymity degrade when group size increases or random routing paths are rebuilt, assuming that the corrupt group members are able to identify and/or correlate multiple routing paths originating from the same sender.
A Symbolic Algorithm for Optimal Markov Chain Lumping
TLDR
This work presents, for the first time, a symbolic algorithm and its implementation for the lumping of Markov chains that are represented using Multi-Terminal Binary Decision Diagrams and generates the smallest possible quotient Markov chain.
Probabilistic analysis of an anonymity system
TLDR
A demonstration of how certain forms of probabilistic anonymity degrade when group size increases or random routing paths are rebuilt, assuming that the corrupt group members are able to identify and/or correlate multiple routing paths originating from the same sender.
...
...