The ins and outs of the probabilistic model checker MRMC

Katoen, Joost-Pieter; Zapreev, Ivan S.; Hahn, Ernst Moritz; Hermanns, Holger; Jansen, David N.

doi:10.1016/j.peva.2010.04.001

Cited by 195 publications

(102 citation statements)

References 42 publications

Supporting

Mentioning

102

Contrasting

Order By: Relevance

“…In particular, most transient properties can be reduced to the form of the probabilistic interval until operator, which specifies a bound on the probability that the model will be in a goal state at some time in the interval [α, β] after having visited only legal states. A large body of techniques and tools have been developed and demonstrated on industrial case studies following either a statistical [2], [3], [4], [5] or numerical [6], [7], [8], [9] approach.…”

Section: Introductionmentioning

confidence: 99%

Probabilistic Model Checking of Regenerative Concurrent Systems

Paolieri

Horváth

Vicario

2016

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

Abstract-We consider the problem of verifying quantitative reachability properties in stochastic models of concurrent activities with generally distributed durations. Models are specified as Stochastic Time Petri Nets (STPNs) and checked against Boolean combinations of interval until operators imposing bounds on the probability that the marking process will satisfy a goal condition at some time in the interval [α, β] after an execution that never violates a safety property. The proposed solution is based on the analysis of regeneration points in the model execution: a regeneration is encountered after a discrete event if the future evolution depends only on the current marking and not on its previous history, thus satisfying the Markov property. We analyze systems in which multiple generally distributed timers can be started or stopped independently, but regeneration points are always encountered with probability 1 after a bounded number of discrete events. Leveraging the properties of regeneration points in probability spaces of execution paths, we show that the problem can be reduced to a set of Volterra integral equations, and we provide algorithms to compute their parameters through the enumeration of finite sequences of stochastic state classes encoding the joint probability density function (PDF) of generally distributed timers after each discrete event. The computation of symbolic PDFs is limited to the first regeneration epoch, and the repetitive structure of the stochastic process is exploited also before the lower bound α, providing crucial benefits for large time bounds. A case study is presented through the probabilistic formulation of Fischer's mutual exclusion protocol, a well-known real-time verification benchmark.

show abstract

Section: Introductionmentioning

confidence: 99%

Probabilistic Model Checking of Regenerative Concurrent Systems

Paolieri

Horváth

Vicario

2016

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

show abstract

“…An alternative for reducing transition systems is to use an analogue of the approach in Katoen et al (2011): first perform a fast symmetry reduction based on the method in Kwiatkowska et al (2006), then construct a quotient of the resulting transition system using bisimulation equivalence by applying the time-optimal partition refinement algorithm in Derisavi et al (2003) to the state space of this system. As mentioned in Katoen et al (2011), minimisation by bisimulation in a number of case studies results in a more significant state space reduction than symmetry reduction, but the latter is much faster than the former since symmetries are determined on a syntactical level.…”

Section: The Preservation Of Performance and The Simplification Of Itmentioning

confidence: 99%

Equivalence relations for modular performance evaluation in dtsPBC

Tarasyuk

2013

Math. Struct. Comp. Sci.

View full text Add to dashboard Cite

We define a number of stochastic equivalences in the dtsPBC framework, which is a discrete time stochastic extension of finite Petri box calculus (PBC) enriched with iteration. These equivalences allow the identification of stochastic processes that have similar behaviour but are differentiated by the semantics of the calculus. We explain how the equivalences we propose can be used to reduce transition systems of expressions, and demonstrate how to apply the equivalences to compare the stationary behaviour. The equivalences guarantee a coincidence of performance indices for stochastic systems, and can be used for performance analysis simplification. We use a case study to outline a method of modelling, performance evaluation and behaviour preserving reduction of concurrent computing systems, and apply it to the dining philosophers system.

show abstract

“…() Timed automata with mature verification tools such as UPPAAL are used to verify real‐time systems. For a variety of probabilistic systems, the most popular modeling formalism is Markov chain or Markov decision processes, for which Probabilistic model checking (PMC) tools such as PRISM and MRMC can be used. Probabilistic model checking is widely used and has been successfully applied to the verification of a range of timed and probabilistic systems.…”

Section: Introductionmentioning

confidence: 99%

Formal verification of probabilistic SystemC models with statistical model checking

Ngo

Legay

2017

J Software Evolu Process

View full text Add to dashboard Cite

SUMMARYTransaction-level modeling with SystemC has been very successful in describing the behavior of embedded systems by providing high-level executable models, in which many of them have inherent probabilistic behaviors, e.g., random data and unreliable components. It thus is crucial to have both quantitative and qualitative analysis of the probabilities of system properties. Such analysis can be conducted by constructing a formal model of the system under verification and using Probabilistic Model Checking (PMC). However, this method is infeasible for large systems, due to the state space explosion. In this article, we demonstrate the successful use of Statistical Model Checking (SMC) to carry out such analysis directly from large SystemC models and allow designers to express a wide range of useful properties. The first contribution of this work is a framework to verify properties expressed in Bounded Linear Temporal Logic (BLTL) for SystemC models with both timed and probabilistic characteristics. Second, the framework allows users to expose a rich set of user-code primitives as atomic propositions in BLTL. Moreover, users can define their own fine-grained time resolution rather than the boundary of clock cycles in the SystemC simulation. The third contribution is an implementation of a statistical model checker. It contains an automatic monitor generation for producing execution traces of the model-under-verification (MUV), the mechanism for automatically instrumenting the MUV, and the interaction with statistical model checking algorithms.

show abstract

The ins and outs of the probabilistic model checker MRMC

Cited by 195 publications

References 42 publications

Probabilistic Model Checking of Regenerative Concurrent Systems

Probabilistic Model Checking of Regenerative Concurrent Systems

Equivalence relations for modular performance evaluation in dtsPBC

Formal verification of probabilistic SystemC models with statistical model checking

Contact Info

Product

Resources

About