Results 1  10
of
19
Partial order reduction for probabilistic systems
 In Proc. 1st QEST
, 2004
"... In the past, several model checking algorithms have been proposed to verify probabilistic reactive systems. The techniques to combat the stateexplosion problem have mainly concentrated on symbolic methods with variants of decision diagrams or abstraction methods. In this paper, we show how partial ..."
Abstract

Cited by 30 (3 self)
 Add to MetaCart
(Show Context)
In the past, several model checking algorithms have been proposed to verify probabilistic reactive systems. The techniques to combat the stateexplosion problem have mainly concentrated on symbolic methods with variants of decision diagrams or abstraction methods. In this paper, we show how partial order reduction with a variant of Peled’s ample set method can be applied in the context of LTL model checking for probabilistic systems modelled by Markov decision processes. 1
Advances and Challenges of Probabilistic Model Checking
 48TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL AND COMPUTING (2010) 16911698
, 2010
"... Probabilistic model checking is a powerful technique for formally verifying quantitative properties of systems that exhibit stochastic behaviour. Such systems are found in many domains: probabilistic behaviour may arise, for example, due to failures of unreliable components, communication across los ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
(Show Context)
Probabilistic model checking is a powerful technique for formally verifying quantitative properties of systems that exhibit stochastic behaviour. Such systems are found in many domains: probabilistic behaviour may arise, for example, due to failures of unreliable components, communication across lossy media, or through the use of randomisation in distributed protocols. In this paper, we give a short overview of probabilistic model checking and of PRISM (www.prismmodelchecker.org), currently the leading software tool in this area. We then mention some of the limitations of these techniques, describe some of the advances that are being made to overcome them, and outline key challenges that remain in this research area.
Dualprocessor parallelisation of symbolic probabilistic model checking
 In Proc. 12th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS’04
, 2004
"... In this paper, we describe the dualprocessor parallelisation of a symbolic (BDDbased) implementation of probabilistic model checking. We use multiterminal BDDs, which allow a compact representation of large, structured Markov chains. We show that they also provide a convenient block decomposition ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
(Show Context)
In this paper, we describe the dualprocessor parallelisation of a symbolic (BDDbased) implementation of probabilistic model checking. We use multiterminal BDDs, which allow a compact representation of large, structured Markov chains. We show that they also provide a convenient block decomposition of the Markov chain which we use to implement a parallelised version of the GaussSeidel iterative method. We provide experimental results on a range of case studies to illustrate the effectiveness of the technique, observing an average speedup of 1.8 with two processors. Furthermore, we present an optimisation for our method based on preconditioning. 1
Lumping matrix diagram representations of markov models
 In Proc. of the 2005 Int. Conf. on Dependable Systems and Networks
