A Study of Pushdown Games Von der Fakultät für Mathematik, Informatik und Naturwissenschaften der RWTH Aachen University zur Erlangung des akademischen Grades eines Doktors der Naturwissenschaften genehmigte Dissertat

Source URL: cgi.csc.liv.ac.uk

• Formal languages
• Nested word
• Words

Bisimilarity of Probabilistic Pushdown Automata Vojtěch Forejt1 , Petr Jančar2 , Stefan Kiefer1 , and James Worrell1 1 2 Department of Computer Science, University of Oxford, UK

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

• Formal languages
• Mathematics
• Theoretical computer science
• Models of computation
• Discrete mathematics
• Nested word
• Words
• Bisimulation
• Distribution
• Deterministic pushdown automaton

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

INFINITYBranching-Time Model-Checking of Probabilistic Pushdown Automata Tom´asˇ Br´azdil1 V´aclav Broˇzek2 Vojtˇech Forejt3 Faculty of Informatics

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

• Temporal logic
• Mathematical logic
• Theoretical computer science
• Finite model theory
• Linear temporal logic
• Symbol
• FO
• Constructible universe
• IP
• Computation tree logic
• Model theory
• Mathematics

Model Checking Recursive Programs with Numeric Data Types Matthew Hague and Anthony Widjaja Lin Oxford University Computing Laboratory Abstract. Pushdown systems (PDS) naturally model sequential recursive programs. Nume

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

Saturation of Concurrent Collapsible Pushdown Systems M. Hague Royal Holloway University of London, and LIGM, Marne-la-Vall´ee arXiv:1310.2631v1 [cs.FL] 9 Oct 2013

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

Simulating Unary Context-Free Grammars and Pushdown Automata with Finite Automata Giovanni Pighizzini Dipartimento di Informatica e Comunicazione Università degli Studi di Milano ITALY

Source URL: pighizzini.di.unimi.it

Winning regions of higher-order pushdown games∗ A. Carayol† M. Hague‡ A. Meyer§

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

Pruning, Pushdown Exception-Flow Analysis Shuying Liang Weibin Sun Matthew Might

Source URL: matt.might.net