Logical Methods in Computer Science Vol. 10(1:, pp. 1–29 www.lmcs-online.org Submitted Published

Source URL: qav.comlab.ox.ac.uk

• Mathematics
• Mathematical analysis
• Applied mathematics
• Boolean algebra
• Experiment
• Measure theory
• Sigma-algebra
• Markov decision process
• Game theory
• Mathematical optimization

Stochastic Games for Verification of Probabilistic Timed Automata Marta Kwiatkowska, Gethin Norman, and David Parker Oxford University Computing Laboratory, Parks Road, Oxford, OX1 3QD Abstract. Probabilistic timed auto

Source URL: qav.comlab.ox.ac.uk

• Dynamic programming
• Markov decision process
• Stochastic control
• Symbol
• PP
• Probability and statistics
• Probability
• Theoretical computer science
• Models of computation

Compositional Strategy Synthesis for Stochastic Games with Multiple Objectives N. Basseta , M. Kwiatkowskaa,∗, C. Wiltschea a Department of Computer Science, University of Oxford, United Kingdom

Source URL: qav.comlab.ox.ac.uk

• Probability theory
• Statistical randomness
• Probability
• Markov models
• Stochastic game
• Markov chain
• Determinacy
• Game theory
• Strategy
• Probabilistic automaton
• Markov decision process
• Stochastic process

Rigorous Reachability Analysis and Domain Decomposition of Taylor Models Martin Berz and Kyoko Makino Department of Physics and Astronomy Michigan State University

Source URL: www.cs.ox.ac.uk

• Numerical methods for ordinary differential equations
• Domain decomposition methods
• Numerical analysis
• Numerical software
• Mathematical analysis
• PROPT

Approximation of Probabilistic Reachability for Chemical Reaction Networks using the Linear Noise Approximation∗ Luca Bortolussi3 , Luca Cardelli1,2 , Marta Kwiatkowska2 , and Luca Laurenti2 1

Source URL: qav.comlab.ox.ac.uk

• Statistical randomness
• Mathematical analysis
• Probability theory
• Stochastic processes
• Markov models
• Graph theory
• Markov chain
• Stochastic differential equations
• Distribution
• Stochastic simulation
• Normal distribution
• Decomposition of spectrum

Trading Performance for Stability in Markov Decision Processes Tom´asˇ Br´azdil∗ , Krishnendu Chatterjee† , Vojtˇech Forejt‡∗ , and Anton´ın Kuˇcera∗ ∗ Faculty of Informatics, Masaryk University ({xbr

Source URL: qav.comlab.ox.ac.uk

Expected Reachability-Time Games Vojtˇech Forejta , Marta Kwiatkowskaa , Gethin Normanb , Ashutosh Trivedic a Department of Computer Science, University of Oxford, UK. of Computing Science, University of Glasgow, UK.

Source URL: qav.comlab.ox.ac.uk

Automated Verification Techniques for Probabilistic Systems Vojtˇech Forejt1 , Marta Kwiatkowska1 , Gethin Norman2 , and David Parker1 1 Department of Computer Science, University of Oxford, Oxford, OX1 3QD, UK

Source URL: qav.comlab.ox.ac.uk

• Markov models
• Probability
• Dynamic programming
• Markov processes
• Stochastic control
• Markov decision process
• Markov chain
• Linear temporal logic
• S2
• Reinforcement learning
• S0

T DR AF Quantitative Verification Techniques for Biological Processes Marta Kwiatkowska, Gethin Norman, and David Parker

Source URL: qav.comlab.ox.ac.uk

• Protein kinases
• Cell biology
• Biology
• Signal transduction
• Cell signaling
• Biochemistry
• Mitogen-activated protein kinase kinase
• Mitogen-activated protein kinase
• MAPK phosphatase
• Mitogen
• MAP kinase kinase kinase

The Satisfiability Problem for Probabilistic CTL Tom´asˇ Br´azdil Vojtˇech Forejt Jan Kˇret´ınsk´y

Source URL: qav.comlab.ox.ac.uk

• Theoretical computer science
• Mathematics
• Logic in computer science
• Mathematical analysis
• Temporal logic
• Generalizations of the derivative
• Computation tree logic
• Boolean satisfiability problem
• Symbol
• Model theory
• 120-cell
• Distribution