Algorithm of state stationary probability computing for continuous-time finite Markov chain modulated by semi-Markov process
DOI10.1007/978-3-319-30843-2_18zbMATH Open1392.60073OpenAlexW2413828414MaRDI QIDQ4568356FDOQ4568356
Authors: A. Andronov, V. M. Vishnevskii 
Publication date: 21 June 2018
Published in: Communications in Computer and Information Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-30843-2_18
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
Computational methods in Markov chains (60J22) Numerical analysis or methods applied to Markov chains (65C40) Markov renewal processes, semi-Markov processes (60K15)
Cites Work
- The \(BMAP/PH/N\) retrial queueing system operating in Markovian random environment
- Title not available (Why is that?)
- Erlang loss queueing system with batch arrivals operating in a random environment
- Markov-modulated processes and semigenerative phenomena
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Signatures in Markov-Modulated Processes
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)
