Verifying the LTL to B¨ uchi Automata Translation via Very Weak Alternating Automata Simon Jantsch1 and Michael Norrish2 1

Source URL: cakeml.org

• Finite automata
• Temporal logic
• Model checking
• Theoretical computer science
• Formal methods
• Mathematical logic
• Linear temporal logic
• Computation tree logic
• Alternating finite automaton
• Generalized Bchi automaton
• Bchi automaton

The Hanoi Omega-Automata Format This document describes the Hanoi Omega-Automata (HOA) format. The name is a reference to the ATVA’13 conference, which was organized in Hanoi, and where the foundations of this format w

Source URL: adl.github.io

• Finite automata
• Model checking
• -automaton
• Generalized Bchi automaton
• Bchi automaton
• Buchi
• Muller automaton
• Automata theory

Considering Typestate Verification for Quantified Event Automata Giles Reger University of Manchester, Manchester, UK Abstract. This paper discusses how the existing static analyses developed for

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

• Program analysis
• Typestate analysis
• Mathematical logic
• Logic
• Mathematics
• Runtime verification
• Quantifier
• Type system
• Sheaf

Language Equivalence of Probabilistic Pushdown Automata Vojtˇech Forejta , Petr Janˇcarb , Stefan Kiefera , James Worrella a Department b Dept

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

• Formal languages
• IP
• Mathematics
• Grammar
• Theoretical computer science
• Nested stack automaton
• Indexed grammar

Branching-Time Model-Checking of Probabilistic Pushdown Automata Tom´asˇ Br´azdila,1 , V´aclav Broˇzeka , Vojtˇech Forejtb,a , Anton´ın Kuˇceraa,1 a b

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

• Symbol
• Linear temporal logic
• Constructible universe
• Markov chain
• Probabilistic logic
• Logic
• Mathematics
• Epistemology

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

MeCBICTimed P Automata Roberto Barbutia,1 Andrea Maggiolo-Schettinia,1 Paolo Milazzoa,1 Luca Teseib,2 a

Source URL: pages.di.unipi.it

• Models of computation
• Timed automaton
• Symbol
• Multiset
• P system
• Mathematics
• Mobile membranes