Algorithm of state stationary probability computing for continuous-time finite Markov chain modulated by semi-Markov process
From MaRDI portal
Publication:4568356
Recommendations
- On an algorithm for calculating stationary probabilities of the Markov chains
- scientific article; zbMATH DE number 3890486
- A method for approximating the probability functions of a Markov chain
- Algorithms for determining the state-time probabilities and the limit matrix in Markov chains
- A Stable Algorithm to Calculate Steady-State Probability & Frequency of a Markov System
Cites work
- scientific article; zbMATH DE number 3868383 (Why is no real title available?)
- scientific article; zbMATH DE number 3738676 (Why is no real title available?)
- scientific article; zbMATH DE number 781861 (Why is no real title available?)
- scientific article; zbMATH DE number 6424438 (Why is no real title available?)
- scientific article; zbMATH DE number 965582 (Why is no real title available?)
- Erlang loss queueing system with batch arrivals operating in a random environment
- Markov-modulated processes and semigenerative phenomena
- Signatures in Markov-modulated processes
- The \(BMAP/PH/N\) retrial queueing system operating in Markovian random environment
Cited in
(3)
This page was built for publication: Algorithm of state stationary probability computing for continuous-time finite Markov chain modulated by semi-Markov process
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4568356)