{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T09:57:50Z","timestamp":1742378270754},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540000105"},{"type":"electronic","value":"9783540360780"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36078-6_20","type":"book-chapter","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T02:48:36Z","timestamp":1180666116000},"page":"292-310","source":"Crossref","is-referenced-by-count":20,"title":["Games, Probability, and the Quantitative \u03bc-Calculus qM\u03bc"],"prefix":"10.1007","author":[{"given":"A. K.","family":"McIver","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. C.","family":"Morgan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,10,24]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF01257083","volume":"20","author":"M. Ben-Ari","year":"1983","unstructured":"M. Ben-Ari, A. Pnueli, and Z. Manna. The temporal logic of branching time. Acta Informatica, 20:207\u2013226, 1983.","journal-title":"Acta Informatica"},{"key":"20_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/3-540-60692-0_70","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"A. Bianco","year":"1995","unstructured":"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\u2013512, December 1995."},{"issue":"2","key":"20_CR3","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0890-5401(92)90048-K","volume":"96","author":"A. Condon","year":"1992","unstructured":"A. Condon. The complexity of stochastic games. Information and Computation, 96(2):203\u2013224, 1992.","journal-title":"Information and Computation"},{"issue":"2","key":"20_CR4","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1093\/logcom\/2.4.511","volume":"2","author":"P. Cousot","year":"1992","unstructured":"P. Cousot and R. Cousot. Abstract interpretation frameworks. Journal of Logic and Computation, 2(2):511\u2013547, 1992.","journal-title":"Journal of Logic and Computation"},{"key":"20_CR5","series-title":"Lect Notes Comput Sci","volume-title":"STACS\u2019 97","author":"L. Alfaro de","year":"1997","unstructured":"Luca de Alfaro. Temporal logics for the specification of performance and reliability. In STACS\u2019 97, volume 1200 of LNCS, 1997."},{"key":"20_CR6","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of CONCUR\u2019 99","author":"L. Alfaro de","year":"1999","unstructured":"Luca de Alfaro. Computing minimum and maximum reachability times in probabilistic systems. In Proceedings of CONCUR\u2019 99, LNCS. Springer Verlag, 1999."},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Luca de Alfaro and Rupak Majumdar. Quantitative solution of omega-regular games. In Proc. STOC\u2019 01, 2001.","DOI":"10.1145\/380752.380871"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"H. Everett. Recursive games. In Contributions to the Theory of Games III, volume 39 of Ann. Math. Stud., pages 47\u201378. Princeton University Press, 1957.","DOI":"10.1515\/9781400882151-004"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"J. Filar and O.J. Vrieze. Competitive Markov Decision Processes \u2014 Theory, Algorithms, and Applications. Springer Verlag, 1996.","DOI":"10.1007\/978-1-4612-4054-9"},{"key":"20_CR10","unstructured":"G. Grimmett and D. Welsh. Probability: an Introduction. Oxford Science Publications, 1986."},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/BF01211866","volume":"6","author":"H. Hansson","year":"1994","unstructured":"Hans Hansson and Bengt Jonsson. A logic for reasoning about time and reliability. Formal Aspects of Computing, 6:512\u2013535, 1994.","journal-title":"Formal Aspects of Computing"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Michael Huth and Marta Kwiatkowska. Quantitative analysis and model checking. In Proceedings of 12th annual IEEE Symposium on Logic in Computer Science, 1997.","DOI":"10.1109\/LICS.1997.614940"},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/0022-0000(81)90036-2","volume":"22","author":"D. Kozen","year":"1981","unstructured":"D. Kozen. Semantics of probabilistic programs. Journal of Computer and System Sciences, 22:328\u2013350, 1981.","journal-title":"Journal of Computer and System Sciences"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"D. Kozen. A probabilistic PDL. In Proceedings of the 15th ACM Symposium on Theory of Computing, New York, 1983. ACM.","DOI":"10.1145\/800061.808758"},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D. Kozen","year":"1983","unstructured":"D. Kozen. Results on the propositional \u03bc-calculus. Theoretical Computer Science, 27:333\u2013354, 1983.","journal-title":"Theoretical Computer Science"},{"key":"20_CR16","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s002360000046","volume":"37","author":"A.K. McIver","year":"2001","unstructured":"A.K. McIver and C. Morgan. Demonic, angelic and unbounded probabilistic choices in sequential programs. Acta Informatica, 37:329\u2013354, 2001.","journal-title":"Acta Informatica"},{"key":"20_CR17","unstructured":"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."},{"key":"20_CR18","series-title":"Lect Notes Comput Sci","volume-title":"International Static Analysis Symposium (SAS\u2019 00)","author":"D. Monniaux","year":"2000","unstructured":"David Monniaux. Abstract interpretation of probabilistic semantics. In International Static Analysis Symposium (SAS\u2019 00), volume 1824 of LNCS. Springer Verlag, 2000."},{"key":"20_CR19","volume-title":"Proc. Formal Methods Pacific\u2019 97","author":"C. Morgan","year":"1997","unstructured":"Carroll Morgan and Annabelle McIver. A probabilistic temporal calculus based on expectations. In Lindsay Groves and Steve Reeves, editors, Proc. Formal Methods Pacific\u2019 97. Springer Verlag Singapore, July 1997. Available at [27]."},{"issue":"6","key":"20_CR20","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1093\/jigpal\/7.6.779","volume":"7","author":"C. Morgan","year":"1999","unstructured":"Carroll Morgan and Annabelle McIver. An expectation-based model for probabilistic temporal logic. Logic Journal of the IGPL, 7(6):779\u2013804, 1999. Also available via [27].","journal-title":"Logic Journal of the IGPL"},{"key":"20_CR21","unstructured":"Carroll Morgan and Annabelle McIver. pGCL: Formal reasoning for random algorithms. South African Computer Journal, 22, March 1999. Also available at [27]."},{"key":"20_CR22","unstructured":"Carroll Morgan and Annabelle McIver. Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL. In Proceedings CATS\u2019 01. Elsevier, 2000. Also available at [27]; to appear in Theoretical Computer Science."},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"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].","DOI":"10.1109\/APSEC.2001.991501"},{"issue":"3","key":"20_CR24","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1145\/229542.229547","volume":"18","author":"C.C. Morgan","year":"1996","unstructured":"C.C. Morgan, A.K. McIver, and K. Seidel. Probabilistic predicate transformers. ACM Transactions on Programming Languages and Systems, 18(3):325\u2013353, May 1996.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"20_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/3-540-49019-1_20","volume-title":"Proceedings of the Foundation of Software Sciences and Computation Structures, Amsterdam","author":"N. Narasimha","year":"1999","unstructured":"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\u2013305, 1999."},{"key":"20_CR26","unstructured":"Draft presentations of the full proofs of these results can be found via entry Games02 at the web site [27]."},{"key":"20_CR27","unstructured":"PSG. Probabilistic Systems Group: Collected reports. http:\/\/web.comlab.ox.ac.uk\/oucl\/research\/areas\/probs\/bibliography. html ."},{"issue":"2","key":"20_CR28","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF00288965","volume":"17","author":"M.O. Rabin","year":"1982","unstructured":"M.O. Rabin. The choice-coordination problem. Acta Informatica, 17(2):121\u2013134, June 1982.","journal-title":"Acta Informatica"},{"key":"20_CR29","unstructured":"Roberto Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT, 1995."},{"key":"20_CR30","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"CONCUR\u2019 95","author":"C. Stirling","year":"1995","unstructured":"Colin Stirling. Local model checking games. In CONCUR\u2019 95, volume 962 of LNCS, pages 1\u201311. Springer Verlag, 1995. Extended abstract."},{"key":"20_CR31","series-title":"Lect Notes Comput Sci","volume-title":"Seventh International Conference on Tools and Analysis of Systems, Genova","author":"M. Y. Vardi","year":"2001","unstructured":"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."},{"key":"20_CR32","doi-asserted-by":"crossref","unstructured":"Moshe Y. Vardi. A temporal fixpoint calculus. In Proc. 15th Ann. ACM Symp. on Principles of Programming Languages. ACM, January 1988. Extended abstract.","DOI":"10.1145\/73560.73582"},{"key":"20_CR33","unstructured":"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\/ ."}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36078-6_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,22]],"date-time":"2020-04-22T16:21:33Z","timestamp":1587572493000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36078-6_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540000105","9783540360780"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/3-540-36078-6_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}