{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T20:54:28Z","timestamp":1760043268974,"version":"3.41.2"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030003883"},{"type":"electronic","value":"9783030003890"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-00389-0_12","type":"book-chapter","created":{"date-parts":[[2018,9,19]],"date-time":"2018-09-19T19:12:43Z","timestamp":1537384363000},"page":"214-234","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Categorical B\u00fcchi and Parity Conditions via Alternating Fixed Points of Functors"],"prefix":"10.1007","author":[{"given":"Natsuki","family":"Urabe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ichiro","family":"Hasuo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,20]]},"reference":[{"issue":"2","key":"12_CR1","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0022-0000(79)90026-6","volume":"19","author":"J Ad\u00e1mek","year":"1979","unstructured":"Ad\u00e1mek, J., Koubek, V.: Least fixed point of a functor. J. Comput. Syst. Sci. 19(2), 163\u2013178 (1979). https:\/\/doi.org\/10.1016\/0022-0000(79)90026-6","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.jlamp.2017.11.003","volume":"95","author":"J Ad\u00e1mek","year":"2018","unstructured":"Ad\u00e1mek, J., Milius, S., Moss, L.S.: Fixed points of functors. J. Log. Algebraic Methods Program. 95, 41\u201381 (2018)","journal-title":"J. Log. Algebraic Methods Program."},{"key":"12_CR3","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Rudiments of $$\\mu $$-Calculus","author":"A Arnold","year":"2001","unstructured":"Arnold, A., Niwi\u0144ski, D.: Rudiments of $$\\mu $$-Calculus. Studies in Logic and the Foundations of Mathematics. Elsevier, Amsterdam (2001)"},{"key":"12_CR4","volume-title":"Handbook of Categorical Algebra, Encyclopedia of Mathematics and its Applications","author":"F Borceux","year":"1994","unstructured":"Borceux, F.: Handbook of Categorical Algebra, Encyclopedia of Mathematics and its Applications, vol. 1. Cambridge University Press, Cambridge (1994)"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-32784-1_6","volume-title":"Coalgebraic Methods in Computer Science","author":"V Ciancia","year":"2012","unstructured":"Ciancia, V., Venema, Y.: Stream automata are coalgebras. In: Pattinson, D., Schr\u00f6der, L. (eds.) CMCS 2012. LNCS, vol. 7399, pp. 90\u2013108. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32784-1_6"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/3-540-56496-9_32","volume-title":"Computer Aided Verification","author":"R Cleaveland","year":"1993","unstructured":"Cleaveland, R., Klein, M., Steffen, B.: Faster model checking for the modal mu-calculus. In: von Bochmann, G., Probst, D.K. (eds.) CAV 1992. LNCS, vol. 663, pp. 410\u2013422. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-56496-9_32"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(83)90059-2","volume":"25","author":"B Courcelle","year":"1983","unstructured":"Courcelle, B.: Fundamental properties of infinite trees. Theor. Comput. Sci. 25, 95\u2013169 (1983). https:\/\/doi.org\/10.1016\/0304-3975(83)90059-2","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"12_CR8","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1137\/S0097539703420675","volume":"34","author":"K Etessami","year":"2005","unstructured":"Etessami, K., Wilke, T., Schuller, R.A.: Fair simulation relations, parity games, and state space reduction for B\u00fcchi automata. SICOMP 34(5), 1159\u20131175 (2005)","journal-title":"SICOMP"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Ghani, N., Hancock, P., Pattinson, D.: Representations of stream processors using nested fixed points. Log. Methods Comput. Sci. 5(3) (2009)","DOI":"10.2168\/LMCS-5(3:9)2009"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/11548133_14","volume-title":"Algebra and Coalgebra in Computer Science","author":"I Hasuo","year":"2005","unstructured":"Hasuo, I., Jacobs, B.: Context-free languages via coalgebraic trace semantics. In: Fiadeiro, J.L., Harman, N., Roggenbach, M., Rutten, J. (eds.) CALCO 2005. LNCS, vol. 3629, pp. 213\u2013231. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11548133_14"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Hasuo, I., Jacobs, B., Sokolova, A.: Generic trace semantics via coinduction. Log. Methods Comput. Sci. 3(4) (2007)","DOI":"10.2168\/LMCS-3(4:11)2007"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.entcs.2004.02.031","volume":"106","author":"B Jacobs","year":"2004","unstructured":"Jacobs, B.: Trace semantics for coalgebras. Electr. Notes Theor. Comput. Sci. 106, 167\u2013184 (2004). https:\/\/doi.org\/10.1016\/j.entcs.2004.02.031","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"12_CR13","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781316823187","volume-title":"Introduction to Coalgebra: Towards Mathematics of States and Observation","author":"B Jacobs","year":"2016","unstructured":"Jacobs, B.: Introduction to Coalgebra: Towards Mathematics of States and Observation. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, New York (2016)"},{"issue":"1","key":"12_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2004.05.003","volume":"196","author":"S Milius","year":"2005","unstructured":"Milius, S.: Completely iterative algebras and completely iterative monads. Inf. Comput. 196(1), 1\u201341 (2005)","journal-title":"Inf. Comput."},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/3-540-58027-1_15","volume-title":"Mathematical Foundations of Programming Semantics","author":"PS Mulry","year":"1994","unstructured":"Mulry, P.S.: Lifting theorems for Kleisli categories. In: Brookes, S., Main, M., Melton, A., Mislove, M., Schmidt, D. (eds.) MFPS 1993. LNCS, vol. 802, pp. 304\u2013319. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58027-1_15"},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/S1571-0661(05)80319-6","volume":"29","author":"J Power","year":"1999","unstructured":"Power, J., Turi, D.: A coalgebraic foundation for linear time semantics. Electr. Notes Theor. Comput. Sci. 29, 259\u2013274 (1999)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"12_CR17","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: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 389\u2013455. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-642-59126-6_7"},{"key":"12_CR18","unstructured":"Urabe, N., Hasuo, I.: Coalgebraic infinite traces and Kleisli simulations. CoRR abs\/1505.06819 (2015). http:\/\/arxiv.org\/abs\/1505.06819"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Urabe, N., Hasuo, I.: Fair simulation for nondeterministic and probabilistic Buechi automata: a coalgebraic perspective. LMCS 13(3) (2017)","DOI":"10.23638\/LMCS-13(3:20)2017"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Urabe, N., Hasuo, I.: Categorical B\u00fcchi and parity conditions via alternating fixed points of functors. arXiv preprint (2018)","DOI":"10.1007\/978-3-030-00389-0_12"},{"key":"12_CR21","unstructured":"Urabe, N., Shimizu, S., Hasuo, I.: Coalgebraic trace semantics for B\u00fcchi and parity automata. In: Proceedings of the CONCUR 2016. LIPIcs, vol. 59, pp. 24:1\u201324:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016)"}],"container-title":["Lecture Notes in Computer Science","Coalgebraic Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00389-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T22:29:43Z","timestamp":1751927383000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-00389-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030003883","9783030003890"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00389-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"20 September 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CMCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Coalgebraic Methods in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thessaloniki","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cmcs2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.coalg.org\/cmcs18\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}