We consider two-player reachability games with additional resource counters on arenas that are induced by the configuration graphs of pushdown systems. For a play, we define the resource cost to be the highest occurring counter value. In this way, we quantify resources and memory that player 0 needs to win. We introduce the bounded winning problem: Is there a uniform bound k such that player 0 can win the game from a set of initial configurations with this bound k? We provide an effective, saturation-based method to solve this problem for regular sets of initial and goal configurations. © 2014 Springer-Verlag.
CITATION STYLE
Lang, M. (2014). Resource reachability games on pushdown graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8412 LNCS, pp. 195–209). Springer Verlag. https://doi.org/10.1007/978-3-642-54830-7_13
Mendeley helps you to discover research relevant for your work.