Computational Probability

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Great advances have been made in recent years in the field of computational probability. In particular, the state of the art - as it relates to queuing systems, stochastic Petri-nets and systems dealing with reliability - has benefited significantly from these advances. The objective of this book is to make these topics accessible to researchers, graduate students, and practitioners. Great care was taken to make the exposition as clear as possible. Every line in the book has been evaluated, and changes have been made whenever it was felt that the initial exposition was not clear enough for the intended readership.
The work of major research scholars in this field comprises the individual chapters of Computational Probability. The first chapter describes, in nonmathematical terms, the challenges in computational probability. Chapter 2 describes the methodologies available for obtaining the transition matrices for Markov chains, with particular emphasis on stochastic Petri-nets. Chapter 3 discusses how to find transient probabilities and transient rewards for these Markov chains. The next two chapters indicate how to find steady-state probabilities for Markov chains with a finite number of states. Both direct and iterative methods are described in Chapter 4. Details of these methods are given in Chapter 5. Chapters 6 and 7 deal with infinite-state Markov chains, which occur frequently in queueing, because there are times one does not want to set a bound for all queues. Chapter 8 deals with transforms, in particular Laplace transforms. The work of Ward Whitt and his collaborators, who have recently developed a number of numerical methods for Laplace transform inversions, is emphasized in this chapter. Finally, if one wants to optimize a system, one way to do the optimization is through Markov decision making, described in Chapter 9. Markov modeling has found applications in many areas, three of which are described in detail: Chapter 10 analyzes discrete-time queues, Chapter 11 describes networks of queues, and Chapter 12 deals with reliability theory.

Author(s): Winfried K. Grassmann (auth.), Winfried K. Grassmann (eds.)
Series: International Series in Operations Research & Management Science 24
Edition: 1
Publisher: Springer US
Year: 2000

Language: English
Pages: 490
Tags: Operation Research/Decision Theory; Probability Theory and Stochastic Processes; Statistics, general

Front Matter....Pages i-viii
Computational Probability: Challenges and Limitations....Pages 1-9
Tools for Formulating Markov Models....Pages 11-41
Transient Solutions for Markov Chains....Pages 43-79
Numerical Methods for Computing Stationary Distributions of Finite Irreducible Markov Chains....Pages 81-111
Stochastic Automata Networks....Pages 113-151
Matrix Analytic Methods....Pages 153-203
Use of Characteristic Roots for Solving Infinite State Markov Chains....Pages 205-255
An Introduction to Numerical Transform Inversion and Its Application to Probability Models....Pages 257-323
Optimal Control of Markov Chains....Pages 325-363
On Numerical Computations of Some Discrete-Time Queues....Pages 365-408
The Product form Tool for Queueing Networks....Pages 409-443
Techniques for System Dependability Evaluation....Pages 445-479
Back Matter....Pages 481-490