Modular strategies for infinite games on recursive graphs

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

Volumn 2725, Issue , 2003, Pages 67-79

  Alur, Rajeev ^a   La Torre, Salvatore ^b   Madhusudan, P ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b UNIVERSITY OF SALERNO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS; FLOW GRAPHS; POLYNOMIALS;

ALTERNATING TREE AUTOMATON; COMPLEXITY BOUNDS; LINEAR TEMPORAL LOGIC; MODULAR STRATEGY; RECURSIVE PROCEDURE; SEQUENTIAL PROGRAMS; SYNTHESIS ALGORITHMS; WINNING CONDITIONS;

SPECIFICATIONS;

EID: 33644689137     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45069-6_6     Document Type: Article

References (20)

1. R. Alur, K. Etessami, and M. Yannakakis. Analysis of recursive state machines. In Proc. 13th Intern. Conf. on Computer Aided Verification, CAV'01, LNCS 2102, p. 207-220. Springer, 2001.
2. R. Alur, T. Henzinger, and O. Kupferman. Alternating-time temporal logic. Journal of the ACM, 49(5):1-42, 2002.
3. R. Alur, S. La Torre, and P. Madhusudan. Modular strategies for recursive game graphs. In Proc. 9th Intern. Conf. an Tools and Algorithms for the Construction and the Analysis of Systems, TACAS'03, LNCS 2619, p. 363-378. Springer, 2003.
4. T. Ball and S. Rajamani. The SLAM toolkit. In Proc. 13th Intern. Conf. on Computer Aided Verification, CAV'01, p. 260-264, 2001.
5. M. Benedikt, P. Godefroid, and T. W. Reps. Model checking of unrestricted hierarchical state machines. In Proc. 28th Intern. Coll. on Automata, Languages and Programming, ICALP'01, LNCS 2076, p. 652-666. Springer, 2001.
6. A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model-checking. In Proc. 8th Conference on Concurrency Theory, CONCUR'97, LNCS 1243, p. 135-150, 1997. Springer, 1997.
7. J. Büchi and L. Landweber. Solving sequential conditions by finite-state strategies. Trans. Amer. Math. Soc., 138:295-311, 1969.
8. T. Cachat. Symbolic strategy synthesis for games on pushdown graphs. In Proc. 29th Intern. Coll. on Automata, Languages and Programming, ICALP'02, LNCS 2380, p. 704-715. Springer, 2002.
9. T. Cachat. Two-Way Tree Automata Solving Pushdown Games, p. 303-317. LNCS 2500. Springer, 2002.
10. A. Chakrabarti, L. de Alfaro, T. Henzinger, M. Jurdzinski, and F. Mang. Interface compatibility checking for software modules. In Proc. 14th Intern. Conf. on Computer Aided Verification, CAV '02, LNCS 2404, p. 428-141. Springer, 2002.
11. H. Chen and D. Wagner. MOPS: an infrastructure for examining security properties of software. In Proc. 9th ACM Conf. on Comp. and Comm. Security, 2002.
12. J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon. Efficient algorithms for model checking pushdown systems. In Proc. 12th Intern. Conf. on Computer Aided Verification, CAV '00, LNCS 1855, p. 232-247. Springer, 2000.
13. O. Kupferman and M. Vardi. An automata-theoretic approach to reasoning about infinite-state systems. In Proc. 12th Intern. Conf. on Computer Aided Verification, CAV '00, LNCS 1855, p. 36-52. Springer, 2000.
14. O. Kupferman, M. Vardi, and P. Wolper. Module checking. Information and Computation, 164(2):322-344, 2001.
15. A. Pnueli. The temporal logic of programs. In Proc. of the 18th IEEE Symposium on Foundations of Computer Science, p. 46-77, 1977.
16. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proc. 16th ACM Symposium on Principles of Programming Languages, 1989.
17. W. Thomas. Infinite games and verification. In Proc. 14th Intern. Conf. on Computer Aided Verification, CAV'02, LNCS 2404, p. 58-64. Springer, 2002.
18. M. Vardi. Reasoning about the past with two-way automata. In Proc. 25th Intern. Coll. on Automata, Languages, and Programming, ICALP'98, LNCS 1443, p. 628-641. Springer, 1998.
19. M. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115:1-37, 1994.
20. I. Walukiewicz. Pushdown processes: Games and model-checking. Information and Computation, 164(2):234-263, January 2001.