Relation between Hitting Times and Probabilities for Imprecise Markov Chains

Abstract

In the present paper, we investigate the relationship between hitting times and hitting probabilities in discrete-time imprecise Markov chains (IMCs). We define lower and upper hitting times and probabilities for IMCs whose set of transition matrices $\T$ is compact, convex, and has separately specified rows. Building on reachability-based partitions of the state space, we prove two key implications: (i) finiteness of the upper expected hitting time entails the lower hitting probability equals one, and (ii) finiteness of the lower expected hitting time entails the upper hitting probability equals one. We further show an equivalence: the upper expected hitting time is finite if and only if the lower hitting probability is one. Finally, by presenting a counterexample, we show that the converse of the second implication can fail.

Figures (2)

• Figure 1: Illustration of key sets of states and their reachability characteristics.
• Figure 2: Overview of the relationships between lower and upper hitting times and hitting probabilities.

Theorems & Definitions (8)

• proposition 1
• proof
• proposition 2
• proof
• theorem 1
• proof
• theorem 2
• proof