1. L. de Alfaro (1997): Formal Verification of Probabilistic Systems. Ph.D. thesis. Stanford University.
  2. Luca de Alfaro (1998): Stochastic Transition Systems. In: Davide Sangiorgi & Robert de Simone: CONCUR, Lecture Notes in Computer Science 1466. Springer, pp. 423–438. Available at
  3. Luca de Alfaro, Thomas A. Henzinger & Rupak Majumdar (2003): Discounting the Future in Systems Theory. In: Jos C. M. Baeten, Jan Karel Lenstra, Joachim Parrow & Gerhard J. Woeginger: ICALP, Lecture Notes in Computer Science 2719. Springer, pp. 1022–1037. Available at
  4. Luca de Alfaro, Rupak Majumdar, Vishwanath Raman & Mariëlle Stoelinga (2007): Game Relations and Metrics. In: LICS. IEEE Computer Society, pp. 99–108. Available at
  5. Rajeev Alur, Aldric Degorre, Oded Maler & Gera Weiss (2009): On Omega-Languages Defined by Mean-Payoff Conditions. In: Luca de Alfaro: FOSSACS, Lecture Notes in Computer Science 5504. Springer, pp. 333–347. Available at
  6. C. Baier, M. Größer, M. Leucker, B. Bollig & F. Ciesinski (2004): Controller Synthesis for Probabilistic Systems. In: IFIP TCS, pp. 493–506.
  7. Christel Baier, Boudewijn R. Haverkort, Holger Hermanns & Joost-Pieter Katoen (2010): Performance evaluation and model checking join forces. Commun. ACM 53(9), pp. 76–85. Available at
  8. G. Behrmann, J. Bengtsson, A. David, K. G. Larsen, P. Pettersson & W. Yi. (2002): Uppaal Implementation Secrets. In: Formal Techniques in Real-Time and Fault Tolerant Systems.
  9. Andrea Bianco & Luca de Alfaro (1995): Model Checking of Probabalistic and Nondeterministic Systems. In: P. S. Thiagarajan: FSTTCS, Lecture Notes in Computer Science 1026. Springer, pp. 499–513. Available at
  10. Roderick Bloem, Krishnendu Chatterjee, Thomas A. Henzinger & Barbara Jobstmann (2009): Better Quality in Synthesis through Quantitative Objectives. In: Ahmed Bouajjani & Oded Maler: CAV, Lecture Notes in Computer Science 5643. Springer, pp. 140–156. Available at
  11. Roderick Bloem, Karin Greimel, Thomas A. Henzinger & Barbara Jobstmann (2009): Synthesizing robust systems. In: FMCAD. IEEE, pp. 85–92. Available at
  12. Arindam Chakrabarti, Krishnendu Chatterjee, Thomas A. Henzinger, Orna Kupferman & Rupak Majumdar (2005): Verifying Quantitative Properties Using Bound Functions. In: Dominique Borrione & Wolfgang J. Paul: CHARME, Lecture Notes in Computer Science 3725. Springer, pp. 50–64. Available at
  13. Krishnendu Chatterjee, Luca de Alfaro, Marco Faella, Thomas A. Henzinger, Rupak Majumdar & Mariëlle Stoelinga (2006): Compositional Quantitative Reasoning. In: QEST. IEEE Computer Society, pp. 179–188. Available at
  14. Krishnendu Chatterjee, Laurent Doyen & Thomas A. Henzinger (2008): Quantitative Languages. In: Michael Kaminski & Simone Martini: CSL, Lecture Notes in Computer Science 5213. Springer, pp. 385–400. Available at
  15. Krishnendu Chatterjee, Thomas A. Henzinger, Barbara Jobstmann & Rohit Singh (2010): Measuring and Synthesizing Systems in Probabilistic Environments. In: Tayssir Touili, Byron Cook & Paul Jackson: CAV, Lecture Notes in Computer Science 6174. Springer, pp. 380–395. Available at
  16. Costas Courcoubetis & Mihalis Yannakakis (1990): Markov Decision Processes and Regular Events (Extended Abstract). In: Mike Paterson: ICALP, Lecture Notes in Computer Science 443. Springer, pp. 336–349. Available at
  17. R. A. Cuninghame-Green (1979): Minimax algebra. In: Lecture Notes in Economics and Mathematical Systems 166. Springer-Verlag.
  18. C. Derman (1962): On Sequential Decisions and Markov Chains. Management Science 9(1), pp. 16–24.
  19. Josee Desharnais, Vineet Gupta, Radha Jagadeesan & Prakash Panangaden (2004): Metrics for labelled Markov processes. Theor. Comput. Sci. 318(3), pp. 323–354. Available at
  20. M. Droste & P. Gastin (2007): Weighted automata and weighted logics. Theoretical Computer Science 380, pp. 69–86. Available at
  21. M. Droste, W. Kuich & H. Vogler (2009): Handbook of Weighted Automata. Springer Publishing Company, Incorporated.
  22. Manfred Droste, Werner Kuich & George Rahonis (2008): Multi-Valued MSO Logics OverWords and Trees. Fundam. Inform. 84(3-4), pp. 305–327. Available at
  23. J. Filar & K. Vrieze (1996): Competitive Markov Decision Processes. Springer-Verlag.
  24. Stephane Gaubert & Max Plus (1997): Methods and Applications of (MAX, +) Linear Algebra. In: Rüdiger Reischuk & Michel Morvan: STACS, Lecture Notes in Computer Science 1200. Springer, pp. 261–282. Available at
  25. Hugo Gimbert (2007): Pure Stationary Optimal Strategies in Markov Decision Processes. In: Wolfgang Thomas & Pascal Weil: STACS, Lecture Notes in Computer Science 4393. Springer, pp. 200–211. Available at
  26. A. Hinton, M. Kwiatkowska, G. Norman & D. Parker (2006): PRISM: A Tool for Automatic Verification of Probabilistic Systems. In: TACAS.
  27. J. R. Isbell & W. H. Marlow (1956): Attrition games. Naval Research Logistics Quarterly 3, pp. 71–94.
  28. Orna Kupferman & Yoad Lustig (2007): Lattice Automata. In: Byron Cook & Andreas Podelski: VMCAI, Lecture Notes in Computer Science 4349. Springer, pp. 199–213. Available at
  29. J.R. Norris (2003): Markov Chains. Cambridge University Press.
  30. M. L. Puterman (1994): Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley-Interscience.
  31. H. C. Tijms (2003): A First Course in Stochastic Models. Chichester: Wiley.
  32. Ralf Wimmer, Bettina Braitling, Bernd Becker, Ernst Moritz Hahn, Pepijn Crouzen, Holger Hermanns, Catuscia Dhama & Oliver E. Theel (2010): Symblicit Calculation of Long-Run Averages for Concurrent Probabilistic Systems. In: QEST. IEEE Computer Society, pp. 27–36. Available at
  33. Uri Zwick & Mike Paterson (1996): The Complexity of Mean Payoff Games on Graphs. Theor. Comput. Sci. 158(1&2), pp. 343–359. Available at

Comments and questions to:
For website issues: