Model checking games for the quantitative μ-calculus

Theory of Computing Systems

Volumn 47, Issue 3, 2010, Pages 696-719

  Fischer, Diana ^a   Grädel, Erich ^a   Kaiser, Łukasz ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Games; Logic; Model checking; Quantitative logics

Indexed keywords

CLASSICAL COUNTERPART; DUALITY PROPERTIES; GAMES; LOGIC; LOGICAL OPERATORS; MODEL CHECKING PROBLEM; QUANTITATIVE LOGICS; TRANSITION SYSTEM;

GAME THEORY; MODEL CHECKING;

CALCULATIONS;

EID: 77953324688     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-009-9201-y     Document Type: Article

References (13)

1. de Alfaro, L.: Quantitative verification and control via the mu-calculus. In: Amadio, R. M., Lugiez, D. (eds.) CONCUR. LNCS, vol. 2761, pp. 102-126. Springer, Berlin (2003).
2. de Alfaro, L., Majumdar, R.: Quantitative solution of omega-regular games. J. Comput. Syst. Sci. 68(2), 374-397 (2004).
3. de Alfaro, L., Henzinger, T. A., Majumdar, R.: Discounting the future in systems theory. In: Baeten, J. C. M., Lenstra, J. K., Parrow, J., Woeginger, G. J. (eds.) ICALP. Lecture Notes in Computer Science, vol. 2719, pp. 1022-1037. Springer, Berlin (2003).
4. de Alfaro, L., Faella, M., Henzinger, T. A., Majumdar, R., Stoelinga, M.: Model checking discounted temporal properties. Theor. Comput. Sci. 345(1), 139-170 (2005).
5. de Alfaro, L., Faella, M., Stoelinga, M.: Linear and branching system metrics. Technical Report ucsc-crl-05-01, School of Engineering, University of California, Santa Cruz (2005).
6. Emerson, E. A., Jutla, C. S., Sistla, A. P.: On model-checking for fragments of μ-calculus. In: Proceedings of the 5th International Conference on Computer Aided Verification, CAV '93, vol. 697, pp. 385-396. Springer, Berlin (1993).
7. Gawlitza, T., Seidl, H.: Computing game values for crash games. In: Namjoshi, K. S., Yoneda, T., Higashino, T., Okamura, Y. (eds.) ATVA. Lecture Notes in Computer Science, vol. 4762, pp. 177-191. Springer, Berlin (2007).
8. Gimbert, H., Zielonka, W.: Perfect information stochastic priority games. In: Arge, L., Cachin, C., Jurdzinski, T., Tarlecki, A. (eds.) ICALP. Lecture Notes in Computer Science, vol. 4596, pp. 850-861. Springer, Berlin (2007).
9. Grädel, E.: Finite model theory and descriptive complexity. In: Finite Model Theory and Its Applications, pp. 125-230. Springer, Berlin (2007).
10. Jurdziński, M.: Small progress measures for solving parity games. In: Reichel, H., Tison, S. (eds.) STACS. Lecture Notes in Computer Science, vol. 1770, pp. 290-301. Springer, Berlin (2000).
11. Martin, D. A.: Borel determinacy. Ann. Math. 102, 363-371 (1975).
12. McIver, A., Morgan, C.: Results on the quantitative μ-calculus qMμ. ACM Trans. Comput. Log. 8(1) (2007).
13. Stirling, C.: Games and modal mu-calculus. In: Margaria, T., Steffen, B. (eds.) TACAS. Lecture Notes in Computer Science, vol. 1055, pp. 298-312. Springer, Berlin (1996).