Infinite games on finitely coloured graphs with applications to automata on infinite trees
Theoretical Computer Science
On the complexity of verifying concurrent transition systems
Information and Computation
Automata logics, and infinite games: a guide to current research
Automata logics, and infinite games: a guide to current research
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
Complexity bounds for regular games
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Strategy machines and their complexity
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Hi-index | 0.00 |
When studying games played on finite arenas, the arena is given explicitly, hiding the underlying structure of the arena. We study games where the global arena is a product of several smaller, constituent arenas. We investigate how these "global games" can be solved by playing "component games" on the constituent arenas. To this end, we introduce two kinds of products of arenas. Moreover, we define a suitable notion of strategy composition and show how, for the first notion of product, winning strategies in reachability games can be composed from winning strategies in games on the constituent arenas. For the second kind of product, the complexity of solving the global game shows that a general composition theorem is equivalent to proving Pspace = Exptime.