{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T07:28:39Z","timestamp":1750318119607,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031158384"},{"type":"electronic","value":"9783031158391"}],"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:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-15839-1_12","type":"book-chapter","created":{"date-parts":[[2022,8,28]],"date-time":"2022-08-28T18:02:38Z","timestamp":1661709758000},"page":"200-218","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Convex Zone Merging in\u00a0Parametric Timed Automata"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8473-9555","authenticated-orcid":false,"given":"\u00c9tienne","family":"Andr\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2548-6196","authenticated-orcid":false,"given":"Dylan","family":"Marinho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3154-5268","authenticated-orcid":false,"given":"Laure","family":"Petrucci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4305-0625","authenticated-orcid":false,"given":"Jaco","family":"van de Pol","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,29]]},"reference":[{"issue":"2","key":"12_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183\u2013235 (1994). https:\/\/doi.org\/10.1016\/0304-3975(94)90010-8","journal-title":"Theor. Comput. Sci."},{"key":"12_CR2","doi-asserted-by":"publisher","unstructured":"Alur, R., Henzinger, T.A., Vardi, M.Y.: Parametric real-time reasoning. In: Kosaraju, S.R., Johnson, D.S., Aggarwal, A. (eds.) STOC, pp. 592\u2013601. ACM, New York (1993). https:\/\/doi.org\/10.1145\/167088.167242","DOI":"10.1145\/167088.167242"},{"issue":"2","key":"12_CR3","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s10009-017-0467-0","volume":"21","author":"\u00c9 Andr\u00e9","year":"2017","unstructured":"Andr\u00e9, \u00c9.: What\u2019s decidable about parametric timed automata? Int. J. Softw. Tools Technol. Transfer 21(2), 203\u2013219 (2017). https:\/\/doi.org\/10.1007\/s10009-017-0467-0","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/978-3-030-81685-8_26","volume-title":"Computer Aided Verification","author":"\u00c9 Andr\u00e9","year":"2021","unstructured":"Andr\u00e9, \u00c9.: IMITATOR 3: synthesis of timing parameters beyond decidability. In: Silva, A., Leino, K.R.M. (eds.) CAV 2021. LNCS, vol. 12759, pp. 552\u2013565. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81685-8_26"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-030-72016-2_17","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"\u00c9 Andr\u00e9","year":"2021","unstructured":"Andr\u00e9, \u00c9., Arias, J., Petrucci, L., Pol, J.: Iterative bounded synthesis for efficient cycle detection in parametric timed automata. In: Groote, J.F., Larsen, K.G. (eds.) TACAS 2021. LNCS, vol. 12651, pp. 311\u2013329. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-72016-2_17"},{"issue":"5","key":"12_CR6","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1142\/S0129054109006905","volume":"20","author":"\u00c9 Andr\u00e9","year":"2009","unstructured":"Andr\u00e9, \u00c9., Chatain, T., Encrenaz, E., Fribourg, L.: An inverse method for parametric timed automata. Int. J. Found. Comput. Sci. 20(5), 819\u2013836 (2009). https:\/\/doi.org\/10.1142\/S0129054109006905","journal-title":"Int. J. Found. Comput. Sci."},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-319-02444-8_27","volume-title":"Automated Technology for Verification and Analysis","author":"\u00c9 Andr\u00e9","year":"2013","unstructured":"Andr\u00e9, \u00c9., Fribourg, L., Soulat, R.: Merge and conquer: state merging in parametric timed automata. In: Van Hung, D., Ogawa, M. (eds.) ATVA 2013. LNCS, vol. 8172, pp. 381\u2013396. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-02444-8_27"},{"key":"12_CR8","doi-asserted-by":"publisher","unstructured":"Andr\u00e9, \u00c9., Lime, D., Markey, N.: Language preservation problems in parametric timed automata. Log. Methods Comput. Sci. 16(1) (2020). https:\/\/doi.org\/10.23638\/LMCS-16(1:5)2020","DOI":"10.23638\/LMCS-16(1:5)2020"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/978-3-319-24537-9_2","volume-title":"Reachability Problems","author":"\u00c9 Andr\u00e9","year":"2015","unstructured":"Andr\u00e9, \u00c9., Lime, D., Roux, O.H.: Integer-complete synthesis for bounded parametric timed automata. In: Boja\u0144czyk, M., Lasota, S., Potapov, I. (eds.) RP 2015. LNCS, vol. 9328, pp. 7\u201319. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24537-9_2"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-030-79379-1_3","volume-title":"Tests and Proofs","author":"\u00c9 Andr\u00e9","year":"2021","unstructured":"Andr\u00e9, \u00c9., Marinho, D., van de Pol, J.: A benchmarks library for extended parametric timed automata. In: Loulergue, F., Wotawa, F. (eds.) TAP 2021. LNCS, vol. 12740, pp. 39\u201350. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79379-1_3"},{"key":"12_CR11","doi-asserted-by":"publisher","unstructured":"Andr\u00e9, \u00c9., Nguyen, H.G., Petrucci, L.: Efficient parameter synthesis using optimized state exploration strategies. In: Hu, Z., Bai, G. (eds.) ICECCS, pp. 1\u201310. IEEE (2017). https:\/\/doi.org\/10.1109\/ICECCS.2017.28","DOI":"10.1109\/ICECCS.2017.28"},{"issue":"1\u20132","key":"12_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.scico.2007.08.001","volume":"72","author":"R Bagnara","year":"2008","unstructured":"Bagnara, R., Hill, P.M., Zaffanella, E.: The Parma Polyhedra Library: toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems. Sci. Comput. Program. 72(1\u20132), 3\u201321 (2008). https:\/\/doi.org\/10.1016\/j.scico.2007.08.001","journal-title":"Sci. Comput. Program."},{"key":"12_CR13","volume-title":"Principles of Model Checking","author":"C Baier","year":"2008","unstructured":"Baier, C., Katoen, J.P.: Principles of Model Checking. MIT Press, Cambridge (2008)"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-319-99725-4_11","volume-title":"Static Analysis","author":"A Becchi","year":"2018","unstructured":"Becchi, A., Zaffanella, E.: An efficient abstract domain for not necessarily closed polyhedra. In: Podelski, A. (ed.) SAS 2018. LNCS, vol. 11002, pp. 146\u2013165. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99725-4_11"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2020.104620","volume":"275","author":"A Becchi","year":"2020","unstructured":"Becchi, A., Zaffanella, E.: PPLite: zero-overhead encoding of NNC polyhedra. Inf. Comput. 275, 1\u201336 (2020). https:\/\/doi.org\/10.1016\/j.ic.2020.104620","journal-title":"Inf. Comput."},{"issue":"3","key":"12_CR16","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/s10009-005-0190-0","volume":"8","author":"G Behrmann","year":"2006","unstructured":"Behrmann, G., Bouyer, P., Larsen, K.G., Pel\u00e1nek, R.: Lower and upper bounds in zone-based abstractions of timed automata. Int. J. Softw. Tools Technol. Transfer 8(3), 204\u2013215 (2006). https:\/\/doi.org\/10.1007\/s10009-005-0190-0","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/11817949_31","volume-title":"CONCUR 2006 \u2013 Concurrency Theory","author":"R Ben Salah","year":"2006","unstructured":"Ben Salah, R., Bozga, M., Maler, O.: On interleaving in timed automata. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 465\u2013476. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11817949_31"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-319-41591-8_12","volume-title":"Software Engineering and Formal Methods","author":"P Bezd\u011bk","year":"2016","unstructured":"Bezd\u011bk, P., Bene\u0161, N., Barnat, J., \u010cern\u00e1, I.: LTL parameter synthesis of parametric timed automata. In: De Nicola, R., K\u00fchn, E. (eds.) SEFM 2016. LNCS, vol. 9763, pp. 172\u2013187. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41591-8_12"},{"issue":"11","key":"12_CR19","doi-asserted-by":"publisher","first-page":"4018","DOI":"10.1109\/TCAD.2020.3012859","volume":"39","author":"S Bogomolov","year":"2020","unstructured":"Bogomolov, S., Forets, M., Frehse, G., Potomkin, K., Schilling, C.: Reachability analysis of linear hybrid systems via block decomposition. IEEE Trans. Comput. Aided Des. Integr. Circ. Syst. 39(11), 4018\u20134029 (2020). https:\/\/doi.org\/10.1109\/TCAD.2020.3012859","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circ. Syst."},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-642-24288-5_13","volume-title":"Reachability Problems","author":"X Chen","year":"2011","unstructured":"Chen, X., \u00c1brah\u00e1m, E., Frehse, G.: Efficient bounded reachability computation for rectangular automata. In: Delzanno, G., Potapov, I. (eds.) RP 2011. LNCS, vol. 6945, pp. 139\u2013152. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24288-5_13"},{"key":"12_CR21","doi-asserted-by":"publisher","unstructured":"Chen, X., Sankaranarayanan, S., \u00c1brah\u00e1m, E.: Under-approximate flowpipes for non-linear continuous systems. In: FMCAD, pp. 59\u201366. IEEE (2014). https:\/\/doi.org\/10.1109\/FMCAD.2014.6987596","DOI":"10.1109\/FMCAD.2014.6987596"},{"key":"12_CR22","unstructured":"David, A.: Merging DBMs efficiently. In: NWPT, pp. 54\u201356. DIKU, University of Copenhagen (2005)"},{"key":"12_CR23","doi-asserted-by":"publisher","unstructured":"Henzinger, T.A.: The theory of hybrid automata. In: Vardi, M.Y., Clarke, E.M. (eds.) LiCS, pp. 278\u2013292. IEEE Computer Society (1996). https:\/\/doi.org\/10.1109\/LICS.1996.561342","DOI":"10.1109\/LICS.1996.561342"},{"key":"12_CR24","doi-asserted-by":"publisher","unstructured":"Henzinger, T.A., Manna, Z., Pnueli, A.: Temporal proof methodologies for real-time systems. In: Wise, D.S. (ed.) POPL, pp. 353\u2013366. ACM Press (1991). https:\/\/doi.org\/10.1145\/99583.99629","DOI":"10.1145\/99583.99629"},{"key":"12_CR25","doi-asserted-by":"publisher","unstructured":"Herbreteau, F., Srivathsan, B., Tran, T.T., Walukiewicz, I.: Why liveness for timed automata is hard, and what we can do about it. ACM Trans. Comput. Log. 21(3), 17:1\u201317:28 (2020). https:\/\/doi.org\/10.1145\/3372310","DOI":"10.1145\/3372310"},{"issue":"2","key":"12_CR26","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/s10703-011-0133-1","volume":"40","author":"F Herbreteau","year":"2012","unstructured":"Herbreteau, F., Srivathsan, B., Walukiewicz, I.: Efficient emptiness check for timed B\u00fcchi automata. Formal Methods Syst. Des. 40(2), 122\u2013146 (2012). https:\/\/doi.org\/10.1007\/s10703-011-0133-1","journal-title":"Formal Methods Syst. Des."},{"key":"12_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"990","DOI":"10.1007\/978-3-642-39799-8_71","volume-title":"Computer Aided Verification","author":"F Herbreteau","year":"2013","unstructured":"Herbreteau, F., Srivathsan, B., Walukiewicz, I.: Lazy abstractions for timed automata. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 990\u20131005. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_71"},{"key":"12_CR28","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ic.2016.07.004","volume":"251","author":"F Herbreteau","year":"2016","unstructured":"Herbreteau, F., Srivathsan, B., Walukiewicz, I.: Better abstractions for timed automata. Inf. Comput. 251, 67\u201390 (2016). https:\/\/doi.org\/10.1016\/j.ic.2016.07.004","journal-title":"Inf. Comput."},{"key":"12_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-319-22975-1_9","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"F Herbreteau","year":"2015","unstructured":"Herbreteau, F., Tran, T.-T.: Improving search order for reachability testing in timed automata. In: Sankaranarayanan, S., Vicario, E. (eds.) FORMATS 2015. LNCS, vol. 9268, pp. 124\u2013139. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22975-1_9"},{"key":"12_CR30","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S1567-8326(02)00037-1","volume":"52\u201353","author":"T Hune","year":"2002","unstructured":"Hune, T., Romijn, J., Stoelinga, M., Vaandrager, F.W.: Linear parametric model checking of timed automata. J. Log. Algebraic Program. 52\u201353, 183\u2013220 (2002). https:\/\/doi.org\/10.1016\/S1567-8326(02)00037-1","journal-title":"J. Log. Algebraic Program."},{"issue":"5","key":"12_CR31","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1109\/TSE.2014.2357445","volume":"41","author":"A Jovanovi\u0107","year":"2015","unstructured":"Jovanovi\u0107, A., Lime, D., Roux, O.H.: Integer parameter synthesis for real-time systems. IEEE Trans. Softw. Eng. 41(5), 445\u2013461 (2015). https:\/\/doi.org\/10.1109\/TSE.2014.2357445","journal-title":"IEEE Trans. Softw. Eng."},{"key":"12_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1007\/978-3-642-39799-8_69","volume-title":"Computer Aided Verification","author":"A Laarman","year":"2013","unstructured":"Laarman, A., Olesen, M.C., Dalsgaard, A.E., Larsen, K.G., van de Pol, J.: Multi-core emptiness checking of timed B\u00fcchi automata using inclusion abstraction. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 968\u2013983. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_69"},{"key":"12_CR33","doi-asserted-by":"publisher","unstructured":"Nguyen, H.G., Petrucci, L., Van de Pol, J.: Layered and collecting NDFS with subsumption for parametric timed automata. In: Lin, A.W., Sun, J. (eds.) ICECCS, pp. 1\u20139. IEEE Computer Society, December 2018. https:\/\/doi.org\/10.1109\/ICECCS2018.2018.00009","DOI":"10.1109\/ICECCS2018.2018.00009"},{"key":"12_CR34","doi-asserted-by":"publisher","unstructured":"Schupp, S., Nellen, J., \u00c1brah\u00e1m, E.: Divide and conquer: variable set separation in hybrid systems reachability analysis. In: Wiklicky, H., de Vink, E.P. (eds.) QAPL@ETAPS. Electronic Proceedings in Theoretical Computer Science, vol. 250, pp. 1\u201314 (2017). https:\/\/doi.org\/10.4204\/EPTCS.250.1","DOI":"10.4204\/EPTCS.250.1"}],"container-title":["Lecture Notes in Computer Science","Formal Modeling and Analysis of Timed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15839-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T23:17:11Z","timestamp":1662074231000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15839-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031158384","9783031158391"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15839-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FORMATS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Modeling and Analysis of Timed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","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":"12 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"formats2022","order":10,"name":"conference_id","label":"Conference ID","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":"30","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":"12","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":"40% - 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":"3","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)"}}]}}