Decisive Markov Chains

Article, Preprint English OPEN
Abdulla, Parosh Aziz; Henda, Noomene Ben; Mayr, Richard;
(2007)
  • Related identifiers: doi: 10.2168/LMCS-3(4:7)2007
  • Subject: Computer Science - Discrete Mathematics | D.2.4 | Computer Science - Logic in Computer Science | F.4.1 | G.3

We consider qualitative and quantitative verification problems for infinite-state Markov chains. We call a Markov chain decisive w.r.t. a given set of target states F if it almost certainly eventually reaches either F or a state from which F can no longer be reached. Wh... View more
Share - Bookmark