{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T09:10:40Z","timestamp":1774775440187,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662445211","type":"print"},{"value":"9783662445228","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44522-8_41","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T10:12:23Z","timestamp":1407838343000},"page":"486-498","source":"Crossref","is-referenced-by-count":9,"title":["Determinising Parity Automata"],"prefix":"10.1007","author":[{"given":"Sven","family":"Schewe","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Varghese","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"41_CR1","doi-asserted-by":"crossref","unstructured":"Boker, U., Kupferman, O.: Co-ing B\u00fcchi made tight and useful. In: Proc. of LICS, pp. 245\u2013254 (2009)","DOI":"10.1109\/LICS.2009.32"},{"key":"41_CR2","unstructured":"Cai, Y., Zhang, T.: Tight upper bounds for Streett and parity complementation. In: Proc. of CSL, pp. 112\u2013128 (2011)"},{"key":"41_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-642-02930-1_13","volume-title":"Automata, Languages and Programming","author":"T. Colcombet","year":"2009","unstructured":"Colcombet, T., Zdanowski, K.: A tight lower bound for determinization of B\u00fcchi automata. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part II. LNCS, vol.\u00a05556, pp. 151\u2013162. Springer, Heidelberg (2009)"},{"key":"41_CR4","doi-asserted-by":"crossref","unstructured":"Duret-Lutz, A.: LTL translation improvements in SPOT. In: VECoS, pp. 72\u201383. BCS (2011)","DOI":"10.14236\/ewic\/VECOS2011.8"},{"key":"41_CR5","doi-asserted-by":"crossref","unstructured":"Finkbeiner, B., Schewe, S.: Uniform distributed synthesis. In: Proc. of LICS 2005, pp. 321\u2013330 (2005)","DOI":"10.1109\/LICS.2005.53"},{"key":"41_CR6","unstructured":"Finkbeiner, B., Schewe, S.: Bounded synthesis. International Journal on Software Tools for Technology Transfer, online-first: 1\u201312 (2012)"},{"key":"41_CR7","unstructured":"Kupferman, O., Vardi, M.Y.: Synthesizing distributed systems. In: Proc. of LICS 2001, pp. 389\u2013398 (2001)"},{"key":"41_CR8","doi-asserted-by":"crossref","unstructured":"Kupferman, O., Vardi, M.Y.: Safraless decision procedures. In: Proc. of FOCS 2005, pp. 531\u2013540 (2005)","DOI":"10.1109\/SFCS.2005.66"},{"key":"41_CR9","doi-asserted-by":"crossref","unstructured":"Piterman, N.: From nondeterministic B\u00fcchi and Streett automata to deterministic parity automata. Journal of LMCS 3(3:5) (2007)","DOI":"10.2168\/LMCS-3(3:5)2007"},{"key":"41_CR10","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: Distributed reactive systems are hard to synthesize. In: Proc. of FOCS 1990, pp. 746\u2013757 (1990)","DOI":"10.1109\/FSCS.1990.89597"},{"key":"41_CR11","first-page":"1","volume":"141","author":"M.O. Rabin","year":"1969","unstructured":"Rabin, M.O.: Decidability of second order theories and automata on infinite trees. Transaction of the AMS\u00a0141, 1\u201335 (1969)","journal-title":"Transaction of the AMS"},{"key":"41_CR12","doi-asserted-by":"crossref","unstructured":"Safra, S.: On the complexity of \u03c9-automata. In: Proc. of FOCS 1988, pp. 319\u2013327 (1988)","DOI":"10.1109\/SFCS.1988.21948"},{"key":"41_CR13","doi-asserted-by":"crossref","unstructured":"Safra, S.: Exponential determinization for omega-automata with strong-fairness acceptance condition. In: Proc. of STOC 1992, pp. 275\u2013282 (1992)","DOI":"10.1145\/129712.129739"},{"key":"41_CR14","unstructured":"Schewe, S.: B\u00fcchi complementation made tight. In: Proc. of STACS 2009, pp. 661\u2013672 (2009)"},{"key":"41_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-642-00596-1_13","volume-title":"Foundations of Software Science and Computational Structures","author":"S. Schewe","year":"2009","unstructured":"Schewe, S.: Tighter bounds for the determinisation of b\u00fcchi automata. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol.\u00a05504, pp. 167\u2013181. Springer, Heidelberg (2009)"},{"key":"41_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/11874683_39","volume-title":"Computer Science Logic","author":"S. Schewe","year":"2006","unstructured":"Schewe, S., Finkbeiner, B.: Satisfiability and finite model property for the alternating-time \u03bc-calculus. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol.\u00a04207, pp. 591\u2013605. Springer, Heidelberg (2006)"},{"key":"41_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-540-71410-1_10","volume-title":"Logic-Based Program Synthesis and Transformation","author":"S. Schewe","year":"2007","unstructured":"Schewe, S., Finkbeiner, B.: Synthesis of asynchronous systems. In: Puebla, G. (ed.) LOPSTR 2006. LNCS, vol.\u00a04407, pp. 127\u2013142. Springer, Heidelberg (2007)"},{"key":"41_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-642-33386-6_5","volume-title":"Automated Technology for Verification and Analysis","author":"S. Schewe","year":"2012","unstructured":"Schewe, S., Varghese, T.: Tight bounds for the determinisation and complementation of generalised b\u00fcchi automata. In: Chakraborty, S., Mukund, M. (eds.) ATVA 2012. LNCS, vol.\u00a07561, pp. 42\u201356. Springer, Heidelberg (2012)"},{"key":"41_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/978-3-540-70918-3_2","volume-title":"STACS 2007","author":"M.Y. Vardi","year":"2007","unstructured":"Vardi, M.Y.: The B\u00fcchi complementation saga. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol.\u00a04393, pp. 12\u201322. Springer, Heidelberg (2007)"},{"key":"41_CR20","doi-asserted-by":"crossref","unstructured":"Wilke, T.: Alternating tree automata, parity games, and modal \u03bc-calculus. Bull. Soc. Math. Belg. 8(2) (May 2001)","DOI":"10.36045\/bbms\/1102714178"},{"key":"41_CR21","doi-asserted-by":"crossref","unstructured":"Yan, Q.: Lower bounds for complementation of omega-automata via the full automata technique. Journal of LMCS, 4(1:5) (2008)","DOI":"10.2168\/LMCS-4(1:5)2008"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44522-8_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:29:26Z","timestamp":1746332966000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44522-8_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662445211","9783662445228"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44522-8_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}