A SUCCESSIVE LUMPING PROCEDURE FOR A CLASS OF MARKOV CHAINS

DOI10.1017/S0269964812000150zbMath1261.60071OpenAlexW2328055495WikidataQ56769510 ScholiaQ56769510MaRDI QIDQ4902486

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

zbMATH Keywords

semi-Markov processescontinuous time Markov processesdiscrete time Markov chainsreliability and queueing modelslumpable Markov chains

Mathematics Subject Classification ID

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)

Related Items (16)

Reasoning about proportional lumpability ⋮ Stationary analysis of the shortest queue problem ⋮ DES AND RES PROCESSES AND THEIR EXPLICIT SOLUTIONS ⋮ LINEAR BIRTH/IMMIGRATION-DEATH PROCESS WITH BINOMIAL CATASTROPHES ⋮ 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 ⋮ Waiting-time analysis of D-BMAP/G/1 queueing system ⋮ A comparative analysis of the successive lumping and the lattice path counting algorithms ⋮ Statistical analysis of multivariate discrete-valued time series ⋮ Inventory systems with stochastic and batch demand: computational approaches ⋮ Approximate lumpability for Markovian agent-based models using local symmetries ⋮ Level product form QSF processes and an analysis of queues with <scp>C</scp> oxian interarrival distribution ⋮ Service with a queue and a random capacity cart: random processing batches and E-limited policies ⋮ Parallel computing for Markov chains with islands and ports ⋮ A successive censoring algorithm for a system of connected LDQBD-processes

Cites Work

• Unnamed Item
• Methods of aggregation
• Jointly optimal allocation of a repairman and optimal control of service rate for machine repairman problem
• Optimal Repair Allocation in a Series System
• A Method to Calculate Steady-State Distributions of Large Markov Chains by Aggregating States
• On the Maintenance of Systems Composed of Highly Reliable Components
• On the optimal assignment of servers and a repairman
• On the convergence of the power series algorithm
• On the optimal maintenance of systems and control of arrivals in queues
• Similar States in Continuous-Time Markov Chains

This page was built for publication: A SUCCESSIVE LUMPING PROCEDURE FOR A CLASS OF MARKOV CHAINS