Games on multi-stack pushdown systems

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

Volumn 5407 LNCS, Issue , 2009, Pages 395-408

  Seth, Anil ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

Author keywords

[No Author keywords available]

Indexed keywords

EMPTINESS PROBLEM; PARITY GAMES; PUSH-DOWN AUTOMATA; PUSHDOWN SYSTEMS; WINNING STRATEGY;

COMPUTER SCIENCE; TRANSLATION (LANGUAGES);

GAME THEORY;

EID: 67650489410     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-92687-0_27     Document Type: Conference Paper

References (12)

1. Madhusudan, P., Parlato, G., La Torre, S.: A Robust Class of Context-Sensitive Languages. In: 22nd IEEE Symp. on Logic in Computer Science (LICS) Wroclaw, Poland (2007)
2. Madhusudan, P., Parlato, G., La Torre, S.: An Infinite Automaton Characterization of Double Exponential Time. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol. 5213, pp. 33-48. Springer, Heidelberg (2008)
3. 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)
4. Lal, A., Reps, T.: Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp.37-51. Springer, Heidelberg (2008)
5. Qadeer, S., Rehof, J.: Context-bounded model checking of concurrent software. In: Proceedings of the 11th International Symposium on Tools and Algorithms for the Construction and Analysis of Systems (2005)
6. Kahlon, V., Ivancic, F., Gupta, A.: Reasoning About Threads Communicating via Locks. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp.505-518. Springer, Heidelberg (2005)
7. Serre, O.: Note on Winning Positions on Pushdown Games with Omega-Regular Conditions. Information Processing Letters 85(6), 285-291 (2003)
8. Cachat, T.: Uniform solution of parity games on prefix-recognizable graphs. In: Proc. INFINITY. ENTCS, vol. 68(6) (2002)
9. Walukiewicz, I.: Pushdown processes: games and model checking. Information and computation 164, 234-263 (2001)
10. Jurdziński, 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)
11. Bouajjani, A., Esparza, J., Maler, O.: Reachability analysis of pushdown automata: Applications to model checking. In: Proc. Concur, pp. 135-150 (1997)
12. 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)