{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:53:55Z","timestamp":1725490435216},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734192"},{"type":"electronic","value":"9783540734208"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73420-8_73","type":"book-chapter","created":{"date-parts":[[2007,8,25]],"date-time":"2007-08-25T14:58:43Z","timestamp":1188053923000},"page":"850-861","source":"Crossref","is-referenced-by-count":5,"title":["Perfect Information Stochastic Priority Games"],"prefix":"10.1007","author":[{"given":"Hugo","family":"Gimbert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wies\u0142aw","family":"Zielonka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"73_CR1","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1073\/pnas.39.10.1095","volume":"39","author":"L.S. Shapley","year":"1953","unstructured":"Shapley, L.S.: Stochastic games. Proceedings Nat. Acad. of Science USA\u00a039, 1095\u20131100 (1953)","journal-title":"Proceedings Nat. Acad. of Science USA"},{"key":"73_CR2","first-page":"368","volume-title":"FOCS 1991","author":"E. Emerson","year":"1991","unstructured":"Emerson, E., Jutla, C.: Tree automata, \u03bc-calculus and determinacy. In: FOCS 1991, pp. 368\u2013377. IEEE Computer Society Press, Los Alamitos (1991)"},{"key":"73_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.1007\/3-540-45061-0_79","volume-title":"Automata, Languages and Programming","author":"L. Alfaro de","year":"2003","unstructured":"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 2003. LNCS, vol.\u00a02719, pp. 1022\u20131037. Springer, Heidelberg (2003)"},{"key":"73_CR4","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/j.jcss.2003.07.009","volume":"68","author":"L. Alfaro de","year":"2004","unstructured":"de Alfaro, L., Majumdar, R.: Quantitative solution to omega-regular games. Journal of Computer and System Sciences\u00a068, 374\u2013397 (2004)","journal-title":"Journal of Computer and System Sciences"},{"key":"73_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/11787006_27","volume-title":"Automata, Languages and Programming","author":"H. Gimbert","year":"2006","unstructured":"Gimbert, H., Zielonka, W.: Deterministic priority mean-payoff games as limits of discounted games. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052(Part II), pp. 312\u2013323. Springer, Heidelberg (2006)"},{"key":"73_CR6","unstructured":"Chatterejee, K., Jurdzi\u0144ski, M., Henzinger, T.: Quantitative stochastic parity games. In: Proceedings of the 15th Annual Symposium on Discrete Algorithms SODA, pp. 114\u2013123 (2004)"},{"key":"73_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/3-540-36078-6_20","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"A. McIver","year":"2002","unstructured":"McIver, A., Morgan, C.: Games, probability and the quantitative \u03bc-calculus qmu. In: Baaz, M., Voronkov, A. (eds.) LPAR 2002. LNCS (LNAI), vol.\u00a02514, pp. 292\u2013310. Springer, Heidelberg (2002), Full version \n                    \n                      arxiv.org\/abs\/cs.LO\/0309024"},{"key":"73_CR8","unstructured":"de Alfaro, L.: Formal Verification of Probabilistic Systems. PhD thesis, Stanford University (December 1997)"},{"key":"73_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/978-3-540-24727-2_35","volume-title":"Foundations of Software Science and Computation Structures","author":"W. Zielonka","year":"2004","unstructured":"Zielonka, W.: Perfect-information stochastic parity games. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 499\u2013513. Springer, Heidelberg (2004)"},{"key":"73_CR10","volume-title":"A Course in Game Theory","author":"M.J. Osborne","year":"2002","unstructured":"Osborne, M.J., Rubinstein, A.: A Course in Game Theory. MIT Press, Cambridge (2002)"},{"key":"73_CR11","volume-title":"Competitive Markov Decision Processes","author":"J. Filar","year":"1997","unstructured":"Filar, J., Vrieze, K.: Competitive Markov Decision Processes. Springer, Heidelberg (1997)"},{"key":"73_CR12","series-title":"ENTCS","first-page":"195","volume-title":"QAPL 2005","author":"A. McIver","year":"2005","unstructured":"McIver, A., Morgan, C.: A novel stochastic game via the quantitative mu-calculus. In: Cerone, A., Wiklicky, H. (eds.) QAPL 2005. Proc. of the Third Workshop on Quantitative Aspects of Programming Languages. ENTCS, vol.\u00a0153(2), pp. 195\u2013212. Elsevier, Amsterdam (2005)"},{"key":"73_CR13","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1214\/aoms\/1177704593","volume":"33","author":"D. Blackwell","year":"1962","unstructured":"Blackwell, D.: Discrete dynamic programming. Annals of Mathematical Statistics\u00a033, 719\u2013726 (1962)","journal-title":"Annals of Mathematical Statistics"},{"key":"73_CR14","volume-title":"Handbook of Markov Decision Processes","author":"A. Hordijk","year":"2002","unstructured":"Hordijk, A., Yushkevich, A.: Blackwell optimality. In: Feinberg, E., Schwartz, A. (eds.) Handbook of Markov Decision Processes, Kluwer, Dordrecht (2002)"},{"key":"73_CR15","unstructured":"Titchmarsh, E.: The Theory of Functions, 2nd edn. Oxford University Press, Oxford"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73420-8_73","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T14:26:25Z","timestamp":1558275985000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73420-8_73"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540734192","9783540734208"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73420-8_73","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}