Game refinement relations and metrics

Logical Methods in Computer Science

Volumn 4, Issue 3, 2008, Pages

  de Alfaro, Luca ^a   Majumdar, Rupak ^b   Raman, Vishwanath ^a   Stoelinga, Mariëlle ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

regular properties; Equivalence of states; Game semantics; Metrics; Minimax theorem; Probabilistic choice; Quantitative calculus; Refinement of states

Indexed keywords

EQUIVALENCE OF STATES; GAME SEMANTICS; METRICS; MINIMAX THEOREM; PROBABILISTIC CHOICES; REFINEMENT OF STATES; REGULAR PROPERTIES;

GAME THEORY; PROBABILITY DISTRIBUTIONS; SEMANTICS; CALCULATIONS; PROBABILITY;

CALCULATIONS; PROBABILITY DISTRIBUTIONS;

EID: 78249288583     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-4(3:7)2008     Document Type: Article

References (33)

1. R. Alur, T. A. Henzinger, and O. Kupferman. Alternating time temporal logic. J. ACM, 49: 672-713, 2002.
2. R. Alur, T. A. Henzinger, O. Kupferman, and M. Y. Vardi. Alternating refinement relations. In CONCUR 98: Concurrency Theory. 9th Int. Conf., volume 1466 of Lect. Notes in Comp. Sci., pages 163-178. Springer-Verlag, 1998.
3. A. Aziz, V. Singhal, F. Balarin, R. K. Brayton, and A. L. Sangiovanni-Vincentelli. It usually works: The temporal logic of stochastic systems. In Computer Aided Verification, volume 939 of Lect. Notes in Comp. Sci. Springer-Verlag, 1995.
4. C. C. Chang and H. J. Keisler. Model theory. Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam., 1973.
5. L. de Alfaro, T. A. Henzinger, and O. Kupferman. Concurrent reachability games. In Proc. 39th IEEE Symp. Found. of Comp. Sci., pages 564-575. IEEE Computer Society Press, 1998.
6. L. de Alfaro, T. A. Henzinger, and R. Majumdar. Discounting the future in systems theory. In Proc. 30th Int. Colloq. Aut. Lang. Prog., volume 2719 of Lect. Notes in Comp. Sci., pages 1022-1037. Springer-Verlag, 2003.
7. L. de Alfaro and R. Majumdar. Quantitative solution of omega-regular games. Journal of Computer and System Sciences, 68: 374-397, 2004.
8. C. Derman. Finite State Markovian Decision Processes. Academic Press, 1970.
9. J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. Metrics for labelled markov systems. In CONCUR 99: Concurrency Theory. 10th Int. Conf., volume 1664 of Lect. Notes in Comp. Sci., pages 258-273. Springer, 1999.
10. J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. Approximating labelled markov processes. Information and Computation, 2002.
11. J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. The metric analogue of weak bisimulation for probabilistic processes. In Proc. 17th IEEE Symp. Logic in Comp. Sci., pages 413-422, 2002.
12. J. Filar and K. Vrieze. Competitive Markov Decision Processes. Springer-Verlag, 1997.
13. H. Hansson and B. Jonsson. A logic for reasoning about time and reliability. Formal Asp. Comput., 6(5): 512-535, 1994.
14. C.-C. Jou and S. A. Smolka. Equivalences, congruences and complete axiomatizations for probabilistic processes. In CONCUR 90: Concurrency Theory. 1st Int. Conf., volume 458 of Lect. Notes in Comp. Sci., pages 367-383. Springer-Verlag, 1990.
15. J. G. Kemeny, J. L. Snell, and A. W. Knapp. Denumerable Markov Chains. D. Van Nostrand Company, 1966.
16. D. Kozen. A probabilistic PDL. In Proc. 15th ACM Symp. Theory of Comp., pages 291-297, 1983.
17. D. Kozen. Results on the propositional μ-calculus. Theoretical Computer Science, 27(3): 333-354, 1983.
18. K. G. Larsen and A. Skou. Compositional verification of probabilistic processes. In W. R. Cleaveland, editor, CONCUR 92: Concurrency Theory. 3rd Int. Conf., volume 630 of Lect. Notes in Comp. Sci. Springer-Verlag, 1992.
19. R. Majumdar. Symbolic algorithms for verification and control. PhD thesis, University of California, Berkeley, 2003.
20. D. A. Martin. The determinacy of Blackwell games. The Journal of Symbolic Logic, 63(4): 1565-1581, 1998.
21. A. McIver and C. Morgan. Abstraction, Refinement, and Proof for Probabilistic Systems. Monographs in Computer Science. Springer-Verlag, 2004.
22. R. Milner. Operational and algebraic semantics of concurrent processes. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 1202-1242. Elsevier Science Publishers (North-Holland), Amsterdam, 1990.
23. M. J. Osborne and A. Rubinstein. A Course in Game Theory. MIT Press, 1994.
24. R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT, 1995. Technical Report MIT/LCS/TR-676.
25. R. Segala and N. A. Lynch. Probabilistic simulations for probabilistic processes. In CONCUR 94: Con-currency Theory. 5th Int. Conf., volume 836 of Lect. Notes in Comp. Sci., pages 481-496. Springer-Verlag, 1994.
26. R. Segala and N. A. Lynch. Probabilistic simulations for probabilistic processes. Nordic Journal of Com-puting, 2(2): 250-273, 1995.
27. L. S. Shapley. Stochastic games. Proc. Nat. Acad. Sci. USA, 39: 1095-1100, 1953.
28. M. Sion. On general minimax theorems. Pacific Journal of Mathematics., 8: 171-176, 1958.
29. A. Tarski. A Decision Method for Elementary Algebra and Geometry. University of California Press, Berkeley and Los Angeles, 1951.
30. F. van Breugel and J. Worrel. An algorithm for quantitative verification of probabilistic transition systems. In CONCUR 01: Concurrency Theory. 12th Int. Conf., volume 2154 of Lect. Notes in Comp. Sci., pages 336-350, 2001.
31. F. van Breugel and J. Worrel. Towards quantitative verification of probabilistic systems. In Proc. 28th Int. Colloq. Aut. Lang. Prog., volume 2076 of Lect. Notes in Comp. Sci., pages 421-432. Springer-Verlag, 2001.
32. J. von Neumann and O. Morgenstern. Theory of Games and Economic Behavior. New York: John Wiley and Sons, 1944.
33. H. Weyl. Elementary proof of a minmax theorem due to von Neumann. In Contributions to the Theory of Games, I, volume 24 of Annals of Mathematical Studies, pages 19-25. Princeton University Press, 1950.