| | |
Summary: Verifying Infinite Markov Chains with a Finite Attractor or the Global
Coarseness Property
Parosh Aziz Abdulla
Uppsala University, Sweden.
parosh@it.uu.se
Noomene Ben Henda
Uppsala University, Sweden.
Noomene.BenHenda@it.uu.se
Richard Mayr
NC State University, USA.
mayr@csc.ncsu.edu
Abstract
We consider infinite Markov chains which either have a
finite attractor or satisfy the global coarseness property.
Markov chains derived from probabilistic lossy channel sys
tems (PLCS) or probabilistic vector addition systems with
states (PVASS) are classic examples for these types, respec
tively. We consider three different variants of the reacha
bility problem and the repeated reachability problem: The
qualitative problem, i.e., deciding if the probability is one
|
