{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T23:49:55Z","timestamp":1777765795024,"version":"3.51.4"},"publisher-location":"Cham","reference-count":50,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031974380","type":"print"},{"value":"9783031974397","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T00:00:00Z","timestamp":1756512000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T00:00:00Z","timestamp":1756512000000},"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":[[2026]]},"DOI":"10.1007\/978-3-031-97439-7_11","type":"book-chapter","created":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T11:03:55Z","timestamp":1756551835000},"page":"234-252","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Featured Message Sequence Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5718-8276","authenticated-orcid":false,"given":"Clemens","family":"Dubslaff","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,30]]},"reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/3-540-48320-9_10","volume-title":"CONCUR\u201999 Concurrency Theory","author":"R Alur","year":"1999","unstructured":"Alur, R., Yannakakis, M.: Model checking of message sequence charts. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol. 1664, pp. 114\u2013129. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48320-9_10"},{"key":"11_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37521-7","volume-title":"Feature-Oriented Software Product Lines - Concepts and Implementation","author":"S Apel","year":"2013","unstructured":"Apel, S., Batory, D.S., K\u00e4stner, C., Saake, G.: Feature-Oriented Software Product Lines - Concepts and Implementation. Springer, Cham (2013)"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"49","DOI":"10.5381\/jot.2009.8.5.c5","volume":"8","author":"S Apel","year":"2009","unstructured":"Apel, S., K\u00e4stner, C.: An overview of feature-oriented software development. J. Object Technol. 8, 49\u201384 (2009)","journal-title":"J. Object Technol."},{"key":"11_CR4","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-0-387-34878-0_27","volume-title":"Formal Description Techniques VII","author":"JCM Baeten","year":"1995","unstructured":"Baeten, J.C.M., Mauw, S.: Delayed choice: an operator for joining message sequence charts. In: Formal Description Techniques VII. IAICT, pp. 340\u2013354. Springer, Boston, MA (1995). https:\/\/doi.org\/10.1007\/978-0-387-34878-0_27"},{"issue":"6","key":"11_CR5","first-page":"524","volume":"29","author":"C Baier","year":"2003","unstructured":"Baier, C., Haverkort, B., Hermanns, H., Katoen, J.-P.: Model-checking algorithms for continuous-time Markov chains. IEEE TSE 29(6), 524\u2013541 (2003)","journal-title":"IEEE TSE"},{"issue":"4","key":"11_CR6","first-page":"209","volume":"33","author":"C Baier","year":"2007","unstructured":"Baier, C., Cloth, L., Haverkort, B.R., Kuntz, M., Siegle, M.: Model checking Markov chains with actions and state labels. IEEE TSE 33(4), 209\u2013224 (2007)","journal-title":"IEEE TSE"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-319-07734-5_2","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"C Baier","year":"2014","unstructured":"Baier, C., Dubslaff, C., Kl\u00fcppelholz, S., Leuschner, L.: Energy-utility analysis for resilient systems using probabilistic model checking. In: Ciardo, G., Kindler, E. (eds.) PETRI NETS 2014. LNCS, vol. 8489, pp. 20\u201339. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07734-5_2"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-319-68167-2_27","volume-title":"Automated Technology for Verification and Analysis","author":"C Baier","year":"2017","unstructured":"Baier, C., Dubslaff, C., Koren\u010diak, L., Ku\u010dera, A., \u0158eh\u00e1k, V.: Synthesis of optimal resilient control strategies. In: D\u2019Souza, D., Narayan Kumar, K. (eds.) ATVA 2017. LNCS, vol. 10482, pp. 417\u2013434. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68167-2_27"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Baier, C., Dubslaff, C., Koren\u010diak, L. U., Ku\u010dera, A., \u0158eh\u00e1k, V.: Mean-payoff optimization in continuous-time Markov chains with parametric alarms. ACM Trans. Model. Comput. Simul. 29(4) (2019)","DOI":"10.1145\/3310225"},{"key":"11_CR10","volume-title":"Principles of Model Checking","author":"C Baier","year":"2008","unstructured":"Baier, C., Katoen, J.-P.: Principles of Model Checking. The MIT Press, Cambridge (2008)"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/11554844_3","volume-title":"Software Product Lines","author":"D Batory","year":"2005","unstructured":"Batory, D.: Feature models, grammars, and propositional formulas. In: Obbink, H., Pohl, K. (eds.) SPLC 2005. LNCS, vol. 3714, pp. 7\u201320. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11554844_3"},{"issue":"3","key":"11_CR12","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1109\/TSE.2009.89","volume":"36","author":"B Bollig","year":"2010","unstructured":"Bollig, B., Katoen, J.-P., Kern, C., Leucker, M.: Learning communicating automata from MSCs. IEEE Trans. Softw. Eng. 36(3), 390\u2013408 (2010). https:\/\/doi.org\/10.1109\/TSE.2009.89","journal-title":"IEEE Trans. Softw. Eng."},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"RE Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. 35, 677\u2013691 (1986)","journal-title":"IEEE Trans. Comput."},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Chrszon, P., Baier, C., Dubslaff, C., Kl\u00fcppelholz, S.: From features to roles. In: Proceedings of the 24th Systems and Software Product Line Conference (SPLC), pp. 1\u201311. ACM (2020)","DOI":"10.1145\/3382025.3414962"},{"key":"11_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2022.111556","volume":"196","author":"P Chrszon","year":"2023","unstructured":"Chrszon, P., Baier, C., Dubslaff, C., Kl\u00fcppelholz, S.: Interaction detection in configurable systems - a formal approach featuring roles. J. Syst. Softw. 196, 111556 (2023)","journal-title":"J. Syst. Softw."},{"key":"11_CR16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-662-49665-7_17","volume-title":"FASE 2016","author":"P Chrszon","year":"2016","unstructured":"Chrszon, P., Dubslaff, C., Kl\u00fcppelholz, S., Baier, C.: Family-based modeling and analysis for probabilistic systems - featuring PROFEAT. In: Stevens, P., Wasowski, A. (eds.) FASE 2016. LNCS, vol. 9633, pp. 287\u2013304. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49665-7_17"},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s00165-017-0432-4","volume":"30","author":"P Chrszon","year":"2018","unstructured":"Chrszon, P., Dubslaff, C., Kl\u00fcppelholz, S., Baier, C.: PROFEAT: feature-oriented engineering for family-based probabilistic model checking. Formal Aspects Comput. 30, 45\u201375 (2018)","journal-title":"Formal Aspects Comput."},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1145\/5397.5399","volume":"8","author":"EM Clarke","year":"1986","unstructured":"Clarke, E.M., Allen Emerson, E., Sistla, A.P.: Automatic verification of finite-state concurrent systems using temporal logic specifications. Trans. Program. Lang. Syst. 8, 244\u2013263 (1986)","journal-title":"Trans. Program. Lang. Syst."},{"key":"11_CR19","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1109\/TSE.2012.86","volume":"39","author":"A Classen","year":"2013","unstructured":"Classen, A., Cordy, M., Schobbens, P.-Y., Heymans, P., Legay, A., Raskin, J.-F.: Featured transition systems: foundations for verifying variability-intensive systems and their application to LTL model checking. Trans. Softw. Eng. 39, 1069\u20131089 (2013)","journal-title":"Trans. Softw. Eng."},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Classen, A., Heymans, P., Schobbens, P-Y., Legay, A.: Symbolic model checking of software product lines. In: Proceedings of the 33rd Conference on Software Engineering (ICSE), pp. 321\u2013330. ACM (2011)","DOI":"10.1145\/1985793.1985838"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/3-540-53479-2_17","volume-title":"Semantics of Systems of Concurrent Processes","author":"R De Nicola","year":"1990","unstructured":"De Nicola, R., Vaandrager, F.: Action versus state based logics for transition systems. In: Guessarian, I. (ed.) LITP 1990. LNCS, vol. 469, pp. 407\u2013419. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-53479-2_17"},{"key":"11_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-030-30446-1_9","volume-title":"Software Engineering and Formal Methods","author":"C Dubslaff","year":"2019","unstructured":"Dubslaff, C.: Compositional feature-oriented systems. In: \u00d6lveczky, P.C., Sala\u00fcn, G. (eds.) SEFM 2019. LNCS, vol. 11724, pp. 162\u2013180. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30446-1_9"},{"key":"11_CR23","unstructured":"Dubslaff, C.; Quantitative Analysis of Configurable and Reconfigurable Systems. PhD thesis, TU Dresden, Institute for Theoretical Computer Science (2021)"},{"key":"11_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-319-22975-1_6","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"C Dubslaff","year":"2015","unstructured":"Dubslaff, C., Baier, C.: Quantitative analysis of communication scenarios. In: Sankaranarayanan, S., Vicario, E. (eds.) FORMATS 2015. LNCS, vol. 9268, pp. 76\u201392. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22975-1_6"},{"key":"11_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-319-68270-9_4","volume-title":"ModelEd, TestEd, TrustEd","author":"C Dubslaff","year":"2017","unstructured":"Dubslaff, C., Baier, C.: Delayed-choice semantics for pomset families and message sequence graphs. In: Katoen, J.-P., Langerak, R., Rensink, A. (eds.) ModelEd, TestEd, TrustEd. LNCS, vol. 10500, pp. 64\u201384. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68270-9_4"},{"key":"11_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-662-46734-3_5","volume-title":"Transactions on Aspect-Oriented Software Development XII","author":"C Dubslaff","year":"2015","unstructured":"Dubslaff, C., Baier, C., Kl\u00fcppelholz, S.: Probabilistic model checking for feature-oriented systems. In: Chiba, S., Tanter, \u00c9., Ernst, E., Hirschfeld, R. (eds.) Transactions on Aspect-Oriented Software Development XII. LNCS, vol. 8989, pp. 180\u2013220. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46734-3_5"},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"Dubslaff, C., Kl\u00fcppelholz, S., Baier, C.: Probabilistic model checking for energy analysis in software product lines. In: Proceedings of the 13th Conference on Modularity (MODULARITY), pp. 169\u2013180. ACM (2014)","DOI":"10.1145\/2577080.2577095"},{"key":"11_CR28","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-031-19849-6_14","volume-title":"ISoLA 2022","author":"C Dubslaff","year":"2022","unstructured":"Dubslaff, C., K\u00f6hl, M.A.: Configurable-by-construction runtime monitoring. In: Margaria, T., Steffen, B. (eds.) ISoLA 2022. LNCS, vol. 13701, pp. 220\u2013241. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-19849-6_14"},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"Genest, B., Kuske, D., Muscholl, A.: A Kleene theorem and model-checking algorithms for existentially bounded communicating automata. Inf. Comput. 204(6)","DOI":"10.1016\/j.ic.2006.01.005"},{"key":"11_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/3-540-45465-9_56","volume-title":"Automata, Languages and Programming","author":"B Genest","year":"2002","unstructured":"Genest, B., Muscholl, A., Seidl, H., Zeitoun, M.: Infinite-state high-level MSCs: model-checking and realizability. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 657\u2013668. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45465-9_56"},{"key":"11_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1007\/3-540-45319-9_34","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"EL Gunter","year":"2001","unstructured":"Gunter, E.L., Muscholl, A., Peled, D.A.: Compositional message sequence charts. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 496\u2013511. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45319-9_34"},{"key":"11_CR32","doi-asserted-by":"crossref","unstructured":"Haverkort, B., Cloth, L., Hermanns, H., Katoen, J.-P., Baier, C.: Model checking performability properties. In: Proceedings International Conference on Dependable Systems and Networks, pp. 103\u2013112 (2002)","DOI":"10.1109\/DSN.2002.1028891"},{"key":"11_CR33","unstructured":"ITU-T. Message sequence chart (msc). Recommendation Z.120, Edition 1.0 (1993)"},{"key":"11_CR34","unstructured":"ITU-T. Message sequence chart (msc). Recommendation Z.120, Edition 2.0 (1996)"},{"key":"11_CR35","unstructured":"ITU-T. Annex b: Formal semantics of message sequence charts. Z.120, v2.2 (1998)"},{"key":"11_CR36","unstructured":"ITU-T. Message Sequence Chart (MSC). Z.120, Edition 5.0 (2011)"},{"key":"11_CR37","doi-asserted-by":"crossref","unstructured":"Kang, K.C., Cohen, S.G., Hess, J.A., Novak, W.E., Spencer Peterson, A.: Feature-oriented domain analysis (foda) feasibility study. Technical report, Carnegie-Mellon University Software Engineering Institute (1990)","DOI":"10.21236\/ADA235785"},{"key":"11_CR38","unstructured":"Katoen, J.P., Lambert, L.: Pomsets for message sequence charts. In: K\u00f6nig, H., Langend\u00f6rfer, P., (eds.) 8. GI\/ITG-Fachgespraech, pp. 197\u2013207. Shaker Verlag (1998)"},{"key":"11_CR39","doi-asserted-by":"crossref","unstructured":"K\u00f6hl, M.A., Dubslaff, C., Hermanns, H.: Configuration monitor synthesis. In: Akshay, Aina Niemetz, S., Sankaranarayanan, S., (eds.) Automated Technology for Verification and Analysis, pp. 3\u201327. Springer, Cham (2025)","DOI":"10.1007\/978-3-031-78750-8_1"},{"key":"11_CR40","doi-asserted-by":"crossref","unstructured":"Narayan Kumar, K.: The Theory of Message Sequence Charts, pp. 289\u2013323. Co-Published with Indian Institute of Science (IISc), Bangalore (2012)","DOI":"10.1142\/9789814271059_0010"},{"key":"11_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/3-540-48340-3_8","volume-title":"Mathematical Foundations of Computer Science 1999","author":"A Muscholl","year":"1999","unstructured":"Muscholl, A., Peled, D.: Message sequence graphs and decision problems on Mazurkiewicz traces. In: Kuty\u0142owski, M., Pacholski, L., Wierzbicki, T. (eds.) MFCS 1999. LNCS, vol. 1672, pp. 81\u201391. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48340-3_8"},{"key":"11_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/BFb0053553","volume-title":"Foundations of Software Science and Computation Structures","author":"A Muscholl","year":"1998","unstructured":"Muscholl, A., Peled, D., Su, Z.: Deciding properties for message sequence charts. In: Nivat, M. (ed.) FoSSaCS 1998. LNCS, vol. 1378, pp. 226\u2013242. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0053553"},{"key":"11_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/BFb0053553","volume-title":"Foundations of Software Science and Computation Structures","author":"A Muscholl","year":"1998","unstructured":"Muscholl, A., Peled, D., Su, Z.: Deciding properties for message sequence charts. In: Nivat, M. (ed.) FoSSaCS 1998. LNCS, vol. 1378, pp. 226\u2013242. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0053553"},{"key":"11_CR44","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-540-74128-2_8","volume-title":"Model Checking and Artificial Intelligence","author":"C Pecheur","year":"2007","unstructured":"Pecheur, C., Raimondi, F.: Symbolic model checking of logics with actions. In: Edelkamp, S., Lomuscio, A. (eds.) MoChArt 2006. LNCS (LNAI), vol. 4428, pp. 113\u2013128. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74128-2_8"},{"key":"11_CR45","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: 18th Annual Symposium on the Foundations of Computer Science (FOCS-77), pp. 46\u201357. IEEE. Providence, Rhode Island (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"11_CR46","doi-asserted-by":"crossref","unstructured":"Post, H., Sinz, C.: Configuration lifting: verification meets software configuration. In: Proceedings of the 23rd Conference on Automated Software Engineering (ASE), pp. 347\u2013350. IEEE (2008)","DOI":"10.1109\/ASE.2008.45"},{"key":"11_CR47","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01379149","volume":"15","author":"V Pratt","year":"1986","unstructured":"Pratt, V.: Modeling concurrency with partial orders. Int. J. Parallel Prog. 15, 33\u201371 (1986)","journal-title":"Int. J. Parallel Prog."},{"key":"11_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-540-48654-1_20","volume-title":"CONCUR \u201994: Concurrency Theory","author":"A Rensink","year":"1994","unstructured":"Rensink, A., Wehrheim, H.: Weak sequential composition in process algebras. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol. 836, pp. 226\u2013241. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/978-3-540-48654-1_20"},{"key":"11_CR49","doi-asserted-by":"crossref","unstructured":"Th\u00fcm, T., Apel, S., K\u00e4stner, C., Schaefer, I., Saake, G.: A classification and survey of analysis strategies for software product lines. Comput. Surv. 47, 6:1\u20136:45 (2014)","DOI":"10.1145\/2580950"},{"key":"11_CR50","unstructured":"Zhou, Z., Sheldon, F.T., Potok, T.E.: Modeling with stochastic message sequence charts. In: IIIS Proceedings of the International Conference on Computer, Communication, and Control Technology (CCCT 2003) (2003)"}],"container-title":["Lecture Notes in Computer Science","Principles of Formal Quantitative Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-97439-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T15:29:39Z","timestamp":1777476579000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-97439-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,30]]},"ISBN":["9783031974380","9783031974397"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-97439-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,30]]},"assertion":[{"value":"30 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}