{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T12:43:06Z","timestamp":1725453786420},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387678"},{"type":"electronic","value":"9783642387685"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38768-5_16","type":"book-chapter","created":{"date-parts":[[2013,5,17]],"date-time":"2013-05-17T04:31:28Z","timestamp":1368765088000},"page":"158-168","source":"Crossref","is-referenced-by-count":0,"title":["Deternimization of B\u00fcchi Automata as Partitioned Automata"],"prefix":"10.1007","author":[{"given":"Cong","family":"Tian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenhua","family":"Duan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mengfei","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"Clark, M., Gremberg, O., Peled, A.: Model Checking. The MIT Press (2000)"},{"key":"16_CR2","unstructured":"Katoen, J.-P.: Concepts, Algorithms and Tools for Model Checking. Arbeitsberichte der Informatik, Friedrich-Alexander-Universitaet Erlangen-Nuernberg\u00a032(1) (1999)"},{"key":"16_CR3","unstructured":"B\u00fcchi, J.R.: On a decision method in restricted second order arithmetic. In: Proceedings of the International Congress on Logic, Method, and Philosophy of Science, pp. 1\u201312. Stanford University Press (1962)"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-642-59126-6_7","volume-title":"Handbook of Formal Languages","author":"W. Thomas","year":"1997","unstructured":"Thomas, W.: Languages, automata and logic. In: Handbook of Formal Languages, vol.\u00a03, pp. 389\u2013455. Springer, Berlin (1997)"},{"issue":"5","key":"16_CR5","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1109\/32.588521","volume":"23","author":"G.J. Holzmann","year":"1997","unstructured":"Holzmann, G.J.: The Model Checker Spin. IEEE Trans. on Software Engineering\u00a023(5), 279\u2013295 (1997)","journal-title":"IEEE Trans. on Software Engineering"},{"key":"16_CR6","series-title":"LNCS","volume-title":"Automata, Logics, and Infinite Games","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. LNCS, vol.\u00a02500. Springer, Heidelberg (2002)"},{"key":"16_CR7","unstructured":"Jain, H.: Automata on Infinite Objects. B.Tech Seminar Report, India, internal report (1996)"},{"key":"16_CR8","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":"16_CR9","doi-asserted-by":"crossref","unstructured":"Safra, S.: On the complexity of omega-automata. In: Proceedings of the 29th Annual Symposium on Foundations of Computer Science, FOCS 1988, pp. 319\u2013327. IEEE Computer Society Press (1988)","DOI":"10.1109\/SFCS.1988.21948"},{"issue":"1-2","key":"16_CR10","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0304-3975(94)00214-4","volume":"141","author":"D.E. Muller","year":"1995","unstructured":"Muller, D.E., Schupp: Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra. Theoretical Computer Science\u00a0141(1-2), 69\u2013107 (1995)","journal-title":"Theoretical Computer Science"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Boker, U., Kupferman, O.: Co-ing B\u00fcchi Made Tight and Useful. In: LICS 2009, pp. 245\u2013254 (2009)","DOI":"10.1109\/LICS.2009.32"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-642-15025-8_8","volume-title":"Fields of Logic and Computation","author":"U. Boker","year":"2010","unstructured":"Boker, U., Kupferman, O.: The Quest for a Tight Translation of B\u00fcchi to co-B\u00fcchi Automata. In: Blass, A., Dershowitz, N., Reisig, W. (eds.) Fields of Logic and Computation. LNCS, vol.\u00a06300, pp. 147\u2013164. Springer, Heidelberg (2010)"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-642-19805-2_13","volume-title":"Foundations of Software Science and Computational Structures","author":"U. Boker","year":"2011","unstructured":"Boker, U., Kupferman, O.: Co-B\u00fcching Them All. In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol.\u00a06604, pp. 184\u2013198. Springer, Heidelberg (2011)"},{"issue":"4","key":"16_CR14","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1142\/S0129054106004145","volume":"17","author":"E. Friedgut","year":"2006","unstructured":"Friedgut, E., Kupderman, O., Vardi, M.Y.: B\u00fcchi complementation made tighter. International Journal of Foundations of Computer Science\u00a017(4), 851\u2013863 (2006)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"16_CR15","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(87)90008-9","volume":"49","author":"A.P. Sistla","year":"1987","unstructured":"Sistla, A.P., Vardi, M.Y., Wolper, P.: The complementation problem for B\u00fcchi automata with applications to temporal logic. Theoretical Computer Science\u00a049, 217\u2013237 (1987)","journal-title":"Theoretical Computer Science"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Muller, D.E.: Infinite sequences and finite machines. In: Proceedings of the 4th IEEE Symposioum on Switching Circuit Theory and Logical Design, pp. 3\u201316 (1963)","DOI":"10.1109\/SWCT.1963.8"},{"issue":"5","key":"16_CR17","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/S0019-9958(66)80013-X","volume":"9","author":"McNaughton","year":"1966","unstructured":"McNaughton: Testing and generating infinite sequences by a finite automaton. Information and Control\u00a09(5), 521\u2013530 (1966)","journal-title":"Information and Control"},{"key":"16_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/11787006_50","volume-title":"Automata, Languages and Programming","author":"Q. Yan","year":"2006","unstructured":"Yan, Q.: Lower bounds for complementation of \u03c9-automata via the full automata technique. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 589\u2013600. Springer, Heidelberg (2006)"},{"key":"16_CR19","unstructured":"Schewe, S.: B\u00fcchi Complementation Made Tight. In: STACS 2009, pp. 661\u2013672 (2009)"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Piterman, N.: From nondeterministic B\u00fcchi and Streett automata to deterministic parity automata. Journal of Logical Methods in Computer Science 3 (2007)","DOI":"10.2168\/LMCS-3(3:5)2007"},{"issue":"16","key":"16_CR21","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1016\/j.ipl.2009.04.022","volume":"109","author":"W. Liu","year":"2009","unstructured":"Liu, W., Wang, J.: A tighter analysis of Piterman\u2019s B\u00fcchi determinization. Inf. Process. Lett.\u00a0109(16), 941\u2013945 (2009)","journal-title":"Inf. Process. Lett."},{"key":"16_CR22","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":"16_CR23","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 Transition Labeled 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)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38768-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T02:20:02Z","timestamp":1557714002000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38768-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387678","9783642387685"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38768-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}