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 http://link.springer.de/link/service/series/0558/bibs/2719/27191022.htm.
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 http://doi.ieeecomputersociety.org/10.1109/LICS.2007.22.
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 http://dx.doi.org/10.1007/978-3-642-00596-1_24.
C. Baier, M. Größer, M. Leucker, B. Bollig & F. Ciesinski (2004):
Controller Synthesis for Probabilistic Systems.
In: IFIP TCS,
pp. 493–506.
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 http://doi.acm.org/10.1145/1810891.1810912.
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.
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 http://dx.doi.org/10.1007/3-540-60692-0_70.
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 http://dx.doi.org/10.1007/978-3-642-02658-4_14.
Roderick Bloem, Karin Greimel, Thomas A. Henzinger & Barbara Jobstmann (2009):
Synthesizing robust systems.
In: FMCAD.
IEEE,
pp. 85–92.
Available at http://dx.doi.org/10.1109/FMCAD.2009.5351139.
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 http://dx.doi.org/10.1007/11560548_7.
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 http://doi.ieeecomputersociety.org/10.1109/QEST.2006.11.
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 http://dx.doi.org/10.1007/978-3-540-87531-4_28.
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 http://dx.doi.org/10.1007/978-3-642-14295-6_34.
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 http://dx.doi.org/10.1007/BFb0032043.
R. A. Cuninghame-Green (1979):
Minimax algebra.
In: Lecture Notes in Economics and Mathematical Systems 166.
Springer-Verlag.
C. Derman (1962):
On Sequential Decisions and Markov Chains.
Management Science 9(1),
pp. 16–24.
Josee Desharnais, Vineet Gupta, Radha Jagadeesan & Prakash Panangaden (2004):
Metrics for labelled Markov processes.
Theor. Comput. Sci. 318(3),
pp. 323–354.
Available at http://dx.doi.org/10.1016/j.tcs.2003.09.013.
J. Filar & K. Vrieze (1996):
Competitive Markov Decision Processes.
Springer-Verlag.
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 http://dx.doi.org/10.1007/BFb0023465.
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 http://dx.doi.org/10.1007/978-3-540-70918-3_18.
A. Hinton, M. Kwiatkowska, G. Norman & D. Parker (2006):
PRISM: A Tool for Automatic Verification of Probabilistic Systems.
In: TACAS.
J. R. Isbell & W. H. Marlow (1956):
Attrition games.
Naval Research Logistics Quarterly 3,
pp. 71–94.
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 http://dx.doi.org/10.1007/978-3-540-69738-1_14.
J.R. Norris (2003):
Markov Chains.
Cambridge University Press.
M. L. Puterman (1994):
Markov Decision Processes: Discrete Stochastic Dynamic Programming.
Wiley-Interscience.
H. C. Tijms (2003):
A First Course in Stochastic Models.
Chichester: Wiley.
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 http://dx.doi.org/10.1109/QEST.2010.12.
Uri Zwick & Mike Paterson (1996):
The Complexity of Mean Payoff Games on Graphs.
Theor. Comput. Sci. 158(1&2),
pp. 343–359.
Available at http://dx.doi.org/10.1016/0304-3975(95)00188-3.