• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Numerical Methods for Solving Discrete Event Systems: With Applications to Queueing Systems

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

Paperback

Series: Cms/Caims Books in Mathematics, Book 5

General MathematicsProbability & Statistics

Currently unavailable to order

ISBN10: 3031100840
ISBN13: 9783031100840
Publisher: Springer
Published: Nov 6 2023
Pages: 362
Language: English

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.

Also in

General Mathematics