ROW-CONTINUOUS FINITE MARKOV CHAINS : STRUCTURE AND ALGORITHMS

DOI10.15807/JORSJ.30.291MaRDI QIDQ3763363zbMATH OpenOpenAlexFDO

Authors Ushio Sumita, M. Zachmann, Julian Keilson

Publication date 1987

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.30.291

zbMATH Keywords

first passage timesalgorithmic procedure for calculating the ergodic probabilitiesperformance analysis of computer and production systems

Mathematics Subject Classification ID

Applications of renewal theory (reliability, demand theory, etc.) (60K10) Markov renewal processes, semi-Markov processes (60K15) Continuous-time Markov processes on discrete state spaces (60J27)

Recommendations

• Finite Markov Chains and Algorithmic Applications
• scientific article; zbMATH DE number 510837
• Computation of Steady-State Probabilities for Infinite-State Markov Chains with Repeating Rows
• scientific article; zbMATH DE number 2169692
• An algorithmic approach for a special class of Markov chains
• scientific article; zbMATH DE number 4084689
• EMBEDDED MATRICES FOR FINITE MARKOV CHAINS
• Markov Chains with Hybrid Repeating Rows - Upper-Hessenberg, Quasi-Toeplitz Structure of the Block Transition Probability Matrix
• Markov chains. Theory, algorithms and applications

Cited in

(3)

• Analysis of a two-stage finite buffer flow controlled queueing model by a compensation method
• scientific article; zbMATH DE number 4084689 (Why is no real title available?)
• Finite Markov chain models skip-free in one direction

This page was built for publication: ROW-CONTINUOUS FINITE MARKOV CHAINS : STRUCTURE AND ALGORITHMS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3763363)