{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T22:39:50Z","timestamp":1767911990023,"version":"3.49.0"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031131875","type":"print"},{"value":"9783031131882","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,8,6]],"date-time":"2022-08-06T00:00:00Z","timestamp":1659744000000},"content-version":"vor","delay-in-days":217,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Petri nets are one of the most prominent system-level formalisms for the specification of causality in concurrent, distributed, or multi-agent systems. This formalism is abstract enough to be analyzed using theoretical tools, and at the same time, concrete enough to eliminate ambiguities that would arise at implementation level. One interesting feature of Petri nets is that they can be studied from the point of view of true concurrency, where causal scenarios are specified using partial orders, instead of approaches based on interleaving.<\/jats:p><jats:p>On the other hand, message sequence chart (MSC) languages, are a standard formalism for the specification of causality from a purely behavioral perspective. In other words, this formalism specifies a set of causal scenarios between actions of a system, without providing any implementation-level details about the system.<\/jats:p><jats:p>In this work, we establish several new connections between MSC languages and Petri nets, and show that several computational problems involving these formalisms are decidable. Our results fill some gaps in the literature that had been open for several years. To obtain our results we develop new techniques in the realm of slice automata theory, a framework introduced one decade ago in the study of the partial order behavior of bounded Petri nets. These techniques can also be applied to establish connections between Petri nets and other well studied behavioral formalisms, such as the notion of Mazurkiewicz trace languages.<\/jats:p>","DOI":"10.1007\/978-3-031-13188-2_22","type":"book-chapter","created":{"date-parts":[[2022,8,5]],"date-time":"2022-08-05T08:16:57Z","timestamp":1659687417000},"page":"447-467","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Synthesis and Analysis of Petri Nets from Causal Specifications"],"prefix":"10.1007","author":[{"given":"Mateus","family":"de Oliveira Oliveira","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,6]]},"reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/11590156_27","volume-title":"FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science","author":"B Adsul","year":"2005","unstructured":"Adsul, B., Mukund, M., Kumar, K.N., Narayanan, V.: Causal closure for MSC languages. In: Sarukkai, S., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 335\u2013347. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11590156_27"},{"key":"22_CR2","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 1999 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"},{"issue":"2\u20133","key":"22_CR3","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF01692060","volume":"20","author":"M Bauderon","year":"1987","unstructured":"Bauderon, M., Courcelle, B.: Graph expressions and graph rewritings. Math. Syst. Theory 20(2\u20133), 83\u2013127 (1987)","journal-title":"Math. Syst. Theory"},{"issue":"9\u201310","key":"22_CR4","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1016\/j.ic.2008.03.010","volume":"206","author":"B Bollig","year":"2008","unstructured":"Bollig, B., Kuske, D.: Muller message-passing automata and logics. Inf. Comput. 206(9\u201310), 1084\u20131094 (2008)","journal-title":"Inf. Comput."},{"issue":"2\u20133","key":"22_CR5","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.tcs.2006.01.014","volume":"358","author":"B Bollig","year":"2006","unstructured":"Bollig, B., Leucker, M.: Message-passing automata are expressively equivalent to EMSO logic. Theor. Comput. Sci. 358(2\u20133), 150\u2013172 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20133","key":"22_CR6","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.tcs.2004.09.040","volume":"332","author":"FJ Brandenburg","year":"2005","unstructured":"Brandenburg, F.J., Skodinis, K.: Finite graph automata for linear and boundary graph languages. Theor. Comput. Sci. 332(1\u20133), 199\u2013232 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-540-87405-8_23","volume-title":"Graph Transformations","author":"HJS Bruggink","year":"2008","unstructured":"Bruggink, H.J.S., K\u00f6nig, B.: On the recognizability of arrow and graph languages. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol. 5214, pp. 336\u2013350. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87405-8_23"},{"issue":"1","key":"22_CR8","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0304-3975(94)90280-1","volume":"134","author":"V Diekert","year":"1994","unstructured":"Diekert, V.: A partial trace semantics for Petri Nets. Theor. Comput. Sci. 134(1), 87\u2013105 (1994)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"22_CR9","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1142\/S0129054192000218","volume":"3","author":"M Droste","year":"1992","unstructured":"Droste, M.: Concurrent automata and domains. Int. J. Found. Comput. Sci. 3(4), 389\u2013418 (1992)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1\u20132","key":"22_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(00)00166-3","volume":"247","author":"M Droste","year":"2000","unstructured":"Droste, M., Gastin, P., Kuske, D.: Asynchronous cellular automata for pomsets. Theor. Comput. Sci. 247(1\u20132), 1\u201338 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1007\/s002360050106","volume":"34","author":"J Engelfriet","year":"1997","unstructured":"Engelfriet, J., Vereijken, J.J.: Context-free graph grammars and concatenation of graphs. Acta Informatica 34, 773\u2013803 (1997)","journal-title":"Acta Informatica"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-642-02424-5_7","volume-title":"Applications and Theory of Petri Nets","author":"J Fanchon","year":"2009","unstructured":"Fanchon, J., Morin, R.: Pomset languages of finite step transition systems. In: Franceschinis, G., Wolf, K. (eds.) PETRI NETS 2009. LNCS, vol. 5606, pp. 83\u2013102. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02424-5_7"},{"key":"22_CR13","unstructured":"Gaifman, H., Pratt, V.R.: Partial order models of concurrency and the computation of functions. In: Proceedings of the 2nd Symposium on Logic in Computer Science (LICS 1987), pp. 72\u201385 (1987)"},{"issue":"6","key":"22_CR14","doi-asserted-by":"publisher","first-page":"920","DOI":"10.1016\/j.ic.2006.01.005","volume":"204","author":"B Genest","year":"2006","unstructured":"Genest, B., Kuske, D., Muscholl, A.: A Kleene theorem and model checking algorithms for existentially bounded communicating automata. Inf. Comput. 204(6), 920\u2013956 (2006)","journal-title":"Inf. Comput."},{"issue":"1\u20133","key":"22_CR15","first-page":"147","volume":"80","author":"B Genest","year":"2007","unstructured":"Genest, B., Kuske, D., Muscholl, A.: On communicating automata with bounded channels. Fundamenta Informaticae 80(1\u20133), 147\u2013167 (2007)","journal-title":"Fundamenta Informaticae"},{"issue":"4","key":"22_CR16","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1016\/j.jcss.2005.09.007","volume":"72","author":"B Genest","year":"2006","unstructured":"Genest, B., Muscholl, A., Seidl, H., Zeitoun, M.: Infinite-state high-level MSCS: model-checking and realizability. J. Comput. Syst. Sci. 72(4), 617\u2013647 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"22_CR17","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0304-3975(88)90124-7","volume":"61","author":"JL Gischer","year":"1988","unstructured":"Gischer, J.L.: The equational theory of pomsets. Theor. Comput. Sci. 61, 199\u2013224 (1988)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/BFb0036914","volume-title":"Automata, Languages and Programming","author":"U Goltz","year":"1983","unstructured":"Goltz, U., Reisig, W.: Processes of place\/transition-nets. In: Diaz, J. (ed.) ICALP 1983. LNCS, vol. 154, pp. 264\u2013277. Springer, Heidelberg (1983). https:\/\/doi.org\/10.1007\/BFb0036914"},{"issue":"1","key":"22_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2004.08.004","volume":"202","author":"JG Henriksen","year":"2005","unstructured":"Henriksen, J.G., Mukund, M., Kumar, K.N., Sohoni, M., Thiagarajan, P.: A theory of regular MSC languages. Inf. Comput. 202(1), 1\u201338 (2005)","journal-title":"Inf. Comput."},{"issue":"1","key":"22_CR20","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1006\/inco.1995.1032","volume":"117","author":"P Hoogers","year":"1995","unstructured":"Hoogers, P., Kleijn, H., Thiagarajan, P.: A trace semantics for Petri Nets. Inf. Comput. 117(1), 98\u2013114 (1995)","journal-title":"Inf. Comput."},{"key":"22_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/3-540-60043-4_59","volume-title":"Algebraic Methodology and Software Technology","author":"L Jategaonkar Jagadeesan","year":"1995","unstructured":"Jategaonkar Jagadeesan, L., Jagadeesan, R.: Causality and true concurrency: a data-flow analysis of the Pi-Calculus. In: Alagar, V.S., Nivat, M. (eds.) AMAST 1995. LNCS, vol. 936, pp. 277\u2013291. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60043-4_59"},{"key":"22_CR22","unstructured":"Kuske, D.: Contributions to a trace theory beyond Mazurkiewicz traces (2000)"},{"issue":"1","key":"22_CR23","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/S0890-5401(03)00123-8","volume":"187","author":"D Kuske","year":"2003","unstructured":"Kuske, D.: Regular sets of infinite message sequence charts. Inf. Comput. 187(1), 80\u2013109 (2003)","journal-title":"Inf. Comput."},{"issue":"2","key":"22_CR24","first-page":"187","volume":"7","author":"D Kuske","year":"2002","unstructured":"Kuske, D., Morin, R.: Pomsets for local trace languages. J. Automata Lang. Combinatorics 7(2), 187\u2013224 (2002)","journal-title":"J. Automata Lang. Combinatorics"},{"key":"22_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/3-540-63141-0_22","volume-title":"CONCUR 1997: Concurrency Theory","author":"R Langerak","year":"1997","unstructured":"Langerak, R., Brinksma, E., Katoen, J.-P.: Causal ambiguity and partial orders in event structures. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243, pp. 317\u2013331. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63141-0_22"},{"issue":"1\u20132","key":"22_CR26","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/S0304-3975(00)00031-1","volume":"237","author":"K Lodaya","year":"2000","unstructured":"Lodaya, K., Weil, P.: Series-parallel languages and the bounded-width property. Theor. Comput. Sci. 237(1\u20132), 347\u2013380 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-45294-X_22","volume-title":"FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science","author":"P Madhusudan","year":"2001","unstructured":"Madhusudan, P., Meenakshi, B.: Beyond message sequence graphs. In: Hariharan, R., Vinay, V., Mukund, M. (eds.) FSTTCS 2001. LNCS, vol. 2245, pp. 256\u2013267. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45294-X_22"},{"key":"22_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/3-540-17906-2_30","volume-title":"Petri Nets: Applications and Relationships to Other Models of Concurrency","author":"A Mazurkiewicz","year":"1987","unstructured":"Mazurkiewicz, A.: Trace theory. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) ACPN 1986. LNCS, vol. 255, pp. 278\u2013324. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-17906-2_30"},{"key":"22_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/BFb0023477","volume-title":"STACS 1997","author":"U Montanari","year":"1997","unstructured":"Montanari, U., Pistore, M.: Minimal transition systems for history-preserving bisimulation. In: Reischuk, R., Morvan, M. (eds.) STACS 1997. LNCS, vol. 1200, pp. 413\u2013425. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0023477"},{"key":"22_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/3-540-45315-6_22","volume-title":"Foundations of Software Science and Computation Structures","author":"R Morin","year":"2001","unstructured":"Morin, R.: On regular message sequence chart languages and relationships to Mazurkiewicz trace theory. In: Honsell, F., Miculan, M. (eds.) FoSSaCS 2001. LNCS, vol. 2030, pp. 332\u2013346. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45315-6_22"},{"key":"22_CR31","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":"22_CR32","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"},{"issue":"3","key":"22_CR33","doi-asserted-by":"publisher","first-page":"263","DOI":"10.3233\/FI-2010-367","volume":"105","author":"M de Oliveira Oliveira","year":"2010","unstructured":"de Oliveira Oliveira, M.: Hasse diagram generators and Petri Nets. Fundamenta Informaticae 105(3), 263\u2013289 (2010)","journal-title":"Fundamenta Informaticae"},{"key":"22_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-642-28332-1_38","volume-title":"Language and Automata Theory and Applications","author":"M Oliveira Oliveira","year":"2012","unstructured":"Oliveira Oliveira, M.: Canonizable partial order generators. In: Dediu, A.-H., Mart\u00edn-Vide, C. (eds.) LATA 2012. LNCS, vol. 7183, pp. 445\u2013457. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28332-1_38"},{"key":"22_CR35","first-page":"147","volume":"172","author":"W Thomas","year":"1992","unstructured":"Thomas, W.: Finite-state recognizability of graph properties. Theorie des Automates et Applications 172, 147\u2013159 (1992)","journal-title":"Theorie des Automates et Applications"},{"key":"22_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-55767-9","volume-title":"Modular Construction and Partial Order Semantics of Petri Nets","year":"1992","unstructured":"Vogler, W. (ed.): Modular Construction and Partial Order Semantics of Petri Nets. LNCS, vol. 625. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55767-9"},{"issue":"2","key":"22_CR37","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1051\/ita\/1987210200991","volume":"21","author":"W Zielonka","year":"1987","unstructured":"Zielonka, W.: Notes on finite asynchronous automata. RAIRO-Theor. Inform. Appl. 21(2), 99\u2013135 (1987)","journal-title":"RAIRO-Theor. Inform. Appl."}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-13188-2_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,5]],"date-time":"2022-08-05T08:22:12Z","timestamp":1659687732000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-13188-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031131875","9783031131882"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-13188-2_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"6 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Aided Verification","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Haifa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Israel","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"34","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cav2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/i-cav.org\/2022\/","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":"209","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":"40","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":"11","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":"19% - 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.9","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":"9.7","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)"}}]}}