Visibly Pushdown Games
The class of visibly pushdown languages has been recently defined as a subclass of context-free languages with desirable closure properties and tractable decision problems. We study visibly pushdown games, which are games played on visibly pushdown systems where the winning condition is given by a visibly pushdown language. We establish that, unlike pushdown games with pushdown winning conditions, visibly pushdown games are decidable and are 2Exptime-complete. We also show that pushdown games against Ltl specifications and Caret specifications are 3Exptime-complete. Finally, we establish the topological complexity of visibly pushdown languages by showing that they are a subclass of Boolean combinations of Σ 3 sets. This leads to an alternative proof that visibly pushdown automata are not determinizable and also shows that visibly pushdown games are determined.
Unable to display preview. Download preview PDF.
- 2.Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, STOC 2004 (2004)Google Scholar
- 6.Emerson, E.A., Jutla, C.S., Sistla, A.P.: On model-checking for fragments of μ-calculus. In: CAV 1993. LNCS, vol. 697, pp. 385–396. Springer, Heidelberg (1993)Google Scholar
- 7.Kechris, A.S.: Classical Descriptive Set Theory. Graduate texts in mathematics, vol. 156. Springer, Heidelberg (1994)Google Scholar
- 9.Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Proc. 16th ACM Symposium on Principles of Programming Languages, Austin (January 1989)Google Scholar
- 10.Reps, T., Horwitz, S., Sagiv, S.: Precise interprocedural dataflow analysis via graph reachability. In: Proc. of ACM Symp. POPL, pp. 49–61 (1995)Google Scholar
- 12.Staiger, L.: ω-Languages. In: Handbook of Formal Language Theory, vol. III, Springer, Heidelberg (1997)Google Scholar
- 13.Thomas, W.: Languages, Automata, and Logic. In: Handbook of Formal Language Theory, vol. III, pp. 389–455. Springer, Heidelberg (1997)Google Scholar
- 15.Walukiewicz, I.: Pushdown processes: Games and model checking. Information and Computation 164(2) (January 2001)Google Scholar
- 16.Walukiewicz, I.: A landscape with games in the background. To appear in Proceedings of LICS 2004 (2004) (Invited talk)Google Scholar