Modular Strategies for Recursive Game Graphs

Loading...
Thumbnail Image
Penn collection
Departmental Papers (CIS)
Degree type
Discipline
Subject
CPS Theory
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
La Torre, Salvatore
Madhusudan, P.
Contributor
Abstract

In this paper, we focus on solving games in recursive game graphs that can model the control ow in sequential programs with recursive procedure calls. While such games can be viewed as the pushdown games studied in the literature, the natural notion of winning in our framework requires the strategies to be modular with only local memory; that is, resolution of choices within a module does not depend on the context in which the module is invoked, but only on the history within the current invocation of the module. While reachability in (global) pushdown games is known to be EXPTIME-complete, we show reachability in modular games to be NP-complete. We present a fixpoint computation algorithm for solving modular games such that the worst-case number of iterations is exponential in the total number of returned values from the modules. If the strategy within a module does not depend on the global history, but can remember the history of the past invocations of this module, that is, if memory is local but persistent, we show that reachability becomes undecidable.

Advisor
Date of presentation
2003-04-07
Conference name
Departmental Papers (CIS)
Conference dates
2023-05-16T22:30:55.000
Conference location
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Volume number
Issue number
Publisher
Publisher DOI
Journal Issue
Comments
From the 9th International Conference, TACAS 2003 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2003 Warsaw, Poland, April 7–11, 2003.
Postprint version. Published in Lecture Notes in Computer Science, Volume 2619, Tools and Algorithms for the Construction and Analysis of Systems, 2003, pages 363-378. Publisher URL: http://springerlink.metapress.com/link.asp?id=unhytq9djp9j5mjn
Recommended citation
Collection