Results on the quantitative μ-calculus qMμ

ACM Transactions on Computational Logic

Volumn 8, Issue 1, 2007, Pages

  McIver, Annabelle ^a   Morgan, Carroll ^b  

^a MACQUARIE UNIVERSITY   (Australia)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Angelic choice; Demonic choice; Denotational semantics; Game semantics; Minimax theorem; Modal mu calculus; Probabilistic choice; Quantitative aspects of programming languages

Indexed keywords

ALGORITHMS; FUNCTIONS; GAME THEORY; PROBABILISTIC LOGICS;

ANGELIC CHOICE; DEMONIC CHOICE; DENOTATIONAL SEMANTICS; GAME SEMANTICS; MINIMAX THEOREM; PROBABILISTIC CHOICE;

COMPUTATION THEORY;

EID: 33846576007     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/1182613.1182616     Document Type: Article

References (47)

1. AZIZ, A., SINGHAL, V., BRAYTON, F. B. R., AND SANGIOVANNI-VINCENTELLI, A. 1995. It usually works: The temporal logic of stochastic systems. In Proceedings of the Computer-Aided Verification, 7th International Workshop. Lectrure Notes in Computer Science, vol. 939. Springer Verlag.
2. BEN-ARI, M., PNUELI, A., AND MANNA, Z. 1983. The temporal logic of branching time. Acta Inf. 20, 207-226.
3. BIANCO, A. AND DE ALFARO, L. 1995. Model checking of probabilistic and nondeterministic systems. In Foundations of Software Technology and Theoretical Computer Science. Lectrure Notes in Computer Science, vol. 1026. Springer Verlag, 499-512.
4. CHATTERJEE, K., JURDZINSKI, M., AND HENZINGER, T. A. 2004. Quantitative stochastic parity games. In Proceedings of the 16th Annual Symposium on Discrete Algorithms. 114-123.
5. CONDON, A. 1992. The complexity of stochastic games. Inf. Computat. 96, 2, 203-224.
6. COURCOUBETIS, C. AND YANNAKAKIS, M. 1995. The complexity of probabilistic verification. J. ACM 42, 4, 857-907.
7. COUSOT, P. AND COUSOT, R. 1992. Abstract interpretation frameworks. J. Logic Computat. 2, 2, 511-547.
8. DE ALFARO, L. 1997. Temporal logics for the specification of performance and reliability. In Proceedings of the 4th Annual Symposium on Theoretical Aspects of Computer Science (STACS). Lectrure Notes in Computer Science, vol. 1200. Springer Verlag.
9. DE ALFARO, L. 1999. Computing minimum and maximum reachability times in probabilistic systems. In Proceedings of the Concurrency Theory: 10th International Conference (CONCUR). Lectrure Notes in Computer Science, vol. 1664. Springer Verlag.
10. DE ALFARO, L. 2003. Quantitative verification and control via the mu-calculus. In Proceedings of the Concurrency Theory: 14th International Conference CONCUR. Lectrure Notes in Computer Science, vol. 2761. Springer Verlag.
11. DE ALFARO, L. AND MAJUMDAR, R. 2004. Quantitative solution of omega-regular games. J. Comput. Syst. Sci. 68, 374-397.
12. EVERETT, H. 1957. Recursive games. In Contributions to the Theory of Games III. Annals of Mathematics Studies, vol. 39. Princeton University Press, Princeton, NJ. 47-78.
13. FILAR, J. AND VRIEZE, O. 1996. Competitive Markov Decision Processes - Theory, Algorithms, and Applications. Springer Verlag.
14. GRIMMETT, G. AND WELSH, D. 1986. Probability: An Introduction. Oxford Science.
15. HANSSON, H. AND JONSSON, B. 1994a. A logic for reasoning about time and probability. Formal Aspects Comput. 6, 5, 512-535.
16. HANSSON, H. AND JONSSON, B. 1994b. A logic for reasoning about time and reliability. Formal Aspects Comput. 6, 512-535.
17. HOARE, C. 1985. A couple of novelties in the propositional calculus. Zeitschr. für Math. Logik und Grundlagen der Math. 31, 2, 173-178.
18. HUTH, M. AND KWIATKOWSKA, M. 1997. Quantitative analysis and model checking. In Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science.
19. KOZEN, D. 1983a. A probabilistic PDL. In Proceedings of the 15th ACM Symposium on Theory of Computing.
20. KOZEN, D. 1983b. Results on the propositional μ-calculus. Theoret. Comput. Sci. 27, 333-354.
21. KWIATKOWSKA, M., NORMAN, G., AND PARKER, D. 2002. PRISM: Probabilistic symbolic model checker. In Proceedings of the 12th International Conference on Modelling Techniques and Tools for Computer Performance Evaluation (TOOLS), T. Field et al. Eds. Lectrure Notes in Computer Science, vol. 2324. Springer Verlag, 200-204.
22. MARTIN, D. 1998. The determinacy of Blackwell games. J. Symbol. Logic 63, 4, 1565-81.
23. MCIVER, A. AND MORGAN, C. 2002. Games, probability and the quantitative μ-calculus qMu. In Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning: 9th International Conference (LPAR). Lectrure Notes in Computer Science, vol. 2514. Springer Verlag, 292-310.
24. MCIVER, A. AND MORGAN, C. 2004. Abstraction, Refinement and Proof for Probabilistic Systems. Monographs in Computer Science. Springer Verlag.
25. MONNIAUX, D. 2000. Abstract interpretation of probabilistic semantics. In International Static Analysis Symposium (SAS). Lectrure Notes in Computer Science, vol. 1824. Springer Verlag.
26. MORGAN, C. AND MCIVER, A. 1997. A probabilistic temporal calculus based on expectations. In Proceedings of the Formal Methods Pacific Conference, L. Groves and S. Reeves, Eds. Springer Verlag.
27. MORGAN, C. AND MCIVER, A. 1999a. An expectation-based model for probabilistic temporal logic. Logic J. IGPL 7, 6, 779-804.
28. MORGAN, C. AND MCIVER, A. 1999b. pGCL: Formal reasoning for random algorithms. South African Comput. J. 22, 14-27.
29. MORGAN, C. AND MCIVER, A. 2001. Cost analysis of games using program logic. In Proceedings of the 8th Asia-Pacific Software Engineering Conference (APSEC).
30. MORGAN, C. AND MCIVER, A. 2003. Almost-Certain eventualities and abstract probabilities in the quantitative temporal logic qTL. Theor. Comput. Sci. 293, 3, 507-534.
31. MORGAN, C., MCIVER, A., AND SEIDEL, K. 1996. Probabilistic predicate transformers. ACM Trans. Program. Lang. Syst. 18, 3 (May), 325-353.
32. NARASIMHA, N., CLEAVELAND, R., AND IYER, P. 1999. Probabilistic temporal logics via the modal mu-calculus. In Proceedings of the Foundation of Software Sciences and Computation Structures, Amsterdam Conference. Lectrure Notes in Computer Science, vol. 1578. Springer Verlag, 288-305.
33. NIWINSKI, D. 2002. Mu-calculus via games. In Annual Conference of the European Association for Computer Science Logic. Lectrure Notes in Computer Science, vol. 2471. Springer Verlag.
34. OCCAM. 2006. The Occam programming language. //directory.google.com/Top/ Computers/Programming/Languages/Occam.
35. PRISM. 2006. Probabilistic symbolic model checker, //www.cs.bham.ac.uk/ ~dxp/prism.
36. PSG. 2006. Probabilistic systems group: Collected reports, //web.comlab.ox.ac.uk/oucl/research/areas/probs/bibliography.html.
37. RABIN, M. 1982. The choice-coordination problem. Acta Inf. 17, 2 (June), 121-134.
38. ROSCOE, A. 1998. The Theory and Practice of Concurrency. Prentice-Hall, Upper Saddle River, NJ.
39. Scripts. 2006. Scripts for calculations of futures game example, www.cse.unsw.edu.au/~carrollm/qmu.
40. SEGALA, R. 1995. Modeling and verification of randomized distributed real-time systems. Ph.D. thesis, MIT.
41. STIRLING, C. 1995. Local model checking games. In Proceedings of the Concurrency Theory International Conference (CONCUR). Lectrure Notes in Computer Science, vol. 962. Springer Verlag, 1-11. Extended abstract.
42. THOMAS, W. 1995. On the synthesis of strategies in infinite games. In 12th Symposium on Theoretical Aspects of Computer Science. Lectrure Notes in Computer Science, vol. 900. Springer Verlag, 1-13.
43. VARDI, M. 2001. Branching vs. linear time: Final showdown. In 7th International Conference on Tools and Analysis of Systems, Genova. Lectrure Notes in Computer Science, vol. 2031. Springer Verlag.
44. VARDI, M. Y. 1988. A temporal fixpoint calculus. In Proceedings of the 15th Annual ACM Symposium on Principles of Programming Languages. Extended abstract.
45. VON NEUMANN, J. AND MORGENSTERN, O. 1944. Theory of Games and Economic Behavior. Princeton University Press, Princeton, NJ.
46. WALUKIEWICZ, I. 1995. Notes on the propositional mu-calculus: Completeness and related results. Tech. Rep. BRICS NS-95-1, BRICS, Department of Computer Science, University Aarhus. //www.brics.aaudk/BRICS/.
47. ZIELONKA, W. 2004. Perfect-Information stochastic parity games. In Proceedings of Foundations of Software Science and Computation Structures. Lectrure Notes in Computer Science, vol. 2987. Springer Verlag, 499-513.