{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T19:16:52Z","timestamp":1783019812277,"version":"3.54.6"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032262035","type":"print"},{"value":"9783032262042","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T00:00:00Z","timestamp":1779062400000},"content-version":"vor","delay-in-days":137,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    Automated robotic systems operating in real-world environments require thorough test campaigns before deployment, in which engineers assess whether the system is actually exposed to critical scenarios. A well-established way to judge the efficacy of test campaigns in controlled environments is scenario coverage: It quantifies the quality of recorded data from test campaigns w.r.t. a set of (critical) scenario classes of interest. Challenges arise when transferring coverage from controlled to open environments, as it may no longer be exactly determined to which scenario class the recorded test data belongs to: sensors offer limited observability, e.g., by occlusions or hardware failures, and specifications might be inherently vague, e.g., via imprecise traffic regulations. We leverage the Open World Assumption to formally extend scenario coverage to such ambiguous test data and present algorithms for computing guaranteed lower and upper bounds on coverage. Whereas deciding the lower bound problem is\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$D^p$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:msup>\n                            <mml:mi>D<\/mml:mi>\n                            <mml:mi>p<\/mml:mi>\n                          <\/mml:msup>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    -complete, the upper bound can be computed in polynomial time. We extend an existing coverage software tool with two approaches for incorporating the Open World Assumption, grounded in LTL\n                    <jats:sub>f<\/jats:sub>\n                    . Our evaluation shows that meaningful statements on scenario coverage are feasible, even under intricacies of the real world.\n                  <\/jats:p>","DOI":"10.1007\/978-3-032-26204-2_7","type":"book-chapter","created":{"date-parts":[[2026,5,17]],"date-time":"2026-05-17T15:51:33Z","timestamp":1779033093000},"page":"130-150","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Test Coverage of\u00a0Automated Robotic Systems in\u00a0Open World Environments"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1065-4182","authenticated-orcid":false,"given":"Lukas","family":"Westhofen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1769-3486","authenticated-orcid":false,"given":"Till","family":"Schallau","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7866-7927","authenticated-orcid":false,"given":"Dominik","family":"Schmid","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6265-6641","authenticated-orcid":false,"given":"Stefan","family":"Naujokat","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9524-4459","authenticated-orcid":false,"given":"Falk","family":"Howar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9276-6342","authenticated-orcid":false,"given":"Daniel","family":"Neider","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,18]]},"reference":[{"key":"7_CR1","unstructured":"Alexander, R., Hawkins, H.R., Rae, A.J.: Situation coverage - a coverage criterion for testing autonomous robots. Report, The University of York (2015). https:\/\/eprints.whiterose.ac.uk\/id\/eprint\/88736\/"},{"key":"7_CR2","doi-asserted-by":"publisher","unstructured":"Amersbach, C., Winner, H.: Defining required and feasible test coverage for scenario-based validation of highly automated vehicles. In: 2019 IEEE Intelligent Transportation Systems Conference (ITSC), pp. 425\u2013430. IEEE (2019). https:\/\/doi.org\/10.1109\/ITSC.2019.8917534","DOI":"10.1109\/ITSC.2019.8917534"},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F.: The Description Logic Handbook: Theory, Implementation and Applications, 2 edn. Cambridge University Press (2007). https:\/\/doi.org\/10.1017\/cbo9780511711787","DOI":"10.1017\/cbo9780511711787"},{"key":"7_CR4","doi-asserted-by":"publisher","unstructured":"Bock, J., Krajewski, R., Moers, T., Runde, S., Vater, L., Eckstein, L.: The inD dataset: a drone dataset of naturalistic road user trajectories at German intersections. In: 2020 IEEE Intelligent Vehicles Symposium (IV), pp. 1929\u20131934. IEEE (2020). https:\/\/doi.org\/10.1109\/iv47402.2020.9304839","DOI":"10.1109\/iv47402.2020.9304839"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-662-43951-7_8","volume-title":"Automata, Languages, and Programming","author":"D Bundala","year":"2014","unstructured":"Bundala, D., Ouaknine, J.: On the complexity of temporal-logic path checking. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8573, pp. 86\u201397. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43951-7_8"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-030-01090-4_8","volume-title":"Automated Technology for Verification and Analysis","author":"C-H Cheng","year":"2018","unstructured":"Cheng, C.-H., Huang, C.-H., Yasuoka, H.: Quantitative projection coverage for testing ML-enabled autonomous systems. In: Lahiri, S.K., Wang, C. (eds.) ATVA 2018. LNCS, vol. 11138, pp. 126\u2013142. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01090-4_8"},{"key":"7_CR7","doi-asserted-by":"publisher","unstructured":"Chuzhoy, J., Khanna, S.: A faster combinatorial algorithm for maximum bipartite matching. In: Proceedings of the 2024 Annual ACM-Siam Symposium on Discrete Algorithms (SODA), pp. 2185\u20132235. Society for Industrial and Applied Mathematics (2024). https:\/\/doi.org\/10.1137\/1.9781611977912.79","DOI":"10.1137\/1.9781611977912.79"},{"key":"7_CR8","unstructured":"De\u00a0Giacomo, G., Vardi, M.Y.: Linear temporal logic and linear dynamic logic on finite traces. In: Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI 2013, pp. 854\u2013860. Association for Computing Machinery, New York, NY, USA (2013). https:\/\/dl.acm.org\/doi\/abs\/10.5555\/2540128.2540252"},{"key":"7_CR9","doi-asserted-by":"publisher","unstructured":"Esterle, K., Gressenbuch, L., Knoll, A.: Formalizing traffic rules for machine interpretability. In: 2020 IEEE 3rd Connected and Automated Vehicles Symposium (CAVS), pp.\u00a01\u20137. IEEE (2020). https:\/\/doi.org\/10.1109\/CAVS51000.2020.9334599","DOI":"10.1109\/CAVS51000.2020.9334599"},{"key":"7_CR10","unstructured":"Federal Ministry for Digital and Transport (Germany): Stra\u00dfenverkehrs-Ordnung (StVO). Regulation BGBl. I S. 367, BMDV (2013). https:\/\/www.gesetze-im-internet.de\/stvo_2013\/"},{"key":"7_CR11","unstructured":"Federal Ministry for Digital and Transport (Germany): Verordnung zur Regelung des Betriebs von Kraftfahrzeugen mit automatisierter und autonomer Fahrfunktion und zur \u00c4nderung stra\u00dfenverkehrsrechtlicher Vorschriften. Regulation 86\/22, BMDV (2022). https:\/\/www.bundesrat.de\/bv.html?id=0086-22"},{"key":"7_CR12","doi-asserted-by":"publisher","unstructured":"Gay, G., Staats, M., Whalen, M.W., Heimdahl, M.P.E.: Moving the goalposts: coverage satisfaction is not enough. In: Proceedings of the 7th International Workshop on Search-Based Software Testing (SBST), SBST 2014, pp. 19\u201322. Association for Computing Machinery, New York, NY, USA (2014). https:\/\/doi.org\/10.1145\/2593833.2593837","DOI":"10.1145\/2593833.2593837"},{"key":"7_CR13","doi-asserted-by":"publisher","unstructured":"de\u00a0Gelder, E., Buermann, M., ob den Camp, O.: Coverage metrics for a scenario database for the scenario-based assessment of automated driving systems. In: 2024 IEEE International Automated Vehicle Validation Conference (IAVVC), pp.\u00a01\u20138. IEEE (2024). https:\/\/doi.org\/10.1109\/iavvc63304.2024.10786405","DOI":"10.1109\/iavvc63304.2024.10786405"},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"de\u00a0Gelder, E., et al.: Towards an ontology for scenario definition for the assessment of automated vehicles: an object-oriented framework. IEEE Trans. Intell. Veh. 7(2), 300\u2013314 (2022). https:\/\/doi.org\/10.1109\/tiv.2022.3144803","DOI":"10.1109\/tiv.2022.3144803"},{"key":"7_CR15","doi-asserted-by":"publisher","unstructured":"de\u00a0Gelder, E., Singh, T., Hadj-Selem, F., Vidal\u00a0Bazan, S., Op\u00a0den Camp, O.: Scenario metrics for the safety assurance framework of automated vehicles: a review of its application. Vehicles 7(3), 100 (2025). https:\/\/doi.org\/10.3390\/vehicles7030100","DOI":"10.3390\/vehicles7030100"},{"key":"7_CR16","doi-asserted-by":"publisher","unstructured":"de Gelder, E., Manders, J., Grappiolo, C., Paardekooper, J.P., ob den Camp, O., de Schutter, B.: Real-world scenario mining for the assessment of automated vehicles. In: 2020 IEEE 23rd International Conference on Intelligent Transportation Systems (ITSC), pp.\u00a01\u20138. IEEE (2020). https:\/\/doi.org\/10.1109\/itsc45102.2020.9294652","DOI":"10.1109\/itsc45102.2020.9294652"},{"issue":"12","key":"7_CR17","doi-asserted-by":"publisher","first-page":"1402","DOI":"10.1109\/32.62448","volume":"16","author":"D Hamlet","year":"1990","unstructured":"Hamlet, D., Taylor, R.: Partition testing does not inspire confidence (program testing). IEEE Trans. Software Eng. 16(12), 1402\u20131411 (1990). https:\/\/doi.org\/10.1109\/32.62448","journal-title":"IEEE Trans. Software Eng."},{"key":"7_CR18","doi-asserted-by":"publisher","unstructured":"Hekmatnejad, M., et al.: Encoding and monitoring responsibility sensitive safety rules for automated vehicles in signal temporal logic. In: Proceedings of the 17th ACM-IEEE International Conference on Formal Methods and Models for System Design, MEMOCODE 2019, pp. 1\u201311. Association for Computing Machinery, New York, NY, USA (2019). https:\/\/doi.org\/10.1145\/3359986.3361203","DOI":"10.1145\/3359986.3361203"},{"key":"7_CR19","doi-asserted-by":"publisher","unstructured":"Hopcroft, J.E., Karp, R.M.: A N5\/2 algorithm for maximum matchings in bipartite. In: 12th Annual Symposium on Switching and Automata Theory (SWAT 1971). IEEE (1971). https:\/\/doi.org\/10.1109\/swat.1971.1","DOI":"10.1109\/swat.1971.1"},{"key":"7_CR20","unstructured":"International Organization for Standardization: Road vehicles \u2014 safety of the intended functionality. ISO Standard 21448:2022, ISO (2022). https:\/\/www.iso.org\/standard\/77490.html"},{"key":"7_CR21","unstructured":"International Organization for Standardization: Road vehicles \u2014 test scenarios for automated driving systems \u2014 scenario categorization. ISO Standard 34504:2024, ISO (2024). https:\/\/www.iso.org\/standard\/78953.html"},{"key":"7_CR22","doi-asserted-by":"publisher","unstructured":"Keet, C.M.: Open World Assumption, p. 1567. Springer New York, New York, NY (2013). https:\/\/doi.org\/10.1007\/978-1-4419-9863-7_734","DOI":"10.1007\/978-1-4419-9863-7_734"},{"issue":"3","key":"7_CR23","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1016\/0022-0000(88)90039-6","volume":"36","author":"MW Krentel","year":"1988","unstructured":"Krentel, M.W.: The complexity of optimization problems. J. Comput. Syst. Sci. 36(3), 490\u2013509 (1988). https:\/\/doi.org\/10.1016\/0022-0000(88)90039-6","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR24","doi-asserted-by":"publisher","unstructured":"Maierhofer, S., Moosbrugger, P., Althoff, M.: Formalization of intersection traffic rules in temporal logic. In: 2022 IEEE Intelligent Vehicles Symposium (IV), pp. 1135\u20131144. IEEE (2022). https:\/\/doi.org\/10.1109\/IV51971.2022.9827153","DOI":"10.1109\/IV51971.2022.9827153"},{"key":"7_CR25","doi-asserted-by":"publisher","unstructured":"Neurohr, C., Westhofen, L., Henning, T., de\u00a0Graaff, T., Mohlmann, E., Bode, E.: Fundamental considerations around scenario-based testing for automated driving. In: 2020 IEEE Intelligent Vehicles Symposium (IV), pp. 121\u2013127. IEEE (2020). https:\/\/doi.org\/10.1109\/iv47402.2020.9304823","DOI":"10.1109\/iv47402.2020.9304823"},{"key":"7_CR26","doi-asserted-by":"publisher","unstructured":"Papadimitriou, C.H., Yannakakis, M.: The complexity of facets (and some facets of complexity). In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing - STOCK 1982, STOC 1982, pp. 255\u2013260. Association for Computing Machinery, New York, NY, USA (1982). https:\/\/doi.org\/10.1145\/800070.802199","DOI":"10.1145\/800070.802199"},{"key":"7_CR27","doi-asserted-by":"publisher","first-page":"87456","DOI":"10.1109\/ACCESS.2020.2993730","volume":"8","author":"S Riedmaier","year":"2020","unstructured":"Riedmaier, S., Ponn, T., Ludwig, D., Schick, B., Diermeyer, F.: Survey on scenario-based safety assessment of automated vehicles. IEEE Access 8, 87456\u201387477 (2020). https:\/\/doi.org\/10.1109\/ACCESS.2020.2993730","journal-title":"IEEE Access"},{"key":"7_CR28","doi-asserted-by":"publisher","unstructured":"Roesener, C., Fahrenkrog, F., Uhlig, A., Eckstein, L.: A scenario-based assessment approach for automated driving by using time series classification of human-driving behaviour. In: 2016 IEEE 19th International Conference on Intelligent Transportation Systems (ITSC), pp. 1360\u20131365. IEEE (2016). https:\/\/doi.org\/10.1109\/itsc.2016.7795734","DOI":"10.1109\/itsc.2016.7795734"},{"key":"7_CR29","doi-asserted-by":"publisher","unstructured":"Schallau, T., Naujokat, S., Kullmann, F., Howar, F.: Tree-based scenario classification. In: Benz, N., Gopinath, D., Shi, N. (eds.) NASA Formal Methods. LNCS, vol. 14627, pp. 259\u2013278. Springer Nature Switzerland, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-60698-4_15","DOI":"10.1007\/978-3-031-60698-4_15"},{"key":"7_CR30","doi-asserted-by":"publisher","unstructured":"Schmid, D., et al.: A qualitative analysis of the german road traffic regulations (StVO) for automated driving. In: 2025 IEEE International Automated Vehicle Validation Conference (IAVVC), pp.\u00a01\u20138. IEEE (2025). https:\/\/doi.org\/10.1109\/IAVVC61942.2025.11219635","DOI":"10.1109\/IAVVC61942.2025.11219635"},{"key":"7_CR31","doi-asserted-by":"publisher","unstructured":"Schmid, D., Westhofen, L., Schallau, T.: Data from: test coverage of automated robotic systems in open world environments (2026). https:\/\/doi.org\/10.5281\/zenodo.17775279. Dataset","DOI":"10.5281\/zenodo.17775279"},{"issue":"9","key":"7_CR32","doi-asserted-by":"publisher","first-page":"14088","DOI":"10.1109\/TITS.2021.3136353","volume":"23","author":"J Sun","year":"2022","unstructured":"Sun, J., Zhang, H., Zhou, H., Yu, R., Tian, Y.: Scenario-based test automation for highly automated vehicles: a review and paving the way for systematic safety assurance. IEEE Trans. Intell. Transp. Syst. 23(9), 14088\u201314103 (2022). https:\/\/doi.org\/10.1109\/TITS.2021.3136353","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"7_CR33","unstructured":"United Nations: Uniform provisions concerning the approval of vehicles with regard to automated lane keeping systems (ALKS). UN Regulation\u00a0157, United Nations (2021). https:\/\/documents.un.org\/symbol-explorer?s=E\/ECE\/TRANS\/505\/REV.3\/ADD.156, e\/ECE\/TRANS\/505\/Rev.3\/Add.156"},{"key":"7_CR34","doi-asserted-by":"publisher","unstructured":"Vardi, M.Y.: The complexity of relational query languages (extended abstract). In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing - STOC 1982, STOC 1982, pp. 137\u2013146. Association for Computing Machinery, New York, NY, USA (1982). https:\/\/doi.org\/10.1145\/800070.802186","DOI":"10.1145\/800070.802186"},{"key":"7_CR35","doi-asserted-by":"publisher","unstructured":"Weber, H., Glasmacher, C., Schuldes, M., Wagener, N., Eckstein, L.: Holistic driving scenario concept for urban traffic. In: 2023 IEEE Intelligent Vehicles Symposium (IV). IEEE (2023). https:\/\/doi.org\/10.1109\/iv55152.2023.10186385","DOI":"10.1109\/iv55152.2023.10186385"},{"key":"7_CR36","doi-asserted-by":"publisher","unstructured":"Westhofen, L.: STARS logic MTCQ (2025). https:\/\/doi.org\/10.5281\/zenodo.17791768. Software","DOI":"10.5281\/zenodo.17791768"},{"issue":"14","key":"7_CR37","doi-asserted-by":"publisher","first-page":"15221","DOI":"10.1609\/aaai.v39i14.33670","volume":"39","author":"L Westhofen","year":"2025","unstructured":"Westhofen, L., Jung, J.C., Neider, D.: Temporal conjunctive query answering via rewriting. Proc. AAAI Conf. Artif. Intell. 39(14), 15221\u201315229 (2025). https:\/\/doi.org\/10.1609\/aaai.v39i14.33670","journal-title":"Proc. AAAI Conf. Artif. Intell."},{"key":"7_CR38","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1109\/ojits.2022.3187247","volume":"3","author":"L Westhofen","year":"2022","unstructured":"Westhofen, L., Neurohr, C., Butz, M., Scholtes, M., Schuldes, M.: Using ontologies for the formalization and recognition of criticality for automated driving. IEEE Open J. Intell. Transp. Syst. 3, 519\u2013538 (2022). https:\/\/doi.org\/10.1109\/ojits.2022.3187247","journal-title":"IEEE Open J. Intell. Transp. Syst."},{"key":"7_CR39","doi-asserted-by":"publisher","unstructured":"Westhofen, L., Neurohr, C., Jung, J.C., Neider, D.: Answering temporal conjunctive queries over description logic ontologies for situation recognition in complex operational domains. In: Finkbeiner, B., Kov\u00e1cs, L. (eds.) Tools and Algorithms for the Construction and Analysis of Systems. LNCS, pp. 167\u2013187. Springer Nature Switzerland, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-57246-3_10","DOI":"10.1007\/978-3-031-57246-3_10"},{"key":"7_CR40","doi-asserted-by":"publisher","unstructured":"Westhofen, L., Neurohr, C., Jung, J.C., Neider, D.: Topllet: an optimized engine for answering metric temporal conjunctive queries. In: NASA Formal Methods, pp. 314\u2013321. Springer Nature Switzerland, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-60698-4_18","DOI":"10.1007\/978-3-031-60698-4_18"},{"key":"7_CR41","doi-asserted-by":"publisher","unstructured":"Westhofen, L., Schallau, T., Schmid, D., Naujokat, S., Howar, F., Neider, D.: Supplementary material to \u2018test coverage of automated robotic systems in open world environments\u2019. Supplementary Mater. (2026). https:\/\/doi.org\/10.5281\/zenodo.18803837","DOI":"10.5281\/zenodo.18803837"},{"key":"7_CR42","doi-asserted-by":"publisher","unstructured":"Xiao, M.: An exact MaxSAT algorithm: further observations and further improvements. In: Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence (IJCAI-22), IJCAI-2022, pp. 1887\u20131893. International Joint Conferences on Artificial Intelligence Organization (2022). https:\/\/doi.org\/10.24963\/ijcai.2022\/262","DOI":"10.24963\/ijcai.2022\/262"},{"issue":"4","key":"7_CR43","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1145\/267580.267590","volume":"29","author":"H Zhu","year":"1997","unstructured":"Zhu, H., Hall, P.A.V., May, J.H.R.: Software unit test coverage and adequacy. ACM Comput. Surv. 29(4), 366\u2013427 (1997). https:\/\/doi.org\/10.1145\/267580.267590","journal-title":"ACM Comput. Surv."}],"container-title":["Lecture Notes in Computer Science","Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-26204-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T18:00:01Z","timestamp":1783015201000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-26204-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032262035","9783032262042"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-26204-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"18 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 May 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fm2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/fm-2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}