{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T03:10:58Z","timestamp":1780629058674,"version":"3.54.1"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030317836","type":"print"},{"value":"9783030317843","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-31784-3_27","type":"book-chapter","created":{"date-parts":[[2019,10,20]],"date-time":"2019-10-20T21:32:04Z","timestamp":1571607124000},"page":"462-478","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Deciding Fast Termination for Probabilistic VASS with Nondeterminism"],"prefix":"10.1007","author":[{"given":"Tom\u00e1\u0161","family":"Br\u00e1zdil","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Krishnendu","family":"Chatterjee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anton\u00edn","family":"Ku\u010dera","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Petr","family":"Novotn\u00fd","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dominik","family":"Velan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,10,21]]},"reference":[{"key":"27_CR1","unstructured":"de Alfaro, L.: Formal verification of probabilistic systems. Phd. thesis, Stanford University, Stanford, CA, USA (1998)"},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-662-47666-6_30","volume-title":"Automata, Languages, and Programming","author":"Benjamin Aminof","year":"2015","unstructured":"Aminof, B., Rubin, S., Zuleger, F., Spegni, F.: Liveness of parameterized timed networks. In: Proceedings of ICALP 2015, pp. 375\u2013387 (2015)"},{"issue":"04","key":"27_CR3","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1142\/S0129054111008428","volume":"22","author":"MF Atig","year":"2011","unstructured":"Atig, M.F., Habermehl, P.: On yen\u2019s path logic for petri nets. Int. J. Found. Comput. Sci. 22(04), 783\u2013799 (2011)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"27_CR4","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":"27_CR5","doi-asserted-by":"crossref","unstructured":"Barthe, G., Gaboardi, M., Gr\u00e9goire, B., Hsu, J., Strub, P.Y.: Proving differential privacy via probabilistic couplings. In: Proceedings of LICS 2016. pp. 749\u2013758. ACM, New York (2016)","DOI":"10.1145\/2933575.2934554"},{"issue":"2","key":"27_CR6","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1145\/2951860.2951873","volume":"47","author":"R Bloem","year":"2016","unstructured":"Bloem, R., et al.: Decidability in parameterized verification. SIGACT News 47(2), 53\u201364 (2016)","journal-title":"SIGACT News"},{"key":"27_CR7","first-page":"96","volume-title":"Lecture Notes in Computer Science","author":"Laura Bozzelli","year":"2011","unstructured":"Bozzelli, L., Ganty, P.: Complexity analysis of the backward coverability algorithm for VASS. In: Proceedings of RP 2011, pp. 96\u2013109 (2011)"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Br\u00e1zdil, T., Bro\u017eek, V., Chatterjee, K., Forejt, V., Ku\u010dera, A.: Markov decision processes with multiple long-run average objectives. 10(1), 1\u201329 (2014)","DOI":"10.2168\/LMCS-10(1:13)2014"},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-642-22012-8_26","volume-title":"Automata, Languages and Programming","author":"T Br\u00e1zdil","year":"2011","unstructured":"Br\u00e1zdil, T., Bro\u017eek, V., Etessami, K., Ku\u010dera, A.: Approximating the termination value of one-counter MDPs and Stochastic games. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6756, pp. 332\u2013343. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-22012-8_26"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Br\u00e1zdil, T., Chatterjee, K., Ku\u010dera, A., Novotn\u00fd, P., Velan, D., Zuleger, F.: Efficient algorithms for asymptotic bounds on termination time in VASS. In: Proceedings of LICS 2018, pp. 185\u2013194 (2018)","DOI":"10.1145\/3209108.3209191"},{"issue":"6","key":"27_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2629599","volume":"61","author":"Tom\u00e1s Br\u00e1zdil","year":"2014","unstructured":"Br\u00e1zdil, T., Kiefer, S., Ku\u010dera, A.: Efficient analysis of probabilistic programs with an unbounded counter. J. ACM 61(6) (2014)","journal-title":"Journal of the ACM"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-642-31585-5_16","volume-title":"Automata, Languages, and Programming","author":"T Br\u00e1zdil","year":"2012","unstructured":"Br\u00e1zdil, T., Ku\u010dera, A., Novotn\u00fd, P., Wojtczak, D.: Minimizing Expected termination time in one-counter Markov decision processes. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012. LNCS, vol. 7392, pp. 141\u2013152. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-31585-5_16"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Cassez, F.: Timed games for computing WCET for pipelined processors with caches. In: 2011 Eleventh International Conference on Application of Concurrency to System Design, pp. 195\u2013204, (June 2011)","DOI":"10.1109\/ACSD.2011.15"},{"key":"27_CR14","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A., Raskin, J.F.: Generalized mean-payoff and energy games. In: Proceedings of FSTTCS 2010, pp. 505\u2013516 (2010)"},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-642-40184-8_35","volume-title":"CONCUR 2013 \u2013 Concurrency Theory","author":"Krishnendu Chatterjee","year":"2013","unstructured":"Chatterjee, K., Velner, Y.: Hyperplane separation technique for multidimensional mean-payoff games. In: Proceedings of CONCUR 2013, pp. 500\u2013515 (2013)"},{"key":"27_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-319-63390-9_3","volume-title":"Computer Aided Verification","author":"K Chatterjee","year":"2017","unstructured":"Chatterjee, K., Fu, H., Goharshady, A.K.: Non-polynomial worst-case analysis of recursive programs. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10427, pp. 41\u201363. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-63390-9_3"},{"key":"27_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-319-63387-9_6","volume-title":"Computer Aided Verification","author":"K Chatterjee","year":"2017","unstructured":"Chatterjee, K., Fu, H., Murhekar, A.: Automated recurrence analysis for almost-linear expected-runtime bounds. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10426, pp. 118\u2013139. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-63387-9_6"},{"key":"27_CR18","doi-asserted-by":"crossref","unstructured":"Colcombet, T., Jurdzinski, M., Lazic, R., Schmitz, S.: Perfect half space games. In: Proceedings of LICS 2017, pp. 1\u201311 (2017)","DOI":"10.1109\/LICS.2017.8005105"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Czerwinski, W., Lasota, S., Lazic, R., Leroux, J., Mazowiecki, F.: The reachability problem for petri nets is not elementary. In: Proceedings of STOC 2019, pp. 24\u201333 (2019)","DOI":"10.1145\/3313276.3316369"},{"key":"27_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/3-540-65306-6_20","volume-title":"Lectures on Petri Nets I: Basic Models","author":"J Esparza","year":"1998","unstructured":"Esparza, J.: Decidability and complexity of Petri net problems\u2014an introduction. In: Reisig, W., Rozenberg, G. (eds.) ACPN 1996. LNCS, vol. 1491, pp. 374\u2013428. Springer, Heidelberg (1998). \nhttps:\/\/doi.org\/10.1007\/3-540-65306-6_20"},{"key":"27_CR21","doi-asserted-by":"crossref","unstructured":"Esparza, J., Ku\u010dera, A., Mayr, R.: Model-checking probabilistic pushdown automata. 2(1:2), 1\u201331 (2006)","DOI":"10.2168\/LMCS-2(1:2)2006"},{"key":"27_CR22","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/978-3-319-08867-9_40","volume-title":"Computer Aided Verification","author":"Javier Esparza","year":"2014","unstructured":"Esparza, J., Ledesma-Garza, R., Majumdar, R., Meyer, P., Niksic, F.: An smt-based approach to coverability analysis. In: Proceedings of CAV 2014, pp. 603\u2013619 (2014)"},{"key":"27_CR23","first-page":"245","volume":"52","author":"J Esparza","year":"1994","unstructured":"Esparza, J., Nielsen, M.: Decidability issues for petri nets - a survey. Bull. EATCS 52, 245\u2013262 (1994)","journal-title":"Bull. EATCS"},{"key":"27_CR24","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/2159531.2159534","volume":"13","author":"K Etessami","year":"2012","unstructured":"Etessami, K., Yannakakis, M.: Model checking of recursive probabilistic systems. ACM Trans. Comput. Log. 13, 12 (2012)","journal-title":"ACM Trans. Comput. Log."},{"key":"27_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-662-49498-1_12","volume-title":"Programming Languages and Systems","author":"N Foster","year":"2016","unstructured":"Foster, N., Kozen, D., Mamouras, K., Reitblatt, M., Silva, A.: Probabilistic NetKAT. In: Thiemann, P. (ed.) ESOP 2016. LNCS, vol. 9632, pp. 282\u2013309. Springer, Heidelberg (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-662-49498-1_12"},{"issue":"7553","key":"27_CR26","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1038\/nature14541","volume":"521","author":"Z Ghahramani","year":"2015","unstructured":"Ghahramani, Z.: Probabilistic machine learning and artificial intelligence. Nature 521(7553), 452\u2013459 (2015)","journal-title":"Nature"},{"issue":"1","key":"27_CR27","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1145\/1594834.1480898","volume":"44","author":"Sumit Gulwani","year":"2009","unstructured":"Gulwani, S., Mehra, K.K., Chilimbi, T.: Speed: precise and efficient static estimation of program computational complexity. In: Proceedings of POPL 2009. pp. 127\u2013139. ACM, New York (2009)","journal-title":"ACM SIGPLAN Notices"},{"issue":"3","key":"27_CR28","doi-asserted-by":"publisher","first-page":"14:1","DOI":"10.1145\/2362389.2362393","volume":"34","author":"J Hoffmann","year":"2012","unstructured":"Hoffmann, J., Aehlig, K., Hofmann, M.: Multivariate amortized resource analysis. ACM Trans. Prog. Lang. Syst. 34(3), 14:1\u201314:62 (2012)","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"27_CR29","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-662-47666-6_21","volume-title":"Automata, Languages, and Programming","author":"Marcin Jurdzi\u0144ski","year":"2015","unstructured":"Jurdzinski, M., Lazic, R., Schmitz, S.: Fixed-dimensional energy games are in pseudo-polynomial time. In: Proceedings of ICALP 2015, pp. 260\u2013272 (2015)"},{"issue":"3","key":"27_CR30","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s00236-018-0321-1","volume":"56","author":"BL Kaminski","year":"2019","unstructured":"Kaminski, B.L., Katoen, J., Matheja, C.: On the hardness of analyzing probabilistic programs. Acta Inf. 56(3), 255\u2013285 (2019)","journal-title":"Acta Inf."},{"issue":"5","key":"27_CR31","doi-asserted-by":"publisher","first-page":"30:1","DOI":"10.1145\/3208102","volume":"65","author":"BL Kaminski","year":"2018","unstructured":"Kaminski, B.L., Katoen, J., Matheja, C., Olmedo, F.: Weakest precondition reasoning for expected runtimes of randomized algorithms. J. ACM 65(5), 30:1\u201330:68 (2018)","journal-title":"J. ACM"},{"issue":"2","key":"27_CR32","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"RM Karp","year":"1969","unstructured":"Karp, R.M., Miller, R.E.: Parallel program schemata. J. Comput. Syst. Sci. 3(2), 147\u2013195 (1969)","journal-title":"J. Comput. Syst. Sci."},{"key":"27_CR33","doi-asserted-by":"crossref","unstructured":"Kosaraju, S.R.: Decidability of reachability in vector addition systems (preliminary version). In: Proceedings of STOC 1982, pp. 267\u2013281. ACM (1982)","DOI":"10.1145\/800070.802201"},{"key":"27_CR34","doi-asserted-by":"crossref","unstructured":"Kosaraju, S.R., Sullivan, G.F.: Detecting cycles in dynamic graphs in polynomial time. In: Proceedings of STOC 1988, pp. 398\u2013406 (1988)","DOI":"10.1145\/62212.62251"},{"issue":"1","key":"27_CR35","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1145\/1925844.1926421","volume":"46","author":"J\u00e9r\u00f4me Leroux","year":"2011","unstructured":"Leroux, J.: Vector addition system reachability problem: a short self-contained proof. In: Proceedings of POPL 2011, pp. 307\u2013316 (2011)","journal-title":"ACM SIGPLAN Notices"},{"key":"27_CR36","unstructured":"Leroux, J.: Polynomial vector addition systems with states. In: Proceedings of ICALP 2018, vol. 107, pp. 134:1\u2013134:13 (2018)"},{"key":"27_CR37","doi-asserted-by":"crossref","unstructured":"Leroux, J., Schmitz, S.: Reachability in vector addition systems is primitive-recursive in fixed dimension. In: Proceedings of LICS 2019 (2019)","DOI":"10.1109\/LICS.2019.8785796"},{"key":"27_CR38","unstructured":"Lipton, R.: The reachability problem requires exponential space. Technical Report 62 (1976)"},{"key":"27_CR39","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1137\/0213029","volume":"13","author":"E Mayr","year":"1984","unstructured":"Mayr, E.: An algorithm for the general Petri net reachability problem. SIAM J. Comput. 13, 441\u2013460 (1984)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"27_CR40","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1145\/3296979.3192394","volume":"53","author":"Van Chan Ngo","year":"2018","unstructured":"Ngo, V.C., Carbonneaux, Q., Hoffmann, J.: Bounded expectations: Resource analysis for probabilistic programs. In: Proceedings of PLDI 2018, pp. 496\u2013512. ACM, New York (2018)","journal-title":"ACM SIGPLAN Notices"},{"key":"27_CR41","doi-asserted-by":"crossref","unstructured":"Puterman, M.: Markov Decision Processes (1994)","DOI":"10.1002\/9780470316887"},{"key":"27_CR42","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(78)90036-1","volume":"6","author":"C Rackoff","year":"1978","unstructured":"Rackoff, C.: The covering and boundedness problems for vector addition systems. Theor. Comput. Sci. 6, 223\u2013231 (1978)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"27_CR43","doi-asserted-by":"publisher","first-page":"3:1","DOI":"10.1145\/2858784","volume":"8","author":"S Schmitz","year":"2016","unstructured":"Schmitz, S.: Complexity hierarchies beyond elementary. ACM Trans. Comput. Theory 8(1), 3:1\u20133:36 (2016)","journal-title":"ACM Trans. Comput. Theory"},{"key":"27_CR44","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1007\/978-3-319-08867-9_50","volume-title":"Computer Aided Verification","author":"Moritz Sinn","year":"2014","unstructured":"Sinn, M., Zuleger, F., Veith, H.: A simple and scalable static analysis for bound analysis and amortized complexity analysis. In: Proccedings of CAV 2014, pp. 745\u2013761 (2014)"},{"key":"27_CR45","volume-title":"Probabilistic Robotics (Intelligent Robotics and Autonomous Agents)","author":"S Thrun","year":"2005","unstructured":"Thrun, S., Burgard, W., Fox, D.: Probabilistic Robotics (Intelligent Robotics and Autonomous Agents). The MIT Press, Cambridge (2005)"},{"key":"27_CR46","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.ic.2015.03.001","volume":"241","author":"Y Velner","year":"2015","unstructured":"Velner, Y., Chatterjee, K., Doyen, L., Henzinger, T.A., Rabinovich, A.M., Raskin, J.: The complexity of multi-mean-payoff and multi-energy games. Inf. Comput. 241, 177\u2013196 (2015)","journal-title":"Inf. Comput."},{"issue":"3","key":"27_CR47","doi-asserted-by":"publisher","first-page":"36:1","DOI":"10.1145\/1347375.1347389","volume":"7","author":"R Wilhelm","year":"2008","unstructured":"Wilhelm, R., et al.: The worst-case execution-time problem—overview of methods and survey of tools. ACM Trans. Embed. Comput. Syst. 7(3), 36:1\u201336:53 (2008)","journal-title":"ACM Trans. Embed. Comput. Syst."},{"issue":"1","key":"27_CR48","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0890-5401(92)90059-O","volume":"96","author":"HC Yen","year":"1992","unstructured":"Yen, H.C.: A unified approach for deciding the existence of certain petri net paths. Inf. Comput. 96(1), 119\u2013137 (1992)","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-31784-3_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T13:31:06Z","timestamp":1573738266000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-31784-3_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030317836","9783030317843"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-31784-3_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"21 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ATVA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Automated Technology for Verification and Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"atva2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/atva2019.iis.sinica.edu.tw\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","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":"87","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":"29","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":"33% - 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.4","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":"Between 1 and 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)"}}]}}