On State Occupancies, First Passage Times and Duration in Non-Homogeneous Semi-Markov Chains

Abstract

Semi-Markov processes generalize the Markov chains framework by utilizing abstract sojourn time distributions. They are widely known for offering enhanced accuracy in modeling stochastic phenomena. The aim of this paper is to provide closed analytic forms for three types of probabilities which describe attributes of considerable research interest in semi-Markov modeling: (a) the number of transitions to a state through time (Occupancy), (b) the number of transitions or the amount of time required to observe the first passage to a state (First passage time) and (c) the number of transitions or the amount of time required after a state is entered before the first real transition is made to another state (Duration). The non-homogeneous in time recursive relations of the above probabilities are developed and a description of the corresponding geometric transforms is produced. By applying appropriate properties, the closed analytic forms of the above probabilities are provided. Finally, data from human DNA sequences are used to illustrate the theoretical results of the paper.

Semi-Markov Models for Process Mining in Smart Homes

“…Performance analysis typically focuses on the dynamic behaviour of the process, based on key performance indicators (KPIs) such as response time, uptime, or reliability. More specifically, the main KPIs for Markov-type models have been identified by [11] as (i) state occupancy probabilities, i.e., number of visits to a state during an arbitrary time interval; (ii) first passage time probabilities; and (iii) state occupancy duration probabilities [12]. Also, Markov models are widely used probabilistic process models where it is assumed that the Markov property holds, i.e., the current state only depends on the immediately previous state.…”

The effectiveness of naive optimization of the egress path for an active-shooter scenario

“…In this framework, we assume that the shooter's movement dynamics is described by a semi-Markov chain (SMC) with a discrete state space [11] . An SMC is a generalization of a traditional Markov chain with abstract sojourn time distributions.…”

Markov and Semi-Markov Chains, Processes, Systems, and Emerging Related Fields

“…(ii2) On State Occupancies, First Passage Times and Duration in Non-Homogeneous Semi-Markov Chains, by Georgiou, A.C., Papadopoulou, A.A., Kolias, P., Palikrousis, H., and Farmakioti, E. [18]. A basic aspect of Semi-Markov processes (SMC) is the utilization of general sojourn time distributions.…”