Computational Probability

Free delivery worldwide

Available. Dispatched from the UK in 3 business days
When will my order arrive?


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.
show more

Product details

  • Hardback | 490 pages
  • 157.5 x 236.2 x 33mm | 952.56g
  • Dordrecht, Netherlands
  • English
  • 1999 ed.
  • VIII, 490 p.
  • 0792386175
  • 9780792386179

Table of contents

Preface. 1. Computational Probability: Challenges and Limitations; W.K. Grassmann. 2. Tools for Formulating Markov Models; G. Ciardo. 3. Transient Solutions for Markov Chains; E. de Souza e Silva, H.R. Gail. 4. Numerical Methods for Computing Stationary Distributions of Finite Irreducible Markov Chains; W.J. Stewart. 5. Stochastic Automata Networks; B. Plateau, W.J. Steward. 6. Matrix Analytic Methods; W.K. Grassmann, D.A. Stanford. 7. Use of Characteristic Roots for Solving Infinite State Markov Chains; H.R. Gail, et al. 8. An Introduction to Numerical Transform Inversion and Its Application to Probability Models; J. Abate, et al. 9. Optimal Control of Markov Chains; S. Stidham, Jr. 10. On Numerical Computations of Some Discrete-Time Queues; M.L. Chaudhry. 11. The Product Form Tool for Queueing Networks; N.M. van Dijk, W.K. Grassmann. 12. Techniques for System Dependability Evaluation; J.K. Muppala, et al. Index.
show more