The number of visits to a subset of the state space by a discrete- parameter semi-Markov process (Q1344834): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Some renewal-theoretic investigations in the theory of sojourn times in finite semi-Markov processes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Occupation frequencies for irreducible finite semi-Markov processes with reliability applications / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Analysis of a counting process associated with a semi-Markov process: number of entries into a subset of state space / rank | |||
Normal rank | |||
Latest revision as of 12:02, 23 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The number of visits to a subset of the state space by a discrete- parameter semi-Markov process |
scientific article |
Statements
The number of visits to a subset of the state space by a discrete- parameter semi-Markov process (English)
0 references
22 February 1995
0 references
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.
0 references
counting process
0 references
closed form expression
0 references
semi-Markov process
0 references
0 references
0 references
