{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:25:44Z","timestamp":1743049544045,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031067723"},{"type":"electronic","value":"9783031067730"}],"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-06773-0_25","type":"book-chapter","created":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T11:24:44Z","timestamp":1652959484000},"page":"470-488","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Exemplifying Parametric Timed Specifications over\u00a0Signals with\u00a0Bounded Behavior"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8473-9555","authenticated-orcid":false,"given":"\u00c9tienne","family":"Andr\u00e9","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9360-7490","authenticated-orcid":false,"given":"Masaki","family":"Waga","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1554-6618","authenticated-orcid":false,"given":"Natuski","family":"Urabe","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8300-4650","authenticated-orcid":false,"given":"Ichiro","family":"Hasuo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,20]]},"reference":[{"issue":"1","key":"25_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(94)00202-T","volume":"138","author":"R Alur","year":"1995","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","journal-title":"TCS"},{"issue":"2","key":"25_CR2","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. TCS 126(2), 183\u2013235 (1994). https:\/\/doi.org\/10.1016\/0304-3975(94)90010-8","journal-title":"TCS"},{"key":"25_CR3","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":"25_CR4","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":"25_CR5","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":"25_CR6","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: TACAS 2021. LNCS, vol. 12651, pp. 311\u2013329. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-72016-2_17"},{"key":"25_CR7","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"},{"issue":"5","key":"25_CR8","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":"25_CR9","doi-asserted-by":"publisher","unstructured":"Andr\u00e9, \u00c9., Lime, D.: Liveness in L\/U-parametric timed automata. In: Legay, A., Schneider, K. (eds.) ACSD, pp. 9\u201318. IEEE (2017). https:\/\/doi.org\/10.1109\/ACSD.2017.19","DOI":"10.1109\/ACSD.2017.19"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Andr\u00e9, \u00c9., Waga, M., Urabe, N., Hasuo, I.: Exemplifying parametric timed specifications over signals with bounded behavior. Technical report abs\/2203.13247, arXiv (2022). https:\/\/arxiv.org\/abs\/2203.13247","DOI":"10.1007\/978-3-031-06773-0_25"},{"issue":"2","key":"25_CR11","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1145\/506147.506151","volume":"49","author":"E Asarin","year":"2002","unstructured":"Asarin, E., Caspi, P., Maler, O.: Timed regular expressions. J. ACM 49(2), 172\u2013206 (2002). https:\/\/doi.org\/10.1145\/506147.506151","journal-title":"J. ACM"},{"key":"25_CR12","doi-asserted-by":"publisher","unstructured":"Bagnara, R., M., H.P., 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. Programm. 72(1\u20132), 3\u201321 (2008). https:\/\/doi.org\/10.1016\/j.scico.2007.08.001","DOI":"10.1016\/j.scico.2007.08.001"},{"key":"25_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/978-3-030-55754-6_25","volume-title":"NASA Formal Methods","author":"B Barbot","year":"2020","unstructured":"Barbot, B., Basset, N., Dang, T., Donz\u00e9, A., Kapinski, J., Yamaguchi, T.: Falsification of cyber-physical systems with constrained signal spaces. In: Lee, R., Jha, S., Mavridou, A., Giannakopoulou, D. (eds.) NFM 2020. LNCS, vol. 12229, pp. 420\u2013439. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-55754-6_25"},{"key":"25_CR14","doi-asserted-by":"publisher","unstructured":"Basset, N., Dang, T., Gigler, F., Mateis, C., Ni\u010dkovi\u0107, D.: Sampling of shape expressions with ShapEx. In: Arun-Kumar, S., M\u00e9ry, D., Saha, I., Zhang, L. (eds.) MEMOCODE, pp. 118\u2013125. ACM (2021). https:\/\/doi.org\/10.1145\/3487212.3487350","DOI":"10.1145\/3487212.3487350"},{"key":"25_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-319-63387-9_21","volume-title":"Computer Aided Verification","author":"T Brihaye","year":"2017","unstructured":"Brihaye, T., Geeraerts, G., Ho, H.-M., Monmege, B.: MightyL: a compositional translation from MITL to timed automata. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10426, pp. 421\u2013440. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63387-9_21"},{"key":"25_CR16","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":"25_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-030-25540-4_21","volume-title":"Computer Aided Verification","author":"A Cimatti","year":"2019","unstructured":"Cimatti, A., Griggio, A., Magnago, E., Roveri, M., Tonetta, S.: Extending nuXmv with timed transition systems and timed temporal properties. In: Dillig, I., Tasiran, S. (eds.) CAV 2019. LNCS, vol. 11561, pp. 376\u2013386. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25540-4_21"},{"key":"25_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-030-32079-9_12","volume-title":"Runtime Verification","author":"JH Dawes","year":"2019","unstructured":"Dawes, J.H., Reger, G.: Explaining violations of properties in control-flow temporal logic. In: Finkbeiner, B., Mariani, L. (eds.) RV 2019. LNCS, vol. 11757, pp. 202\u2013220. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32079-9_12"},{"key":"25_CR19","doi-asserted-by":"publisher","unstructured":"Daws, C., Yovine, S.: Two examples of verification of multirate timed automata with Kronos. In: RTSS, pp. 66\u201375. IEEE Computer Society (1995). https:\/\/doi.org\/10.1109\/REAL.1995.495197","DOI":"10.1109\/REAL.1995.495197"},{"key":"25_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-58485-4_43","volume-title":"Static Analysis","author":"N Halbwachs","year":"1994","unstructured":"Halbwachs, N., Proy, Y.-E., Raymond, P.: Verification of linear hybrid systems by means of convex approximations. In: Le Charlier, B. (ed.) SAS 1994. LNCS, vol. 864, pp. 223\u2013237. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58485-4_43"},{"key":"25_CR21","unstructured":"He, J., Bartocci, E., Ni\u010dkovi\u0107, D., Isakovic, H., Grosu, R.: From English to Signal Temporal Logic. Technical report abs\/2109.10294, arXiv (2021), https:\/\/arxiv.org\/abs\/2109.10294"},{"key":"25_CR22","doi-asserted-by":"publisher","unstructured":"Henzinger, T.A.: The theory of hybrid automata. In: LICS, pp. 278\u2013292. IEEE Computer Society (1996). https:\/\/doi.org\/10.1109\/LICS.1996.561342","DOI":"10.1109\/LICS.1996.561342"},{"key":"25_CR23","doi-asserted-by":"publisher","unstructured":"Hoxha, B., Mavridis, N., Fainekos, G.: VISPEC: a graphical tool for elicitation of MTL requirements. In: IROS, pp. 3486\u20133492. IEEE (2015). https:\/\/doi.org\/10.1109\/IROS.2015.7353863","DOI":"10.1109\/IROS.2015.7353863"},{"key":"25_CR24","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. JLAP 52\u201353, 183\u2013220 (2002). https:\/\/doi.org\/10.1016\/S1567-8326(02)00037-1","journal-title":"JLAP"},{"issue":"5","key":"25_CR25","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. TSE 41(5), 445\u2013461 (2015). https:\/\/doi.org\/10.1109\/TSE.2014.2357445","journal-title":"TSE"},{"key":"25_CR26","doi-asserted-by":"publisher","unstructured":"Kim, S.K., Carrington, D.A.: Visualization of formal specifications. In: APSEC, pp. 102\u2013109. IEEE Computer Society (1999). https:\/\/doi.org\/10.1109\/APSEC.1999.809590","DOI":"10.1109\/APSEC.1999.809590"},{"key":"25_CR27","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1007\/978-3-319-10575-8_23","volume-title":"Handbook of Model Checking","author":"RP Kurshan","year":"2018","unstructured":"Kurshan, R.P.: Transfer of model checking to industrial practice. In: Handbook of Model Checking, pp. 763\u2013793. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-10575-8_23"},{"key":"25_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-540-30206-3_12","volume-title":"Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems","author":"O Maler","year":"2004","unstructured":"Maler, O., Nickovic, D.: Monitoring temporal properties of continuous signals. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS\/FTRTFT -2004. LNCS, vol. 3253, pp. 152\u2013166. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30206-3_12"},{"key":"25_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/11867340_20","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"O Maler","year":"2006","unstructured":"Maler, O., Nickovic, D., Pnueli, A.: From MITL to timed automata. In: Asarin, E., Bouyer, P. (eds.) FORMATS 2006. LNCS, vol. 4202, pp. 274\u2013289. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11867340_20"},{"key":"25_CR30","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":"25_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-030-32079-9_17","volume-title":"Runtime Verification","author":"D Ni\u010dkovi\u0107","year":"2019","unstructured":"Ni\u010dkovi\u0107, D., Qin, X., Ferr\u00e8re, T., Mateis, C., Deshmukh, J.: Shape expressions for specifying and extracting signal features. In: Finkbeiner, B., Mariani, L. (eds.) RV 2019. LNCS, vol. 11757, pp. 292\u2013309. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32079-9_17"},{"key":"25_CR32","doi-asserted-by":"publisher","unstructured":"Pakonen, A., Buzhinsky, I., Vyatkin, V.: Counterexample visualization and explanation for function block diagrams. In: INDIN, pp. 747\u2013753. IEEE (2018). https:\/\/doi.org\/10.1109\/INDIN.2018.8472025","DOI":"10.1109\/INDIN.2018.8472025"},{"key":"25_CR33","doi-asserted-by":"publisher","unstructured":"Prabhakar, P., Lal, R., Kapinski, J.: Automatic trace generation for signal temporal logic. In: RTSS, pp. 208\u2013217. IEEE Computer Society (2018). https:\/\/doi.org\/10.1109\/RTSS.2018.00038","DOI":"10.1109\/RTSS.2018.00038"},{"key":"25_CR34","doi-asserted-by":"crossref","unstructured":"Raskin, J.F.: An introduction to hybrid automata. In: Hristu-Varsakelis, D., Levine, W.S. (eds.) Handbook of Networked and Embedded Control Systems, pp. 491\u2013518. Birkh\u00e4user (2005)","DOI":"10.1007\/0-8176-4404-0_21"},{"key":"25_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-319-63387-9_11","volume-title":"Computer Aided Verification","author":"H Roehm","year":"2017","unstructured":"Roehm, H., Heinz, T., Mayer, E.C.: STLInspector: STL validation with guarantees. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10426, pp. 225\u2013232. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63387-9_11"},{"key":"25_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-319-50230-4_13","volume-title":"Software Technologies: Applications and Foundations","author":"U Tikhonova","year":"2016","unstructured":"Tikhonova, U., Manders, M., Boudewijns, R.: Visualization of formal specifications for understanding and debugging an industrial DSL. In: Milazzo, P., Varr\u00f3, D., Wimmer, M. (eds.) STAF 2016. LNCS, vol. 9946, pp. 179\u2013195. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50230-4_13"},{"key":"25_CR37","doi-asserted-by":"publisher","unstructured":"Waga, M., Andr\u00e9, \u00c9., Hasuo, I.: Model-bounded monitoring of hybrid systems. In: Maggio, M., Weimer, J., Farque, M.A., Oishi, M. (eds.) ICCPS, pp. 21\u201332. ACM (2021). https:\/\/doi.org\/10.1145\/3450267.3450531","DOI":"10.1145\/3450267.3450531"}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06773-0_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T11:11:35Z","timestamp":1659352295000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06773-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031067723","9783031067730"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06773-0_25","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":"20 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"NASA Formal Methods Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pasadena, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"24 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nfm2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/shemesh.larc.nasa.gov\/nfm2022\/","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":"118","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":"33","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":"6","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":"28% - 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":"6.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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}