Games on higher order multi-stack pushdown systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5797 LNCS, Issue , 2009, Pages 203-216

  Seth, Anil ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

Author keywords

[No Author keywords available]

Indexed keywords

HIGHER ORDER; PARITY GAMES; PUSHDOWN SYSTEMS; WINNING STRATEGY;

GAME THEORY;

EID: 70349960027     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04420-5_19     Document Type: Conference Paper

References (17)

1. Seth, A.: Games on Higher Order Multi-Stack Pushdown Systems, full version, http://www.cse.iitk.ac.in/users/seth/RP09/fullversion
2. Seth, A.: Games on Multi-Stack Pushdown Systems. In: Artemov, S., Nerode, A. (eds.) LFCS 2009. LNCS, vol.5407, pp. 395-408. Springer, Heidelberg (2008)
3. Carayol, A., Hague, M., Meyer, A., Ong, C.-H.L., Serre, O.: Winning Regions of Higher-Order Pushdown Games. In: Proc: LICS 2008, pp. 193-204. IEEE Computer Society, Los Alamitos (2008)
4. Hague, M., Murawski, A.S., Luke Ong, C.-H., Serre, O.: Collapsible Pushdown Automata and Recursion Schemes. In: Proc: LICS 2008, pp. 452-461. IEEE Computer Society, Los Alamitos (2008)
5. Madhusudan, P., Parlato, G., La Torre, S.: A Robust Class of Context-Sensitive Languages. In: Proc: LICS 2007, pp. 161-170. IEEE Computer Society, Los Alamitos (2007)
6. Madhusudan, P., Parlato, G., La Torre, S.: Context-Bounded Analysis of Concurrent Queue Systems. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol.4963, pp. 299-314. Springer, Heidelberg (2008)
7. Qadeer, S., Rehof, J.: Context-bounded model checking of concurrent software. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol.3440, pp. 93-107. Springer, Heidelberg (2005)
8. Knapik, T., Niwinski, D., Urzyczyn, P., Walukiewicz, I.: Unsafe Grammars and Panic Automata. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.3580, pp. 1450-1461. Springer, Heidelberg (2005)
9. Bouajjani, A., Meyer, A.: Symbolic reachability analysis of higher-order contextfree processes. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol.3328, pp. 135-147. Springer, Heidelberg (2004)
10. Cachat, T.: Higher order pushdown automata, the caucal hierarchy of graphs and parity games. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.2719, pp. 556-569. Springer, Heidelberg (2003)
11. Cachat, T.: Uniform solution of parity games on pre.x-recognizable graphs. In: Proc. Infinity. ENTCS, vol.68(6) (2002)
12. Walukiewicz, I.: Pushdown processes: games and model checking. Information and computation 164, 234-263 (2001)
13. Jurdzínski, M.: Small Progress Measures for Solving Parity Games. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol.1770, pp. 290-301. Springer, Heidelberg (2000)
14. Thomas, W.: Languages, automata and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.III, pp. 389-455. Springer, New York (1997)
15. Engelfriet, J.: Iterated pushdown automata and complexity classes. In: STOC 1983: Proceedings of the fifteenth annual ACM symposium on Theory of computing, pp. 365-373. ACM Press, New York (1983)
16. Damm, W., Goerdt, A.: An automata-theoretical characterization of the OIhierarchy. Information and Control 71(1-2), 1-32 (1986)
17. Maslov, A.N.: Multilevel stack automata. Problems of Information Transmission 15, 1170-1174 (1976)