{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T11:21:17Z","timestamp":1778498477128,"version":"3.51.4"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031682780","type":"print"},{"value":"9783031682797","type":"electronic"}],"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_3","type":"book-chapter","created":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T23:03:07Z","timestamp":1723417387000},"page":"28-45","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Presenting Interval Pomsets with\u00a0Interfaces"],"prefix":"10.1007","author":[{"given":"Amazigh","family":"Amrane","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hugo","family":"Bazille","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emily","family":"Clement","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uli","family":"Fahrenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krzysztof","family":"Ziemia\u0144ski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,12]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Amrane, A., Bazille, H., Clement, E., Fahrenberg, U.: Languages of higher-dimensional timed automata. In: PETRI NETS (2024). Accepted","DOI":"10.1007\/978-3-031-61433-0_10"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Amrane, A., Bazille, H., Fahrenberg, U., Fortin, M.: Logic and languages of higher-dimensional automata. In: DLT (2024). Accepted","DOI":"10.1007\/978-3-031-66159-4_5"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Amrane, H., Bazille, A., Fahrenberg, U., Ziemia\u0144ski, K.: Closure and decision properties for higher-dimensional automata. In: \u00c1brah\u00e1m, E., Dubslaff, C., Lizeth\u00a0Tapia Tarifa, S., (eds.) ICTAC, vol. 14446, pp. 295\u2013312. Springer (2023)","DOI":"10.1007\/978-3-031-47963-2_18"},{"issue":"1 &2","key":"3_CR4","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0304-3975(95)00230-8","volume":"163","author":"SL Bloom","year":"1996","unstructured":"Bloom, S.L., \u00c9sik, Z.: Free shuffle algebras in language varieties. Theoret. Comput. Sci. 163(1 &2), 55\u201398 (1996)","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"3_CR5","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1017\/S0960129597002442","volume":"7","author":"SL Bloom","year":"1997","unstructured":"Bloom, S.L., \u00c9sik, Z.: Varieties generated by languages with poset operations. Math. Struct. Comput. Sci. 7(6), 701\u2013713 (1997)","journal-title":"Math. Struct. Comput. Sci."},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Casta\u00f1eda, A., Rajsbaum, S., Raynal, M.: Unifying concurrent objects and distributed tasks: Interval-linearizability. J. ACM 65(6), 45:1\u201345:42 (2018)","DOI":"10.1145\/3266457"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Fahrenberg, U.: Higher-dimensional timed automata. In: Abate, A., Girard, A., Heemels, M. (eds.) ADHS, vol. 51. IFAC-PapersOnLine, pp. 109\u2013114. Elsevier (2018)","DOI":"10.1016\/j.ifacol.2018.08.019"},{"key":"3_CR8","unstructured":"Fahrenberg, U.: Higher-dimensional timed and hybrid automata. Leibniz Trans. Embedded Syst. 8(2), 03:1\u201303:16 (2022)"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-030-43520-2_6","volume-title":"Relational and Algebraic Methods in Computer Science","author":"U Fahrenberg","year":"2020","unstructured":"Fahrenberg, U., Johansen, C., Struth, G., Bahadur\u00a0Thapa, R.: Generating posets beyond N. In: Fahrenberg, U., Jipsen, P., Winter, M. (eds.) RAMiCS 2020. LNCS, vol. 12062, pp. 82\u201399. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-43520-2_6"},{"issue":"5","key":"3_CR10","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., Ziemia\u0144ski, K.: Languages of higher-dimensional automata. Math. Struct. Comput. Sci. 31(5), 575\u2013613 (2021)","journal-title":"Math. Struct. Comput. Sci."},{"key":"3_CR11","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, vol. 243. LIPIcs, pp. 29:1\u201329:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"issue":"2","key":"3_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2022.104914","volume":"285","author":"U Fahrenberg","year":"2022","unstructured":"Fahrenberg, U., Johansen, C., Struth, G., Ziemia\u0144ski, K.: Posets with interfaces as a model for concurrency. Inf. Comput. 285(2), 104914 (2022)","journal-title":"Inf. Comput."},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Fahrenberg, U., Ziemia\u0144ski, K.: A Myhill-Nerode theorem for higher-dimensional automata. In: Gomes, L., Lorenz, R. (ed.) PETRI NETS. LNCS, vol. 13929, pp. 167\u2013188. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-33620-1_9"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/3-540-45694-5_27","volume-title":"CONCUR 2002 \u2014 Concurrency Theory","author":"J Fanchon","year":"2002","unstructured":"Fanchon, J., Morin, R.: Regular sets of pomsets with autoconcurrency. In: Brim, L., K\u0159et\u00ednsk\u00fd, M., Ku\u010dera, A., Jan\u010dar, P. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 402\u2013417. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45694-5_27"},{"issue":"1","key":"3_CR15","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/0022-2496(70)90062-3","volume":"7","author":"PC Fishburn","year":"1970","unstructured":"Fishburn, P.C.: Intransitive indifference with unequal indifference intervals. J. Math. Psychol. 7(1), 144\u2013149 (1970)","journal-title":"J. Math. Psychol."},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Fishburn, P.C.: Interval Orders and Interval Graphs: A Study of Partially Ordered Sets. Wiley (1985)","DOI":"10.1016\/0012-365X(85)90042-1"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0304-3975(88)90124-7","volume":"61","author":"JL Gischer","year":"1988","unstructured":"Gischer, J.L.: The equational theory of pomsets. Theoret. Comput. Sci. 61, 199\u2013224 (1988)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"3_CR18","first-page":"427","volume":"4","author":"J Grabowski","year":"1981","unstructured":"Grabowski, J.: On partial languages. Fund. Inform. 4(2), 427 (1981)","journal-title":"Fund. Inform."},{"issue":"6","key":"3_CR19","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 Methods Programm. 80(6), 266\u2013296 (2011)","journal-title":"J. Logic Algebraic Methods Programm."},{"issue":"4","key":"3_CR20","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1016\/j.jlamp.2015.09.012","volume":"85","author":"T Hoare","year":"2016","unstructured":"Hoare, T., van Staden, S., M\u00f6ller, B., Struth, G., Zhu, H.: Developments in concurrent Kleene algebra. J. Logic Algebraic Methods Programm. 85(4), 617\u2013636 (2016)","journal-title":"J. Logic Algebraic Methods Programm."},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Janicki, R., Kleijn, J., Koutny, M., Mikulski, L.: Paradigms of Concurrency - Observations, Behaviours, and Systems - a Petri Net View, vol. 1020. Studies in Computational Intelligence. Springer (2022)","DOI":"10.1007\/978-3-662-64821-6"},{"issue":"1\u20132","key":"3_CR22","first-page":"31","volume":"169","author":"R Janicki","year":"2019","unstructured":"Janicki, R., Koutny, M.: Operational semantics, interval orders and sequences of antichains. Fund. Inform. 169(1\u20132), 31\u201355 (2019)","journal-title":"Fund. Inform."},{"key":"3_CR23","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.ic.2016.12.009","volume":"253","author":"R Janicki","year":"2017","unstructured":"Janicki, R., Yin, X.: Modeling concurrency with interval traces. Inf. Comput. 253, 78\u2013108 (2017)","journal-title":"Inf. Comput."},{"key":"3_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1007\/978-3-319-89884-1_30","volume-title":"Programming Languages and Systems","author":"T Kapp\u00e9","year":"2018","unstructured":"Kapp\u00e9, T., Brunet, P., Silva, A., Zanasi, F.: Concurrent kleene algebra: free model and completeness. In: Ahmed, A. (ed.) ESOP 2018. LNCS, vol. 10801, pp. 856\u2013882. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89884-1_30"},{"issue":"7","key":"3_CR25","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L Lamport","year":"1978","unstructured":"Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558\u2013565 (1978)","journal-title":"Commun. ACM"},{"issue":"2","key":"3_CR26","first-page":"77","volume":"1","author":"L Lamport","year":"1986","unstructured":"Lamport, L.: On interprocess communication. Part I: basic formalism. Distributed Computing 1(2), 77\u201385 (1986)","journal-title":"Part I: basic formalism. Distributed Computing"},{"issue":"3","key":"3_CR27","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1023\/A:1006477416166","volume":"16","author":"A Myers","year":"1999","unstructured":"Myers, A.: Basic interval orders. Order 16(3), 261\u2013275 (1999)","journal-title":"Order"},{"issue":"1","key":"3_CR28","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01379149","volume":"15","author":"VR Pratt","year":"1986","unstructured":"Pratt, V.R.: Modeling concurrency with partial orders. J. Parallel Programm. 15(1), 33\u201371 (1986)","journal-title":"J. Parallel Programm."},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"van Glabbeek, R.J.: On the expressiveness of higher dimensional automata. Theoretical Comput. Sci. 356(3), 265\u2013290 (2006). See also\u00a0[30]","DOI":"10.1016\/j.tcs.2006.02.012"},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"van Glabbeek, R.J.: Erratum to \u201cOn the expressiveness of higher dimensional automata\u201d. Theoretical Comput. Sci. 368(1-2), 168\u2013194 (2006)","DOI":"10.1016\/j.tcs.2006.06.024"},{"key":"3_CR31","first-page":"441","volume":"17","author":"N Wiener","year":"1914","unstructured":"Wiener, N.: A contribution to the theory of relative position. Proc. Camb. Philos. Soc. 17, 441\u2013449 (1914)","journal-title":"Proc. Camb. Philos. Soc."}],"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_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T23:07:17Z","timestamp":1723417637000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68279-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031682780","9783031682797"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68279-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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"}}]}}