{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T04:40:44Z","timestamp":1780116044613,"version":"3.54.0"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030793784","type":"print"},{"value":"9783030793791","type":"electronic"}],"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-79379-1_3","type":"book-chapter","created":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T18:04:00Z","timestamp":1623953040000},"page":"39-50","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A Benchmarks Library for Extended Parametric 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":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2548-6196","authenticated-orcid":false,"given":"Dylan","family":"Marinho","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4305-0625","authenticated-orcid":false,"given":"Jaco","family":"van de Pol","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,6,18]]},"reference":[{"key":"3_CR1","unstructured":"JANI specification (2017). https:\/\/jani-spec.org\/"},{"key":"3_CR2","unstructured":"The IMITATOR benchmarks library v1.0 (2018). https:\/\/www.imitator.fr\/library1.html"},{"key":"3_CR3","unstructured":"ARCH benchmarks (2021). https:\/\/cps-vo.org\/group\/ARCH\/benchmarks"},{"key":"3_CR4","unstructured":"MARS repository (2021). http:\/\/www.mars-workshop.org\/repository.html"},{"key":"3_CR5","unstructured":"Model checking contest (2021). https:\/\/mcc.lip6.fr\/"},{"key":"3_CR6","unstructured":"The IMITATOR benchmarks library v2.0 (2021). https:\/\/www.imitator.fr\/static\/library2\/"},{"key":"3_CR7","doi-asserted-by":"publisher","unstructured":"Aceto, L., Bouyer, P., Burgue\u00f1o, A., Larsen, K.G.: The power of reachability testing for timed automata. TCS 300(1\u20133), 411\u2013475 (2003). https:\/\/doi.org\/10.1016\/S0304-3975(02)00334-1","DOI":"10.1016\/S0304-3975(02)00334-1"},{"key":"3_CR8","doi-asserted-by":"publisher","unstructured":"Alur, R., et al.: The algorithmic analysis of hybrid systems. TCS 138(1), 3\u201334 (1995). https:\/\/doi.org\/10.1016\/0304-3975(94)00202-T","DOI":"10.1016\/0304-3975(94)00202-T"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/3-540-57318-6_30","volume-title":"Hybrid Systems","author":"R Alur","year":"1993","unstructured":"Alur, R., Courcoubetis, C., Henzinger, T.A., Ho, P.-H.: Hybrid automata: an algorithmic approach to the specification and verification of hybrid systems. In: Grossman, R.L., Nerode, A., Ravn, A.P., Rischel, H. (eds.) HS 1991-1992. LNCS, vol. 736, pp. 209\u2013229. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57318-6_30"},{"key":"3_CR10","doi-asserted-by":"publisher","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. TCS 126(2), 183\u2013235 (1994). https:\/\/doi.org\/10.1016\/0304-3975(94)90010-8","DOI":"10.1016\/0304-3975(94)90010-8"},{"key":"3_CR11","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"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-030-17502-3_4","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E Amparore","year":"2019","unstructured":"Amparore, E., et al.: Presentation of the 9th edition of the model checking contest. In: Beyer, D., Huisman, M., Kordon, F., Steffen, B. (eds.) TACAS 2019. LNCS, vol. 11429, pp. 50\u201368. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17502-3_4"},{"key":"3_CR13","doi-asserted-by":"publisher","unstructured":"Andr\u00e9, \u00c9.: Observer patterns for real-time systems. In: Liu, Y., Martin, A. (eds.) ICECCS, pp. 125\u2013134. IEEE Computer Society, July 2013. https:\/\/doi.org\/10.1109\/ICECCS.2013.26","DOI":"10.1109\/ICECCS.2013.26"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/978-3-319-46750-4_27","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2016","author":"\u00c9 Andr\u00e9","year":"2016","unstructured":"Andr\u00e9, \u00c9.: Parametric deadlock-freeness checking timed automata. In: Sampaio, A., Wang, F. (eds.) ICTAC 2016. LNCS, vol. 9965, pp. 469\u2013478. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46750-4_27"},{"key":"3_CR15","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-030-12988-0_5","volume-title":"Formal Techniques for Safety-Critical Systems","author":"\u00c9 Andr\u00e9","year":"2019","unstructured":"Andr\u00e9, \u00c9.: A benchmark library for parametric timed model checking. In: Artho, C., \u00d6lveczky, P.C. (eds.) FTSCS 2018. CCIS, vol. 1008, pp. 75\u201383. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-12988-0_5"},{"key":"3_CR16","unstructured":"Andr\u00e9, \u00c9.: IMITATOR user manual (2021). https:\/\/github.com\/imitator-model-checker\/imitator\/releases\/download\/v3.1.0-beta\/IMITATOR-user-manual.pdf"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-030-31157-5_9","volume-title":"Tests and Proofs","author":"\u00c9 Andr\u00e9","year":"2019","unstructured":"Andr\u00e9, \u00c9., Arcaini, P., Gargantini, A., Radavelli, M.: Repairing timed automata clock guards through abstraction and testing. In: Beyer, D., Keller, C. (eds.) TAP 2019. LNCS, vol. 11823, pp. 129\u2013146. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31157-5_9"},{"key":"3_CR18","unstructured":"Andr\u00e9, \u00c9., Arias, J., Petrucci, L., van de Pol, J.: Iterative bounded synthesis for efficient cycle detection in parametric timed automata. In: Groote, J.F., Larsen, K.G. (eds.) TACAS (2021)"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-030-17465-1_12","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"\u00c9 Andr\u00e9","year":"2019","unstructured":"Andr\u00e9, \u00c9., Bloemen, V., Petrucci, L., van de Pol, J.: Minimal-time synthesis for parametric timed automata. In: Vojnar, T., Zhang, L. (eds.) TACAS 2019. LNCS, vol. 11428, pp. 211\u2013228. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17465-1_12"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-319-25423-4_21","volume-title":"Formal Methods and Software Engineering","author":"\u00c9 Andr\u00e9","year":"2015","unstructured":"Andr\u00e9, \u00c9., Coti, C., Nguyen, H.G.: Enhanced distributed behavioral cartography of parametric timed automata. In: Butler, M., Conchon, S., Za\u00efdi, F. (eds.) ICFEM 2015. LNCS, vol. 9407, pp. 319\u2013335. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-25423-4_21"},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-642-32759-9_6","volume-title":"FM 2012: Formal Methods","author":"\u00c9 Andr\u00e9","year":"2012","unstructured":"Andr\u00e9, \u00c9., Fribourg, L., K\u00fchne, U., Soulat, R.: IMITATOR 2.5: a tool for analyzing robustness in scheduling problems. In: Giannakopoulou, D., M\u00e9ry, D. (eds.) FM 2012. LNCS, vol. 7436, pp. 33\u201336. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32759-9_6"},{"key":"3_CR22","doi-asserted-by":"publisher","unstructured":"Andr\u00e9, \u00c9., Hasuo, I., Waga, M.: Offline timed pattern matching under uncertainty. In: Lin, A.W., Sun, J. (eds.) ICECCS, pp. 10\u201320. IEEE Computer Society (2018). https:\/\/doi.org\/10.1109\/ICECCS2018.2018.00010","DOI":"10.1109\/ICECCS2018.2018.00010"},{"key":"3_CR23","doi-asserted-by":"publisher","unstructured":"Andr\u00e9, \u00c9., Lime, D., Markey, N.: Language preservation problems in parametric timed automata. LMCS 16(1) (2020). https:\/\/doi.org\/10.23638\/LMCS-16(1:5)2020. https:\/\/lmcs.episciences.org\/6042","DOI":"10.23638\/LMCS-16(1:5)2020"},{"key":"3_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-319-60225-7_2","volume-title":"Formal Techniques for Distributed Objects, Components, and Systems","author":"\u00c9 Andr\u00e9","year":"2017","unstructured":"Andr\u00e9, \u00c9., Lin, S.-W.: Learning-based compositional parameter synthesis for event-recording automata. In: Bouajjani, A., Silva, A. (eds.) FORTE 2017. LNCS, vol. 10321, pp. 17\u201332. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-60225-7_2"},{"key":"3_CR25","doi-asserted-by":"publisher","unstructured":"Andr\u00e9, \u00c9., Marinho, D., van de Pol, J.: The IMITATOR benchmarks library 2.0: a benchmarks library for extended parametric timed automata, April 2021. https:\/\/doi.org\/10.5281\/zenodo.4730980","DOI":"10.5281\/zenodo.4730980"},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-319-48989-6_4","volume-title":"FM 2016: Formal Methods","author":"L A\u015ftef\u0103noaei","year":"2016","unstructured":"A\u015ftef\u0103noaei, L., Bensalem, S., Bozga, M., Cheng, C.-H., Ruess, H.: Compositional parameter synthesis. In: Fitzgerald, J., Heitmeyer, C., Gnesi, S., Philippou, A. (eds.) FM 2016. LNCS, vol. 9995, pp. 60\u201368. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48989-6_4"},{"key":"3_CR27","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"},{"key":"3_CR28","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":"3_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/3-540-44618-4_12","volume-title":"CONCUR 2000 \u2014 Concurrency Theory","author":"F Cassez","year":"2000","unstructured":"Cassez, F., Larsen, K.: The impressive power of stopwatches. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 138\u2013152. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44618-4_12"},{"key":"3_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-319-17524-9_29","volume-title":"NASA Formal Methods","author":"X Chen","year":"2015","unstructured":"Chen, X., Schupp, S., Makhlouf, I.B., \u00c1brah\u00e1m, E., Frehse, G., Kowalewski, S.: A benchmark suite for hybrid systems reachability analysis. In: Havelund, K., Holzmann, G., Joshi, R. (eds.) NFM 2015. LNCS, vol. 9058, pp. 408\u2013414. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-17524-9_29"},{"key":"3_CR31","doi-asserted-by":"publisher","unstructured":"Cimatti, A., Palopoli, L., Ramadian, Y.: Symbolic computation of schedulability regions using parametric timed automata. In: RTSS, pp. 80\u201389. IEEE Computer Society (2008). https:\/\/doi.org\/10.1109\/RTSS.2008.36","DOI":"10.1109\/RTSS.2008.36"},{"key":"3_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-540-24743-2_22","volume-title":"Hybrid Systems: Computation and Control","author":"A Fehnker","year":"2004","unstructured":"Fehnker, A., Ivan\u010di\u0107, F.: Benchmarks for hybrid systems verification. In: Alur, R., Pappas, G.J. (eds.) HSCC 2004. LNCS, vol. 2993, pp. 326\u2013341. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24743-2_22"},{"key":"3_CR33","unstructured":"Frehse, G., et al.: ARCH-COMP19 category report: hybrid systems with piecewise constant dynamics. In: ARCH@CPSIoTWeek. EPiC Series in Computing, vol. 61, pp. 1\u201313. EasyChair (2019)"},{"key":"3_CR34","doi-asserted-by":"publisher","unstructured":"Fribourg, L., K\u00fchne, U.: Parametric verification and test coverage for hybrid automata using the inverse method. Int. J. Found. Comput. Sci. 24(2), 233\u2013249 (2013). https:\/\/doi.org\/10.1142\/S0129054113400091","DOI":"10.1142\/S0129054113400091"},{"key":"3_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/3-540-60630-0_3","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"TA Henzinger","year":"1995","unstructured":"Henzinger, T.A., Ho, P.-H., Wong-Toi, H.: A user guide to HyTech. In: Brinksma, E., Cleaveland, W.R., Larsen, K.G., Margaria, T., Steffen, B. (eds.) TACAS 1995. LNCS, vol. 1019, pp. 41\u201371. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60630-0_3"},{"key":"3_CR36","unstructured":"Hoxha, B., Abbas, H., Fainekos, G.E.: Benchmarks for temporal logic requirements for automotive systems. In: Frehse, G., Althoff, M. (eds.) ARCH@CPSWeek. EPiC Series in Computing, vol. 34, pp. 25\u201330. EasyChair (2014). http:\/\/www.easychair.org\/publications\/paper\/250954"},{"key":"3_CR37","doi-asserted-by":"publisher","unstructured":"Hune, T., Romijn, J., Stoelinga, M., Vaandrager, F.W.: Linear parametric model checking of timed automata. JLAP 52\u201353, 183\u2013220 (2002). https:\/\/doi.org\/10.1016\/S1567-8326(02)00037-1","DOI":"10.1016\/S1567-8326(02)00037-1"},{"key":"3_CR38","doi-asserted-by":"publisher","unstructured":"Knapik, M., Penczek, W.: Bounded model checking for parametric timed automata. Trans. Petri Nets Other Models Concurrency 5, 141\u2013159 (2012). https:\/\/doi.org\/10.1007\/978-3-642-29072-5_6","DOI":"10.1007\/978-3-642-29072-5_6"},{"key":"3_CR39","doi-asserted-by":"publisher","unstructured":"Kwiatkowska, M.Z., Norman, G., Parker, D.: The PRISM benchmark suite. In: Ninth International Conference on Quantitative Evaluation of Systems, QEST 2012, London, United Kingdom, 17\u201320 September 2012, pp. 203\u2013204. IEEE Computer Society (2012). https:\/\/doi.org\/10.1109\/QEST.2012.14","DOI":"10.1109\/QEST.2012.14"},{"key":"3_CR40","doi-asserted-by":"publisher","unstructured":"Larsen, K.G., Pettersson, P., Yi, W.: UPPAAL in a nutshell. STTT 1(1\u20132), 134\u2013152 (1997). https:\/\/doi.org\/10.1007\/s100090050010","DOI":"10.1007\/s100090050010"},{"key":"3_CR41","doi-asserted-by":"publisher","unstructured":"Luthmann, L., Gerecht, T., Stephan, A., B\u00fcrdek, J., Lochau, M.: Minimum\/maximum delay testing of product lines with unbounded parametric real-time constraints. J. Syst. Softw. 149, 535\u2013553 (2019). https:\/\/doi.org\/10.1016\/j.jss.2018.12.028","DOI":"10.1016\/j.jss.2018.12.028"},{"key":"3_CR42","doi-asserted-by":"publisher","unstructured":"Luthmann, L., Stephan, A., B\u00fcrdek, J., Lochau, M.: Modeling and testing product lines with unbounded parametric real-time constraints. In: Cohen, M.B., et al. (eds.) SPLC, Volume A, pp. 104\u2013113. ACM (2017). https:\/\/doi.org\/10.1145\/3106195.3106204","DOI":"10.1145\/3106195.3106204"},{"key":"3_CR43","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":"3_CR44","unstructured":"Quinton, S., Vardanega, T.: 6th International Workshop on Analysis Tools and Methodologies for Embedded and Real-Time Systems (WATERS). http:\/\/waters2015.inria.fr\/"},{"key":"3_CR45","unstructured":"Shan, L., Graf, S., Quinton, S.: RTLib: A Library of Timed Automata for Modeling Real-Time Systems. Research report, Grenoble 1 UGA - Universit\u00e9 Grenoble Alpe; INRIA Grenoble - Rhone-Alpes, November 2016. https:\/\/hal.archives-ouvertes.fr\/hal-01393888"},{"key":"3_CR46","unstructured":"Sun, Y., Andr\u00e9, \u00c9., Lipari, G.: Verification of two real-time systems using parametric timed automata. In: Quinton, S., Vardanega, T. (eds.) WATERS, July 2015"}],"container-title":["Lecture Notes in Computer Science","Tests and Proofs"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-79379-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,19]],"date-time":"2021-06-19T23:05:17Z","timestamp":1624143917000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79379-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030793784","9783030793791"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79379-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"18 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TAP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Tests and Proofs","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tap2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.univ-orleans.fr\/lifo\/events\/TAP2021\/","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":"10","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":"6","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":"0","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":"60% - 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":"1.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)"}}]}}