{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:10:35Z","timestamp":1767337835467,"version":"3.40.3"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031107351"},{"type":"electronic","value":"9783031107368"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-10736-8_3","type":"book-chapter","created":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T17:09:53Z","timestamp":1658509793000},"page":"45-66","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Coalgebraic Semantics for\u00a0Nominal Automata"],"prefix":"10.1007","author":[{"given":"Florian","family":"Frank","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Milius","sequence":"additional","affiliation":[]},{"given":"Henning","family":"Urbat","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,23]]},"reference":[{"key":"3_CR1","unstructured":"Ad\u00e1mek, J., Milius, S., Moss, L.S.: Initial algebras without iteration. In: Gaducci, F., Silva, A. (eds.) 9th Conference on Algebra and Coalgebra in Computer Science (CALCO). LIPIcs, vol. 211, pp. 5:1\u20135:20. Schloss Dagstuhl (2021)"},{"key":"3_CR2","unstructured":"Applegate, H.: Acyclic models and resolvent functors. Ph.D. thesis, Columbia University (1965)"},{"key":"3_CR3","unstructured":"Bartels, F.: On generalized coinduction and probabilistic specification formats. Ph.D. thesis, Vrije Universiteit Amsterdam (2004)"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Boja\u0144czyk, M., Klin, B., Lasota, S.: Automata theory in nominal sets. Log. Methods Comput. Sci. 10(3), 1\u20138 (2014)","DOI":"10.2168\/LMCS-10(3:4)2014"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.tcs.2015.03.024","volume":"604","author":"F Bonchi","year":"2015","unstructured":"Bonchi, F., Milius, S., Silva, A., Zanasi, F.: Killing epsilons with a dagger: a coalgebraic study of systems with algebraic label structure. Theoret. Comput. Sci. 604, 102\u2013126 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Pous, D.: Checking NFA equivalence with bisimulations up to congruence. In: Giacobazzi, R., Cousot, R. (eds.) Proceedings of 40th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2013), pp. 457\u2013468. ACM (2013)","DOI":"10.1145\/2480359.2429124"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Bonsangue, M.M., Milius, S., Silva, A.: Sound and complete axiomatizations of coalgebraic language equivalence. ACM Trans. Comput. Logic 14(1), 7:1\u20137:52 (2013)","DOI":"10.1145\/2422085.2422092"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-662-45917-1_7","volume-title":"Trustworthy Global Computing","author":"V Ciancia","year":"2014","unstructured":"Ciancia, V., Sammartino, M.: A class of automata for the verification of infinite, resource-allocating behaviours. In: Maffei, M., Tuosto, E. (eds.) TGC 2014. LNCS, vol. 8902, pp. 97\u2013111. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45917-1_7"},{"key":"3_CR9","unstructured":"Dorsch, U., Milius, S., Schr\u00f6der, L.: Graded monads and graded logics for the linear time - branching time spectrum. In: Fokkink, W.J., van Glabbeek, R. (eds.) Proceedings of 30th International Conference on Concurrency Theory (CONCUR). LIPIcs, vol. 140, pp. 36:1\u201336:16. Schloss Dagstuhl (2019)"},{"key":"3_CR10","unstructured":"Fiore, M., Plotkin, G.D., Turi, D.: Abstract syntax and variable binding. In: Proceedings of Logic in Computer Science (LICS), pp. 193\u2013202. IEEE Computer Society (1999)"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Freyd, P.: Remarks on algebraically compact categories. In: Fourman, M.P., Johnstone, P.T., Pitts, A.M. (eds.) Applications of category theory in computer science: Proceedings of the London Mathematical Society Symposium, Durham 1991. London Mathematical Society Lecture Note Series, vol. 177, pp. 95\u2013106. Cambridge University Press (1992)","DOI":"10.1017\/CBO9780511525902.006"},{"issue":"2","key":"3_CR12","doi-asserted-by":"publisher","first-page":"161","DOI":"10.2178\/bsl\/1305810911","volume":"17","author":"MJ Gabbay","year":"2011","unstructured":"Gabbay, M.J.: Foundations of nominal techniques: logic and semantics of variables in abstract syntax. Bull. Symb. Log. 17(2), 161\u2013229 (2011)","journal-title":"Bull. Symb. Log."},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Gabbay, M.J., Pitts, A.M.: A new approach to abstract syntax involving binders. In: Logic in Computer Science, LICS 1999, pp. 214\u2013224. IEEE Computer Society (1999)","DOI":"10.1109\/LICS.1999.782617"},{"key":"3_CR14","unstructured":"van Glabbeek, R.: The linear time - branching time spectrum i; the semantics of concrete, sequential processes. In: Bergstra, J., Ponse, A., Smolka, S. (eds.) Handbook of Process Algebra, pp. 3\u201399. Elsevier (2001)"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Goncharov, S., Milius, S., Silva, A.: Towards a uniform theory of effectful state machines. ACM Trans. Comput. Log.21(3), 63 (2020). (article 23)","DOI":"10.1145\/3372880"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-642-36742-7_19","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R Grigore","year":"2013","unstructured":"Grigore, R., Distefano, D., Petersen, R.L., Tzevelekos, N.: Runtime verification based on register automata. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013. LNCS, vol. 7795, pp. 260\u2013276. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36742-7_19"},{"key":"3_CR17","unstructured":"Hasuo, I.: Tracing Anonymity with Coalgebras. Ph.D. thesis, Radboud University Nijmegen (2008)"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Hasuo, I., Jacobs, B., Sokolova, A.: Generic trace semantics via coinduction. Log. Methods Comput. Sci. 3(4:11), 1\u201336 (2007)","DOI":"10.2168\/LMCS-3(4:11)2007"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1006\/inco.1998.2725","volume":"145","author":"C Hermida","year":"1998","unstructured":"Hermida, C., Jacobs, B.: Structural induction and conduction in a fibrational setting. Inform. Comput. 145, 107\u2013152 (1998)","journal-title":"Inform. Comput."},{"key":"3_CR20","series-title":"Towards Mathematics of States and Observation","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316823187","volume-title":"Introduction to Coalgebra","author":"B Jacobs","year":"2016","unstructured":"Jacobs, B.: Introduction to Coalgebra. Towards Mathematics of States and Observation, Cambridge University Press, Cambridge (2016)"},{"key":"3_CR21","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1016\/j.jcss.2014.12.005","volume":"81","author":"B Jacobs","year":"2015","unstructured":"Jacobs, B., Silva, A., Sokolova, A.: Trace semantics via determinization. J. Comput. System Sci. 81, 859\u2013879 (2015)","journal-title":"J. Comput. System Sci."},{"key":"3_CR22","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1112\/blms\/7.3.294","volume":"7","author":"PT Johnstone","year":"1975","unstructured":"Johnstone, P.T.: Adjoint lifting theorems for categories of algebras. Bull. London Math. Soc. 7, 294\u2013297 (1975)","journal-title":"Bull. London Math. Soc."},{"key":"3_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0001-8708(81)90052-9","volume":"42","author":"A Joyal","year":"1981","unstructured":"Joyal, A.: Une th\u00e9orie combinatoire des s\u00e9ries formelles. Adv. Math. 42, 1\u201382 (1981)","journal-title":"Adv. Math."},{"key":"3_CR24","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/BFb0072514","volume":"1234","author":"A Joyal","year":"1986","unstructured":"Joyal, A.: Foncteurs analytiques et esp\u00e8ces de structures. Lect. Notes Math. 1234, 126\u2013159 (1986)","journal-title":"Lect. Notes Math."},{"issue":"2","key":"3_CR25","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0304-3975(94)90242-9","volume":"134","author":"M Kaminski","year":"1994","unstructured":"Kaminski, M., Francez, N.: Finite-memory automata. Theor. Comput. Sci. 134(2), 329\u2013363 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01220868","volume":"21","author":"A Kock","year":"1970","unstructured":"Kock, A.: Monads on symmetric monoidal closed categories. Arch. Math. (Basel) 21, 1\u201310 (1970)","journal-title":"Arch. Math. (Basel)"},{"key":"3_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-662-47666-6_23","volume-title":"Automata, Languages, and Programming","author":"D Kozen","year":"2015","unstructured":"Kozen, D., Mamouras, K., Petri\u015fan, D., Silva, A.: Nominal Kleene coalgebra. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 286\u2013298. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47666-6_23"},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"K\u00fcrtz, K., K\u00fcsters, R., Wilke, T.: Selecting theories and nonce generation for recursive protocols. In: Formal methods in security engineering, FMSE 2007, pp. 61\u201370. ACM (2007)","DOI":"10.1145\/1314436.1314445"},{"key":"3_CR29","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF01110627","volume":"103","author":"J Lambek","year":"1968","unstructured":"Lambek, J.: A fixpoint theorem for complete categories. Math. Z. 103, 151\u2013161 (1968)","journal-title":"Math. Z."},{"key":"3_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-642-03741-2_4","volume-title":"Algebra and Coalgebra in Computer Science","author":"S Milius","year":"2009","unstructured":"Milius, S., Palm, T., Schwencke, D.: Complete iterativity for algebras with effects. In: Kurz, A., Lenisa, M., Tarlecki, A. (eds.) CALCO 2009. LNCS, vol. 5728, pp. 34\u201348. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03741-2_4"},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"Milius, S., Pattinson, D., Wi\u00dfmann, T.: A new foundation for finitary corecursion and iterative algebras. Inform. and Comput. 271, 104456 (2020)","DOI":"10.1016\/j.ic.2019.104456"},{"issue":"1","key":"3_CR32","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","volume":"93","author":"E Moggi","year":"1991","unstructured":"Moggi, E.: Notions of computations and monads. Inform. Comput. 93(1), 55\u201392 (1991)","journal-title":"Inform. Comput."},{"key":"3_CR33","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":"3_CR34","doi-asserted-by":"crossref","unstructured":"Pitts, A.M.: Nominal Sets: Names and Symmetry in Computer Science. Cambridge University Press (2013)","DOI":"10.1017\/CBO9781139084673"},{"key":"3_CR35","unstructured":"Plotkin, G.D., Turi, D.: Towards a mathematical operational semantics. In: Proceedings of Logic in Computer Science (LICS) (1997)"},{"key":"3_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-642-35843-2_32","volume-title":"SOFSEM 2013: Theory and Practice of Computer Science","author":"J Rot","year":"2013","unstructured":"Rot, J., Bonsangue, M., Rutten, J.: Coalgebraic bisimulation-up-to. In: van Emde Boas, P., Groen, F.C.A., Italiano, G.F., Nawrocki, J., Sack, H. (eds.) SOFSEM 2013. LNCS, vol. 7741, pp. 369\u2013381. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-35843-2_32"},{"key":"3_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/BFb0055624","volume-title":"CONCUR 1998 Concurrency Theory","author":"JJMM Rutten","year":"1998","unstructured":"Rutten, J.J.M.M.: Automata and coinduction (an exercise in coalgebra). In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 194\u2013218. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055624"},{"issue":"1","key":"3_CR38","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J Rutten","year":"2000","unstructured":"Rutten, J.: Universal coalgebra: a theory of systems. Theoret. Comput. Sci. 249(1), 3\u201380 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-662-54458-7_8","volume-title":"Foundations of Software Science and Computation Structures","author":"L Schr\u00f6der","year":"2017","unstructured":"Schr\u00f6der, L., Kozen, D., Milius, S., Wi\u00dfmann, T.: Nominal automata with name binding. In: Esparza, J., Murawski, A.S. (eds.) FoSSaCS 2017. LNCS, vol. 10203, pp. 124\u2013142. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54458-7_8"},{"key":"3_CR40","doi-asserted-by":"crossref","unstructured":"Silva, A., Bonchi, F., Bonsangue, M.M., Rutten, J.J.M.M.: Generalizing determinization from automata to coalgebras. Log. Methods Comput. Sci. 9(1:9), 1\u201322 (2013)","DOI":"10.2168\/LMCS-9(1:9)2013"},{"key":"3_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-642-40206-7_20","volume-title":"Algebra and Coalgebra in Computer Science","author":"A Silva","year":"2013","unstructured":"Silva, A., Westerbaan, B.: A coalgebraic view of $$\\epsilon $$-transitions. In: Heckel, R., Milius, S. (eds.) CALCO 2013. LNCS, vol. 8089, pp. 267\u2013281. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40206-7_20"},{"issue":"4","key":"3_CR42","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1137\/0211062","volume":"11","author":"MB Smyth","year":"1982","unstructured":"Smyth, M.B., Plotkin, G.D.: The category-theoretic solution of recursive domain equations. SIAM J. Comput. 11(4), 761\u2013783 (1982)","journal-title":"SIAM J. Comput."},{"key":"3_CR43","doi-asserted-by":"crossref","unstructured":"Winter, J., Bonsangue, M., Rutten, J.: Coalgebraic characterizations of context-free languages. Log. Methods Comput. Sci. 9(3:14), 39 (2013)","DOI":"10.2168\/LMCS-9(3:14)2013"},{"key":"3_CR44","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1016\/j.jcss.2014.12.004","volume":"81","author":"J Winter","year":"2015","unstructured":"Winter, J., Bonsangue, M., Rutten, J.: Context-free coalgebras. J. Comput. System Sci. 81, 911\u2013939 (2015)","journal-title":"J. Comput. System Sci."},{"key":"3_CR45","unstructured":"Wi\u00dfmann, T.: Coalgebraic Semantics and Minimization in Sets and Beyond. Ph.D. thesis, Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg (FAU) (2020). https:\/\/opus4.kobv.de\/opus4-fau\/frontdoor\/index\/index\/docId\/14222"}],"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-031-10736-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,29]],"date-time":"2024-09-29T18:23:11Z","timestamp":1727634191000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-10736-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031107351","9783031107368"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-10736-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"23 July 2022","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":"Munich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 April 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 April 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cmcs2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.coalg.org\/cmcs22\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}