Solving games via three-valued abstraction refinement

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

Volumn 4703 LNCS, Issue , 2007, Pages 74-89

  De Alfaro, Luca ^a   Roy, Pritam ^a  

^a University of California Santa Cruz   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; APPROXIMATION THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING;

ABSTRACTION-REFINEMENT; OVER-APPROXIMATION; UNDER-APPROXIMATION;

GAME THEORY;

EID: 38149129342     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74407-8_6     Document Type: Conference Paper

References (19)

1. Adler, B., de Alfaro, L., Silva, L.D.D., Faella, M., Legay, A., Raman, V., Roy, P.: TICC: a tool for interface compatibility and composition. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 59-62. Springer, Heidelberg (2006)
2. Alur, R., Itai, A., Kurshan, R.P., Yannakakis, M.: Timing verification by successive approximation. Inf. Comput. 118(1), 142-157 (1995)
3. Ball, T., Rajamani, S.: The SLAM project: Debugging system software via static analysis. In: Proceedings of the 29th Annual Symposium on Principles of Programming Languages, pp. 1-3. ACM Press, New York (2002)
4. Bryant, R.: Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers C-35(8), 677-691 (1986)
5. Clarke, E., Grumberg, O., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, Springer, Heidelberg (2000)
6. de Alfaro, L., Alur, R., Grosu, R., Henzinger, T., Kang, M., Majumdar, R., Mang, F., Meyer-Kirsch, C., Wang, B.: Mocha: A model checking tool that exploits design structure. In: ICSE 01. Proceedings of the 23rd International Conference on Software Engineering, pp. 835-836 (2001)
7. de Alfaro, L., da Silva, L.D., Faella, M., Legay, A., Roy, P., Sorea, M.: Sociable interfaces. In: Gramlich, B. (ed.) Frontiers of Combining Systems. LNCS (LNAI), vol. 3717, pp. 81-105. Springer, Heidelberg (2005)
8. de Alfaro, L., Faella, M., Henzinger, T., Majumdar, R., Stoelinga, M.: The element of surprise in timed games. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 144-158. Springer, Heidelberg (2003)
9. de Alfaro, L., Godefroid, P., Jagadeesan, R.: Three-valued abstractions of games: Uncertainty, but with precision. In: Proc. 19th IEEE Symp. Logic in Comp. Sci., pp. 170-179. IEEE Computer Society Press, Los Alamitos (2004)
10. de Alfaro, L., Henzinger, T., Majumdar, R.: Symbolic algorithms for infinite-state games. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, Springer, Heidelberg (2001)
11. Emerson, E., Juila, C.: Tree automata, mu-calculus and determinacy (extended abstract). In: Proc. 32nd IEEE Symp. Found, of Comp. Sci., pp. 368-377. IEEE Computer Society Press, Los Alamitos (1991)
12. Henzinger, T., Jhala, R., Majumdar, R.: Counterexample-guided control. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 886-902. Springer, Heidelberg (2003)
13. Maler, O., Pnueli, A., Sifakis, J.: On the synthesis of discrete controllers for timed systems. In: Mayr, E.W., Puech, C. (eds.) STACS 95. LNCS, vol. 900, pp. 229-242. Springer, Heidelberg (1995)
14. Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer, New York (1991)
15. Martin, D.: An extension of Borel determinacy. Annals of Pure and Applied Logic 49, 279-293 (1990)
16. Shoham, S.: A game-based framework for CTL counter-examples and 3-valued abstraction-refinement. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 275-287. Springer, Heidelberg (2003)
17. Shoham, S., Grumberg, O.: Monotonic abstraction-refinement for CTL. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 546-560. Springer, Heidelberg (2004)
18. Shoham, S., Grumberg, O.: 3-valued abstraction: More precision at less cost. In: Proc. 21st IEEE Symp. Logic in Comp. Sci., pp. 399-410. IEEE Computer Society Press, Los Alamitos (2006)
19. Thomas, W.: Automata on infinite objects. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, ch. 4, pp. 135-191. Elsevier Science Publishers,North-Holland, Amsterdam (1990)