{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T11:20:33Z","timestamp":1778498433568,"version":"3.51.4"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030171261","type":"print"},{"value":"9783030171278","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,4,5]],"date-time":"2019-04-05T00:00:00Z","timestamp":1554422400000},"content-version":"vor","delay-in-days":94,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>In this paper, we give a new definition of partial Higher Dimension Automata using lax functors. This definition is simpler and more natural from a categorical point of view, but also matches more clearly the intuition that pHDA are Higher Dimensional Automata with some missing faces. We then focus on trees. Originally, for example in transition systems, trees are defined as those systems that have a unique path property. To understand what kind of unique property is needed in pHDA, we start by looking at trees as colimits of paths. This definition tells us that trees are exactly the pHDA with the unique path property modulo a notion of homotopy, and without any shortcuts. This property allows us to prove two interesting characterisations of trees: trees are exactly those pHDA that are an unfolding of another pHDA; and trees are exactly the cofibrant objects, much as in the language of Quillen\u2019s model structure. In particular, this last characterisation gives the premisses of a new understanding of concurrency theory using homotopy theory.<\/jats:p>","DOI":"10.1007\/978-3-030-17127-8_13","type":"book-chapter","created":{"date-parts":[[2019,4,5]],"date-time":"2019-04-05T11:11:46Z","timestamp":1554462706000},"page":"224-241","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Trees in Partial Higher Dimensional Automata"],"prefix":"10.1007","author":[{"given":"J\u00e9r\u00e9my","family":"Dubut","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,5]]},"reference":[{"key":"13_CR1","unstructured":"Bednarczyk, M.A.: Categories of asynchronous systems. Ph.D. thesis, University of Sussex (1987)"},{"key":"13_CR2","series-title":"Textbooks in Mathematics","doi-asserted-by":"publisher","DOI":"10.4171\/048","volume-title":"Algebraic Topology","author":"T tom Dieck","year":"2008","unstructured":"tom Dieck, T.: Algebraic Topology. Textbooks in Mathematics. European Mathematical Society, Z\u00fcrich (2008)"},{"key":"13_CR3","unstructured":"Dubut, J.: Directed homotopy and homology theories for geometric models of true concurrency. Ph.D. thesis, ENS Paris-Saclay (2017)"},{"key":"13_CR4","unstructured":"Dubut, J., Goubault, E., Goubault-Larrecq, J.: Bisimulations and unfolding in P-accessible categorical models. In: Proceedings of the 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), vol. 59, pp. 1\u201314. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2016)"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-540-31982-5_12","volume-title":"Foundations of Software Science and Computational Structures","author":"U Fahrenberg","year":"2005","unstructured":"Fahrenberg, U.: A category of higher-dimensional automata. In: Sassone, V. (ed.) FoSSaCS 2005. LNCS, vol. 3441, pp. 187\u2013201. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31982-5_12"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.entcs.2013.09.012","volume":"298","author":"U Fahrenberg","year":"2013","unstructured":"Fahrenberg, U., Legay, A.: History-preserving bisimilarity for higher-dimensional automata via open maps. Electron. Notes Theor. Comput. Sci. 298, 165\u2013178 (2013)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"13_CR7","unstructured":"Fahrenberg, U., Legay, A.: Partial higher-dimensional automata. In: CALCO 2015, pp. 101\u2013115 (2015)"},{"issue":"2","key":"13_CR8","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.aam.2005.02.003","volume":"35","author":"L Fajstrup","year":"2005","unstructured":"Fajstrup, L.: Dipaths and dihomotopies in a cubical complex. Adv. Appl. Math. 35(2), 188\u2013206 (2005)","journal-title":"Adv. Appl. Math."},{"key":"13_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-15398-8","volume-title":"Directed Algebraic Topology and Concurrency","author":"L Fajstrup","year":"2016","unstructured":"Fajstrup, L., Goubault, E., Haucourt, E., Mimram, S., Raussen, M.: Directed Algebraic Topology and Concurrency. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-15398-8"},{"key":"13_CR10","first-page":"295","volume":"25","author":"P Gaucher","year":"2011","unstructured":"Gaucher, P.: Towards a homotopy theory of higher dimensional transition systems. Theory Appl. Categ. 25, 295\u2013341 (2011)","journal-title":"Theory Appl. Categ."},{"key":"13_CR11","unstructured":"van Glabbeek, R.J.: Bisimulations for higher dimensional automata, June 1991. http:\/\/theory.stanford.edu\/~rvg\/hda"},{"issue":"2","key":"13_CR12","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.entcs.2004.11.026","volume":"128","author":"RJ van Glabbeek","year":"2005","unstructured":"van Glabbeek, R.J.: On the expresiveness of higher dimensional automata: (extended abstract). Electron. Notes Theor. Comput. Sci. 128(2), 5\u201334 (2005)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"13_CR13","unstructured":"Goubault, E.: G\u00e9om\u00e9trie du parall\u00e9lisme. Ph.D. thesis, Ecole Polytechnique (1995)"},{"key":"13_CR14","series-title":"New Mathematical Monographs","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511657474","volume-title":"Directed Algebraic Topology: Models of Non-Reversible Worlds","author":"M Grandis","year":"2009","unstructured":"Grandis, M.: Directed Algebraic Topology: Models of Non-Reversible Worlds. New Mathematical Monographs, vol. 13. Cambridge University Press, Cambridge (2009)"},{"key":"13_CR15","series-title":"Mathematical Surveys and Monographs","volume-title":"Model Categories and Their Localizations","author":"PS Hirschhorn","year":"2003","unstructured":"Hirschhorn, P.S.: Model Categories and Their Localizations. Mathematical Surveys and Monographs, vol. 99. American Mathematical Society, Providence (2003)"},{"key":"13_CR16","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"publisher","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":"2","key":"13_CR17","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1006\/inco.1996.0057","volume":"127","author":"A Joyal","year":"1996","unstructured":"Joyal, A., Nielsen, M., Winskel, G.: Bisimulation from open maps. Inf. Comput. 127(2), 164\u2013185 (1996)","journal-title":"Inf. Comput."},{"key":"13_CR18","series-title":"Chicago Lectures in Mathematics","volume-title":"A Concise Course in Algebraic Topology","author":"JP May","year":"1999","unstructured":"May, J.P.: A Concise Course in Algebraic Topology. Chicago Lectures in Mathematics. University of Chicago Press, Chicago (1999)"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communicating Systems","year":"1980","unstructured":"Milner, R. (ed.): A Calculus of Communicating Systems. LNCS, vol. 92. Springer, Heidelberg (1980). https:\/\/doi.org\/10.1007\/3-540-10235-3"},{"issue":"12","key":"13_CR20","first-page":"288","volume":"24","author":"S Niefield","year":"2010","unstructured":"Niefield, S.: Lax presheaves and exponentiability. Theory Appl. Categ. 24(12), 288\u2013301 (2010)","journal-title":"Theory Appl. Categ."},{"issue":"1","key":"13_CR21","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","volume":"13","author":"M Nielsen","year":"1981","unstructured":"Nielsen, M., Plotkin, G., Winskel, G.: Petri nets, event structures and domains, part I. Theor. Comput. Sci. 13(1), 85\u2013108 (1981)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/3-540-58043-3_25","volume-title":"A Decade of Concurrency Reflections and Perspectives","author":"M Nielsen","year":"1994","unstructured":"Nielsen, M., Sassone, V., Winskel, G.: Relationships between models of concurrency. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX 1993. LNCS, vol. 803, pp. 425\u2013476. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58043-3_25"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Pratt, V.: Modeling concurrency with geometry. In: Proceedings of the 18th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pp. 311\u2013322, January 1991","DOI":"10.1145\/99583.99625"},{"key":"13_CR24","series-title":"LNM","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0097438","volume-title":"Homotopical Algebra","author":"DG Quillen","year":"1967","unstructured":"Quillen, D.G.: Homotopical Algebra. LNM, vol. 43. Springer, Heidelberg (1967). https:\/\/doi.org\/10.1007\/BFb0097438"},{"issue":"5","key":"13_CR25","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1093\/comjnl\/28.5.449","volume":"28","author":"MW Shields","year":"1985","unstructured":"Shields, M.W.: Concurrent machines. Comput. J. 28(5), 449\u2013465 (1985)","journal-title":"Comput. J."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17127-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T18:09:05Z","timestamp":1757095745000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-17127-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030171261","9783030171278"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17127-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"5 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FoSSaCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Foundations of Software Science and Computation Structures","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fossacs2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.etaps.org\/2019\/fossacs","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}