A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Verifying infinite Markov chains with a finite attractor or the global coarseness property

2005
*
20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05)
*

We consider infinite Markov chains which either have a finite attractor or satisfy the global coarseness property. Markov chains derived from probabilistic lossy channel systems (PLCS) or probabilistic vector addition systems with states (PVASS) are classic examples for these types, respectively. We consider three different variants of the reachability problem and the repeated reachability problem: The qualitative problem, i.e., deciding if the probability is one (or zero); the approximate

doi:10.1109/lics.2005.54
dblp:conf/lics/AbdullaHM05
fatcat:4gz2zn4mefchrbyk5nxw5jreme