{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T01:26:57Z","timestamp":1773883617704,"version":"3.50.1"},"publisher-location":"Cham","reference-count":50,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031274800","type":"print"},{"value":"9783031274817","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-27481-7_13","type":"book-chapter","created":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T14:03:10Z","timestamp":1677765790000},"page":"199-221","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["$$\\textsf{PFL}$$: A Probabilistic Logic for\u00a0Fault Trees"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5522-4798","authenticated-orcid":false,"given":"Stefano M.","family":"Nicoletti","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5687-854X","authenticated-orcid":false,"given":"Milan","family":"Lopuha\u00e4-Zwakenberg","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9348-7684","authenticated-orcid":false,"given":"E. Moritz","family":"Hahn","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6793-8165","authenticated-orcid":false,"given":"Mari\u00eblle","family":"Stoelinga","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,3]]},"reference":[{"issue":"1","key":"13_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/inco.1993.1024","volume":"104","author":"R Alur","year":"1993","unstructured":"Alur, R., Courcoubetis, C., Dill, D.: Model-checking in dense real-time. Inf. Comput. 104(1), 2\u201334 (1993)","journal-title":"Inf. Comput."},{"key":"13_CR2","unstructured":"Andersen, H.R.: An introduction to binary decision diagrams. Lecture notes, available online, IT University of Copenhagen, p. 5 (1997)"},{"issue":"7","key":"13_CR3","doi-asserted-by":"publisher","first-page":"161","DOI":"10.5055\/jem.0539","volume":"18","author":"T Bakeli","year":"2020","unstructured":"Bakeli, T., Hafidi, A.A., et al.: COVID-19 infection risk management during construction activities: an approach based on fault tree analysis (FTA). J. Emerg. Manage. 18(7), 161\u2013176 (2020)","journal-title":"J. Emerg. Manage."},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1007\/978-3-031-06773-0_38","volume-title":"NASA Formal Methods","author":"D Basg\u00f6ze","year":"2022","unstructured":"Basg\u00f6ze, D., Volk, M., Katoen, J., Khan, S., Stoelinga, M.: BDDs strike back - efficient analysis of static and dynamic fault trees. In: Deshmukh, J.V., Havelund, K., Perez, I. (eds.) NFM 2022. LNCS, vol. 13260, pp. 713\u2013732. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06773-0_38"},{"key":"13_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-4129-7","volume-title":"Mathematical Logic for Computer Science","author":"M Ben-Ari","year":"2012","unstructured":"Ben-Ari, M.: Mathematical Logic for Computer Science. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-1-4471-4129-7"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-36080-8_3","volume-title":"Dependable Computing EDCC-4","author":"P Bieber","year":"2002","unstructured":"Bieber, P., Castel, C., Seguin, C.: Combination of fault tree analysis and model checking for safety assessment of complex system. In: Bondavalli, A., Thevenod-Fosse, P. (eds.) EDCC 2002. LNCS, vol. 2485, pp. 19\u201331. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36080-8_3"},{"issue":"22","key":"13_CR7","doi-asserted-by":"publisher","first-page":"133","DOI":"10.3182\/20130904-3-UK-4041.00007","volume":"46","author":"A Bobbio","year":"2013","unstructured":"Bobbio, A., Egidi, L., Terruggia, R.: A methodology for qualitative\/quantitative analysis of weighted attack trees. IFAC Proc. Vol. 46(22), 133\u2013138 (2013). https:\/\/doi.org\/10.3182\/20130904-3-UK-4041.00007","journal-title":"IFAC Proc. Vol."},{"key":"13_CR8","doi-asserted-by":"publisher","unstructured":"Boudali, H., Crouzen, P., Stoelinga, M.: Dynamic fault tree analysis using input\/output interactive Markov chains. In: DSN, pp. 708\u2013717. IEEE Computer Society (2007). https:\/\/doi.org\/10.1109\/DSN.2007.37","DOI":"10.1109\/DSN.2007.37"},{"issue":"5","key":"13_CR9","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1093\/comjnl\/bxq024","volume":"54","author":"M Bozzano","year":"2011","unstructured":"Bozzano, M., Cimatti, A., Katoen, J., Nguyen, V.Y., Noll, T., Roveri, M.: Safety, dependability and performance analysis of extended AADL models. Comput. J. 54(5), 754\u2013775 (2011). https:\/\/doi.org\/10.1093\/comjnl\/bxq024","journal-title":"Comput. J."},{"key":"13_CR10","doi-asserted-by":"publisher","unstructured":"Brace, K., Rudell, R., Bryant, R.: Efficient implementation of a BDD package. In: 27th ACM\/IEEE Design Automation Conference, pp. 40\u201345 (1990). https:\/\/doi.org\/10.1109\/DAC.1990.114826","DOI":"10.1109\/DAC.1990.114826"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-662-54580-5_9","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"CE Budde","year":"2017","unstructured":"Budde, C.E., Dehnert, C., Hahn, E.M., Hartmanns, A., Junges, S., Turrini, A.: JANI: quantitative model and tool interaction. In: Legay, A., Margaria, T. (eds.) TACAS 2017. LNCS, vol. 10206, pp. 151\u2013168. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54580-5_9"},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Budde, C.E., Stoelinga, M.: Efficient algorithms for quantitative attack tree analysis. In: 2021 IEEE 34th Computer Security Foundations Symposium (CSF), pp. 1\u201315 (2021). https:\/\/doi.org\/10.1109\/CSF51468.2021.00041","DOI":"10.1109\/CSF51468.2021.00041"},{"key":"13_CR13","unstructured":"Clark, P., Harrison, P., Jenkins, T., Thompson, J.A., Wojcik, R.H., et al.: Acquiring and using world knowledge using a restricted subset of English. In: Flairs Conference, pp. 506\u2013511 (2005)"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BFb0025774","volume-title":"Logics of Programs","author":"EM Clarke","year":"1982","unstructured":"Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching time temporal logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol. 131, pp. 52\u201371. Springer, Heidelberg (1982). https:\/\/doi.org\/10.1007\/BFb0025774"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Conrad, E., Titolo, L., Giannakopoulou, D., Pressburger, T., Dutle, A.: A compositional proof framework for FRETish requirements. In: Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs, pp. 68\u201381 (2022)","DOI":"10.1145\/3497775.3503685"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-319-24318-4_26","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2015","author":"F Corzilius","year":"2015","unstructured":"Corzilius, F., Kremer, G., Junges, S., Schupp, S., \u00c1brah\u00e1m, E.: SMT-RAT: an open source C++ toolbox for strategic and parallel SMT solving. In: Heule, M., Weaver, S. (eds.) SAT 2015. LNCS, vol. 9340, pp. 360\u2013368. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24318-4_26"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Crapo, A., Moitra, A., McMillan, C., Russell, D.: Requirements capture and analysis in ASSERT (TM). In: 2017 IEEE 25th International Requirements Engineering Conference (RE), pp. 283\u2013291. IEEE (2017)","DOI":"10.1109\/RE.2017.54"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"6333","DOI":"10.1109\/TAC.2021.3133265","volume":"67","author":"M Cubuktepe","year":"2021","unstructured":"Cubuktepe, M., Jansen, N., Junges, S., Katoen, J.P., Topcu, U.: Convex optimization for parameter synthesis in MDPs. IEEE Trans. Autom. Control 67, 6333\u20136348 (2021)","journal-title":"IEEE Trans. Autom. Control"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1007\/3-540-49519-3_33","volume-title":"Formal Methods in Computer-Aided Design","author":"D D\u00e9harbe","year":"1998","unstructured":"D\u00e9harbe, D., Shankar, S., Clarke, E.M.: Model checking VHDL with CV. In: Gopalakrishnan, G., Windley, P. (eds.) FMCAD 1998. LNCS, vol. 1522, pp. 508\u2013514. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-49519-3_33"},{"issue":"3","key":"13_CR20","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1109\/24.537011","volume":"45","author":"Y Dutuit","year":"1996","unstructured":"Dutuit, Y., Rauzy, A.: A linear-time algorithm to find modules of fault trees. IEEE Trans. Reliab. 45(3), 422\u2013425 (1996)","journal-title":"IEEE Trans. Reliab."},{"key":"13_CR21","unstructured":"Ericson, C.A.: Fault tree analysis. In: System Safety Conference, vol. 1, pp. 1\u20139 (1999)"},{"key":"13_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/978-3-030-01090-4_18","volume-title":"Automated Technology for Verification and Analysis","author":"P Gainer","year":"2018","unstructured":"Gainer, P., Hahn, E.M., Schewe, S.: Accelerated model checking of parametric Markov chains. In: Lahiri, S.K., Wang, C. (eds.) ATVA 2018. LNCS, vol. 11138, pp. 300\u2013316. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01090-4_18"},{"key":"13_CR23","unstructured":"Giannakopoulou, D., Mavridou, A., Rhein, J., Pressburger, T., Schumann, J., Shi, N.: Formal requirements elicitation with FRET. In: International Working Conference on Requirements Engineering: Foundation for Software Quality (REFSQ-2020). No. ARC-E-DAA-TN77785 (2020)"},{"key":"13_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-642-20398-5_12","volume-title":"NASA Formal Methods","author":"EM Hahn","year":"2011","unstructured":"Hahn, E.M., Han, T., Zhang, L.: Synthesis for PCTL in parametric Markov decision processes. In: Bobaru, M., Havelund, K., Holzmann, G.J., Joshi, R. (eds.) NFM 2011. LNCS, vol. 6617, pp. 146\u2013161. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20398-5_12"},{"issue":"7","key":"13_CR25","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1109\/32.708570","volume":"24","author":"KM Hansen","year":"1998","unstructured":"Hansen, K.M., Ravn, A.P., Stavridou, V.: From safety analysis to software requirements. IEEE Trans. Software Eng. 24(7), 573\u2013584 (1998)","journal-title":"IEEE Trans. Software Eng."},{"issue":"5","key":"13_CR26","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/BF01211866","volume":"6","author":"H Hansson","year":"1994","unstructured":"Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. Formal Aspects Comput. 6(5), 512\u2013535 (1994). https:\/\/doi.org\/10.1007\/BF01211866","journal-title":"Formal Aspects Comput."},{"key":"13_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-662-49635-0_9","volume-title":"Principles of Security and Trust","author":"H Hermanns","year":"2016","unstructured":"Hermanns, H., Kr\u00e4mer, J., Kr\u010d\u00e1l, J., Stoelinga, M.: The value of attack-defence diagrams. In: Piessens, F., Vigan\u00f2, L. (eds.) POST 2016. LNCS, vol. 9635, pp. 163\u2013185. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49635-0_9"},{"key":"13_CR28","unstructured":"International Standardization Organization: ISO\/DIS 26262: Road vehicles, functional safety (2018). https:\/\/www.iso.org\/standard\/68383.html"},{"key":"13_CR29","doi-asserted-by":"publisher","unstructured":"Jimenez-Roa, L., Heskes, T., Tinga, T., Stoelinga, M.: Automatic inference of fault tree models via multi-objective evolutionary algorithms. IEEE Trans. Dependable Secure Comput., 1\u201312 (2021). https:\/\/doi.org\/10.1109\/TDSC.2022.3203805","DOI":"10.1109\/TDSC.2022.3203805"},{"key":"13_CR30","unstructured":"Junges, S., et al.: Parameter synthesis for Markov models. arXiv preprint arXiv:1903.07993 (2019)"},{"key":"13_CR31","doi-asserted-by":"crossref","unstructured":"Katoen, J.P.: The probabilistic model checking landscape. In: Proceedings of the 31st Annual ACM\/IEEE Symposium on Logic in Computer Science, pp. 31\u201345 (2016)","DOI":"10.1145\/2933575.2934574"},{"key":"13_CR32","doi-asserted-by":"publisher","unstructured":"Kumar, R., Stoelinga, M.: Quantitative security and safety analysis with attack-fault trees. In: Proceedings of the 18th IEEE International Symposium on High Assurance Systems Engineering (HASE 2017), pp. 25\u201332. HASE, IEEE, USA (2017). https:\/\/doi.org\/10.1109\/HASE.2017.12","DOI":"10.1109\/HASE.2017.12"},{"key":"13_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-642-22110-1_47","volume-title":"Computer Aided Verification","author":"M Kwiatkowska","year":"2011","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: PRISM 4.0: verification of probabilistic real-time systems. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 585\u2013591. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22110-1_47"},{"key":"13_CR34","doi-asserted-by":"crossref","unstructured":"Moszkowski, B.: A temporal logic for multi-level reasoning about hardware. Technical report, STANFORD UNIV CA (1982)","DOI":"10.21236\/ADA324174"},{"key":"13_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-319-99154-2_19","volume-title":"Quantitative Evaluation of Systems","author":"M Nauta","year":"2018","unstructured":"Nauta, M., Bucur, D., Stoelinga, M.: LIFT: learning fault trees from observational data. In: McIver, A., Horvath, A. (eds.) QEST 2018. LNCS, vol. 11024, pp. 306\u2013322. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99154-2_19"},{"key":"13_CR36","unstructured":"Nicoletti, S., Hahn, E., Stoelinga, M.: A logic to reason about fault trees. Interview Report. https:\/\/www.utwente.nl\/en\/eemcs\/fmt\/research\/files\/ft-logic-interview-domain-expert.pdf"},{"key":"13_CR37","doi-asserted-by":"publisher","unstructured":"Nicoletti, S., Hahn, E., Stoelinga, M.: BFL: a logic to reason about fault trees. In: (DSN), pp. 441\u2013452. IEEE\/EUCA (2022). https:\/\/doi.org\/10.1109\/DSN53405.2022.00051","DOI":"10.1109\/DSN53405.2022.00051"},{"issue":"2","key":"13_CR38","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1093\/logcom\/exi077","volume":"16","author":"Z Ognjanovic","year":"2006","unstructured":"Ognjanovic, Z.: Discrete linear-time probabilistic logics: completeness, decidability and complexity. J. Log. Comput. 16(2), 257\u2013285 (2006). https:\/\/doi.org\/10.1093\/logcom\/exi077","journal-title":"J. Log. Comput."},{"key":"13_CR39","doi-asserted-by":"crossref","unstructured":"Pease, A., Murray, W.: An English to logic translator for ontology-based knowledge representation languages. In: 2003 Proceedings of the International Conference on Natural Language Processing and Knowledge Engineering, pp. 777\u2013783. IEEE (2003)","DOI":"10.1109\/NLPKE.2003.1276010"},{"key":"13_CR40","doi-asserted-by":"publisher","unstructured":"Pnueli, A.: The temporal logic of programs. In: 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October\u20131 November 1977, pp. 46\u201357. IEEE Computer Society (1977). https:\/\/doi.org\/10.1109\/SFCS.1977.32","DOI":"10.1109\/SFCS.1977.32"},{"key":"13_CR41","unstructured":"Raskin, J.F.: Logics, automata and classical theories for deciding real time. Ph.D. thesis, Facult\u00e9s universitaires Notre-Dame de la Paix, Namur (1999)"},{"issue":"3","key":"13_CR42","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0951-8320(93)90060-C","volume":"40","author":"A Rauzy","year":"1993","unstructured":"Rauzy, A.: New algorithms for fault trees analysis. Reliab. Eng. Syst. Saf. 40(3), 203\u2013211 (1993). https:\/\/doi.org\/10.1016\/0951-8320(93)90060-C","journal-title":"Reliab. Eng. Syst. Saf."},{"key":"13_CR43","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.cosrev.2015.03.001","volume":"15\u201316","author":"E Ruijters","year":"2015","unstructured":"Ruijters, E., Stoelinga, M.: Fault tree analysis: a survey of the state-of-the-art in modeling, analysis and tools. Comput. Sci. Rev. 15\u201316, 29\u201362 (2015). https:\/\/doi.org\/10.1016\/j.cosrev.2015.03.001","journal-title":"Comput. Sci. Rev."},{"issue":"12","key":"13_CR44","first-page":"21","volume":"24","author":"B Schneier","year":"1999","unstructured":"Schneier, B.: Attack trees. Dr. Dobb\u2019s J. 24(12), 21\u201329 (1999)","journal-title":"Dr. Dobb\u2019s J."},{"key":"13_CR45","unstructured":"Stamatelatos, M., Vesely, W., Dugan, J., Fragola, J., Minarick, J., Railsback, J.: Fault tree handbook with aerospace applications. Prepared for NASA Office of Safety and Mission Assurance (2002)"},{"key":"13_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1007\/978-3-540-45236-2_40","volume-title":"FME 2003: Formal Methods","author":"A Thums","year":"2003","unstructured":"Thums, A., Schellhorn, G.: Model checking FTA. In: Araki, K., Gnesi, S., Mandrioli, D. (eds.) FME 2003. LNCS, vol. 2805, pp. 739\u2013757. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45236-2_40"},{"issue":"1","key":"13_CR47","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1109\/TII.2017.2710316","volume":"14","author":"M Volk","year":"2018","unstructured":"Volk, M., Junges, S., Katoen, J.: Fast dynamic fault tree analysis by model checking techniques. IEEE Trans. Ind. Inform. 14(1), 370\u2013379 (2018). https:\/\/doi.org\/10.1109\/TII.2017.2710316","journal-title":"IEEE Trans. Ind. Inform."},{"key":"13_CR48","unstructured":"Walker, M.D.: Pandora: a logic for the qualitative analysis of temporal fault trees. Ph.D. thesis, The University of Hull (2009)"},{"key":"13_CR49","unstructured":"White, C., Schwitter, R.: An update on PENG light. In: Proceedings of the Australasian Language Technology Association Workshop 2009, pp. 80\u201388 (2009)"},{"issue":"2","key":"13_CR50","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.jlp.2004.12.003","volume":"18","author":"D Yuhua","year":"2005","unstructured":"Yuhua, D., Datao, Y.: Estimation of failure probability of oil and gas transmission pipelines by fuzzy fault tree analysis. J. Loss Prev. Process Ind. 18(2), 83\u201388 (2005)","journal-title":"J. Loss Prev. Process Ind."}],"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-031-27481-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T16:23:43Z","timestamp":1729009423000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-27481-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031274800","9783031274817"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-27481-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"3 March 2023","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":"L\u00fcbeck","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 March 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 March 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fm2023.isp.uni-luebeck.de\/wordpress\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"95","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"27% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The proceedings also include 7 short industry papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}