Parity Games on Bounded Phase Multi-pushdown Systems
In this paper we address the problem of solving parity games over the configuration graphs of bounded phase multi-pushdown systems. A non-elementary decision procedure was proposed for this problem by A. Seth. In this paper, we provide a simple and inductive construction to solve this problem. We also prove a non-elementary lower-bound, answering a question posed by A. Seth.
KeywordsStrategy Function Atomic Formula Winning Strategy Valuation Function Game Graph
- 2.Emerson, E.A., Jutla, C.S.: Tree automata, mu-calculus and determinacy (extended abstract). In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1–4 October (1991)Google Scholar
- 6.Saivasan, P.: Analysis of Automata-theoretic models of Concurrent Recursive Programs. Ph.D. thesis, Chennai Mathematical Institute (2016)Google Scholar
- 9.Stockmeyer, L.J.: The Complexity of Decision Problems in Automata Theory and Logic. Ph.D. thesis. MIT, Cambridge (1974)Google Scholar
- 10.Torre, S.L., Madhusudan, P., Parlato, G.: A robust class of context-sensitive languages. In: LICS. IEEE Computer Society (2007)Google Scholar