Parameter Synthesis for Probabilistic Timed Automata Using Stochastic Game Abstractions Aleksandra Jovanovi´c, Marta Kwiatkowska Department of Computer Science, University of Oxford, Oxford, UK Abstract

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

• Statistical models
• Probability and statistics
• Statistical theory
• Statistics
• Timed automaton
• Parametric model
• Parameter
• Markov decision process
• Markov chain

Symbolic Optimal Expected Time Reachability Computation and Controller Synthesis for Probabilistic Timed Automata Aleksandra Jovanovi´ca , Marta Kwiatkowskaa , Gethin Normanb , Quentin Peyrasc a Department

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

• Dynamic programming
• Markov processes
• Stochastic control
• Markov decision process
• Approximation algorithms
• Probability
• Computational complexity theory

Reachability in Stochastic Timed Games Patricia Bouyer? and Vojtˇech Forejt?? 1 2

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

• Algebra
• Mathematics
• Abstract algebra
• Timed automaton
• Markov chain
• Weight
• Markov decision process
• -ring
• Spectral theory of ordinary differential equations

Design and Verification of Long–Running Transactions in a Timed Framework Ruggero Lanotte a , Andrea Maggiolo–Schettini b , Paolo Milazzo b , Angelo Troina c,d,∗ a Dipartimento

Source URL: pages.di.unipi.it

• Mathematics
• Algebra
• Abstract algebra
• Field theory
• Distribution
• Functional analysis
• Papyrus 1
• Valuation

Uniform Sampling for Timed Automata with Application to Language Inclusion Measurement? Benoˆıt Barbot1?? , Nicolas Basset1 , Marc Beunardeau2? ? ? , and Marta Kwiatkowska1 1

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

• Mathematical analysis
• Uniform distribution
• Limit of a function
• Timed automaton
• Differential calculus
• BKL singularity

Symbolic Verification and Strategy Synthesis for Linearly-Priced Probabilistic Timed Automata Marta Kwiatkowska1 , Gethin Norman2 , and David Parker3 1 Department of Computer Science, University of Oxford, Oxford, UK

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

• Dynamic programming
• Markov decision process
• Stochastic control
• Symbol
• Timed automaton
• Probability and statistics
• Probability
• Approximation algorithms
• Computational complexity theory

Building Power Consumption Models from Executable Timed I/O Automata Specifications ∗ Benoît Barbot , Marta Kwiatkowska, Alexandru Mereacre and Nicola Paoletti Department of Computer Science, University of Oxford, UK

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

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

Lipschitz Robustness of Timed I/O Systems? Thomas A. Henzinger1 , Jan Otop1,2 and Roopsha Samanta1 1 2

Source URL: www.cs.purdue.edu

• Finite automata
• Finite-state transducer
• Timed automaton
• Finite-state machine
• Control theory
• XC
• Applied mathematics
• Mathematics
• Systems science
• Tree transducer

Checotah, Oklahoma July 4, 2018 BARREL RACE Warm Up 20 MIN Sessions $10/horse 8:30/9:30 am Barrels will be setup 10 riders/session (SOLD ON SITE) Exhibitions (timed on stakes) 9:30-11:15 am (SOLD ON SITE) 12 PM SHARP! Op

Source URL: www.barrelbash.com