{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:55:54Z","timestamp":1725490554579},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424918"},{"type":"electronic","value":"9783540446743"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44674-5_22","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T09:49:49Z","timestamp":1188294589000},"page":"263-271","source":"Crossref","is-referenced-by-count":1,"title":["Implementation of a Strategy Improvement Algorithm for Finite-State Parity Games"],"prefix":"10.1007","author":[{"given":"Dominik","family":"Schmitz","sequence":"first","affiliation":[]},{"given":"Jens","family":"V\u00f6ge","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,20]]},"reference":[{"key":"22_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/3-540-61042-1_46","volume-title":"TACAS\u201996","author":"N. Buhrke","year":"1996","unstructured":"N. Buhrke, H. Lescow, and J. V\u00f6ge. Strategy construction in infinite games with Streett and Rabin chain winning conditions. In T. Magaria and B. Steffen, editors, TACAS\u201996, volume 1055 of LNCS, pages 207\u2013225. Springer, 1996."},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"E.A. Emerson and C.S. Jutla. Tree automata, mu-calculus and determinacy. In Proc. 32nd IEEE Symp. on the Foundations of Computing, pages 368\u2013377, 1991.","DOI":"10.1109\/SFCS.1991.185392"},{"key":"22_CR3","series-title":"Lect Notes Comput Sci","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":"E.A. Emerson, C.S. Jutla, and A.P. Sistla. On model checking for fragments of \u03bc-calculus. In C. Courcoubetis, editor, Computer Aided Verification, number 697 in Lecture Notes in Computer Science, pages 385\u2013396, Berlin, 1993. Springer Verlag."},{"key":"22_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/3-540-46541-3_24","volume-title":"STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings","author":"M. Jurdzi\u0144ski","year":"2000","unstructured":"M. Jurdzi\u0144ski. Small progress measures for solving parity games. In H. Reichel and S. Tison, editors, STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings, volume 1770 of LNCS, pages 290\u2013301, Lille, France, February 2000. Springer."},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0168-0072(93)90036-D","volume":"65","author":"R. McNaughton","year":"1993","unstructured":"R. McNaughton. Infinite games played on finite graphs. Ann. Pure Appl Logic, 65:149\u2013184, 1993.","journal-title":"Ann. Pure Appl Logic"},{"key":"22_CR6","unstructured":"A. Puri. Theory of hybrid systems and discrete event systems. Ph.d. thesis, Electronics Research Laboratory, College of Engineering, University of California, Berkeley, CA 94720, Dec. 1995. Memorandum No. UCB\/ERL M95\/113."},{"key":"22_CR7","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/978-3-642-59126-6_7","volume-title":"Handbook of Formal Language Theory","author":"W. Thomas","year":"1997","unstructured":"W. Thomas. Languages, automata, and logic. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Language Theory, volume III, pages 389\u2013455. Springer-Verlag, New York, 1997."},{"key":"22_CR8","series-title":"Lect Notes Comput Sci","volume-title":"Computer Aided Verification (CAV)","author":"J. V\u00f6ge","year":"2000","unstructured":"J. V\u00f6ge and M. Jurdzi\u0144ski. A discrete strategy improvement algorithm for solving parity games. In E.A. Emerson and A.P. Sistla, editors, Computer Aided Verification (CAV), LNCS. Springer Verlag, 2000."}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44674-5_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T23:02:03Z","timestamp":1550876523000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44674-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424918","9783540446743"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-44674-5_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}