{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,26]],"date-time":"2025-04-26T14:27:52Z","timestamp":1745677672586,"version":"3.40.3"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031308284"},{"type":"electronic","value":"9783031308291"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,4,21]],"date-time":"2023-04-21T00:00:00Z","timestamp":1682035200000},"content-version":"vor","delay-in-days":110,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The concept of must testing is naturally parametrised with a chosen completeness criterion, defining the complete runs of a system. Here I employ justness as this completeness criterion, instead of the traditional choice of progress. The resulting must-testing preorder is incomparable with the default one, and can be characterised as the fair failure preorder of Vogler. It also is the coarsest precongruence preserving linear time properties when assuming justness.<\/jats:p><jats:p>As my system model I here employ Petri nets with read arcs. Through their Petri net semantics, this work applies equally well to process algebras. I provide a Petri net semantics for a standard process algebra extended with signals; the read arcs are necessary to capture those signals.<\/jats:p>","DOI":"10.1007\/978-3-031-30829-1_24","type":"book-chapter","created":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T19:56:19Z","timestamp":1682020579000},"page":"498-519","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Just Testing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4712-7423","authenticated-orcid":false,"given":"Rob","family":"van Glabbeek","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,21]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Alpern, B., Schneider, F.B.: Defining liveness. Infromation Processing Letters 21(4), 181\u2013185 (1985). https:\/\/doi.org\/10.1016\/0020-0190(85)90056-0","key":"24_CR1","DOI":"10.1016\/0020-0190(85)90056-0"},{"doi-asserted-by":"publisher","unstructured":"Apt, K.R., Francez, N., Katz, S.: Appraising fairness in languages for distributed programming. Distributed Computing 2(4), 226\u2013241 (1988). https:\/\/doi.org\/10.1007\/BF01872848","key":"24_CR2","DOI":"10.1007\/BF01872848"},{"doi-asserted-by":"publisher","unstructured":"Bergstra, J.A.: ACP with signals. In: Grabowski, J., Lescanne, P., Wechler, W. (eds.) Proc. International Workshop on Algebraic and Logic Programming. LNCS, vol.\u00a0343, pp. 11\u201320. Springer (1988). https:\/\/doi.org\/10.1007\/3-540-50667-5_53","key":"24_CR3","DOI":"10.1007\/3-540-50667-5_53"},{"doi-asserted-by":"publisher","unstructured":"Bergstra, J.A., Klop, J.W.: Algebra of communicating processes with abstraction. Theor. Comput. Sci. 37(1), 77\u2013121 (1985). https:\/\/doi.org\/10.1016\/0304-3975(85)90088-X","key":"24_CR4","DOI":"10.1016\/0304-3975(85)90088-X"},{"doi-asserted-by":"publisher","unstructured":"Brinksma, E., Rensink, A., Vogler, W.: Fair testing. In: Lee, I., Smolka, S.A. (eds.) Proc. 6th International Conference on Concurrency Theory, CONCUR\u201995. LNCS, vol.\u00a0962, pp. 313\u2013327. Springer (1995). https:\/\/doi.org\/10.1007\/3-540-60218-6_23","key":"24_CR5","DOI":"10.1007\/3-540-60218-6_23"},{"doi-asserted-by":"publisher","unstructured":"Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes. J.\u00a0ACM 31(3), 560\u2013599 (1984). https:\/\/doi.org\/10.1145\/828.833","key":"24_CR6","DOI":"10.1145\/828.833"},{"doi-asserted-by":"publisher","unstructured":"Busi, N., Pinna, G.M.: Non sequential semantics for contextual P\/T nets. In: Billington, J., Reisig, W. (eds.) Proc. 17th Int. Conf. on Application and Theory of Petri Nets. LNCS, vol.\u00a01091, pp. 113\u2013132. Springer (1996). https:\/\/doi.org\/10.1007\/3-540-61363-3_7","key":"24_CR7","DOI":"10.1007\/3-540-61363-3_7"},{"doi-asserted-by":"publisher","unstructured":"Corradini, F., Di Berardini, M.R., Vogler, W.: Time and fairness in a process algebra with non-blocking reading. In: Nielsen, M., Kucera, A., Miltersen, P.B., Palamidessi, C., Tuma, P., Valencia, F.D. (eds.) Theory and Practice of Computer Science, SOFSEM\u201909. LNCS, vol.\u00a05404, pp. 193\u2013204. Springer (2009). https:\/\/doi.org\/10.1007\/978-3-540-95891-8_20","key":"24_CR8","DOI":"10.1007\/978-3-540-95891-8_20"},{"doi-asserted-by":"publisher","unstructured":"De\u00a0Nicola, R., Hennessy, M.: Testing equivalences for processes. Theor. Comput. Sci. 34, 83\u2013133 (1984). https:\/\/doi.org\/10.1016\/0304-3975(84)90113-0","key":"24_CR9","DOI":"10.1016\/0304-3975(84)90113-0"},{"doi-asserted-by":"publisher","unstructured":"Degano, P., De Nicola, R., Montanari, U.: CCS is an (augmented) contact free C\/E system. In: Venturini Zilli, M. (ed.) Advanced School on Mathematical Models for the Semantics of Parallelism, 1986. LNCS, vol.\u00a0280, pp. 144\u2013165. Springer (1987). https:\/\/doi.org\/10.1007\/3-540-18419-8_13","key":"24_CR10","DOI":"10.1007\/3-540-18419-8_13"},{"doi-asserted-by":"publisher","unstructured":"Dyseryn, V., van Glabbeek, R.J., H\u00f6fner, P.: Analysing mutual exclusion using process algebra with signals. In: Peters, K., Tini, S. (eds.) Proceedings Combined 24th International Workshop on Expressiveness in Concurrency and 14th Workshop on Structural Operational Semantics. EPTCS, vol.\u00a0255, pp. 18\u201334 (2017). https:\/\/doi.org\/10.4204\/EPTCS.255.2","key":"24_CR11","DOI":"10.4204\/EPTCS.255.2"},{"doi-asserted-by":"publisher","unstructured":"van Glabbeek, R.J.: The linear time \u2013 branching time spectrum II; the semantics of sequential systems with silent moves. In: Best, E. (ed.) Proc. CONCUR\u201993, 4$$^{th}$$ Int. Conf. on Concurrency Theory. LNCS, vol.\u00a0715, pp. 66\u201381. Springer (1993). https:\/\/doi.org\/10.1007\/3-540-57208-2_6","key":"24_CR12","DOI":"10.1007\/3-540-57208-2_6"},{"doi-asserted-by":"publisher","unstructured":"van Glabbeek, R.J.: A characterisation of weak bisimulation congruence. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de\u00a0Vrijer, R. (eds.) Processes, Terms and Cycles: Steps on the Road to Infinity: Essays Dedicated to Jan Willem Klop on the Occasion of His 60th Birthday. LNCS, vol.\u00a03838, pp. 26\u201339. Springer (2005). https:\/\/doi.org\/10.1007\/11601548_4","key":"24_CR13","DOI":"10.1007\/11601548_4"},{"doi-asserted-by":"publisher","unstructured":"van Glabbeek, R.J.: The individual and collective token interpretations of Petri nets. In: Abadi, M., de\u00a0Alfaro, L. (eds.) Proc. CONCUR\u201905, 16$$^{th}$$ Int. Conf. on Concurrency Theory. LNCS, vol.\u00a03653, pp. 323\u2013337. Springer (2005). https:\/\/doi.org\/10.1007\/11539452_26","key":"24_CR14","DOI":"10.1007\/11539452_26"},{"doi-asserted-by":"publisher","unstructured":"van Glabbeek, R.J.: The coarsest precongruences respecting safety and liveness properties. In: Calude, C., Sassone, V. (eds.) Proc. 6th IFIP TC 1\/WG 2.2 Int. Conf. on Theoretical Computer Science, TCS\u201910; held as part of the World Computer Congress. IFIP, vol.\u00a0323, pp. 32\u201352. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-642-15240-5_3, http:\/\/arxiv.org\/abs\/1007.5491","key":"24_CR15","DOI":"10.1007\/978-3-642-15240-5_3"},{"doi-asserted-by":"publisher","unstructured":"van Glabbeek, R.J.: Structure preserving bisimilarity, supporting an operational petri net semantics of CCSP. In: Meyer, R., Platzer, A., Wehrheim, H. (eds.) Proceedings Correct System Design - Symposium in Honor of Ernst-R\u00fcdiger Olderog on the Occasion of His 60th Birthday. LNCS, vol.\u00a09360, pp. 99\u2013130. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-319-23506-6_9, http:\/\/arxiv.org\/abs\/1509.05842","key":"24_CR16","DOI":"10.1007\/978-3-319-23506-6_9"},{"doi-asserted-by":"publisher","unstructured":"van Glabbeek, R.J.: Ensuring liveness properties of distributed systems: Open problems. Journal of Logical and Algebraic Methods in Programming 109, 100480 (2019). https:\/\/doi.org\/10.1016\/j.jlamp.2019.100480","key":"24_CR17","DOI":"10.1016\/j.jlamp.2019.100480"},{"doi-asserted-by":"publisher","unstructured":"van Glabbeek, R.J.: Justness: A completeness criterion for capturing liveness properties. In: Boja\u0144czyk, M., Simpson, A. (eds.) Proc. 22st Int. Conf. on Foundations of Software Science and Computation Structures, FoSSaCS\u201919; held as part of ETAPS\u201919. LNCS, vol. 11425, pp. 505\u2013522. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-17127-8_29, https:\/\/arxiv.org\/abs\/1909.00286","key":"24_CR18","DOI":"10.1007\/978-3-030-17127-8_29"},{"doi-asserted-by":"publisher","unstructured":"van Glabbeek, R.J.: Reward testing equivalences for processes. In: Boreale, M., Corradini, F., Loreti, M., Pugliese, R. (eds.) Models, Languages, and Tools for Concurrent and Distributed Programming, Essays Dedicated to Rocco De Nicola on the occasion of his 65th Birthday, LNCS, vol. 11665, pp. 45\u201370. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-21485-2_5, https:\/\/arxiv.org\/abs\/1907.13348","key":"24_CR19","DOI":"10.1007\/978-3-030-21485-2_5"},{"doi-asserted-by":"publisher","unstructured":"van Glabbeek, R.J.: Reactive temporal logic. In: Dardha, O., Rot, J. (eds.) Proc. Combined 27th Int. Workshop on Expressiveness in Concurrency and 17th Workshop on Structural Operational Semantics. EPTCS, vol.\u00a0322, pp. 51\u201368 (2020). https:\/\/doi.org\/10.4204\/EPTCS.322.6","key":"24_CR20","DOI":"10.4204\/EPTCS.322.6"},{"unstructured":"van Glabbeek, R.J.: Modelling mutual exclusion in a process algebra with time-outs (2021), https:\/\/arxiv.org\/abs\/2106.12785","key":"24_CR21"},{"unstructured":"van Glabbeek, R.J.: Just Testing (2022), version of this paper extended with four appendices, https:\/\/arxiv.org\/abs\/2212.08829","key":"24_CR22"},{"doi-asserted-by":"publisher","unstructured":"van Glabbeek, R.J., Goltz, U., Schicke, J.W.: Abstract processes of place\/transition systems. Information Processing Letters 111(13), 626\u2013633 (2011). https:\/\/doi.org\/10.1016\/j.ipl.2011.03.013, https:\/\/arxiv.org\/abs\/1103.5916","key":"24_CR23","DOI":"10.1016\/j.ipl.2011.03.013"},{"doi-asserted-by":"publisher","unstructured":"van Glabbeek, R.J., H\u00f6fner, P.: CCS: it\u2019s not fair! \u2013 fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions. Acta Informatica 52(2-3), 175\u2013205 (2015). https:\/\/doi.org\/10.1007\/s00236-015-0221-6, https:\/\/arxiv.org\/abs\/1505.05964","key":"24_CR24","DOI":"10.1007\/s00236-015-0221-6"},{"doi-asserted-by":"publisher","unstructured":"van Glabbeek, R.J., H\u00f6fner, P.: Progress, justness and fairness. ACM Computing Surveys 52(4), 69 (August 2019). https:\/\/doi.org\/10.1145\/3329125, https:\/\/arxiv.org\/abs\/1810.07414","key":"24_CR25","DOI":"10.1145\/3329125"},{"doi-asserted-by":"publisher","unstructured":"van Glabbeek, R.J., H\u00f6fner, P., Wang, W.: Enabling preserving bisimulation equivalence. In: Haddad, S., Varacca, D. (eds.) Proc. 32nd Int. Conference on Concurrency Theory, CONCUR\u201921. Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0203. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2021.33, https:\/\/arxiv.org\/abs\/2108.00142","key":"24_CR26","DOI":"10.4230\/LIPIcs.CONCUR.2021.33"},{"doi-asserted-by":"publisher","unstructured":"van Glabbeek, R.J., Vaandrager, F.W.: Petri net models for algebraic theories of concurrency. In: Bakker, J.W.d., Nijman, A.J., Treleaven, P.C. (eds.) Proc. PARLE, Parallel Architectures and Languages Europe, Vol. II. LNCS, vol.\u00a0259, pp. 224\u2013242. Springer (1987). https:\/\/doi.org\/10.1007\/3-540-17945-3_13","key":"24_CR27","DOI":"10.1007\/3-540-17945-3_13"},{"doi-asserted-by":"publisher","unstructured":"Goltz, U.: CCS and Petri nets. In: Guessarian, I. (ed.) Proc. Semantics of Systems of Concurrent Processes, LITP Spring School on Theoretical Computer Science. LNCS, vol.\u00a0469, pp. 334\u2013357. Springer (1990). https:\/\/doi.org\/10.1007\/3-540-53479-2_14","key":"24_CR28","DOI":"10.1007\/3-540-53479-2_14"},{"doi-asserted-by":"publisher","unstructured":"Goltz, U., Mycroft, A.: On the relationship of CCS and Petri nets. In: Paredaens, J. (ed.) Proc. $$11^{th}$$ Colloquium on Automata, Languages and Programming, ICALP84. LNCS, vol.\u00a0172, pp. 196\u2013208. Springer (1984). https:\/\/doi.org\/10.1007\/3-540-13345-3_18","key":"24_CR29","DOI":"10.1007\/3-540-13345-3_18"},{"doi-asserted-by":"publisher","unstructured":"Kaivola, R., Valmari, A.: The weakest compositional semantic equivalence preserving nexttime-less linear temporal logic. In: Cleaveland, R. (ed.) Proc. CONCUR\u201992. LNCS, vol.\u00a0630, pp. 207\u2013221. Springer (1992). https:\/\/doi.org\/10.1007\/BFb0084793","key":"24_CR30","DOI":"10.1007\/BFb0084793"},{"doi-asserted-by":"publisher","unstructured":"Kindler, E., Walter, R.: Mutex needs fairness. Inf. Process. Lett. 62(1), 31\u201339 (1997). https:\/\/doi.org\/10.1016\/S0020-0190(97)00033-1","key":"24_CR31","DOI":"10.1016\/S0020-0190(97)00033-1"},{"doi-asserted-by":"publisher","unstructured":"Lamport, L.: Proving the correctness of multiprocess programs. IEEE Transactions on Software Engineering 3(2), 125\u2013143 (1977). https:\/\/doi.org\/10.1109\/TSE.1977.229904","key":"24_CR32","DOI":"10.1109\/TSE.1977.229904"},{"doi-asserted-by":"publisher","unstructured":"Lamport, L.: Fairness and hyperfairness. Distributed Computing 13(4), 239\u2013245 (2000). https:\/\/doi.org\/10.1007\/PL00008921","key":"24_CR33","DOI":"10.1007\/PL00008921"},{"doi-asserted-by":"crossref","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall (1989), alternatively see A Calculus of Communicating Systems, LNCS 92, Springer, 1980, https:\/\/doi.org\/10.1007\/3-540-10235-3","key":"24_CR34","DOI":"10.1007\/3-540-10235-3"},{"doi-asserted-by":"publisher","unstructured":"Montanari, U., Rossi, F.: Contextual nets. Acta Informatica 32(6), 545\u2013596 (1995). https:\/\/doi.org\/10.1007\/BF01178907","key":"24_CR35","DOI":"10.1007\/BF01178907"},{"doi-asserted-by":"publisher","unstructured":"Natarajan, V., Cleaveland, R.: Divergence and fair testing. In: F\u00fcl\u00f6p, Z., G\u00e9cseg, F. (eds.) Proc. 22nd Int. Colloquium on Automata, Languages and Programming, ICALP\u201995. LNCS, vol.\u00a0944, pp. 648\u2013659. Springer (1995). https:\/\/doi.org\/10.1007\/3-540-60084-1_112","key":"24_CR36","DOI":"10.1007\/3-540-60084-1_112"},{"doi-asserted-by":"publisher","unstructured":"Olderog, E.R.: Operational Petri net semantics for CCSP. In: Rozenberg, G. (ed.) Advances in Petri Nets 1987. LNCS, vol.\u00a0266, pp. 196\u2013223. Springer (1987). https:\/\/doi.org\/10.1007\/3-540-18086-9_27","key":"24_CR37","DOI":"10.1007\/3-540-18086-9_27"},{"doi-asserted-by":"crossref","unstructured":"Olderog, E.R.: Nets, Terms and Formulas: Three Views of Concurrent Processes and Their Relationship. Cambridge Tracts in Theoretical Computer Science 23, Cambridge University Press (1991)","key":"24_CR38","DOI":"10.1017\/CBO9780511526589"},{"doi-asserted-by":"publisher","unstructured":"Olderog, E.R., Hoare, C.A.R.: Specification-oriented semantics for communicating processes. Acta Inf. 23, 9\u201366 (1986). https:\/\/doi.org\/10.1007\/BF00268075","key":"24_CR39","DOI":"10.1007\/BF00268075"},{"doi-asserted-by":"publisher","unstructured":"Reisig, W.: Understanding Petri Nets \u2014 Modeling Techniques, Analysis Methods, Case Studies. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-33278-4","key":"24_CR40","DOI":"10.1007\/978-3-642-33278-4"},{"unstructured":"Roever, W.P.d., de\u00a0Boer, F.S., Hannemann, U., Hooman, J., Lakhnech, Y., Poel, M., Zwiers, J.: Concurrency Verification: Introduction to Compositional and Noncompositional Methods, Cambridge Tracts in TCS, vol.\u00a054. Cambridge University Press (2001)","key":"24_CR41"},{"unstructured":"Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice-Hall (1997), http:\/\/www.comlab.ox.ac.uk\/bill.roscoe\/publications\/68b.pdf","key":"24_CR42"},{"doi-asserted-by":"publisher","unstructured":"Vogler, W.: Efficiency of asynchronous systems, read arcs, and the MUTEX-problem. Theor. Comput. Sci. 275(1-2), 589\u2013631 (2002). https:\/\/doi.org\/10.1016\/S0304-3975(01)00300-0","key":"24_CR43","DOI":"10.1016\/S0304-3975(01)00300-0"},{"doi-asserted-by":"publisher","unstructured":"Winskel, G.: A new definition of morphism on Petri nets. In: Fontet, M., Mehlhorn, K. (eds.) Proc. Symposium on Theoretical Aspects of Computer Science, STACS\u201984. LNCS, vol.\u00a0166, pp. 140\u2013150. Springer (1984). https:\/\/doi.org\/10.1007\/3-540-12920-0_13","key":"24_CR44","DOI":"10.1007\/3-540-12920-0_13"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30829-1_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T20:00:44Z","timestamp":1682020844000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30829-1_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031308284","9783031308291"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30829-1_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"21 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FoSSaCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Foundations of Software Science and Computation Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fossacs2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/2023\/fossacs","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":"85","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":"26","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":"31% - 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.1","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":"10","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)"}}]}}