{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T22:08:14Z","timestamp":1757455694640,"version":"3.40.3"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030171834"},{"type":"electronic","value":"9783030171841"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-17184-1_7","type":"book-chapter","created":{"date-parts":[[2019,4,6]],"date-time":"2019-04-06T17:34:04Z","timestamp":1554572044000},"page":"176-204","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Counters in Kappa: Semantics, Simulation, and Static Analysis"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Boutillier","sequence":"first","affiliation":[]},{"given":"Ioana","family":"Cristescu","sequence":"additional","affiliation":[]},{"given":"J\u00e9r\u00f4me","family":"Feret","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,6]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Behr, N., Danos, V., Garnier, I.: Stochastic mechanics of graph rewriting. In: Grohe, M., Koskinen, E., Shankar, N. (eds.) Proceedings of the 31st Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS 2016), New York, NY, USA, pp. 46\u201355. ACM (2016)","key":"7_CR1","DOI":"10.1145\/2933575.2934537"},{"doi-asserted-by":"crossref","unstructured":"Blanchet, B., et al.: A static analyzer for large safety-critical software. In: Proceedings of the ACM SIGPLAN 2003 Conference on Programming Language Design and Implementation (PLDI 2003), San Diego, California, USA, 7\u201314 June 2003, pp. 196\u2013207. ACM Press (2003)","key":"7_CR2","DOI":"10.1145\/781131.781153"},{"issue":"17","key":"7_CR3","doi-asserted-by":"publisher","first-page":"3289","DOI":"10.1093\/bioinformatics\/bth378","volume":"20","author":"ML Blinov","year":"2004","unstructured":"Blinov, M.L., Faeder, J.R., Goldstein, B., Hlavacek, W.S.: BioNetGen: software for rule-based modeling of signal transduction based on the interactions of molecular domains. Bioinformatics 20(17), 3289\u20133291 (2004)","journal-title":"Bioinformatics"},{"doi-asserted-by":"crossref","unstructured":"Bortolussi, L., et al.: CARMA: collective adaptive resource-sharing Markovian agents. In: Bertrand, N., Tribastone, M. (eds.) Proceedings of the Thirteenth Workshop on Quantitative Aspects of Programming Languages and Systems (QAPL 2015), London, UK. EPTCS, vol. 194, pp. 16\u201331 (2015)","key":"7_CR4","DOI":"10.4204\/EPTCS.194.0"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-319-99429-1_17","volume-title":"Computational Methods in Systems Biology","author":"P Boutillier","year":"2018","unstructured":"Boutillier, P., et al.: KaSa: a static analyzer for Kappa. In: \u010ce\u0161ka, M., \u0160afr\u00e1nek, D. (eds.) CMSB 2018. LNCS, vol. 11095, pp. 285\u2013291. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-99429-1_17"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-662-54434-1_8","volume-title":"Programming Languages and Systems","author":"P Boutillier","year":"2017","unstructured":"Boutillier, P., Ehrhard, T., Krivine, J.: Incremental update for graph rewriting. In: Yang, H. (ed.) ESOP 2017. LNCS, vol. 10201, pp. 201\u2013228. Springer, Heidelberg (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-662-54434-1_8"},{"key":"7_CR7","volume-title":"Program Flow Analysis: Theory and Applications","author":"P Cousot","year":"1981","unstructured":"Cousot, P.: Semantic foundations of program analysis. In: Muchnick, S.S., Jones, N.D. (eds.) Program Flow Analysis: Theory and Applications, vol. 10. Prentice-Hall Inc., Englewood Cliffs (1981)"},{"unstructured":"Cousot, P., Cousot, R.: Static determination of dynamic properties of programs. In: Proceedings of the Second International Symposium on Programming, pp. 106\u2013130. Dunod, Paris (1976)","key":"7_CR8"},{"doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Proceedings of POPL 1977. ACM Press (1977)","key":"7_CR9","DOI":"10.1145\/512950.512973"},{"issue":"4","key":"7_CR10","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1093\/logcom\/2.4.511","volume":"2","author":"P Cousot","year":"1992","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation frameworks. J. Logic Comput. 2(4), 511\u2013547 (1992)","journal-title":"J. Logic Comput."},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/3-540-55844-6_142","volume-title":"Programming Language Implementation and Logic Programming","author":"P Cousot","year":"1992","unstructured":"Cousot, P., Cousot, R.: Comparing the Galois connection and widening\/narrowing approaches to abstract interpretation. In: Bruynooghe, M., Wirsing, M. (eds.) PLILP 1992. LNCS, vol. 631, pp. 269\u2013295. Springer, Heidelberg (1992). \n                      https:\/\/doi.org\/10.1007\/3-540-55844-6_142"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-540-77505-8_23","volume-title":"Advances in Computer Science - ASIAN 2006. Secure Software and Related Issues","author":"P Cousot","year":"2007","unstructured":"Cousot, P., et al.: Combination of abstractions in the Astr\u00e9e static analyzer. In: Okada, M., Satoh, I. (eds.) ASIAN 2006. LNCS, vol. 4435, pp. 272\u2013300. Springer, Heidelberg (2007). \n                      https:\/\/doi.org\/10.1007\/978-3-540-77505-8_23"},{"doi-asserted-by":"crossref","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: Aho, A.V., Zilles, S.N., Szymanski, T.G. (eds.) Conference Record of the Fifth Annual ACM Symposium on Principles of Programming Languages, Tucson, Arizona, USA, January 1978, pp. 84\u201396. ACM Press (1978)","key":"7_CR13","DOI":"10.1145\/512760.512770"},{"unstructured":"Danos, V., et al.: Graphs, rewriting and pathway reconstruction for rule-based models. In: D\u2019Souza, D., Kavitha, T., Radhakrishnan, J. (eds.) IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012, Hyderabad, India, 15\u201317 December 2012. LIPIcs, vol. 18, pp. 276\u2013288. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2012)","key":"7_CR14"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-540-74407-8_3","volume-title":"CONCUR 2007 \u2013 Concurrency Theory","author":"V Danos","year":"2007","unstructured":"Danos, V., Feret, J., Fontana, W., Harmer, R., Krivine, J.: Rule-based modelling of cellular signalling. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol. 4703, pp. 17\u201341. Springer, Heidelberg (2007). \n                      https:\/\/doi.org\/10.1007\/978-3-540-74407-8_3"},{"doi-asserted-by":"crossref","unstructured":"Danos, V., Feret, J., Fontana, W., Harmer, R., Krivine, J.: Abstracting the differential semantics of rule-based models: exact and automated model reduction. In: Jouannaud, J.-P. (ed.) Proceedings of the Twenty-Fifth Annual IEEE Symposium on Logic in Computer Science, LICS 2010, Edinburgh, UK, 11\u201314 July 2010, pp. 362\u2013381. IEEE Computer Society (2010)","key":"7_CR16","DOI":"10.1109\/LICS.2010.44"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-540-76637-7_10","volume-title":"Programming Languages and Systems","author":"V Danos","year":"2007","unstructured":"Danos, V., Feret, J., Fontana, W., Krivine, J.: Scalable simulation of cellular signaling networks. In: Shao, Z. (ed.) APLAS 2007. LNCS, vol. 4807, pp. 139\u2013157. Springer, Heidelberg (2007). \n                      https:\/\/doi.org\/10.1007\/978-3-540-76637-7_10"},{"issue":"1","key":"7_CR18","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.tcs.2004.03.065","volume":"325","author":"V Danos","year":"2004","unstructured":"Danos, V., Laneve, C.: Formal molecular biology. Theor. Comput. Sci. 325(1), 69\u2013110 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-642-03845-7_11","volume-title":"Computational Methods in Systems Biology","author":"G Delzanno","year":"2009","unstructured":"Delzanno, G., Di Giusto, C., Gabbrielli, M., Laneve, C., Zavattaro, G.: The kappa-lattice: decidability boundaries for qualitative analysis in biological languages. In: Degano, P., Gorrieri, R. (eds.) CMSB 2009. LNCS, vol. 5688, pp. 158\u2013172. Springer, Heidelberg (2009). \n                      https:\/\/doi.org\/10.1007\/978-3-642-03845-7_11"},{"unstructured":"Dijkstra, E.W.: Over de sequentialiteit van procesbeschrijvingen. circulated privately, 1962 or 1963","key":"7_CR20"},{"unstructured":"Dijkstra, E.W.: Cooperating sequential processes. Technical report EWD-123 (1965)","key":"7_CR21"},{"doi-asserted-by":"crossref","unstructured":"Ehrig, H., et al.: Algebraic approaches to graph transformation. Part II: single pushout approach and comparison with double pushout approach. In: Handbook of Graph Grammars and Computing by Graph Transformation, pp. 247\u2013312. Springer-Verlag, New York Inc., Secaucus (1997)","key":"7_CR22","DOI":"10.1142\/9789812384720_0004"},{"issue":"2","key":"7_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S1571-0661(05)01155-2","volume":"39","author":"J Feret","year":"2001","unstructured":"Feret, J.: Occurrence counting analysis for the pi-calculus. Electron. Notes Theor. Comput. Sci. 39(2), 1\u201318 (2001). Workshop on GEometry and Topology in COncurrency theory, PennState, USA, August 21, 2000","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"1","key":"7_CR24","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.jlap.2004.01.005","volume":"63","author":"J Feret","year":"2005","unstructured":"Feret, J.: Abstract interpretation of mobile systems. J. Log. Algebr. Program. 63(1), 59\u2013130 (2005)","journal-title":"J. Log. Algebr. Program."},{"key":"7_CR25","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.entcs.2015.06.010","volume":"316","author":"J Feret","year":"2015","unstructured":"Feret, J.: An algebraic approach for inferring and using symmetries in rule-based models. Electron. Notes Theor. Comput. Sci. 316, 45\u201365 (2015)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"16","key":"7_CR26","doi-asserted-by":"publisher","first-page":"6453","DOI":"10.1073\/pnas.0809908106","volume":"106","author":"J Feret","year":"2009","unstructured":"Feret, J., Danos, V., Harmer, R., Fontana, W., Krivine, J.: Internal coarse-graining of molecular systems. PNAS 106(16), 6453\u20136458 (2009)","journal-title":"PNAS"},{"key":"7_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/3-540-48294-6_9","volume-title":"Static Analysis","author":"RR Hansen","year":"1999","unstructured":"Hansen, R.R., Jensen, J.G., Nielson, F., Nielson, H.R.: Abstract interpretation of mobile ambients. In: Cortesi, A., Fil\u00e9, G. (eds.) SAS 1999. LNCS, vol. 1694, pp. 134\u2013148. Springer, Heidelberg (1999). \n                      https:\/\/doi.org\/10.1007\/3-540-48294-6_9"},{"issue":"2","key":"7_CR28","doi-asserted-by":"publisher","first-page":"8:1","DOI":"10.1145\/2998499","volume":"27","author":"T Helms","year":"2017","unstructured":"Helms, T., Warnke, T., Maus, C., Uhrmacher, A.M.: Semantics and efficient simulation algorithms of an expressive multilevel modeling language. ACM Trans. Model. Comput. Simul. 27(2), 8:1\u20138:25 (2017)","journal-title":"ACM Trans. Model. Comput. Simul."},{"doi-asserted-by":"crossref","unstructured":"Honorato-Zimmer, R., Millar, A.J., Plotkin, G.D., Zardilis, A.: Chromar, a language of parameterised agents. Theor. Comput. Sci. (2017)","key":"7_CR29","DOI":"10.1016\/j.tcs.2017.07.034"},{"key":"7_CR30","series-title":"Monographs in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03241-1","volume-title":"Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use: Basic Concepts, Analysis Methods and Practical Use. Volume 1","author":"K Jensen","year":"1996","unstructured":"Jensen, K.: Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use: Basic Concepts, Analysis Methods and Practical Use. Volume 1. Monographs in Theoretical Computer Science. An EATCS Series, 2nd edn. Springer, Heidelberg (1996). \n                      https:\/\/doi.org\/10.1007\/978-3-662-03241-1","edition":"2"},{"key":"7_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-642-19718-5_18","volume-title":"Programming Languages and Systems","author":"M John","year":"2011","unstructured":"John, M., Lhoussaine, C., Niehren, J., Versari, C.: Biochemical reaction rules with constraints. In: Barthe, G. (ed.) ESOP 2011. LNCS, vol. 6602, pp. 338\u2013357. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-19718-5_18"},{"issue":"2","key":"7_CR32","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF00268497","volume":"6","author":"M Karr","year":"1976","unstructured":"Karr, M.: Affine relationships among variables of a program. Acta Informatica 6(2), 133\u2013151 (1976)","journal-title":"Acta Informatica"},{"key":"7_CR33","volume-title":"Introduction to Mathematics","author":"SC Kleene","year":"1952","unstructured":"Kleene, S.C.: Introduction to Mathematics. ISHI Press International, New York (1952)"},{"unstructured":"Krey\u00dfig, P.: Chemical organisation theory beyond classical models: discrete dynamics and rule-based models. Ph.D. thesis, Friedrich-Schiller-University Jena (2015)","key":"7_CR34"},{"key":"7_CR35","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/j.compbiomed.2014.07.004","volume":"53","author":"F Liu","year":"2014","unstructured":"Liu, F., Bl\u00e4tke, M.A., Heiner, M., Yang, M.: Modelling and simulating reaction-diffusion systems using coloured petri nets. Comput. Biol. Med. 53, 297\u2013308 (2014)","journal-title":"Comput. Biol. Med."},{"key":"7_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/3-540-44978-7_10","volume-title":"Programs as Data Objects","author":"A Min\u00e9","year":"2001","unstructured":"Min\u00e9, A.: A new numerical abstract domain based on difference-bound matrices. In: Danvy, O., Filinski, A. (eds.) PADO 2001. LNCS, vol. 2053, pp. 155\u2013172. Springer, Heidelberg (2001). \n                      https:\/\/doi.org\/10.1007\/3-540-44978-7_10"},{"issue":"1","key":"7_CR37","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10990-006-8609-1","volume":"19","author":"A Min\u00e9","year":"2006","unstructured":"Min\u00e9, A.: The octagon abstract domain. Higher-Order Symbolic Comput. (HOSC) 19(1), 31\u2013100 (2006)","journal-title":"Higher-Order Symbolic Comput. (HOSC)"},{"doi-asserted-by":"crossref","unstructured":"Nielson, H.R., Nielson, F.: Shape analysis for mobile ambients. In: Proceedings of POPL 2000. ACM Press (2000)","key":"7_CR38","DOI":"10.1145\/325694.325711"},{"doi-asserted-by":"crossref","unstructured":"Petrov, T., Feret, J., Koeppl, H.: Reconstructing species-based dynamics from reduced stochastic rule-based models. In: Laroque, C., Himmelspach, J., Pasupathy, R., Rose, O., Uhrmacher, A.M. (eds.) Winter Simulation Conference, WSC 2012 (2012)","key":"7_CR39","DOI":"10.1109\/WSC.2012.6465241"},{"issue":"2","key":"7_CR40","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1038\/nmeth.1546","volume":"8","author":"MW Sneddon","year":"2011","unstructured":"Sneddon, M.W., Faeder, J.R., Emonet, T.: Efficient modeling, simulation and coarse-graining of biological complexity with NFsim. Nat. Methods 8(2), 177\u2013183 (2011)","journal-title":"Nat. Methods"},{"unstructured":"Stewart, D.: Spatial biomodelling. Master thesis, School of Informatics, University of Edinburgh (2010)","key":"7_CR41"},{"issue":"2","key":"7_CR42","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A Tarski","year":"1955","unstructured":"Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pac. J. Math. 5(2), 285 (1955)","journal-title":"Pac. J. Math."},{"key":"7_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/3-540-17906-2_31","volume-title":"Petri Nets: Applications and Relationships to Other Models of Concurrency","author":"G Winskel","year":"1987","unstructured":"Winskel, G.: Event structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) ACPN 1986. LNCS, vol. 255, pp. 325\u2013392. Springer, Heidelberg (1987). \n                      https:\/\/doi.org\/10.1007\/3-540-17906-2_31"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17184-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T09:20:55Z","timestamp":1558344055000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-17184-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030171834","9783030171841"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17184-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","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":"8 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esop2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.etaps.org\/2019\/esop","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"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"86","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"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"}},{"value":"3,2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"12","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}