{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T11:20:48Z","timestamp":1778498448478,"version":"3.51.4"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031770180","type":"print"},{"value":"9783031770197","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T00:00:00Z","timestamp":1732233600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T00:00:00Z","timestamp":1732233600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-77019-7_8","type":"book-chapter","created":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T20:48:10Z","timestamp":1732222090000},"page":"132-150","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Bisimulations and\u00a0Logics for\u00a0Higher-Dimensional Automata"],"prefix":"10.1007","author":[{"given":"Safa","family":"Zouari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krzysztof","family":"Ziemia\u0144ski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uli","family":"Fahrenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,22]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814105","volume-title":"Reactive Systems: Modelling, Specification and Verification","author":"L Aceto","year":"2007","unstructured":"Aceto, L., Ingolfsdottir, A., Larsen, K., Srba, J.: Reactive Systems: Modelling, Specification and Verification. Cambridge University Press, Cambridge (2007)"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-031-47963-2_18","volume-title":"Theoretical Aspects of Computing - ICTAC 2023","author":"A Amrane","year":"2023","unstructured":"Amrane, A., Bazille, H., Fahrenberg, U., Ziemia\u0144ski, K.: Closure and decision properties for higher-dimensional automata. In: \u00c1brah\u00e1m, E., Dubslaff, C., Tarifa, S.L.T. (eds.) ICTAC 2023. LNCS, vol. 14446, pp. 295\u2013312. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-47963-2_18"},{"key":"8_CR3","volume-title":"Principles of Model Checking","author":"C Baier","year":"2008","unstructured":"Baier, C., Katoen, J.P.: Principles of Model Checking. MIT Press, Cambridge (2008)"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-642-15375-4_11","volume-title":"CONCUR 2010 - Concurrency Theory","author":"P Baldan","year":"2010","unstructured":"Baldan, P., Crafa, S.: A logic for true concurrency. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 147\u2013161. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15375-4_11"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/978-3-319-12736-1_25","volume-title":"Programming Languages and Systems","author":"P Baldan","year":"2014","unstructured":"Baldan, P., Crafa, S.: Hereditary history-preserving bisimilarity: logics and automata. In: Garrigue, J. (ed.) APLAS 2014. LNCS, vol. 8858, pp. 469\u2013488. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-12736-1_25"},{"issue":"4","key":"8_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3412853","volume":"21","author":"P Baldan","year":"2020","unstructured":"Baldan, P., Padoan, T.: Model checking a logic for true concurrency. ACM Trans. Comput. Log. (TOCL) 21(4), 1\u201349 (2020)","journal-title":"ACM Trans. Comput. Log. (TOCL)"},{"key":"8_CR7","unstructured":"Bednarczyk, M.A.: Categories of asynchronous systems. Ph.D. thesis, University of Sussex (1987)"},{"issue":"2","key":"8_CR8","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1145\/201019.201032","volume":"42","author":"R De Nicola","year":"1995","unstructured":"De Nicola, R., Vaandrager, F.: Three logics for branching bisimulation. J. ACM (JACM) 42(2), 458\u2013487 (1995)","journal-title":"J. ACM (JACM)"},{"issue":"5","key":"8_CR9","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). https:\/\/doi.org\/10.1017\/S0960129521000293","journal-title":"Math. Struct. Comput. Sci."},{"key":"8_CR10","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.) 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0243, pp. 29:1\u201329:18. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl (2022). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2022.29","DOI":"10.4230\/LIPIcs.CONCUR.2022.29"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-031-33620-1_9","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"U Fahrenberg","year":"2023","unstructured":"Fahrenberg, U., Ziemia\u0144ski, K.: A Myhill-Nerode theorem for higher-dimensional automata. In: Gomes, L., Lorenz, R. (eds.) PETRI NETS 2023. LNCS, vol. 13929, pp. 167\u2013188. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-33620-1_9"},{"issue":"1","key":"8_CR12","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":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/BFb0039066","volume-title":"CONCUR \u201990 Theories of Concurrency: Unification and Extension","author":"RJ Glabbeek","year":"1990","unstructured":"Glabbeek, R.J.: The linear time - branching time spectrum. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 278\u2013297. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/BFb0039066"},{"issue":"3","key":"8_CR14","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. Theoret. Comput. Sci. 356(3), 265\u2013290 (2006)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"8_CR15","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s002360000041","volume":"37","author":"RJ van Glabbeek","year":"2001","unstructured":"van Glabbeek, R.J., Goltz, U.: Refinement of actions and equivalence notions for concurrent systems. Acta Inform. 37(4), 229\u2013327 (2001)","journal-title":"Acta Inform."},{"issue":"2","key":"8_CR16","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/inco.1997.2634","volume":"136","author":"RJ van Glabbeek","year":"1997","unstructured":"van Glabbeek, R.J., Vaandrager, F.: The difference between splitting in n and n+1. Inf. Comput. 136(2), 109\u2013142 (1997)","journal-title":"Inf. Comput."},{"issue":"1","key":"8_CR17","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M Hennessy","year":"1985","unstructured":"Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. J. ACM (JACM) 32(1), 137\u2013161 (1985)","journal-title":"J. ACM (JACM)"},{"issue":"1","key":"8_CR18","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0304-3975(93)90238-O","volume":"112","author":"R Janicki","year":"1993","unstructured":"Janicki, R., Koutny, M.: Structure of concurrency. Theoret. Comput. Sci. 112(1), 5\u201352 (1993)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"8_CR19","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). https:\/\/doi.org\/10.1006\/inco.1996.0057","journal-title":"Inf. Comput."},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-44618-4_19","volume-title":"CONCUR 2000 \u2014 Concurrency Theory","author":"JJ Leifer","year":"2000","unstructured":"Leifer, J.J., Milner, R.: Deriving bisimulation congruences for reactive systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 243\u2013258. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44618-4_19"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-540-48654-1_29","volume-title":"CONCUR \u201994: Concurrency Theory","author":"M Nielsen","year":"1994","unstructured":"Nielsen, M., Clausen, C.: Bisimulation for models in concurrency. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol. 836, pp. 385\u2013400. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/978-3-540-48654-1_29"},{"issue":"1","key":"8_CR22","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. Theoret. Comput. Sci. 13(1), 85\u2013108 (1981)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Phillips, I., Ulidowski, I.: Event identifier logic. Math. Struct. Comput. Sci. 24(2) (2014)","DOI":"10.1017\/S0960129513000510"},{"key":"8_CR24","unstructured":"Pnueli, A., Manna, Z.: The temporal logic of reactive and concurrent systems. Springer 16, 12 (1992)"},{"key":"8_CR25","doi-asserted-by":"publisher","unstructured":"Pratt, V.: Modeling concurrency with geometry. In: Proceedings of the 18th Symposium on Principles of Programming Languages, POPL 1991, pp. 311-322. Association for Computing Machinery (1991). https:\/\/doi.org\/10.1145\/99583.99625","DOI":"10.1145\/99583.99625"},{"issue":"5","key":"8_CR26","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1017\/S0960129598002527","volume":"8","author":"D Sangiorgi","year":"1998","unstructured":"Sangiorgi, D.: On the bisimulation proof method. Math. Struct. Comput. Sci. 8(5), 447\u2013479 (1998)","journal-title":"Math. Struct. Comput. Sci."},{"issue":"5","key":"8_CR27","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1070\/RM9731","volume":"71","author":"VB Shehtman","year":"2016","unstructured":"Shehtman, V.B.: Bisimulation games and locally tabular logics. Russ. Math. Surv. 71(5), 979 (2016). https:\/\/doi.org\/10.1070\/RM9731","journal-title":"Russ. Math. Surv."},{"issue":"5","key":"8_CR28","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."},{"key":"8_CR29","doi-asserted-by":"publisher","unstructured":"Van\u00a0Glabbeek, R., Plotkin, G.: Configuration structures. In: 10th Annual IEEE Symposium on Logic in Computer Science, LICS 1995, pp. 199\u2013209. IEEE (1995). https:\/\/doi.org\/10.1109\/LICS.1995.523257","DOI":"10.1109\/LICS.1995.523257"},{"issue":"4","key":"8_CR30","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0020-0190(77)90021-7","volume":"6","author":"J Winkowski","year":"1977","unstructured":"Winkowski, J.: An algebraic characterization of the behaviour of non-sequential systems. Inf. Process. Lett. 6(4), 105\u2013109 (1977)","journal-title":"Inf. Process. Lett."},{"key":"8_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/3-540-17906-2_31","volume-title":"Petri Nets: Applications and Relationships to Other Models of Concurrency","author":"G Winskel","year":"1987","unstructured":"Winskel, G.: Event structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) ACPN 1986. LNCS, vol. 255, pp. 325\u2013392. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-17906-2_31"},{"key":"8_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/BFb0013026","volume-title":"Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency","author":"G Winskel","year":"1989","unstructured":"Winskel, G.: An introduction to event structures. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX 1988. LNCS, vol. 354, pp. 364\u2013397. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/BFb0013026"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-77019-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T21:29:50Z","timestamp":1732224590000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-77019-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,22]]},"ISBN":["9783031770180","9783031770197"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-77019-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,22]]},"assertion":[{"value":"22 November 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICTAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Theoretical Aspects of Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bangkok","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thailand","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":"25 November 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 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":"ictac2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ictac2024.cs.ait.ac.th\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}