Computations with Markov Chains -

. .

Résumé :
.

Sommaire:
Preface. 1. Detecting Block GI/M/1 and Block M/G/1 Matrices from Model Specifications; S. Berson, R. Muntz. 2. On Cyclic Reduction Applied to a Class of Toeplitz-like Matrices Arising in Queueing Problems; D. Bini, B. Meini. 3. A Markov Modulated, Nearly Completely Decomposable M/M/1 Queue; G. Latouche, P.J. Schweitzer. 4. Preconditioned Krylov Subspace Methods for the Numerical Solution of Markov Chains; Y. Saad. 5. A Parallel Block Projection Method of the Cimmino Type for Finite Markov Chains; M. Benzi, F. Sgallari, G. Spaletta. 6. Iterative Methods for Queueing Models with Batch Arrivals; R.H. Chan, W-K. Ching. 7. Transient Solutions of Markov Processes by Krylov Subspaces; R.B. Sidje, B. Philippe. 8. Exact Methods for the Transient Analysis of Nonhomogeneous Continuous Time Markov Chains; A. Rindos, S. Woolet, I. Viniotis, K. Trivedi. 9. Time-Dependent Behavior of Redundant Systems with Deterministic Repair; D. Logothetis, K. Trivedi. 10. What is Fundamental for Markov Chains: First Passage Times, Fundamental Matrices, and Group Generalized Inverses; D.P. Heyman, D.P. O'Leary. 11. Immediate Events in Markov Chains; W.K. Grassmann, Yuru Wang. 12. Compositional Markovian Modelling Using a Process Algebra; J. Hillston. 13. Equivalence Relations for Stochastic Automata Networks; P. Buchholz. 14. Graphs and Stochastic Automata Networks; J.-M. Fourneau, F. Quessette. 15. Analyzing Sample Path Data from Markov Chain Sampling Experiments; G. Fishman. 16. Resource Sharing Models with State-Dependent Arrivalsof Batches; G.L. Choudhury, K.K. Leung, W. Whitt. 17. Implementable Policies: Discounted Cost Case; V.G. Kulkarni, Y. Serin. 18. Two Bounding Schemes for the Steady-State Solution of Markov Chains; P. Semal. 19. The Power-Series Algorithm for Markovian Queueing Networks; W.B. van den Hout, J.P.C. Blanc. 20. Discrete-Time Markovian Stochastic Petri Nets; G. Ciardo. 21. Concurrent Generalized Petri Nets; V. Catania, A. Puliafito, M. Scarpa, L. Vita. 22. Exploiting Isomorphisms and Special Structures in the Analysis of Markov Regenerative Stochastic Petri Nets; C. Lindemann. 23. Numerical Solution of Large Finite Markov Chains by Algebraic Multigrid Techniques; U.R. Krieger. 24. On the Utility of the Multi-Level Algorithm for the Solution of Nearly Completely Decomposable Markov Chains; S.T. Leutenegger, G. Horton. 25. A Computationally Efficient Algorithm for Characterizing the Superposition of Multiple Heterogeneous Interrupted Bernoulli Processes; K.M. Elsayed, H.G. Perros. 26. Generalized Folding Algorithm for Transient Analysis of Finite QBD Processes and its Queueing Applications; S-Q. Li, H-D. Sheng. 27. Efficient Solutions for a Class of Non-Markovian Models; E. de Souza e Silva, H.R. Gail, R.R. Muntz. 28. Markovian Arrival and Service Communication Systems: Spectral Expansions, Separability and Kronecker-Product Forms; A. Elwalid, D. Mitra. 29. Empirical Comparison of Uniformization Methods for Continuous-Time Markov Chains; J.D. Diener, W.H. Sanders. 30. Numerical Methods for M/G/1 Type Queues;