Sciweavers

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

13

FOSSACS
2006
Springer

favoriteEmaildiscussreport

101views Software Engineering» more FOSSACS 2006»

Parity Games Played on Transition Graphs of One-Counter Processes

13 years 8 months ago

Parity Games Played on Transition Graphs of One-Counter Processes

Download hal.archives-ouvertes.fr

We consider parity games played on special pushdown graphs, namely those generated by one-counter processes. For parity games on pushdown graphs, it is known from [22] that deciding the winner is an ExpTime-complete problem. An important corollary of this result is that the

Olivier Serre

Real-time Traffic

FOSSACS 2006 | Parity Game | Pushdown | Pushdown Graphs | Software Engineering |

claim paper

Related Content

» OneCounter Stochastic Games

» Reduction of stochastic parity to stochastic meanpayoff games

» Simple Stochastic Parity Games

» Quantitative stochastic parity games

» Winning Regions of Pushdown Parity Games A Saturation Method

» Graph Games on Ordinals

» Strategy Improvement for Stochastic Rabin and Streett Games

» Strategy Improvement for Concurrent Safety Games

Post Info
More Details (n/a)

Added	22 Aug 2010
Updated	22 Aug 2010
Type	Conference
Year	2006
Where	FOSSACS
Authors	Olivier Serre

Comments (0)