{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T11:10:07Z","timestamp":1744024207810,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642329425"},{"type":"electronic","value":"9783642329432"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32943-2_16","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T04:59:35Z","timestamp":1346129975000},"page":"198-212","source":"Crossref","is-referenced-by-count":7,"title":["A Cure for Stuttering Parity Games"],"prefix":"10.1007","author":[{"given":"Sjoerd","family":"Cranen","sequence":"first","affiliation":[]},{"given":"Jeroen J. A.","family":"Keiren","sequence":"additional","affiliation":[]},{"given":"Tim A. C.","family":"Willemse","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"16_CR1","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1145\/585265.585270","volume":"49","author":"R. Alur","year":"2002","unstructured":"Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. J. ACM\u00a049(5), 672\u2013713 (2002)","journal-title":"J. ACM"},{"issue":"1","key":"16_CR2","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S0304-3975(02)00442-5","volume":"303","author":"A. Arnold","year":"2003","unstructured":"Arnold, A., Vincent, A., Walukiewicz, I.: Games for synthesis of controllers with partial observation. TCS\u00a0303(1), 7\u201334 (2003)","journal-title":"TCS"},{"key":"16_CR3","first-page":"342","volume":"17","author":"B. Badban","year":"2005","unstructured":"Badban, B., Fokkink, W., Groote, J.F., Pang, J., van de Pol, J.: Verification of a sliding window protocol in \u03bcCRL and PVS. FAC\u00a017, 342\u2013388 (2005)","journal-title":"FAC"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/11672142_43","volume-title":"STACS 2006","author":"D. Berwanger","year":"2006","unstructured":"Berwanger, D., Dawar, A., Hunter, P., Kreutzer, S.: DAG-Width and Parity Games. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 524\u2013536. Springer, Heidelberg (2006)"},{"issue":"1","key":"16_CR5","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S1571-0661(05)80099-4","volume":"89","author":"S.C.C. Blom","year":"2003","unstructured":"Blom, S.C.C., Orzan, S.: Distributed branching bisimulation reduction of state spaces. Electronic Notes in Theoretical Computer Science\u00a089(1), 99\u2013113 (2003)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1007\/3-540-45657-0_50","volume-title":"Computer Aided Verification","author":"S. Blom","year":"2002","unstructured":"Blom, S., van de Pol, J.: State Space Reduction by Proving Confluence. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 596\u2013694. Springer, Heidelberg (2002)"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0304-3975(88)90098-9","volume":"59","author":"M.C. Browne","year":"1988","unstructured":"Browne, M.C., Clarke, E.M., Grumberg, O.: Characterizing finite Kripke structures in propositional temporal logic. TCS\u00a059, 115\u2013131 (1988)","journal-title":"TCS"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-540-74407-8_9","volume-title":"CONCUR 2007 \u2013 Concurrency Theory","author":"T. Chen","year":"2007","unstructured":"Chen, T., Ploeger, B., van de Pol, J., Willemse, T.A.C.: Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol.\u00a04703, pp. 120\u2013135. Springer, Heidelberg (2007)"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Cranen, S., Keiren, J.J.A., Willemse, T.A.C.: A cure for stuttering parity games. Technical Report 12-05, Eindhoven University of Technology, Eindhoven (2012), http:\/\/alexandria.tue.nl\/repository\/books\/732149.pdf","DOI":"10.1007\/978-3-642-32943-2_16"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-20398-5_16","volume-title":"NASA Formal Methods","author":"S. Cranen","year":"2011","unstructured":"Cranen, S., Keiren, J.J.A., Willemse, T.A.C.: Stuttering Mostly Speeds Up Solving Parity Games. In: Bobaru, M., Havelund, K., Holzmann, G.J., Joshi, R. (eds.) NFM 2011. LNCS, vol.\u00a06617, pp. 207\u2013221. Springer, Heidelberg (2011)"},{"key":"16_CR11","first-page":"368","volume-title":"FOCS 1991","author":"E.A. Emerson","year":"1991","unstructured":"Emerson, E.A., Jutla, C.S.: Tree automata, mu-calculus and determinacy. In: FOCS 1991, pp. 368\u2013377. IEEE Computer Society, Washington, DC (1991)"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-04761-9_15","volume-title":"Automated Technology for Verification and Analysis","author":"O. Friedmann","year":"2009","unstructured":"Friedmann, O., Lange, M.: Solving Parity Games in Practice. In: Liu, Z., Ravn, A.P. (eds.) ATVA 2009. LNCS, vol.\u00a05799, pp. 182\u2013196. Springer, Heidelberg (2009)"},{"key":"16_CR13","unstructured":"Fritz, C.: Simulation-Based Simplification of omega-Automata. PhD thesis, Christian-Albrechts-Universit\u00e4t zu Kiel (2005)"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/11779148_7","volume-title":"Developments in Language Theory","author":"C. Fritz","year":"2006","unstructured":"Fritz, C., Wilke, T.: Simulation Relations for Alternating Parity Automata and Parity Games. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol.\u00a04036, pp. 59\u201370. Springer, Heidelberg (2006)"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Groote, J.F., Pang, J., Wouters, A.G.: Analysis of a distributed system for lifting trucks. In: JLAP, vol.\u00a055, pp. 21\u201356. Elsevier (2003)","DOI":"10.1016\/S1567-8326(02)00038-3"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/BFb0032063","volume-title":"Automata, Languages and Programming","author":"J.F. Groote","year":"1990","unstructured":"Groote, J.F., Vaandrager, F.W.: An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol.\u00a0443, pp. 626\u2013638. Springer, Heidelberg (1990)"},{"issue":"3","key":"16_CR17","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0020-0190(98)00150-1","volume":"68","author":"M. Jurdzi\u0144ski","year":"1998","unstructured":"Jurdzi\u0144ski, M.: Deciding the winner in parity games is in UP \u2229 co-UP. IPL\u00a068(3), 119\u2013124 (1998)","journal-title":"IPL"},{"key":"16_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/3-540-46541-3_24","volume-title":"STACS 2000","author":"M. Jurdzi\u0144ski","year":"2000","unstructured":"Jurdzi\u0144ski, M.: Small Progress Measures for Solving Parity Games. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol.\u00a01770, pp. 290\u2013301. Springer, Heidelberg (2000)"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Jurdzi\u0144ski, M., Paterson, M., Zwick, U.: A Deterministic Subexponential Algorithm for Solving Parity Games. In: SODA 2006, pp. 117\u2013123. ACM\/SIAM (2006)","DOI":"10.1145\/1109557.1109571"},{"key":"16_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-642-19237-1_12","volume-title":"Hardware and Software: Verification and Testing","author":"J.J.A. Keiren","year":"2011","unstructured":"Keiren, J.J.A., Willemse, T.A.C.: Bisimulation Minimisations for Boolean Equation Systems. In: Namjoshi, K., Zeller, A., Ziv, A. (eds.) HVC 2009. LNCS, vol.\u00a06405, pp. 102\u2013116. Springer, Heidelberg (2011)"},{"key":"16_CR21","unstructured":"Luttik, S.P.: Description and formal specification of the link layer of P1394. In: Workshop on Applied Formal Methods in System Design, pp. 43\u201356 (1997)"},{"issue":"2","key":"16_CR22","first-page":"149","volume":"65","author":"R. McNaughton","year":"1993","unstructured":"McNaughton, R.: Infinite games played on finite graphs. APAL\u00a065(2), 149\u2013184 (1993)","journal-title":"APAL"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Obdrz\u00e1lek, J.: Clique-Width and Parity Games. In: CSL, pp. 54\u201368 (2007)","DOI":"10.1007\/978-3-540-74915-8_8"},{"key":"16_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-3-540-77050-3_37","volume-title":"FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science","author":"S. Schewe","year":"2007","unstructured":"Schewe, S.: Solving Parity Games in Big Steps. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol.\u00a04855, pp. 449\u2013460. Springer, Heidelberg (2007)"},{"key":"16_CR25","unstructured":"Stirling, C.: Bisimulation, Model Checking and Other Games. In: Notes for Mathfit Workshop on Finite Model Theory, University of Wales Swansea (1996)"},{"issue":"3","key":"16_CR26","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/233551.233556","volume":"43","author":"R.J. Glabbeek van","year":"1996","unstructured":"van Glabbeek, R.J., Weijland, W.P.: Branching time and abstraction in bisimulation semantics. J. ACM\u00a043(3), 555\u2013600 (1996)","journal-title":"J. ACM"},{"issue":"1-2","key":"16_CR27","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(98)00009-7","volume":"200","author":"W. Zielonka","year":"1998","unstructured":"Zielonka, W.: Infinite games on finitely coloured graphs with applications to automata on infinite trees. TCS\u00a0200(1-2), 135\u2013183 (1998)","journal-title":"TCS"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32943-2_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T10:34:14Z","timestamp":1744022054000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32943-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642329425","9783642329432"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32943-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}