, 2005
"... Continuoustime Markov chains (CTMCs) have been used successfully to model the dependability and performability of many systems. Matrix diagrams (MDs) are known to be a spaceefficient, symbolic representation of large CTMCs. In this paper, we identify local conditions for exact and ordinary lumping ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
(Show Context)
Continuoustime Markov chains (CTMCs) have been used successfully to model the dependability and performability of many systems. Matrix diagrams (MDs) are known to be a spaceefficient, symbolic representation of large CTMCs. In this paper, we identify local conditions for exact and ordinary lumpings that allow us to lump MD representations of Markov models in a compositional manner. We propose a lumping algorithm for CTMCs that are represented as MDs that is based on partition refinement, is applied to each level of an MD directly, and results in an MD representation of the lumped CTMC. Our compositional lumping approach is complementary to other known modellevel lumping approaches for matrix diagrams. The approach has been implemented, and we demonstrate its efficiency and benefits by evaluating an example model of a tandem multiprocessor system with load balancing and failure and repair operations. 1
Combining Response Surface Methodology with Numerical Models for Optimization of Class Based Queueing Systems
 Proc. Int. Conf. on Dependable Systems and Networks (DSN
, 2005
"... In general, decision support is one of the main purposes of modelbased analysis of systems. Response surface methodology (RSM) is an optimization technique that has been applied frequently in practice, but few automated variants are currently available. In this paper, we propose the combination of ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
(Show Context)
In general, decision support is one of the main purposes of modelbased analysis of systems. Response surface methodology (RSM) is an optimization technique that has been applied frequently in practice, but few automated variants are currently available. In this paper, we propose the combination of RSM with numerical analysis methods to solve continuous time Markov chain models of classbased queueing systems (CBQ). We consider first and secondorder models in RSM to identify an optimal parameter configuration for CBQ as part of the differentiated service architecture. Among the many known numerical solution methods for large Markov chains, we consider a GaussSeidel solver with relaxation that relies on a hierarchical Kronecker representation as implemented in the APNN Toolbox. To effectively apply the proposed optimization methodology we determine a suitable configuration of RSM and compare the results with previous results for optimizing CBQ. 1.
Solution of Large Markov Models using Lumping Techniques and Symbolic Data Structures
, 2005
"... Continuous time Markov chains (CTMCs) are among the most fundamental mathematical structures used for performance and dependability modeling of communication and computer systems. They are often constructed from models described in one of the various highlevel formalisms. Since the size of a CTMC u ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
Continuous time Markov chains (CTMCs) are among the most fundamental mathematical structures used for performance and dependability modeling of communication and computer systems. They are often constructed from models described in one of the various highlevel formalisms. Since the size of a CTMC usually grows exponentially with the size of the corresponding highlevel model, one often encounters the infamous statespace explosion problem, which often makes solution of the CTMCs intractable and sometimes makes it impossible. In statebased numerical analysis, which is the solution technique we have chosen to use to solve for measures defined on a CTMC, the statespace explosion problem is manifested in two ways: 1) large state transition rate matrices, and 2) large iteration vectors. The goal of this dissertation is to extend, improve, and combine existing solutions of the statespace explosion problem in order to make possible the construction and solution of very large CTMCs generated from highlevel models. Our new techniques follow largeness avoidance and largeness tolerance approaches. In the former approach, we reduce the size of the CTMC that needs to be solved in order to compute the measures of interest. That
Dependability Analysis with Markov Chains: How Symmetries Improve Symbolic Computations
"... We propose a novel approach that combines two general and complementary methods for dependability analysis based on the steady state or transient analysis of Markov chains. The first method allows us to automatically detect all symmetries in a compositional Markovian model with statesharing composi ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
We propose a novel approach that combines two general and complementary methods for dependability analysis based on the steady state or transient analysis of Markov chains. The first method allows us to automatically detect all symmetries in a compositional Markovian model with statesharing composition. Symmetries are detected with the help of an automorphism group of the model composition graph, which yields a reduction of the associated Markov chain due to lumpability. The second method allows us to represent and numerically solve the lumped Markov chain, even in the case of very large state spaces, with the help of symbolic data structures, in particular matrix diagrams. The overall approach has been implemented and is able to compute stationary and transient measures for large Markovian models of dependable systems.
Optimization of Markov models with evolutionary strategies based on exact and approximate analysis techniques.
, 2006
"... Abstract Markov models are useful in the performance and dependability assessment of systems to obtain quantitative information that helps in making design decisions. The many known analysis techniques can be partitioned into approximate and exact techniques, where the former can be usually applied ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract Markov models are useful in the performance and dependability assessment of systems to obtain quantitative information that helps in making design decisions. The many known analysis techniques can be partitioned into approximate and exact techniques, where the former can be usually applied with limited effort but unknown precision and the latter give exact results but for the price of a computationally expensive calculation. In this paper, we discuss how an optimization method that is used to find an optimal configuration in a design space can make good use of both approximate and exact techniques for Markovian models. We develop a general approach that is formulated for evolutionary strategies and evaluated with Markov models of two queueing systems, a polling server model with realvalued design parameters and a finite buffer queueing network with discrete parameters.
Comparison of encoding schemes for symbolic model checking of bounded petri nets
, 2010
"... Part of the Computer Sciences Commons This Thesis is brought to you for free and open access by the Graduate College at Digital Repository @ Iowa State University. It has been accepted for inclusion in Graduate Theses and Dissertations by an authorized administrator of Digital Repository @ Iowa Stat ..."
Abstract
 Add to MetaCart
(Show Context)
Part of the Computer Sciences Commons This Thesis is brought to you for free and open access by the Graduate College at Digital Repository @ Iowa State University. It has been accepted for inclusion in Graduate Theses and Dissertations by an authorized administrator of Digital Repository @ Iowa State University. For more information, please contact