Description

Book Synopsis

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.




Trade Review
“This monograph is an exciting addition to the queueing/stochastic processes literature,
written by two highly respected senior researchers. … The writing is precise and clear. Well-known models are used as examples to illustrate the methods presented. … It has a huge number of powerful techniques that are not given sufficient focus elsewhere. This may be one of the best books to introduce graduate students … . This monograph is essential for the bookshelf … of every serious queueing theorist.” (Myron Hlynka, Mathematical Reviews, December, 2023)

Table of Contents
Basic Concepts and Definitions.- Systems with Events Generated by Poisson or by Binomial Processes.- Generating the Transition Matrix.- Systems with Events Created by Renewal Processes.- Systems with Events Created by Phase-type Processes.- Computational Complexity and Rounding and Truncation Errors.- Transient Solutions of Markov Chains.- Moving Toward the Statistical Equilibrium.- Equilibrium Solutions of Markov Chains and Related Topics.- Reducing the State Space Through Censoring and Embedding.- Systems with Independent or Almost Independent Components.- Infinite-State Markov Chains and Matrix Analytic Methods.

Numerical Methods for Solving Discrete Event

Product form

£71.24

Includes FREE delivery

RRP £74.99 – you save £3.75 (5%)

Order before 4pm tomorrow for delivery by Thu 15 Jan 2026.

A Hardback by Winfried Grassmann, Javad Tavakoli

Out of stock


    View other formats and editions of Numerical Methods for Solving Discrete Event by Winfried Grassmann

    Publisher: Springer International Publishing AG
    Publication Date: 05/11/2022
    ISBN13: 9783031100819, 978-3031100819
    ISBN10: 3031100816

    Description

    Book Synopsis

    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.




    Trade Review
    “This monograph is an exciting addition to the queueing/stochastic processes literature,
    written by two highly respected senior researchers. … The writing is precise and clear. Well-known models are used as examples to illustrate the methods presented. … It has a huge number of powerful techniques that are not given sufficient focus elsewhere. This may be one of the best books to introduce graduate students … . This monograph is essential for the bookshelf … of every serious queueing theorist.” (Myron Hlynka, Mathematical Reviews, December, 2023)

    Table of Contents
    Basic Concepts and Definitions.- Systems with Events Generated by Poisson or by Binomial Processes.- Generating the Transition Matrix.- Systems with Events Created by Renewal Processes.- Systems with Events Created by Phase-type Processes.- Computational Complexity and Rounding and Truncation Errors.- Transient Solutions of Markov Chains.- Moving Toward the Statistical Equilibrium.- Equilibrium Solutions of Markov Chains and Related Topics.- Reducing the State Space Through Censoring and Embedding.- Systems with Independent or Almost Independent Components.- Infinite-State Markov Chains and Matrix Analytic Methods.

    Recently viewed products

    © 2026 Book Curl

      • American Express
      • Apple Pay
      • Diners Club
      • Discover
      • Google Pay
      • Maestro
      • Mastercard
      • PayPal
      • Shop Pay
      • Union Pay
      • Visa

      Login

      Forgot your password?

      Don't have an account yet?
      Create account