Games, probability, and the quantitative μ-calculus qMμ

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

Volumn 2514, Issue , 2002, Pages 292-310

  McIver, A K ^a   Morgan, C C ^b  

^a MACQUARIE UNIVERSITY   (Australia)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER CIRCUITS; TEMPORAL LOGIC;

BRANCHING TIME; FINITE STATE SYSTEMS; GENERALISATION; MU-CALCULUS; OPERATIONAL INTERPRETATION; SOLID INTERFACES; SPECIFICATION TOOLS; TRANSITION SYSTEM;

CALCULATIONS;

EID: 84954414836     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36078-6_20     Document Type: Conference Paper

References (33)

1. M. Ben-Ari, A. Pnueli, and Z. Manna. The temporal logic of branching time. Acta Informatica, 20:207–226, 1983.
2. Andrea Bianco and Luca de Alfaro. Model checking of probabilistic and nondeterministic systems. In Foundations of Software Technology and Theoretical Computer Science, volume 1026 of LNCS, pages 499–512, December 1995.
3. A. Condon. The complexity of stochastic games. Information and Computation, 96(2):203–224, 1992.
4. P. Cousot and R. Cousot. Abstract interpretation frameworks. Journal of Logic and Computation, 2(2):511–547, 1992.
5. Luca de Alfaro. Temporal logics for the specification of performance and reliability. In STACS’97, volume 1200 of LNCS, 1997.
6. Luca de Alfaro. Computing minimum and maximum reachability times in probabilistic systems. In Proceedings of CONCUR’99, LNCS. Springer Verlag, 1999.
7. Luca de Alfaro and Rupak Majumdar. Quantitative solution of omega-regular games. In Proc. STOC’01, 2001.
8. H. Everett. Recursive games. In Contributions to the Theory of Games III, volume 39 of Ann. Math. Stud., pages 47–78. Princeton University Press, 1957.
9. J. Filar and O.J. Vrieze. Competitive Markov Decision Processes — Theory, Algorithms, and Applications. Springer Verlag, 1996.
10. G. Grimmett and D. Welsh. Probability: an Introduction. Oxford Science Publications, 1986.
11. Hans Hansson and Bengt Jonsson. A logic for reasoning about time and reliability. Formal Aspects of Computing, 6:512–535, 1994.
12. Michael Huth and Marta Kwiatkowska. Quantitative analysis and model checking. In Proceedings of 12th annual IEEE Symposium on Logic in Computer Science, 1997.
13. D. Kozen. Semantics of probabilistic programs. Journal of Computer and System Sciences, 22:328–350, 1981.
14. D. Kozen. A probabilistic PDL. In Proceedings of the 15th ACM Symposium on Theory of Computing, New York, 1983. ACM.
15. D. Kozen. Results on the propositional μ-calculus. Theoretical Computer Science, 27:333–354, 1983.
16. A.K. McIver and C. Morgan. Demonic, angelic and unbounded probabilistic choices in sequential programs. Acta Informatica, 37:329–354, 2001.
17. A.K. McIver, C.C. Morgan, and J.W. Sanders. Probably Hoare? Hoare probably! In A.W. Roscoe, editor, A Classical Mind: Essays in Honour of CAR Hoare. Prentice-Hall, 1999.
18. David Monniaux. Abstract interpretation of probabilistic semantics. In International Static Analysis Symposium (SAS’00), volume 1824 of LNCS. Springer Verlag, 2000.
19. Carroll Morgan and Annabelle McIver. A probabilistic temporal calculus based on expectations. In Lindsay Groves and Steve Reeves, editors, Proc. Formal Methods Pacific’97. Springer Verlag Singapore, July 1997. Available at [27].
20. Carroll Morgan and Annabelle McIver. An expectation-based model for probabilistic temporal logic. Logic Journal of the IGPL, 7(6):779–804, 1999. Also available via [27].
21. Carroll Morgan and Annabelle McIver. pGCL: Formal reasoning for random algorithms. South African Computer Journal, 22, March 1999. Also available at [27].
22. Carroll Morgan and Annabelle McIver. Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL. In Proceedings CATS’01. Elsevier, 2000. Also available at [27]; to appear in Theoretical Computer Science.
23. C.C. Morgan and A.K. McIver. Cost analysis of games using program logic. In Proc. of the 8th Asia-Pacific Software Engineering Conference (APSEC 2001), December 2001. Abstract only: full text available at [27].
24. C.C. Morgan, A.K. McIver, and K. Seidel. Probabilistic predicate transformers. ACM Transactions on Programming Languages and Systems, 18(3):325–353, May 1996.
25. N. Narasimha, R. Cleaveland, and P. Iyer. Probabilistic temporal logics via the modal mu-calculus. In Proceedings of the Foundation of Software Sciences and Computation Structures, Amsterdam, number 1578 in LNCS, pages 288–305, 1999.
26. Draft presentations of the full proofs of these results can be found via entry Games02 at the web site [27].
27. PSG. Probabilistic Systems Group: Collected reports. http://web.comlab.ox.ac.uk/oucl/research/areas/probs/bibliography.html.
28. M.O. Rabin. The choice-coordination problem. Acta Informatica, 17(2):121–134, June 1982.
29. Roberto Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT, 1995.
30. Colin Stirling. Local model checking games. In CONCUR’95, volume 962 of LNCS, pages 1–11. Springer Verlag, 1995. Extended abstract.
31. M. Y. Vardi. Branching vs. linear time: Final showdown. In Seventh International Conference on Tools and Analysis of Systems, Genova, number 2031 in LNCS, April 2001.
32. Moshe Y. Vardi. A temporal fixpoint calculus. In Proc. 15th Ann. ACM Symp. On Principles of Programming Languages. ACM, January 1988. Extended abstract.
33. I. Walukiewicz. Notes on the propositional mu-calculus: Completeness and related results. Technical Report BRICS NS-95-1, BRICS, Dept. Comp. Sci., University Aarhus, 1995. Available at http://www.brics.aaudk/BRICS/.