{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:15:06Z","timestamp":1762460106820,"version":"3.40.5"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031090042"},{"type":"electronic","value":"9783031090059"}],"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-09005-9_10","type":"book-chapter","created":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T23:05:55Z","timestamp":1656371155000},"page":"146-163","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Concurrencies in\u00a0Reversible Concurrent Calculi"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6346-3043","authenticated-orcid":false,"given":"Cl\u00e9ment","family":"Aubert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,28]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","unstructured":"Arpit, Kumar, D.: Calculus of concurrent probabilistic reversible processes. In: ICCCT-2017: Proceedings of the 7th International Conference on Computer and Communication Technology, pp. 34\u201340. ICCCT-2017. ACM, New York (2017). https:\/\/doi.org\/10.1145\/3154979.3155004","DOI":"10.1145\/3154979.3155004"},{"key":"10_CR2","unstructured":"Aubert, C.: Causal consistent replication in reversible concurrent calculi, October 2021. https:\/\/hal.archives-ouvertes.fr\/hal-03384482. Under revision"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Aubert, C.: Concurrencies in reversible concurrent calculi. Technical report, March 2022. https:\/\/hal.archives-ouvertes.fr\/hal-03605003","DOI":"10.1007\/978-3-031-09005-9_10"},{"key":"10_CR4","doi-asserted-by":"publisher","unstructured":"Aubert, C., Cristescu, I.: Reversible barbed congruence on configuration structures. In: Knight, S., Lluch Lafuente, A., Lanese, I., Vieira, H.T. (eds.) ICE 2015. EPTCS, vol. 189, pp. 68\u201395 (2015). https:\/\/doi.org\/10.4204\/EPTCS.189.7","DOI":"10.4204\/EPTCS.189.7"},{"issue":"1","key":"10_CR5","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.jlamp.2016.08.004","volume":"86","author":"C Aubert","year":"2017","unstructured":"Aubert, C., Cristescu, I.: Contextual equivalences in configuration structures and reversibility. J. Log. Algebr. Methods Program. 86(1), 77\u2013106 (2017). https:\/\/doi.org\/10.1016\/j.jlamp.2016.08.004","journal-title":"J. Log. Algebr. Methods Program."},{"key":"10_CR6","doi-asserted-by":"publisher","unstructured":"Aubert, C., Cristescu, I.: How reversibility can solve traditional questions: the example of hereditary history-preserving bisimulation. In: Konnov, I., Kov\u00e1cs, L. (eds.) 31st International Conference on Concurrency Theory, CONCUR 2020, 1\u20134 September 2020, Vienna, Austria. LIPIcs, vol. 2017, pp. 13:1\u201313:24. Schloss Dagstuhl (2020). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2020.13","DOI":"10.4230\/LIPIcs.CONCUR.2020.13"},{"key":"10_CR7","unstructured":"Aubert, C., Cristescu, I.: Structural equivalences for reversible calculi of communicating systems (oral communication). Research report, Augusta University (2020). https:\/\/hal.archives-ouvertes.fr\/hal-02571597. Communication at ICE 2020"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-030-79837-6_9","volume-title":"Reversible Computation","author":"C Aubert","year":"2021","unstructured":"Aubert, C., Medi\u0107, D.: Explicit identifiers and contexts in reversible concurrent calculus. In: Yamashita, S., Yokoyama, T. (eds.) RC 2021. LNCS, vol. 12805, pp. 144\u2013162. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79837-6_9"},{"key":"10_CR9","doi-asserted-by":"publisher","unstructured":"Aubert, C., Varacca, D.: Processes, systems & tests: defining contextual equivalences. In: Lange, J., Mavridou, A., Safina, L., Scalas, A. (eds.) Proceedings 14th Interaction and Concurrency Experience, Online, 18th June 2021. EPTCS, vol. 347, pp. 1\u201321. Open Publishing Association (2021). https:\/\/doi.org\/10.4204\/EPTCS.347.1","DOI":"10.4204\/EPTCS.347.1"},{"key":"10_CR10","unstructured":"Aubert, C., Varacca, D.: Processes against tests: Defining contextual equivalences. Invited submission to the Journal of Logical and Algebraic Methods in Programming (2022). https:\/\/hal.archives-ouvertes.fr\/hal-03535565"},{"issue":"2\u20133","key":"10_CR11","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.tcs.2004.07.036","volume":"335","author":"JCM Baeten","year":"2005","unstructured":"Baeten, J.C.M.: A brief history of process algebra. Theor. Comput. Sci. 335(2\u20133), 131\u2013146 (2005). https:\/\/doi.org\/10.1016\/j.tcs.2004.07.036","journal-title":"Theor. Comput. Sci."},{"key":"10_CR12","first-page":"433","volume":"11","author":"G Boudol","year":"1988","unstructured":"Boudol, G., Castellani, I.: A non-interleaving semantics for CCS based on proved transitions. Fund. Inform. 11, 433\u2013452 (1988)","journal-title":"Fund. Inform."},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/3-540-53479-2_5","volume-title":"Semantics of Systems of Concurrent Processes","author":"G Boudol","year":"1990","unstructured":"Boudol, G., Castellani, I.: Three equivalent semantics for CCS. In: Guessarian, I. (ed.) LITP 1990. LNCS, vol. 469, pp. 96\u2013141. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-53479-2_5"},{"issue":"6","key":"10_CR14","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1017\/S096012950999017X","volume":"19","author":"N Busi","year":"2009","unstructured":"Busi, N., Gabbrielli, M., Zavattaro, G.: On the expressive power of recursion, replication and iteration in process calculi. MSCS 19(6), 1191\u20131222 (2009). https:\/\/doi.org\/10.1017\/S096012950999017X","journal-title":"MSCS"},{"key":"10_CR15","doi-asserted-by":"publisher","unstructured":"Carabetta, G., Degano, P., Gadducci, F.: CCS semantics via proved transition systems and rewriting logic. In: Kirchner, C., Kirchner, H. (eds.) 1998 International Workshop on Rewriting Logic and its Applications, WRLA 1998, Abbaye des Pr\u00e9montr\u00e9s at Pont-\u00e0-Mousson, France, September 1998. Electron. Notes Theor. Comput. Sci. 15, 369\u2013387 (1998). https:\/\/doi.org\/10.1016\/S1571-0661(05)80023-4. https:\/\/www.sciencedirect.com\/journal\/electronic-notes-in- theoretical-computer-science\/vol\/15\/suppl\/C","DOI":"10.1016\/S1571-0661(05)80023-4"},{"key":"10_CR16","doi-asserted-by":"publisher","unstructured":"Cristescu, I., Krivine, J., Varacca, D.: A compositional semantics for the reversible p-calculus. In: LICS, pp. 388\u2013397. IEEE Computer Society (2013). https:\/\/doi.org\/10.1109\/LICS.2013.45","DOI":"10.1109\/LICS.2013.45"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-319-25150-9_14","volume-title":"Theoretical Aspects of Computing - ICTAC 2015","author":"ID Cristescu","year":"2015","unstructured":"Cristescu, I.D., Krivine, J., Varacca, D.: Rigid families for CCS and the $$\\pi $$-calculus. In: Leucker, M., Rueda, C., Valencia, F.D. (eds.) ICTAC 2015. LNCS, vol. 9399, pp. 223\u2013240. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-25150-9_14"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-540-28644-8_19","volume-title":"CONCUR 2004 - Concurrency Theory","author":"V Danos","year":"2004","unstructured":"Danos, V., Krivine, J.: Reversible communicating systems. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 292\u2013307. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28644-8_19"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-540-39866-0_30","volume-title":"Perspectives of System Informatics","author":"P Degano","year":"2004","unstructured":"Degano, P., Gadducci, F., Priami, C.: Causality and replication in concurrent processes. In: Broy, M., Zamulin, A.V. (eds.) PSI 2003. LNCS, vol. 2890, pp. 307\u2013318. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-39866-0_30"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/3-540-55719-9_110","volume-title":"Automata, Languages and Programming","author":"P Degano","year":"1992","unstructured":"Degano, P., Priami, C.: Proved trees. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 629\u2013640. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55719-9_110"},{"issue":"1\u20132","key":"10_CR21","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0304-3975(99)80003-6","volume":"216","author":"P Degano","year":"1999","unstructured":"Degano, P., Priami, C.: Non-interleaving semantics for mobile processes. Theor. Comput. Sci. 216(1\u20132), 237\u2013270 (1999). https:\/\/doi.org\/10.1016\/S0304-3975(99)80003-6","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"10_CR22","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1145\/384192.384194","volume":"33","author":"P Degano","year":"2001","unstructured":"Degano, P., Priami, C.: Enhanced operational semantics. ACM Comput. Surv. 33(2), 135\u2013176 (2001). https:\/\/doi.org\/10.1145\/384192.384194","journal-title":"ACM Comput. Surv."},{"key":"10_CR23","doi-asserted-by":"publisher","unstructured":"Demangeon, R., Yoshida, N.: Causal computational complexity of distributed processes. In: Dawar, A., Gr\u00e4del, E. (eds.) LICS, pp. 344\u2013353. ACM (2018). https:\/\/doi.org\/10.1145\/3209108.3209122","DOI":"10.1145\/3209108.3209122"},{"key":"10_CR24","doi-asserted-by":"publisher","unstructured":"Graversen, E., Phillips, I.C.C., Yoshida, N.: Event structure semantics of (controlled) reversible CCS. J. Log. Algebr. Methods Program. 121, 100686 (2021). https:\/\/doi.org\/10.1016\/j.jlamp.2021.100686","DOI":"10.1016\/j.jlamp.2021.100686"},{"key":"10_CR25","unstructured":"Krivine, J.: Alg\u00e8bres de Processus R\u00e9versible - Programmation Concurrente D\u00e9clarative. Ph.D. thesis, Universit\u00e9 Paris 6 & INRIA Rocquencourt (2006). https:\/\/tel.archives-ouvertes.fr\/tel-00519528"},{"key":"10_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-319-99498-7_2","volume-title":"Reversible Computation","author":"I Lanese","year":"2018","unstructured":"Lanese, I.: From reversible semantics to reversible debugging. In: Kari, J., Ulidowski, I. (eds.) RC 2018. LNCS, vol. 11106, pp. 34\u201346. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99498-7_2"},{"key":"10_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-642-37036-6_21","volume-title":"Programming Languages and Systems","author":"I Lanese","year":"2013","unstructured":"Lanese, I., Lienhardt, M., Mezzina, C.A., Schmitt, A., Stefani, J.-B.: Concurrent flexible reversibility. In: Felleisen, M., Gardner, P. (eds.) ESOP 2013. LNCS, vol. 7792, pp. 370\u2013390. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37036-6_21"},{"key":"10_CR28","doi-asserted-by":"publisher","unstructured":"Lanese, I., Medi\u0107, D., Mezzina, C.A.: Static versus dynamic reversibility in CCS. Acta Inform. (2019). https:\/\/doi.org\/10.1007\/s00236-019-00346-6","DOI":"10.1007\/s00236-019-00346-6"},{"key":"10_CR29","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2016.02.019","volume":"625","author":"I Lanese","year":"2016","unstructured":"Lanese, I., Mezzina, C.A., Stefani, J.: Reversibility in the higher-order $$\\pi $$-calculus. Theor. Comput. Sci. 625, 25\u201384 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2016.02.019","journal-title":"Theor. Comput. Sci."},{"key":"10_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-030-79837-6_8","volume-title":"Reversible Computation","author":"I Lanese","year":"2021","unstructured":"Lanese, I., Phillips, I.: Forward-reverse observational equivalences in CCSK. In: Yamashita, S., Yokoyama, T. (eds.) RC 2021. LNCS, vol. 12805, pp. 126\u2013143. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79837-6_8"},{"key":"10_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/978-3-030-45231-5_23","volume-title":"Foundations of Software Science and Computation Structures","author":"I Lanese","year":"2020","unstructured":"Lanese, I., Phillips, I., Ulidowski, I.: An axiomatic approach to reversible computation. In: FoSSaCS 2020. LNCS, vol. 12077, pp. 442\u2013461. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45231-5_23"},{"key":"10_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2020.104644","volume":"275","author":"D Medi\u0107","year":"2020","unstructured":"Medi\u0107, D., Mezzina, C.A., Phillips, I., Yoshida, N.: A parametric framework for reversible $$\\pi $$-calculi. Inf. Comput. 275, 104644 (2020). https:\/\/doi.org\/10.1016\/j.ic.2020.104644","journal-title":"Inf. Comput."},{"key":"10_CR33","doi-asserted-by":"publisher","unstructured":"Mezzina, C.A., Koutavas, V.: A safety and liveness theory for total reversibility. In: Mallet, F., Zhang, M., Madelaine, E. (eds.) 11th International Symposium on Theoretical Aspects of Software Engineering, TASE 2017, Sophia Antipolis, France, 13\u201315 September, pp. 1\u20138. IEEE (2017). https:\/\/doi.org\/10.1109\/TASE.2017.8285635. https:\/\/ieeexplore.ieee.org\/xpl\/conhome\/8277122\/proceeding","DOI":"10.1109\/TASE.2017.8285635"},{"key":"10_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communicating Systems","year":"1980","unstructured":"Milner, R. (ed.): A Calculus of Communicating Systems. LNCS, vol. 92. Springer, Heidelberg (1980). https:\/\/doi.org\/10.1007\/3-540-10235-3"},{"key":"10_CR35","unstructured":"Palamidessi, C., Valencia, F.D.: Recursion vs replication in process calculi: expressiveness. Bull. EATCS 87, 105\u2013125 (2005). http:\/\/eatcs.org\/images\/bulletin\/beatcs87.pdf"},{"issue":"1","key":"10_CR36","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.entcs.2007.08.018","volume":"192","author":"I Phillips","year":"2007","unstructured":"Phillips, I., Ulidowski, I.: Reversibility and models for concurrency. Electron. Notes Theor. Comput. Sci. 192(1), 93\u2013108 (2007). https:\/\/doi.org\/10.1016\/j.entcs.2007.08.018","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"1\u20132","key":"10_CR37","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.jlap.2006.11.002","volume":"73","author":"I Phillips","year":"2007","unstructured":"Phillips, I., Ulidowski, I.: Reversing algebraic process calculi. J. Log. Algebr. Program. 73(1\u20132), 70\u201396 (2007). https:\/\/doi.org\/10.1016\/j.jlap.2006.11.002","journal-title":"J. Log. Algebr. Program."},{"key":"10_CR38","unstructured":"Sangiorgi, D., Walker, D.: The Pi-calculus. CUP (2001)"},{"issue":"1\u20132","key":"10_CR39","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/S0304-3975(96)80710-9","volume":"170","author":"V Sassone","year":"1996","unstructured":"Sassone, V., Nielsen, M., Winskel, G.: Models for concurrency: towards a classification. Theor. Comput. Sci. 170(1\u20132), 297\u2013348 (1996). https:\/\/doi.org\/10.1016\/S0304-3975(96)80710-9","journal-title":"Theor. Comput. Sci."},{"key":"10_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-08494-7_1","volume-title":"Reversible Computation","author":"I Ulidowski","year":"2014","unstructured":"Ulidowski, I., Phillips, I., Yuen, S.: Concurrency and reversibility. In: Yamashita, S., Minato, S. (eds.) RC 2014. LNCS, vol. 8507, pp. 1\u201314. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08494-7_1"},{"issue":"1","key":"10_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40064-016-3229-7","volume":"5","author":"Y Wang","year":"2016","unstructured":"Wang, Y.: RETRACTED ARTICLE: an algebra of reversible computation. SpringerPlus 5(1), 1\u201335 (2016). https:\/\/doi.org\/10.1186\/s40064-016-3229-7","journal-title":"SpringerPlus"}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-09005-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T20:32:57Z","timestamp":1675974777000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-09005-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031090042","9783031090059"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-09005-9_10","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":"28 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reversible Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Urbino","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"5 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 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":"rc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/reversible-computation-2022.github.io\/","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":"20","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":"10","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":"50% - 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)"}},{"value":"There were 5 sub-reviewers.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}