Approximate uniformization for continuous-time Markov chains with an application to performability analysis
type: Item
instance of: scholarly article
title: Approximate uniformization for continuous-time Markov chains with an application to performability analysis
zbMATH Open document ID: 0753.60066
DOI: 10.1016/0304-4149(92)90018-L
author: Nico M. van Dijk
published in: Stochastic Processes and their Applications
publication date: 1992-09-27T00:00:00Z
Mathematics Subject Classification ID: 60J27
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 90C40
Mathematics Subject Classification ID: 60K10
zbMATH DE Number: 56972
zbMATH Keywords: uniformization technique
zbMATH Keywords: continuous-time Markov chains
zbMATH Keywords: jump rates
zbMATH Keywords: queueing application
MaRDI profile type: Publication
cites work: Q4189915
cites work: Q5820901
cites work: Q5528211
cites work: Priority queues
cites work: Controlled jump processes
cites work: Approximating Transition Probabilities and Mean Occupation Times in Continuous-Time Markov Chains
cites work: Non-negative matrices and Markov chains.
cites work: Technical Note—An Equivalence Between Continuous and Discrete Time Markov Decision Processes
cites work: Stochastic monotonicity in general queueing networks
cites work: Stochastic Monotonicity of the Queue Lengths in Closed Queueing Networks
cites work: Q3321201
cites work: A Concept of Monotonicity and Its Characterization for Closed Queueing Networks
cites work: A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks
cites work: On the finite horizon Bellman equation for controlled Markov jump models with unbounded characteristics: Existence and approximation
cites work: Simple bounds for queueing systems with breakdowns
cites work: Truncation of Markov Chains with Applications to Queueing
cites work: Simple bounds and monotonicity results for finite multi-server exponential tandem queues
cites work: Comparing counting processes and queues
cites work: Bounds and Approximations for the Transient Behavior of Continuous-Time Markov Chains
description: scientific article; zbMATH DE number 56972