By Topic

Infinite-State Verification: From Transition Systems to Markov Chains

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Abdulla, P.A. ; Uppsala Univ., Uppsala, Sweden

In this tutorial, we consider verification of Markov chains with infinite state spaces. We present a general framework which can handle probabilistic versions of several classical models such as Petri nets, lossy channel systems, push-down automata, and noisy Turing machines. First, we describe algorithms for verification of well quasiordered transition systems. These are transition systems which are monotonic w.r.t. a well quasi-ordering on the state space. Then, we extend the framework by introducing decisive Markov chains, a class of Markov chains which cover all the above mentioned models. We consider both safety and liveness problems for decisive Markov chains. Safety: What is the probability that a given set of states is eventually reached. Liveness: What is the probability that a given set of states is reached infinitely often. We will also consider limiting behaviors for infinite-state Markov chains. In order to do that, we consider a stronger condition than decisiveness, namely that of eagerness. Finally, for a subclass of the models, we describe algorithms to solve general versions of the problems in the context of simple stochastic games.

Published in:

Quantitative Evaluation of Systems, 2009. QEST '09. Sixth International Conference on the

Date of Conference:

13-16 Sept. 2009