Markov modelling

Markov modelling deals with discrete event systems in which events happen completely at random. The resulting Markovian systems can often be analyzed analytically. In this session, we show how to use the available packages, and what methods can be employed to find transient and steady state results. It turns out that Markov modelling is extremely convenient to analyze systems with very few state variables.

[1]  Jürg Kohlas,et al.  Stochastic Methods of Operations Research , 1983 .

[2]  Winfried K. Grassmann Transient solutions in markovian queueing systems , 1977, Comput. Oper. Res..

[3]  Micha Yadin,et al.  Numerical Computation of Sojourn-Time Distributions in Queuing Networks , 1984, JACM.

[4]  W. Grassmann Transient solutions in Markovian queues : An algorithm for finding them and determining their waiting-time distributions , 1977 .

[5]  Donald Gross,et al.  The Randomization Technique as a Modeling Tool and Solution Procedure for Transient Markov Processes , 1984, Oper. Res..

[6]  Henry M. Goldberg Computation Of State Probabilities For Mim/S Priority Queues With Customer Classes Having Different Service Rates* , 1981 .

[7]  Chris Beaumont Stochastic Systems for Management , 1981 .

[8]  William J. Stewart,et al.  A comparison of numerical techniques in Markov modeling , 1978, CACM.

[9]  Frederick S. Hillier,et al.  Finite Queues in Series with Exponential or Erlang Service Times - A Numerical Approach , 1966, Oper. Res..

[10]  W. Grassmann The GI/PH/1 Queue: a Method to Find The Transition Matrix , 1982 .

[11]  Amedeo R. Odoni,et al.  An Empirical Investigation of the Transient Behavior of Stationary Queueing Systems , 1983, Oper. Res..

[12]  Victor L. Wallace,et al.  Markovian Models and Numerical Analysis of Computer System Behavior , 1899 .

[13]  Winfried K. Grassmann,et al.  Applications of Semi-Regenerative Theory to Computations of Stationary Distributions of Markov Chains. , 1982 .