First passage times and their algorithms for markov processes
From MaRDI portal
Recommendations
Cited in
(31)- Comparing first-passage times for semi-Markov skip-free processes
- Modeling returns of merchandise in an inventory system
- First passage times for Markov renewal processes and applications
- When the ``bull meets the ``bear: A first passage time problem for a hidden Markov process
- A two-stage queueing network on form postponement supply chain with correlated demands
- First passage times: Busy periods and waiting times
- First passage time and extremum properties of Markov and independent processes
- Busy period for the first subsystem in a matched queueing network
- scientific article; zbMATH DE number 417052 (Why is no real title available?)
- First-passage times with PFr densities
- scientific article; zbMATH DE number 3879859 (Why is no real title available?)
- Identifying Coefficients in the Spectral Representation for First Passage Time Distributions
- First-passage-time moments of Markov processes
- scientific article; zbMATH DE number 3967599 (Why is no real title available?)
- Using Simulation to Estimate First Passage Distribution
- Spectral structure of the first-passage-time densities for classes of Markov chains
- scientific article; zbMATH DE number 19246 (Why is no real title available?)
- The distribution of the first passage time for the markov processes ofGI/M/LType
- Expected passage times in homogeneous quasi-birth-and-death Processes
- Computing mean first passage times for a Markov chain
- First passage time in Markov chains and in random walks on countable abelian groups
- FIRST PASSAGE TIMES OF PH/PH/1/K AND PH/PH/1 QUEUES
- A divide and conquer approach to computing the mean first passage matrix for Markov chains via Perron complement reductions
- First passage moments of finite-state semi-Markov processes
- Throughput, flow times, and service level in an unreliable assembly system
- The first-passage times of phase semi-Markov processes
- Algorithms for Markov stochastic models
- First passage times for multidimensional denumerable state Markov processes
- Performance analysis of assembly systems with unreliable machines and finite buffers
- An iterative algorithm for computing mean first passage times of Markov chains
- A tandem network with MAP inputs
This page was built for publication: First passage times and their algorithms for markov processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4327117)