{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:35:56Z","timestamp":1742967356607,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031682780"},{"type":"electronic","value":"9783031682797"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-68279-7_4","type":"book-chapter","created":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T23:03:07Z","timestamp":1723417387000},"page":"46-64","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Irrationality of\u00a0Process Replication for\u00a0Higher-Dimensional Automata"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-7710-3085","authenticated-orcid":false,"given":"Thomas","family":"Baronner","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7610-8331","authenticated-orcid":false,"given":"Henning","family":"Basold","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7549-9713","authenticated-orcid":false,"given":"M\u00e1rton","family":"Hablicsek","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,12]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","unstructured":"Ad\u00e1mek, J., Rosick\u00fd, J.: Locally Presentable and Accessible Categories. London Mathematical Society Lecture Note Series. Cambridge University Press, Cambridge (1994). https:\/\/doi.org\/10.1017\/CBO9780511600579","DOI":"10.1017\/CBO9780511600579"},{"key":"4_CR2","unstructured":"Baronner, T.: Finite Accessibility of Higher-Dimensional Automata and Unbounded Parallelism of Their Languages. Bachelor\u2019s Thesis, Leiden University, December 2022. https:\/\/theses.liacs.nl\/2532"},{"key":"4_CR3","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1145\/2422085.2422092","DOI":"10.1145\/2422085.2422092"},{"issue":"1","key":"4_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0022-4049(87)90099-5","volume":"47","author":"R Brown","year":"1987","unstructured":"Brown, R., Higgins, P.J.: Tensor products and homotopies for $$\\omega $$-groupoids and crossed complexes. J. Pure Appl. Algebra 47(1), 1\u201333 (1987). https:\/\/doi.org\/10.1016\/0022-4049(87)90099-5","journal-title":"J. Pure Appl. Algebra"},{"key":"4_CR5","unstructured":"Day, B.J.: Construction of Biclosed Categories. Ph.D. thesis, University of New South Wales, September 1970. http:\/\/web.science.mq.edu.au\/~street\/DayPhD.pdf"},{"key":"4_CR6","doi-asserted-by":"publisher","unstructured":"\u00c9sik, Z., N\u00e9meth, Z.L.: Higher dimensional automata. J. Automata 9(1), 329 (2004). https:\/\/doi.org\/10.25596\/JALC-2004-003","DOI":"10.25596\/JALC-2004-003"},{"issue":"5","key":"4_CR7","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1017\/S0960129521000293","volume":"31","author":"U Fahrenberg","year":"2021","unstructured":"Fahrenberg, U., Johansen, C., Struth, G., Ziemianski, K.: Languages of higher-dimensional automata. Math. Struct. Comput. Sci. 31(5), 575\u2013613 (2021). https:\/\/doi.org\/10.1017\/S0960129521000293","journal-title":"Math. Struct. Comput. Sci."},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Fahrenberg, U., Johansen, C., Struth, G., Ziemia\u0144ski, K.: A kleene theorem for higher-dimensional automata. In: Klin, B., Lasota, S., Muscholl, A. (eds.) CONCUR 2022. Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0243, pp. 29:1\u201329:18. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2022). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2022.29","DOI":"10.4230\/LIPIcs.CONCUR.2022.29"},{"key":"4_CR9","doi-asserted-by":"publisher","unstructured":"Fahrenberg, U., Legay, A.: History-preserving bisimilarity for higher-dimensional automata via open maps. In: Proceedings of MFPS 29, pp. 165\u2013178 (2013). https:\/\/doi.org\/10.1016\/j.entcs.2013.09.012","DOI":"10.1016\/j.entcs.2013.09.012"},{"key":"4_CR10","doi-asserted-by":"publisher","unstructured":"Fajstrup, L., Goubault, E., Rau\u00dfen, M.: Detecting Deadlocks in Concurrent Systems. In: CONCUR \u201998: Concurrency Theory, 9th International Conference, Nice, France, 8\u201311 September, 1998, Proceedings, pp. 332\u2013347 (1998). https:\/\/doi.org\/10.1007\/BFb0055632","DOI":"10.1007\/BFb0055632"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Goubault, E.: Geometry and concurrency: a user\u2019s guide. Math. Struct. Comput. Sci. 10(4), 411\u2013425 (2000). http:\/\/journals.cambridge.org\/action\/displayAbstract?aid=54593","DOI":"10.1017\/S0960129500003133"},{"issue":"2","key":"4_CR12","doi-asserted-by":"publisher","first-page":"427","DOI":"10.3233\/FI-1981-4210","volume":"4","author":"J Grabowski","year":"1981","unstructured":"Grabowski, J.: On partial languages. Fundam. Informaticae 4(2), 427 (1981)","journal-title":"On partial languages. Fundam. Informaticae"},{"key":"4_CR13","doi-asserted-by":"publisher","unstructured":"Grandis, M.: Directed Algebraic Topology: Models of Non-Reversible Worlds. New Mathematical Monographs, Cambridge University Press, Cambridge (2009). https:\/\/doi.org\/10.1017\/CBO9780511657474","DOI":"10.1017\/CBO9780511657474"},{"key":"4_CR14","doi-asserted-by":"publisher","unstructured":"Hoare, C.A.R.T., M\u00f6ller, B., Struth, G., Wehrman, I.: Concurrent kleene algebra. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009 - Concurrency Theory, pp. 399\u2013414. LNCS. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04081-8_27","DOI":"10.1007\/978-3-642-04081-8_27"},{"issue":"6","key":"4_CR15","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/j.jlap.2011.04.005","volume":"80","author":"T Hoare","year":"2011","unstructured":"Hoare, T., M\u00f6ller, B., Struth, G., Wehrman, I.: Concurrent kleene algebra and its foundations. J. Logic Algebraic Program. 80(6), 266\u2013296 (2011). https:\/\/doi.org\/10.1016\/j.jlap.2011.04.005","journal-title":"J. Logic Algebraic Program."},{"issue":"1","key":"4_CR16","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0022-4049(86)90005-8","volume":"43","author":"GB Im","year":"1986","unstructured":"Im, G.B., Kelly, G.M.: A universal property of the convolution monoidal structure. J. Pure Appl. Algebra 43(1), 75\u201388 (1986). https:\/\/doi.org\/10.1016\/0022-4049(86)90005-8","journal-title":"J. Pure Appl. Algebra"},{"issue":"4","key":"4_CR17","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1016\/j.jlamp.2015.12.005","volume":"85","author":"P Jipsen","year":"2016","unstructured":"Jipsen, P., Moshier, M.A.: Concurrent Kleene algebra with tests and branching automata. J. Logical Algebraic Methods Programm. 85(4), 637\u2013652 (2016). https:\/\/doi.org\/10.1016\/j.jlamp.2015.12.005","journal-title":"J. Logical Algebraic Methods Programm."},{"issue":"3\u20134","key":"4_CR18","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s41468-019-00023-0","volume":"2","author":"T Kahl","year":"2018","unstructured":"Kahl, T.: Labeled homology of higher-dimensional automata. J. Appl. Comput. Topol. 2(3\u20134), 271\u2013300 (2018). https:\/\/doi.org\/10.1007\/s41468-019-00023-0","journal-title":"J. Appl. Comput. Topol."},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Kan, D.M.: Abstract Homotopy. I. Proceedings of the National Academy of Sciences of the United States of America 41(12), 1092\u20131096 (1955). http:\/\/www.jstor.org\/stable\/89108","DOI":"10.1073\/pnas.41.12.1092"},{"key":"4_CR20","unstructured":"Kapp\u00e9, T.: Concurrent Kleene Algebra: Completeness and Decidability. Doctoral, UCL (University College London), September 2020. https:\/\/discovery.ucl.ac.uk\/id\/eprint\/10109361\/"},{"key":"4_CR21","doi-asserted-by":"publisher","unstructured":"Kapp\u00e9, T., Brunet, P., Luttik, B., Silva, A., Zanasi, F.: Brzozowski goes concurrent - a kleene theorem for pomset languages. In: Meyer, R., Nestmann, U. (eds.) 28th International Conference on Concurrency Theory (CONCUR 2017). LIPIcs, vol.\u00a085, pp. 25:1\u201325:16. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2017). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2017.25","DOI":"10.4230\/LIPIcs.CONCUR.2017.25"},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.jlamp.2018.12.001","volume":"103","author":"T Kapp\u00e9","year":"2019","unstructured":"Kapp\u00e9, T., Brunet, P., Luttik, B., Silva, A., Zanasi, F.: On series-parallel pomset languages: rationality, context-freeness and automata. JLAMP 103, 130\u2013153 (2019). https:\/\/doi.org\/10.1016\/j.jlamp.2018.12.001","journal-title":"JLAMP"},{"issue":"1","key":"4_CR23","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/S0304-3975(00)00031-1","volume":"237","author":"K Lodaya","year":"2000","unstructured":"Lodaya, K., Weil, P.: Series-parallel languages and the bounded-width property. Theoret. Comput. Sci. 237(1), 347\u2013380 (2000). https:\/\/doi.org\/10.1016\/S0304-3975(00)00031-1","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR24","doi-asserted-by":"publisher","unstructured":"Loregian, F.: Coend calculus, December 2020. https:\/\/doi.org\/10.48550\/arXiv.1501.02503","DOI":"10.48550\/arXiv.1501.02503"},{"key":"4_CR25","doi-asserted-by":"publisher","unstructured":"Milius, S.: A sound and complete calculus for finite stream circuits. In: Proceedings of LICS 2010, pp. 421\u2013430 (2010). https:\/\/doi.org\/10.1109\/LICS.2010.11","DOI":"10.1109\/LICS.2010.11"},{"key":"4_CR26","doi-asserted-by":"publisher","unstructured":"Milius, S., Bonsangue, M.M., Myers, R.S.R., Rot, J.: Rational operational models. In: Proceedings of MFPS 29, pp. 257\u2013282 (2013). https:\/\/doi.org\/10.1016\/j.entcs.2013.09.017","DOI":"10.1016\/j.entcs.2013.09.017"},{"key":"4_CR27","doi-asserted-by":"publisher","unstructured":"Pratt, V.R.: Modeling concurrency with geometry. In: Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages (POPL), pp. 311\u2013322 (1991). https:\/\/doi.org\/10.1145\/99583.99625","DOI":"10.1145\/99583.99625"},{"key":"4_CR28","unstructured":"Raussen, M.: Connectivity of spaces of directed paths in geometric models for concurrent computation. CoRR abs\/2106.11703 (2021). https:\/\/arxiv.org\/abs\/2106.11703"},{"key":"4_CR29","unstructured":"Riehl, E.: Category Theory in Context. Aurora: Dover Modern Math Originals, Dover Publications (2016). http:\/\/www.math.jhu.edu\/~eriehl\/context\/"},{"issue":"3","key":"4_CR30","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.tcs.2006.02.012","volume":"356","author":"RJ van Glabbeek","year":"2006","unstructured":"van Glabbeek, R.J.: On the expressiveness of higher dimensional automata. Theor. Comput. Sci. 356(3), 265\u2013290 (2006). https:\/\/doi.org\/10.1016\/j.tcs.2006.02.012","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Relational and Algebraic Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-68279-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T23:07:22Z","timestamp":1723417642000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68279-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031682780","9783031682797"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68279-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"12 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RAMiCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Relational and Algebraic Methods in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ramics2023a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ramics-conf.github.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}