A SUCCESSIVE LUMPING PROCEDURE FOR A CLASS OF MARKOV CHAINS
DOI10.1017/S0269964812000150zbMATH Open1261.60071OpenAlexW2328055495WikidataQ56769510 ScholiaQ56769510MaRDI QIDQ4902486FDOQ4902486
Authors: Michael N. Katehakis, Laurens C. Smit 
Publication date: 15 January 2013
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0269964812000150
Recommendations
- scientific article; zbMATH DE number 279297
- scientific article; zbMATH DE number 4060467
- Lumping in Markov set-chains
- Lumpability and marginalisability for continuous-time Markov chains
- On weak lumpability in Markov chains
- Exact and ordinary lumpability in finite Markov chains
- scientific article; zbMATH DE number 52988
semi-Markov processescontinuous time Markov processesdiscrete time Markov chainsreliability and queueing modelslumpable Markov chains
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Markov renewal processes, semi-Markov processes (60K15) Continuous-time Markov processes on discrete state spaces (60J27)
Cites Work
- Jointly optimal allocation of a repairman and optimal control of service rate for machine repairman problem
- Title not available (Why is that?)
- Optimal Repair Allocation in a Series System
- On the Maintenance of Systems Composed of Highly Reliable Components
- On the convergence of the power series algorithm
- On the optimal assignment of servers and a repairman
- On the optimal maintenance of systems and control of arrivals in queues
- Methods of aggregation
- A Method to Calculate Steady-State Distributions of Large Markov Chains by Aggregating States
- Similar States in Continuous-Time Markov Chains
Cited In (20)
- A comparative analysis of the successive lumping and the lattice path counting algorithms
- DES and RES processes and their explicit solutions
- Reasoning about proportional lumpability
- Approximate lumpability for Markovian agent-based models using local symmetries
- Lumpable Markov chains in risk management
- Level product form QSF processes and an analysis of queues with Coxian interarrival distribution
- A successive censoring algorithm for a system of connected LDQBD-processes
- On sequential discrimination between close Markov chains
- Inventory systems with stochastic and batch demand: computational approaches
- Optimal state-space lumping in Markov chains
- Parallel computing for Markov chains with islands and ports
- Statistical analysis of multivariate discrete-valued time series
- Lumping in Markov set-chains
- Waiting-time analysis of D-BMAP/G/1 queueing system
- Matrix geometric approach for random walks: stability condition and equilibrium distribution
- On optimal bidding and inventory control in sequential procurement auctions: the multi period case
- Retrial queueing system with balking, optional service and vacation
- Stationary analysis of the shortest queue problem
- Linear birth/immigration-death process with binomial catastrophes
- Service with a queue and a random capacity cart: random processing batches and E-limited policies
This page was built for publication: A SUCCESSIVE LUMPING PROCEDURE FOR A CLASS OF MARKOV CHAINS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4902486)
