Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

CORR
2007
Springer

favoriteEmaildiscussreport

151views Education» more CORR 2007»

The Complexity of Games on Higher Order Pushdown Automata

13 years 4 months ago

The Complexity of Games on Higher Order Pushdown Automata

Download www.liafa.jussieu.fr

Abstract. We prove an n-exptime lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches the known upper bound for parity games on HPDA. As a consequence the µ-calculus model checking over graphs given by n-HPDA is n-exptime complete.

Thierry Cachat, Igor Walukiewicz

Real-time Traffic

CORR 2007 | Education | HPDA | N-exptime Lower Bound | Reachability Game |

claim paper

Related Content

» Winning Regions of HigherOrder Pushdown Games

» Parametrized Regular Infinite Games and HigherOrder Pushdown Strategies

» Regular Sets of HigherOrder Pushdown Stacks

» Visibly Pushdown Games

» Symbolic BackwardsReachability Analysis for HigherOrder Pushdown Systems

» An Alternative Construction in Symbolic Reachability Analysis of Second Order Pushdown Sys...

» Verification of HigherOrder Computation A GameSemantic Approach

» On Global Model Checking Trees Generated by HigherOrder Recursion Schemes

» The Complexity of Model Checking Collapsible HigherOrder Pushdown Systems

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	CORR
Authors	Thierry Cachat, Igor Walukiewicz

Comments (0)