Please note: In order to keep Hive up to date and provide users with the best features, we are no longer able to fully support Internet Explorer. The site is still available to you, however some sections of the site may appear broken. We would encourage you to move to a more modern browser like Firefox, Edge or Chrome in order to experience the site fully.

Numerical Methods for Solving Discrete Event Systems : With Applications to Queueing Systems, Paperback / softback Book

Numerical Methods for Solving Discrete Event Systems : With Applications to Queueing Systems Paperback / softback

Part of the CMS/CAIMS Books in Mathematics series

Paperback / softback

Description

This graduate textbook provides an alternative to discrete event simulation.  It describes how to formulate discrete event systems, how to convert them into Markov chains, and how to calculate their transient and equilibrium probabilities.

The most appropriate methods for finding these probabilities are described in some detail, and templates for efficient algorithms are provided.

These algorithms can be executed on any laptop, even in cases where the Markov chain has hundreds of thousands of states.

This book features the probabilistic interpretation of Gaussian elimination, a concept that unifies many of the topics covered, such as embedded Markov chains and matrix analytic methods. The material provided should aid practitioners significantly to solve their problems.

This book also provides an interesting approach to teaching courses of stochastic processes.  

Information

Other Formats

Save 10%

£54.99

£49.15

 
Free Home Delivery

on all orders

 
Pick up orders

from local bookshops

Information

Also in the CMS/CAIMS Books in Mathematics series  |  View all