The number of visits to a subset of the state space by a discrete- parameter semi-Markov process
From MaRDI portal
(Redirected from Publication:1344834)
A discrete-parameter irreducible semi-Markov process with a finite state space is considered. The state space is the union of two disjoint nonempty subsets \(A_1\) and \(A_2\). The distribution of a random number of transitions \(A_1 \to A_2\) during the first \(t + 1\) time instants \((t \geq 1)\) is investigated. A compact formula for this distribution in terms of the semi-Markov transition function is derived.
Recommendations
- Some renewal-theoretic investigations in the theory of sojourn times in finite semi-Markov processes
- Occupation frequencies for irreducible finite semi-Markov processes with reliability applications
- Analysis of a counting process associated with a semi-Markov process: number of entries into a subset of state space
- scientific article; zbMATH DE number 3921682
- The kth visit in semi-Markov processes
Cites work
- Analysis of a counting process associated with a semi-Markov process: number of entries into a subset of state space
- Occupation frequencies for irreducible finite semi-Markov processes with reliability applications
- Some renewal-theoretic investigations in the theory of sojourn times in finite semi-Markov processes
Cited in
(5)- On the derivative counting processes of first- and second-order aggregated semi-Markov systems
- Analysis of a counting process associated with a semi-Markov process: number of entries into a subset of state space
- scientific article; zbMATH DE number 1098840 (Why is no real title available?)
- The crossing barrier of a non-homogeneous semi-Markov chain
- Simple derivations of properties of counting processes associated with Markov renewal processes
This page was built for publication: The number of visits to a subset of the state space by a discrete- parameter semi-Markov process
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1344834)
