A note on the attractor-property of infinite-state Markov chains

BaierChristel, BertrandNathalie, SchnoebelenPhilippe · Information Processing Letters · 2006

In the past 5 years, a series of verification algorithms has been proposed for infinite Markov chains that have a finite attractor, i.e., a set that will be visited infinitely often almost surely s...

Read the paper · More papers on PaperTik