Markov chain approximation methods in a class of level-crossing problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3260374 (Why is no real title available?)
- scientific article; zbMATH DE number 3072483 (Why is no real title available?)
- scientific article; zbMATH DE number 3094672 (Why is no real title available?)
- An approach to the probability distribution of cusum run length
- An embedded level crossing technique for dams and queues
- Approximation with generalized hyperexponential distributions: Weak convergence results
- CONTINUOUS INSPECTION SCHEMES
- Determination of A. R. L. and a Contour Nomogram for Cusum Charts to Control Normal Mean
- The Distribution of the Run Length of One-Sided CUSUM Procedures for Continuous Random Variables
- The System Point Method in Exponential Queues: A Level Crossing Approach
Cited in
(10)- Approximations in the problem of level crossing by a compound renewal process
- Level-crossing problems and inverse Gaussian distributions. Closed-form results and approximations
- Level-wise Subgeometric Convergence of the Level-increment Truncation Approximation of M/G/1-type Markov Chains
- Comparing short-memory charts to monitor the traffic intensity of single server queues
- On stochastic ordering and control charts for traffic intensity
- The crossing barrier of a non-homogeneous semi-Markov chain
- Approximate estimation methods for the moments of stochastic processes
- On level crossings for a general class of piecewise-deterministic Markov processes
- scientific article; zbMATH DE number 1943887 (Why is no real title available?)
- Level-crossing probabilities and first-passage times for linear processes
This page was built for publication: Markov chain approximation methods in a class of level-crossing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1375122)
