{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:11:27Z","timestamp":1767237087866},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642152047"},{"type":"electronic","value":"9783642152054"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-15205-4_22","type":"book-chapter","created":{"date-parts":[[2010,8,13]],"date-time":"2010-08-13T10:48:24Z","timestamp":1281696504000},"page":"260-274","source":"Crossref","is-referenced-by-count":33,"title":["Energy and Mean-Payoff Games with Imperfect Information"],"prefix":"10.1007","author":[{"given":"Aldric","family":"Degorre","sequence":"first","affiliation":[]},{"given":"Laurent","family":"Doyen","sequence":"additional","affiliation":[]},{"given":"Raffaella","family":"Gentilini","sequence":"additional","affiliation":[]},{"given":"Jean-Fran\u00e7ois","family":"Raskin","sequence":"additional","affiliation":[]},{"given":"Szymon","family":"Toru\u0144czyk","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-642-00596-1_24","volume-title":"Foundations of Software Science and Computational Structures","author":"R. Alur","year":"2009","unstructured":"Alur, R., Degorre, A., Maler, O., Weiss, G.: On omega-languages defined by mean-payoff conditions. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol.\u00a05504, pp. 333\u2013347. Springer, Heidelberg (2009)"},{"key":"22_CR2","unstructured":"Berwanger, D., Doyen, L.: On the power of imperfect information. In: Proc. of FSTTCS. Dagstuhl Seminar Proceedings 08004. IBFI (2008)"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Bloem, R., Chatterjee, K., Henzinger, T.A., Jobstmann, B.: Better quality in synthesis through quantitative objectives. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol.\u00a05643, pp. 140\u2013156. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-02658-4_14"},{"key":"22_CR4","unstructured":"Chaloupka, J., Brim, L.: Faster algorithm for mean-payoff games. In: Proc. of MEMICS: Math. and Engineering Methods in Comp. Science, pp. 45\u201353. Nov Press (2009)"},{"key":"22_CR5","first-page":"179","volume-title":"Proc. of QEST: Quantitative Evaluaiton of Systems","author":"K. Chatterjee","year":"2006","unstructured":"Chatterjee, K., de Alfaro, L., Faella, M., Henzinger, T.A., Majumdar, R., Stoelinga, M.: Compositional quantitative reasoning. In: Proc. of QEST: Quantitative Evaluaiton of Systems, pp. 179\u2013188. IEEE Computer Society, Los Alamitos (2006)"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-540-87531-4_28","volume-title":"Computer Science Logic","author":"K. Chatterjee","year":"2008","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: Quantitative languages. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol.\u00a05213, pp. 385\u2013400. Springer, Heidelberg (2008)"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A., Raskin, J.-F.: Algorithms for omega-regular games of incomplete information. Logical Methods in Computer Science\u00a03(3:4) (2007)","DOI":"10.2168\/LMCS-3(3:4)2007"},{"key":"22_CR8","first-page":"454","volume-title":"Proc. of LICS: Logic in Computer Science","author":"L. de Alfaro","year":"1998","unstructured":"de Alfaro, L.: How to specify and verify the long-run average behavior of probabilistic systems. In: Proc. of LICS: Logic in Computer Science, pp. 454\u2013465. IEEE Comp. Soc., Los Alamitos (1998)"},{"issue":"4","key":"22_CR9","doi-asserted-by":"publisher","first-page":"413","DOI":"10.2307\/2370405","volume":"35","author":"L.E. Dickson","year":"1913","unstructured":"Dickson, L.E.: Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. Am. J. of Mathematics\u00a035(4), 413\u2013422 (1913)","journal-title":"Am. J. of Mathematics"},{"key":"22_CR10","unstructured":"Doyen, L., Gentilini, R., Raskin, J.-F.: Faster pseudopolynomial algorithms for meanpayoff games. Technical Report 2009.120, Universit\u00e9 Libre de Bruxelles (ULB), Belgium (2009)"},{"issue":"1-2","key":"22_CR11","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.tcs.2007.02.055","volume":"380","author":"M. Droste","year":"2007","unstructured":"Droste, M., Gastin, P.: Weighted automata and weighted logics. Th. C. Sci.\u00a0380(1-2), 69\u201386 (2007)","journal-title":"Th. C. Sci."},{"key":"22_CR12","first-page":"109","volume":"8","author":"A. Ehrenfeucht","year":"1979","unstructured":"Ehrenfeucht, A., Mycielski, J.: International journal of game theory. Positional Strategies for Mean-Payoff Games\u00a08, 109\u2013113 (1979)","journal-title":"Positional Strategies for Mean-Payoff Games"},{"key":"22_CR13","first-page":"368","volume-title":"Proc. of FOCS","author":"E.A. Emerson","year":"1991","unstructured":"Emerson, E.A., Jutla, C.: Tree automata, mu-calculus and determinacy. In: Proc. of FOCS, pp. 368\u2013377. IEEE, Los Alamitos (1991)"},{"key":"22_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/3-540-56922-7_32","volume-title":"Computer Aided Verification","author":"E.A. Emerson","year":"1993","unstructured":"Emerson, E.A., Jutla, C.S., Sistla, A.P.: On model-checking for fragments of \u03bc-calculus. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.\u00a0697, pp. 385\u2013396. Springer, Heidelberg (1993)"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1007\/3-540-65306-6_20","volume-title":"Lectures on Petri Nets I: Basic Models","author":"J. Esparza","year":"1998","unstructured":"Esparza, J.: Decidability and complexity of Petri net problems - An introduction. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol.\u00a01491, pp. 374\u2013428. Springer, Heidelberg (1998)"},{"issue":"1-2","key":"22_CR16","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A. Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Th. Comp. Sc.\u00a0256(1-2), 63\u201392 (2001)","journal-title":"Th. Comp. Sc."},{"key":"22_CR17","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Logics, and Infinite Games: A Guide to Current Research","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games: A Guide to Current Research. LNCS, vol.\u00a02500. Springer, Heidelberg (2002)"},{"key":"22_CR18","first-page":"60","volume-title":"Proc. of STOC","author":"Y. Gurevich","year":"1982","unstructured":"Gurevich, Y., Harrington, L.: Trees, automata, and games. In: Proc. of STOC, pp. 60\u201365. ACM Press, New York (1982)"},{"key":"22_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/3-540-55719-9_67","volume-title":"Automata, Languages and Programming","author":"D. Krob","year":"1992","unstructured":"Krob, D.: The equality problem for rational series with multiplicities in the tropical semiring is undecidable. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623, pp. 101\u2013112. Springer, Heidelberg (1992)"},{"key":"22_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-540-69738-1_14","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"O. Kupferman","year":"2007","unstructured":"Kupferman, O., Lustig, Y.: Lattice automata. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol.\u00a04349, pp. 199\u2013213. Springer, Heidelberg (2007)"},{"key":"22_CR21","volume-title":"Finite and Infinite Machines","author":"N.M. Minsky","year":"1967","unstructured":"Minsky, N.M.: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)"},{"key":"22_CR22","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(78)90036-1","volume":"6","author":"C. Rackoff","year":"1978","unstructured":"Rackoff, C.: The covering and boundedness problems for vector addition systems. Th. Comp. Sc.\u00a06, 223\u2013231 (1978)","journal-title":"Th. Comp. Sc."},{"issue":"2","key":"22_CR23","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/0022-0000(84)90034-5","volume":"29","author":"J.H. Reif","year":"1984","unstructured":"Reif, J.H.: The complexity of two-player games of incomplete information. Journal of Computer and System Sciences\u00a029(2), 274\u2013301 (1984)","journal-title":"Journal of Computer and System Sciences"},{"key":"22_CR24","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0304-3975(95)00188-3","volume":"158","author":"U. Zwick","year":"1996","unstructured":"Zwick, U., Paterson, M.: The complexity of mean payoff games on graphs. Th. Comp. Sc.\u00a0158, 343\u2013359 (1996)","journal-title":"Th. Comp. Sc."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15205-4_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T17:15:02Z","timestamp":1558286102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15205-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642152047","9783642152054"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15205-4_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}