R W1.T1.1: Detecting reversible structures in markovian process algebra, M.~Bhabuta, P.G. Harrison, and K.~Kanani.

R W2.T1.1: Norton's Equivalent for Queueing Networks with State-Dependent Routing, R.J. Boucherie.
R W2.T1.2: A Characterization of Independence for Competing Markov Chains with Applications to Stochastic Petri Nets, R.J. Boucherie.
R W2.T1.3: Product Forms Based on Backward Traffic Equations, R.J. Boucherie.
R W2.T2.1: Mean Value Analysis of Stochastic Petri Nets, M. Sereno and G. Balbo.
R W2.T2.2: Computational Algorithms for Product Form Solution Stochastic Petri Nets, M. Sereno and G. Balbo.
R W2.T2.3: Duality and Equivalencies in Closed Tandem Queueing Networks, Z. Liu and J. Resing.
R W2.T2.4: Products of Irreducible Random Matrices in the #tex2html_wrap411# algebra, J. Mairesse.

R W3.T1.1: Load Balancing Pargmatics, E. Gelenbe and F. Pekergin
R W3.T2.1: Incremental Dynamic Load Balancing in Distributed Systems, E. Gelenbe and R. Kushwaha.
R W3.T2.2: Optimality of the Round Robin Routing Policy, Z. Liu and D. Towsley.
R W3.T2.3: Stochastic Scheduling Games with Markov Decision Arrival Processes, E. Altman and G. Koole.
R W3.T2.4: On the optimality of FCFS for networks of multi-server queues, G. Koole.
R W3.T2.5: Control of a Random Walk with Noisy Delayed Information, E. Altman and G. Koole.
R W3.T2.6: Optimal repairman assignment in two maintenance models which are equivalent to routing models with early decisions, G. Koole.
R W3.T3.1: Stochastic Bounds for a Polling System, O. Boxma and M. Kelbert.
R W3.T3.2: Optimization of Fixed Time Polling Systems, S.C. Borst, O.J. Boxma, J.H.A. Harink and G.B. Huitema.