Visibly Pushdown Modular Games

Games on recursive game graphs can be used to reason about the control flow of sequential programs with recursion. In games over recursive game graphs, the most natural notion of strategy is the modular strategy, i.e., a strategy that is local to a module and is oblivious to previous module invocations, and thus does not depend on the context of invocation. In this work, we study for the first time modular strategies with respect to winning conditions that can be expressed by a pushdown automaton. We show that such games are undecidable in general, and become decidable for visibly pushdown automata specifications. Our solution relies on a reduction to modular games with finite-state automata winning conditions, which are known in the literature. We carefully characterize the computational complexity of the considered decision problem. In particular, we show that modular games with a universal Buchi or co Buchi visibly pushdown winning condition are EXPTIME-complete, and when the winning condition is given by a CARET or NWTL temporal logic formula the problem is 2EXPTIME-complete, and it remains 2EXPTIME-hard even for simple fragments of these logics. As a further contribution, we present a different solution for modular games with finite-state automata winning condition that runs faster than known solutions for large specifications and many exits.Comment: In Proceedings GandALF 2014, arXiv:1408.556

Spartan Daily, October 4, 2001

Volume 117, Issue 25https://scholarworks.sjsu.edu/spartandaily/9730/thumbnail.jp

Spartan Daily, January 30, 2001

Volume 116, Issue 3https://scholarworks.sjsu.edu/spartandaily/9639/thumbnail.jp

Spartan Daily, November 8, 2001

Volume 117, Issue 50https://scholarworks.sjsu.edu/spartandaily/9755/thumbnail.jp

Spartan Daily, October 25, 2004

Volume 123, Issue 39https://scholarworks.sjsu.edu/spartandaily/10043/thumbnail.jp

Spartan Daily, January 31, 2001

Volume 116, Issue 4https://scholarworks.sjsu.edu/spartandaily/9640/thumbnail.jp

Spartan Daily, February 15, 2006

Volume 126, Issue 12https://scholarworks.sjsu.edu/spartandaily/10212/thumbnail.jp

Logic and Automata

Mathematical logic and automata theory are two scientific disciplines with a fundamentally close relationship. The authors of Logic and Automata take the occasion of the sixtieth birthday of Wolfgang Thomas to present a tour d'horizon of automata theory and logic. The twenty papers in this volume cover many different facets of logic and automata theory, emphasizing the connections to other disciplines such as games, algorithms, and semigroup theory, as well as discussing current challenges in the field