Modular Strategies for Infinite Games on Recursive Graphs

Thumbnail Image
Penn collection
Departmental Papers (CIS)
Degree type
CPS Theory
Grant number
Copyright date
Related resources
La Torre, Salvatore
Madhusudan, P.

In this paper, we focus on solving games in recursive game graphs that can model the control flow of sequential programs with recursive procedure calls. The winning condition is given as an ω-regular specification over the observable, and, unlike traditional pushdown games, the strategy is required to be modular: resolution of choices within a component should not depend on the context in which the component is invoked, but only on the history within the current invocation of the component. We first consider the case when the specification is given as a deterministic Büchi automaton. We show the problem to be decidable, and present a solution based on two-way alternating tree automata with time complexity that is polynomial in the number of internal nodes, exponential in the specification and exponential in the number of exits of the components. We show that the problem is EXPTIME-complete in general, and NP-complete for fixed-size specifications. Then, we show that the same complexity bounds apply if the specification is given as a universal co-Büchi automaton. Finally, for specifications given as formulas of linear temporal logic LTL, we obtain a synthesis algorithm that is doubly-exponential in the formula and singly exponential in the number of exits of components.

Date of presentation
Conference name
Departmental Papers (CIS)
Conference dates
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 DOI
Journal Issue
From the 15th International Conference, CAV 2003, Boulder, CO, USA, July 8-12, 2003.
Postprint version. Published in Lecture Notes in Computer Science, Volume 2725, Computer Aided Verification, 2003, pages 67-79. Publisher URL:
Recommended citation