{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,8]],"date-time":"2025-06-08T22:40:01Z","timestamp":1749422401674,"version":"3.41.0"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030780883"},{"type":"electronic","value":"9783030780890"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-78089-0_1","type":"book-chapter","created":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T14:26:35Z","timestamp":1623248795000},"page":"3-21","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On Bidirectional Runtime Enforcement"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2197-3018","authenticated-orcid":false,"given":"Luca","family":"Aceto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5845-3753","authenticated-orcid":false,"given":"Ian","family":"Cassar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3829-7391","authenticated-orcid":false,"given":"Adrian","family":"Francalanza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8362-3075","authenticated-orcid":false,"given":"Anna","family":"Ing\u00f3lfsd\u00f3ttir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,8]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-319-89366-2_11","volume-title":"Foundations of Software Science and Computation Structures","author":"L Aceto","year":"2018","unstructured":"Aceto, L., Achilleos, A., Francalanza, A., Ing\u00f3lfsd\u00f3ttir, A.: A framework for parameterized monitorability. In: Baier, C., Dal Lago, U. (eds.) FoSSaCS 2018. LNCS, vol. 10803, pp. 203\u2013220. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89366-2_11"},{"key":"1_CR2","doi-asserted-by":"publisher","unstructured":"Aceto, L., Achilleos, A., Francalanza, A., Ing\u00f3lfsd\u00f3ttir, A., Kjartansson, S.\u00d6.: Determinizing monitors for HML with recursion. J. Log. Algebraic Methods Program. 111, (2020). https:\/\/doi.org\/10.1016\/j.jlamp.2019.100515","DOI":"10.1016\/j.jlamp.2019.100515"},{"key":"1_CR3","doi-asserted-by":"publisher","unstructured":"Aceto, L., Achilleos, A., Francalanza, A., Ing\u00f3lfsd\u00f3ttir, A., Lehtinen, K.: The Best a Monitor Can Do. In: CSL. LIPIcs, vol. 183, pp. 7:1\u20137:23. Schloss Dagstuhl (2021). https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2021.7","DOI":"10.4230\/LIPIcs.CSL.2021.7"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-71500-7_1","volume-title":"Fundamental Approaches to Software Engineering","author":"L Aceto","year":"2021","unstructured":"Aceto, L., Attard, D.P., Francalanza, A., Ing\u00f3lfsd\u00f3ttir, A.: On benchmarking for concurrent runtime verification. FASE 2021. LNCS, vol. 12649, pp. 3\u201323. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-71500-7_1"},{"key":"1_CR5","doi-asserted-by":"publisher","unstructured":"Aceto, L., Cassar, I., Francalanza, A., Ing\u00f3lfsd\u00f3ttir, A.: On Runtime Enforcement via Suppressions. In: CONCUR. vol. 118, pp. 34:1\u201334:17. Schloss Dagstuhl (2018). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2018.34","DOI":"10.4230\/LIPIcs.CONCUR.2018.34"},{"key":"1_CR6","unstructured":"Aceto, L., Cassar, I., Francalanza, A., Ing\u00f3lfsd\u00f3ttir, A.: On bidirectional enforcement. Technical report Reykjavik University (2020). http:\/\/icetcs.ru.is\/theofomon\/bidirectionalRE.pdf"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/3-540-49019-1_4","volume-title":"Foundations of Software Science and Computation Structures","author":"L Aceto","year":"1999","unstructured":"Aceto, L., Ing\u00f3lfsd\u00f3ttir, A.: Testing Hennessy-Milner logic with recursion. In: Thomas, W. (ed.) FoSSaCS 1999. LNCS, vol. 1578, pp. 41\u201355. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-49019-1_4"},{"key":"1_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814105","volume-title":"Reactive Systems: Modelling, Specification and Verification","author":"L Aceto","year":"2007","unstructured":"Aceto, L., Ing\u00f3lfsd\u00f3ttir, A., Larsen, K.G., Srba, J.: Reactive Systems: Modelling, Specification and Verification. Cambridge University Press, NY, USA (2007)"},{"key":"1_CR9","doi-asserted-by":"publisher","unstructured":"Alur, R., \u010cern\u00fd, P.: Streaming Transducers for Algorithmic Verification of Single-pass List-processing Programs. In: POPL, pp. 599\u2013610. ACM (2011). https:\/\/doi.org\/10.1145\/1926385.1926454","DOI":"10.1145\/1926385.1926454"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-319-46982-9_31","volume-title":"Runtime Verification","author":"DP Attard","year":"2016","unstructured":"Attard, D.P., Francalanza, A.: A monitoring tool for a branching-time logic. In: Falcone, Y., S\u00e1nchez, C. (eds.) RV 2016. LNCS, vol. 10012, pp. 473\u2013481. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46982-9_31"},{"issue":"4","key":"1_CR11","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10207-011-0137-2","volume":"10","author":"N Bielova","year":"2011","unstructured":"Bielova, N., Massacci, F.: Do you really mean what you actually enforced?-edited automata revisited. J. Inf. Secur. 10(4), 239\u2013254 (2011). https:\/\/doi.org\/10.1007\/s10207-011-0137-2","journal-title":"J. Inf. Secur."},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.tcs.2017.02.009","volume":"669","author":"L Bocchi","year":"2017","unstructured":"Bocchi, L., Chen, T.C., Demangeon, R., Honda, K., Yoshida, N.: Monitoring networks through multiparty session types. TCS 669, 33\u201358 (2017)","journal-title":"TCS"},{"key":"1_CR13","unstructured":"Cassar, I.: Developing Theoretical Foundations for Runtime Enforcement. Ph.D. thesis, University of Malta and Reykjavik University (2021)"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Cassar, I., Francalanza, A., Aceto, L., Ing\u00f3lfsd\u00f3ttir, A.: eAOP: an aspect oriented programming framework for Erlang. In: Erlang. ACM SIGPLAN (2017)","DOI":"10.1145\/3123569.3123570"},{"key":"1_CR15","unstructured":"Cassar, I., Francalanza, A., Attard, D.P., Aceto, L., Ing\u00f3lfsd\u00f3ttir, A.: A Suite of Monitoring Tools for Erlang. In: RV-CuBES. Kalpa Publications in Computing, vol. 3, pp. 41\u201347. EasyChair (2017)"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Cassar, I., Francalanza, A., Said, S.: Improving Runtime Overheads for detectEr. In: FESCA. EPTCS, vol. 178, pp. 1\u20138 (2015)","DOI":"10.4204\/EPTCS.178.1"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-642-30065-3_2","volume-title":"Trustworthy Global Computing","author":"T-C Chen","year":"2012","unstructured":"Chen, T.-C., Bocchi, L., Deni\u00e9lou, P.-M., Honda, K., Yoshida, N.: Asynchronous distributed monitoring for multiparty session enforcement. In: Bruni, R., Sassone, V. (eds.) TGC 2011. LNCS, vol. 7173, pp. 25\u201345. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-30065-3_2"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-540-89862-7_3","volume-title":"Information Systems Security","author":"Y Falcone","year":"2008","unstructured":"Falcone, Y., Fernandez, J.-C., Mounier, L.: Synthesizing Enforcement Monitors w.r.t. the safety-progress classification of properties. In: Sekar, R., Pujari, A.K. (eds.) ICISS 2008. LNCS, vol. 5352, pp. 41\u201355. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89862-7_3"},{"issue":"3","key":"1_CR19","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s10009-011-0196-8","volume":"14","author":"Y Falcone","year":"2012","unstructured":"Falcone, Y., Fernandez, J.C., Mounier, L.: What can you verify and enforce at runtime? J. Softw. Tools Technol. Transf. 14(3), 349 (2012)","journal-title":"J. Softw. Tools Technol. Transf."},{"key":"1_CR20","doi-asserted-by":"publisher","unstructured":"Francalanza, A.: Consistently-Detecting Monitors. In: CONCUR. LIPIcs, vol. 85, pp. 8:1\u20138:19. Dagstuhl, Germany (2017). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2017.8","DOI":"10.4230\/LIPIcs.CONCUR.2017.8"},{"key":"1_CR21","doi-asserted-by":"publisher","unstructured":"Francalanza, A.: A theory of monitors. Inf. Comput 104704 (2021). https:\/\/doi.org\/10.1016\/j.ic.2021.104704","DOI":"10.1016\/j.ic.2021.104704"},{"issue":"1","key":"1_CR22","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10703-017-0273-z","volume":"51","author":"A Francalanza","year":"2017","unstructured":"Francalanza, A., Aceto, L., Ing\u00f3lfsd\u00f3ttir, A.: Monitorability for the Hennessy-Milner logic with recursion. Formal Methods Syst. Des. 51(1), 87\u2013116 (2017)","journal-title":"Formal Methods Syst. Des."},{"issue":"4","key":"1_CR23","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01213531","volume":"8","author":"M Hennessy","year":"1996","unstructured":"Hennessy, M., Lin, H.: Proof systems for message-passing process algebras. Formal Aspects Comput. 8(4), 379\u2013407 (1996). https:\/\/doi.org\/10.1007\/BF01213531","journal-title":"Formal Aspects Comput."},{"issue":"4","key":"1_CR24","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/BF01178384","volume":"32","author":"M Hennessy","year":"1995","unstructured":"Hennessy, M., Liu, X.: A modal logic for message passing processes. Acta Inf. 32(4), 375\u2013393 (1995). https:\/\/doi.org\/10.1007\/BF01178384","journal-title":"Acta Inf."},{"issue":"1","key":"1_CR25","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s10626-016-0231-8","volume":"27","author":"AC van Hulst","year":"2017","unstructured":"van Hulst, A.C., Reniers, M.A., Fokkink, W.J.: Maximally permissive controlled system synthesis for non-determinism and modal logic. Discr. Event Dyn. Syst. 27(1), 109\u2013142 (2017)","journal-title":"Discr. Event Dyn. Syst."},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Jia, L., Gommerstadt, H., Pfenning, F.: Monitors and blame assignment for higher-order session types. In: POPL, pp. 582\u2013594. ACM, NY, USA (2016)","DOI":"10.1145\/2914770.2837662"},{"issue":"1","key":"1_CR27","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cosrev.2012.01.001","volume":"6","author":"R Khoury","year":"2012","unstructured":"Khoury, R., Tawbi, N.: Which security policies are enforceable by runtime monitors? A survey. Comput. Sci. Rev. 6(1), 27\u201345 (2012). https:\/\/doi.org\/10.1016\/j.cosrev.2012.01.001","journal-title":"Comput. Sci. Rev."},{"issue":"2","key":"1_CR28","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/s10703-017-0276-9","volume":"51","author":"B K\u00f6nighofer","year":"2017","unstructured":"K\u00f6nighofer, B., et al.: Shield synthesis. Formal Methods Syst. Des. 51(2), 332\u2013361 (2017). https:\/\/doi.org\/10.1007\/s10703-017-0276-9","journal-title":"Formal Methods Syst. Des."},{"key":"1_CR29","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"DC Kozen","year":"1983","unstructured":"Kozen, D.C.: Results on the propositional $$\\mu $$-calculus. Theor. Comput. Sci. 27, 333\u2013354 (1983)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR30","doi-asserted-by":"publisher","unstructured":"Lanotte, R., Merro, M., Munteanu, A.: Runtime enforcement for control system security. In: CSF, pp. 246\u2013261. IEEE (2020). https:\/\/doi.org\/10.1109\/CSF49147.2020.00025","DOI":"10.1109\/CSF49147.2020.00025"},{"issue":"2","key":"1_CR31","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0304-3975(90)90038-J","volume":"72","author":"KG Larsen","year":"1990","unstructured":"Larsen, K.G.: Proof systems for satisfiability in Hennessy-Milner logic with recursion. Theor. Comput. Sci. 72(2), 265\u2013288 (1990). https:\/\/doi.org\/10.1016\/0304-3975(90)90038-J","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"1_CR32","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/s10207-004-0046-8","volume":"4","author":"J Ligatti","year":"2005","unstructured":"Ligatti, J., Bauer, L., Walker, D.: Edit automata: enforcement mechanisms for run-time security policies. J. Inf. Secur. 4(1), 2\u201316 (2005). https:\/\/doi.org\/10.1007\/s10207-004-0046-8","journal-title":"J. Inf. Secur."},{"issue":"3","key":"1_CR33","doi-asserted-by":"publisher","first-page":"19:1","DOI":"10.1145\/1455526.1455532","volume":"12","author":"J Ligatti","year":"2009","unstructured":"Ligatti, J., Bauer, L., Walker, D.: Run-time enforcement of nonsafety policies. ACM Trans. Inf. Syst. Secur. 12(3), 19:1\u201319:41 (2009)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"issue":"1","key":"1_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes. I. Inf. Comput. 100(1), 1\u201340 (1992). https:\/\/doi.org\/10.1016\/0890-5401(92)90008-4","journal-title":"I. Inf. Comput."},{"issue":"5s","key":"1_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3126500","volume":"16","author":"S Pinisetty","year":"2017","unstructured":"Pinisetty, S., Roop, P.S., Smyth, S., Allen, N., Tripakis, S., Hanxleden, R.V.: Runtime enforcement of cyber-physical systems. ACM Trans. Embed. Comput. Syst. 16(5s), 1\u201325 (2017)","journal-title":"ACM Trans. Embed. Comput. Syst."},{"key":"1_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/BFb0014555","volume-title":"Theoretical Aspects of Computer Software","author":"J Rathke","year":"1997","unstructured":"Rathke, J., Hennessy, M.: Local model checking for value-passing processes (extended abstract). In: Abadi, M., Ito, T. (eds.) TACS 1997. LNCS, vol. 1281, pp. 250\u2013266. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0014555"},{"key":"1_CR37","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139195218","volume-title":"Elements of Automata Theory","author":"J Sakarovitch","year":"2009","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press, New York, NY, USA (2009)"},{"key":"1_CR38","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511777110","volume-title":"Introduction to Bisimulation and Coinduction","author":"D Sangiorgi","year":"2011","unstructured":"Sangiorgi, D.: Introduction to Bisimulation and Coinduction. Cambridge University Press, New York, NY, USA (2011)"},{"issue":"1","key":"1_CR39","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/353323.353382","volume":"3","author":"FB Schneider","year":"2000","unstructured":"Schneider, F.B.: Enforceable security policies. ACM Trans. Inf. Syst. Secur. (TISSEC) 3(1), 30\u201350 (2000)","journal-title":"ACM Trans. Inf. Syst. Secur. (TISSEC)"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Distributed Objects, Components, and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-78089-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,8]],"date-time":"2025-06-08T22:03:52Z","timestamp":1749420232000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-78089-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030780883","9783030780890"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-78089-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"8 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FORTE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Techniques for Distributed Objects, Components, and Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Valletta","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Malta","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"41","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"forte2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.discotec.org\/2021\/forte","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"26","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":"9","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":"4","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":"35% - 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":"2","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":"Due to the Corona pandemic this event was held virtually.","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)"}}]}}