Model-checking large structured Markov chains

CSL Model Checking Algorithms for Infinite-State Structured Markov Chains

Jackson queueing networks (JQNs) are a very general class of queueing networks that find their application in a variety of settings. The state space of the continuous-time Markov chain (CTMC) that underlies such a JQN, is highly structured, however, of infinite size in as many dimensions as there are queues. We present CSL model checking algorithms for labeled JQNs. To do so, we rely on well-kn...

Model checking quantum Markov chains

Article history: Received 10 May 2012 Received in revised form 28 November 2012 Accepted 22 April 2013 Available online 25 April 2013

Parallel Randomization for Large Structured Markov Chains

Multiprocessor architectures with few but powerful processors gain more and more popularity. In this paper we describe a parallel iterative algorithm to perform randomization for a continuous time Markov chain with a Kronecker representation on a shared memory architecture. The Kronecker representation is modified for a parallel matrixvector multiplication with a fast multiplication scheme and ...

LTL Model Checking of Interval Markov Chains

Interval Markov chains (IMCs) generalize ordinary Markov chains by having interval-valued transition probabilities. They are useful for modeling systems in which some transition probabilities depend on an unknown environment, are only approximately known, or are parameters that can be controlled. We consider the problem of computing values for the unknown probabilities in an IMC that maximize t...

Model checking Markov chains : techniques and tools