Results 1 - 10
of
12
The ins and outs of the probabilistic model checker MRMC
- IN PROC. QEST’09
, 2009
"... The Markov Reward Model Checker (MRMC) is a software tool for verifying properties over probabilistic models. It supports PCTL and CSL model checking, and their reward extensions. Distinguishing features of MRMC are its support for computing time- and reward-bounded reachability probabilities, (prop ..."
Abstract
-
Cited by 75 (18 self)
- Add to MetaCart
(Show Context)
The Markov Reward Model Checker (MRMC) is a software tool for verifying properties over probabilistic models. It supports PCTL and CSL model checking, and their reward extensions. Distinguishing features of MRMC are its support for computing time- and reward-bounded reachability probabilities, (property-driven) bisimulation minimization, and precise on-the-fly steady-state detection. Recent tool features include time-bounded reachability analysis for uniform CTMDPs and CSL model checking by discrete-event simulation. This paper presents the tool’s current status and its implementation details.
Using Probabilistic Model Checking in Systems Biology
"... Probabilistic model checking is a formal verification frame-work for systems which exhibit stochastic behaviour. It has been successfully applied to a wide range of domains, includ-ing security and communication protocols, distributed algo-rithms and power management. In this paper we demon-strate i ..."
Abstract
-
Cited by 25 (0 self)
- Add to MetaCart
(Show Context)
Probabilistic model checking is a formal verification frame-work for systems which exhibit stochastic behaviour. It has been successfully applied to a wide range of domains, includ-ing security and communication protocols, distributed algo-rithms and power management. In this paper we demon-strate its applicability to the analysis of biological pathways and show how it can yield a better understanding of the dynamics of these systems. Through a case study of the MAP (Mitogen-Activated Protein) Kinase cascade, we ex-plain how biological pathways can be modelled in the prob-abilistic model checker PRISM and how this enables the analysis of a rich selection of quantitative properties. 1.
HASL: An expressive language for statistical verification of stochastic models
- IN: VALUETOOLS 2011
, 2011
"... We introduce the Hybrid Automata Stochastic Logic (HASL), a new temporal logic formalism for the verification of discrete event stochastic processes (DESP). HASL employs Linear Hybrid Automata (LHA) as machineries to select prefixes of relevant execution paths of a DESP D. The advantage with LHA is ..."
Abstract
-
Cited by 18 (10 self)
- Add to MetaCart
We introduce the Hybrid Automata Stochastic Logic (HASL), a new temporal logic formalism for the verification of discrete event stochastic processes (DESP). HASL employs Linear Hybrid Automata (LHA) as machineries to select prefixes of relevant execution paths of a DESP D. The advantage with LHA is that rather elaborate information can be collected on-the-fly during path selection, providing the user with a powerful means to express sophisticated measures. A formula of HASL consists of an LHA A and an expression Z referring to moments of path random variables. A simulation-based statistical engine is employed to obtained a confidence-interval estimate of the expected value of Z. In essence HASL provide a unifying verification framework where sophisticated temporal reasoning is naturally blended with elaborate reward-based analysis. We illustrate the HASL approach by means of some examples and a discussion about its expressivity. We also provide empirical evidence obtained through COSMOS, a prototype software tool for HASL verification.
Model Checking Meets Performance Evaluation
"... Markov chains are one of the most popular models for the evaluation of performance and dependability of information processing systems. To obtain performance measures, typically long-run or transient state probabilities of Markov chains are determined. Sometimes the Markov chain at hand is equipped ..."
Abstract
-
Cited by 7 (1 self)
- Add to MetaCart
Markov chains are one of the most popular models for the evaluation of performance and dependability of information processing systems. To obtain performance measures, typically long-run or transient state probabilities of Markov chains are determined. Sometimes the Markov chain at hand is equipped with rewards and computations involve determining long-run or instantaneous reward probabilities.
FIVE PERFORMABILITY ALGORITHMS: A COMPARISON
"... Since the introduction by John F. Meyer in 1980 [21], various algorithms have been proposed to evaluate the performability distribution. In this paper we describe and compare five algorithms that have been proposed recently to evaluate this distribution: Picard’s method, a uniformisation-based metho ..."
Abstract
-
Cited by 6 (1 self)
- Add to MetaCart
Since the introduction by John F. Meyer in 1980 [21], various algorithms have been proposed to evaluate the performability distribution. In this paper we describe and compare five algorithms that have been proposed recently to evaluate this distribution: Picard’s method, a uniformisation-based method, a path-exploration method, a discretisation approach and a fully Markovian approximation. As a result of our study, we recommend Picard’s method not to be used (due to numerical stability problems). Furthermore, the path exploration method turns out to be heavily dependent on the branching structure of the Markov-reward model under study. For small models, the uniformisation method is preferable; however, its complexity is such that it is impractical for larger models. The discretisation method performs well, also for larger models; however, it does not easily apply in all cases. The recently proposed Markovian approximation works best, even for large models; however, error bounds cannot be given for it.
ArchitectureDriven Reliability and Energy Optimization for Complex Embedded Systems
- in Proc. of the International Conference on the Quality of Software Architectures (QoSA’10), Springer Verlag, ISBN 978-3-642-13820-1
, 2010
"... Abstract. The use of redundant computational nodes is a widely used design tactic to improve the reliability of complex embedded systems. However, this redundancy allocation has also an effect on other qual-ity attributes, including energy consumption, as each of the redundant computational nodes re ..."
Abstract
-
Cited by 5 (3 self)
- Add to MetaCart
(Show Context)
Abstract. The use of redundant computational nodes is a widely used design tactic to improve the reliability of complex embedded systems. However, this redundancy allocation has also an effect on other qual-ity attributes, including energy consumption, as each of the redundant computational nodes requires additional energy. As a result, the two quality objectives are conflicting. The approach presented in this paper applies a multi-objective optimization strategy to find optimal redun-dancy levels for different architectural elements. It is implemented in the ArcheOpterix tool and validated based on a realistic case study from the automotive domain. 1
Formal analysis of memory contention in a multiprocessor system
- in Formal Methods: Foundations and Applications
, 2013
"... Abstract. Multi-core processors along with multi-module memories are extensively being used in high performance computers these days. One of the main performance evaluation metrics in such configurations is the memory contention problem and its effect on the overall memory access time. Usually, thi ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
(Show Context)
Abstract. Multi-core processors along with multi-module memories are extensively being used in high performance computers these days. One of the main performance evaluation metrics in such configurations is the memory contention problem and its effect on the overall memory access time. Usually, this problem is analyzed using simulation or numerical methods. However, these methods either cannot guarantee accurate analysis or are not scalable due to the unacceptable computation times. As an alternative approach, this paper uses theorem proving to analyze the memory contention problem of a multiprocessor system. For this purpose, the paper presents the higher-order-logic formalization of the expectation of a discrete random variable and Discrete-time Markov Reward Models. These foundations are then utilized to analyze the memory contention problem of a multi-processor system configuration with two processors and two memory modules using the HOL theorem prover.
Quantitative Verification Techniques for Biological Processes
- BIOPROCESSES, SPRINGER: CONDON A, HAREL D, KOK J, SALOMAA A, WINFREE E
"... Probabilistic model checking is a formal verification framework for sys-tems which exhibit stochastic behaviour. It has been successfully applied to a wide range of domains, including security and communication protocols, distributed al-gorithms and power management. In this chapter we demonstrate ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Probabilistic model checking is a formal verification framework for sys-tems which exhibit stochastic behaviour. It has been successfully applied to a wide range of domains, including security and communication protocols, distributed al-gorithms and power management. In this chapter we demonstrate its applicabil-ity to the analysis of biological pathways and show how it can yield a better un-derstanding of the dynamics of these systems. Through a case study of the MAP (Mitogen–Activated Protein) Kinase cascade, we explain how biological pathways can be modelled in the probabilistic model checker PRISM and how this enables the analysis of a rich selection of quantitative properties.
Beyond Model-Checking CSL for QBDs: Resets, Batches and Rewards
"... We propose and discuss a number of extensions to quasibirth-death models (QBDs) for which CSL model checking is still possible, thus extending our recent work [12] on CSL model checking of QBDs. We then equip the QBDs with rewards, and discuss algorithms and open research issues for model checking C ..."
Abstract
- Add to MetaCart
We propose and discuss a number of extensions to quasibirth-death models (QBDs) for which CSL model checking is still possible, thus extending our recent work [12] on CSL model checking of QBDs. We then equip the QBDs with rewards, and discuss algorithms and open research issues for model checking CSRL for QBDs with rewards. 1