{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:55:25Z","timestamp":1742961325371,"version":"3.40.3"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030393212"},{"type":"electronic","value":"9783030393229"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-39322-9_15","type":"book-chapter","created":{"date-parts":[[2020,1,14]],"date-time":"2020-01-14T19:03:59Z","timestamp":1579028639000},"page":"314-336","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Language Inclusion for Finite Prime Event Structures"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Fellner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thorsten","family":"Tarrach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georg","family":"Weissenbacher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,13]]},"reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-642-12002-2_14","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"PA Abdulla","year":"2010","unstructured":"Abdulla, P.A., Chen, Y.-F., Hol\u00edk, L., Mayr, R., Vojnar, T.: When simulation meets antichains. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 158\u2013174. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12002-2_14"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BFb0012757","volume-title":"Automata, Languages and Programming","author":"A Bertoni","year":"1982","unstructured":"Bertoni, A., Mauri, G., Sabadini, N.: Equivalence and membership problems for regular trace languages. In: Nielsen, M., Schmidt, E.M. (eds.) ICALP 1982. LNCS, vol. 140, pp. 61\u201371. Springer, Heidelberg (1982). https:\/\/doi.org\/10.1007\/BFb0012757"},{"issue":"2","key":"15_CR3","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0890-5401(89)90051-5","volume":"82","author":"A Bertoni","year":"1989","unstructured":"Bertoni, A., Mauri, G., Sabadini, N.: Membership problems for regular and context-free trace languages. Inf. Comput. 82(2), 135\u2013150 (1989)","journal-title":"Inf. Comput."},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-319-66706-5_3","volume-title":"Static Analysis","author":"Ahmed Bouajjani","year":"2017","unstructured":"Bouajjani, A., Enea, C., Lahiri, S.K.: Abstract semantic diffing of evolving concurrent programs. In: Ranzato, F. (ed.) Proceedings of the Static Analysis - 24th International Symposium, SAS 2017, New York, NY, USA, 30 August\u20131 September 2017, LNCS, vol. 10422, pp. 46\u201365. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-66706-5_3"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/3-540-53479-2_4","volume-title":"Semantics of Systems of Concurrent Processes","author":"G Boudol","year":"1990","unstructured":"Boudol, G.: Flow event structures and flow nets. In: Guessarian, I. (ed.) LITP 1990. LNCS, vol. 469, pp. 62\u201395. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-53479-2_4"},{"issue":"2","key":"15_CR6","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10703-016-0256-5","volume":"50","author":"P \u010cern\u00fd","year":"2017","unstructured":"\u010cern\u00fd, P., et al.: From non-preemptive to preemptive scheduling using synchronization synthesis. Formal Methods Syst. Des. 50(2), 97\u2013139 (2017)","journal-title":"Formal Methods Syst. Des."},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/978-3-642-59126-6_8","volume-title":"Handbook of Formal Languages","author":"V Diekert","year":"1997","unstructured":"Diekert, V., M\u00e9tivier, Y.: Partial commutation and traces. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 457\u2013533. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-642-59126-6_8"},{"key":"15_CR8","doi-asserted-by":"publisher","unstructured":"Dietsch, D., Jakobs, M.C.: VMCAI 2020 virtual machine, November 2019. https:\/\/doi.org\/10.5281\/zenodo.3533104","DOI":"10.5281\/zenodo.3533104"},{"key":"15_CR9","unstructured":"Clarke, J.E.M., Grumberg, O., Kroening, D., Peled, D., Veith, H.: Model Checking. 2nd edn. MIT Press (2018)"},{"key":"15_CR10","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 \u2014 an introduction. In: Reisig, W., Rozenberg, G. (eds.) ACPN 1996. LNCS, vol. 1491, pp. 374\u2013428. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-65306-6_20"},{"key":"15_CR11","first-page":"244","volume":"52","author":"J Esparza","year":"1994","unstructured":"Esparza, J., Nielsen, M.: Decidability issues for Petri nets - a survey. Bull. EATCS 52, 244\u2013262 (1994)","journal-title":"Bull. EATCS"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-642-40867-0_2","volume-title":"Cellular Automata and Discrete Complex Systems","author":"N Fat\u00e8s","year":"2013","unstructured":"Fat\u00e8s, N.: A guided tour of asynchronous cellular automata. In: Kari, J., Kutrib, M., Malcher, A. (eds.) AUTOMATA 2013. LNCS, vol. 8155, pp. 15\u201330. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40867-0_2"},{"issue":"1","key":"15_CR13","doi-asserted-by":"publisher","first-page":"4:1","DOI":"10.1145\/3289256","volume":"18","author":"A Fellner","year":"2019","unstructured":"Fellner, A., Krenn, W., Schlick, R., Tarrach, T., Weissenbacher, G.: Model-based, mutation-driven test-case generation via heuristic-guided branching search. ACM Trans. Embed. Comput. Syst. 18(1), 4:1\u20134:28 (2019)","journal-title":"ACM Trans. Embed. Comput. Syst."},{"key":"15_CR14","unstructured":"Fellner, A., Tarrach, T., Weissenbacher, G.: Language inclusion for finite prime event structures (2019). https:\/\/arxiv.org\/abs\/1911.06355"},{"key":"15_CR15","doi-asserted-by":"publisher","unstructured":"Fellner, A., Tarrach, T., Weissenbacher, G.: Language Inclusion for Finite Prime Event Structures. Artifact (2019). https:\/\/doi.org\/10.5281\/zenodo.3514619","DOI":"10.5281\/zenodo.3514619"},{"issue":"4","key":"15_CR16","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0304-3975(76)90074-8","volume":"1","author":"EP Friedman","year":"1976","unstructured":"Friedman, E.P.: The inclusion problem for simple languages. Theor. Comput. Sci. 1(4), 297\u2013316 (1976)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"15_CR17","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1006\/jcss.1999.1634","volume":"59","author":"S Gaubert","year":"1999","unstructured":"Gaubert, S., Giua, A.: Petri net languages and infinite subsets of Nm. J. Comput. Syst. Sci. 59(3), 373\u2013391 (1999). https:\/\/doi.org\/10.1006\/jcss.1999.1634","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/3-540-52559-9_68","volume-title":"Stepwise Refinement of Distributed Systems Models, Formalisms, Correctness","author":"R van Glabbeek","year":"1990","unstructured":"van Glabbeek, R., Goltz, U.: Refinement of actions in causality based models. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX 1989. LNCS, vol. 430, pp. 267\u2013300. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-52559-9_68"},{"issue":"41","key":"15_CR19","doi-asserted-by":"publisher","first-page":"4111","DOI":"10.1016\/j.tcs.2009.06.014","volume":"410","author":"RJ van Glabbeek","year":"2009","unstructured":"van Glabbeek, R.J., Plotkin, G.D.: Configuration structures, event structures and Petri nets. Theor. Comput. Sci. 410(41), 4111\u20134159 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Godefroid, P.: Partial-order methods for the verification of concurrent systems (1996)","DOI":"10.1007\/3-540-60761-7"},{"issue":"2","key":"15_CR21","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/0020-0190(79)90128-5","volume":"9","author":"J Grabowski","year":"1979","unstructured":"Grabowski, J.: The unsolvability of some Petri net language problems. Inf. Process. Lett. 9(2), 60\u201363 (1979). https:\/\/doi.org\/10.1016\/0020-0190(79)90128-5","journal-title":"Inf. Process. Lett."},{"key":"15_CR22","unstructured":"Hack, M.: Decidability questions for Petri Nets. Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA, USA (1976). http:\/\/hdl.handle.net\/1721.1\/27441"},{"key":"15_CR23","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. 3rd edn. Pearson (2013)"},{"issue":"1\u20132","key":"15_CR24","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0304-3975(00)00100-6","volume":"256","author":"P Jancar","year":"2001","unstructured":"Jancar, P.: Nonprimitive recursive complexity and undecidability for Petri net equivalences. Theor. Comput. Sci. 256(1\u20132), 23\u201330 (2001). https:\/\/doi.org\/10.1016\/S0304-3975(00)00100-6","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"15_CR25","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0304-3975(77)90014-7","volume":"4","author":"ND Jones","year":"1977","unstructured":"Jones, N.D., Landweber, L.H., Lien, Y.E.: Complexity of some problems in Petri nets. Theor. Comput. Sci. 4(3), 277\u2013299 (1977). https:\/\/doi.org\/10.1016\/0304-3975(77)90014-7","journal-title":"Theor. Comput. Sci."},{"key":"15_CR26","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"Richard M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85\u2013103. Springer, Boston (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"key":"15_CR27","series-title":"Nonconvex Optimization and Its Applications","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-1-4613-3557-3_15","volume-title":"Minimax and Applications","author":"KI Ko","year":"1995","unstructured":"Ko, K.I., Lin, C.L.: On the complexity of min-max optimization problems and their approximation. In: Du, D.Z., Pardalos, P.M. (eds.) Minimax and Applications. Nonconvex Optimization and Its Applications, vol. 4, pp. 219\u2013239. Springer, Boston (1995). https:\/\/doi.org\/10.1007\/978-1-4613-3557-3_15"},{"key":"15_CR28","unstructured":"Lamport, L., et al.: Paxos made simple. ACM SIGACT News 32(4), 18\u201325 (2001)"},{"key":"15_CR29","doi-asserted-by":"publisher","unstructured":"Madhusudan, P.: Model-checking trace event structures. In: Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS 2003), Ottawa, Canada, 22\u201325 June 2003, pp. 371\u2013380. IEEE Computer Society (2003). https:\/\/doi.org\/10.1109\/LICS.2003.1210077","DOI":"10.1109\/LICS.2003.1210077"},{"key":"15_CR30","doi-asserted-by":"crossref","unstructured":"Mayr, R., Clemente, L.: Advanced automata minimization. In: ACM SIGPLAN Notices, vol. 48, pp. 63\u201374. ACM (2013)","DOI":"10.1145\/2480359.2429079"},{"key":"15_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/3-540-17906-2_30","volume-title":"Petri Nets: Applications and Relationships to Other Models of Concurrency","author":"A Mazurkiewicz","year":"1987","unstructured":"Mazurkiewicz, A.: Trace theory. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) ACPN 1986. LNCS, vol. 255, pp. 278\u2013324. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-17906-2_30"},{"key":"15_CR32","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1142\/9789814261456_0001","volume-title":"The Book of Traces","author":"Antoni Mazurkiewicz","year":"1995","unstructured":"Mazurkiewicz, A.: Introduction to trace theory. In: The Book of Traces, pp. 3\u201341 (1995)"},{"key":"15_CR33","doi-asserted-by":"crossref","unstructured":"Meyer, A.R., Stockmeyer, L.J.: The equivalence problem for regular expressions with squaring requires exponential space. In: SWAT (FOCS), pp. 125\u2013129 (1972)","DOI":"10.1109\/SWAT.1972.29"},{"key":"15_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-319-96142-2_22","volume-title":"Computer Aided Verification","author":"HTT Nguyen","year":"2018","unstructured":"Nguyen, H.T.T., Rodr\u00edguez, C., Sousa, M., Coti, C., Petrucci, L.: Quasi-optimal partial order reduction. In: Chockler, H., Weissenbacher, G. (eds.) CAV 2018. LNCS, vol. 10982, pp. 354\u2013371. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96142-2_22"},{"issue":"1","key":"15_CR35","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","volume":"13","author":"M Nielsen","year":"1981","unstructured":"Nielsen, M., Plotkin, G., Winskel, G.: Petri nets, event structures and domains, part I. Theor. Comput. Sci. 13(1), 85\u2013108 (1981)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BFb0035386","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"W Penczek","year":"1997","unstructured":"Penczek, W.: Model-checking for a subclass of event structures. In: Brinksma, E. (ed.) TACAS 1997. LNCS, vol. 1217, pp. 145\u2013164. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0035386"},{"key":"15_CR37","unstructured":"Peterson, J.: Petri Net Theory and the Modeling of Systems. Independently Published (2019). https:\/\/books.google.at\/books?id=IthLyAEACAAJ"},{"key":"15_CR38","unstructured":"Rodr\u00edguez, C., Sousa, M., Sharma, S., Kroening, D.: Unfolding-based partial order reduction. In: 26th International Conference on Concurrency Theory (CONCUR 2015), pp. 456\u2013469 (2015)"},{"issue":"3","key":"15_CR39","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1137\/0214044","volume":"14","author":"RE Stearns","year":"1985","unstructured":"Stearns, R.E., Hunt III, H.B.: On the equivalence and containment problems for unambiguous regular expressions, regular grammars and finite automata. SIAM J. Comput. 14(3), 598\u2013611 (1985)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"15_CR40","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0022-0000(81)90067-2","volume":"23","author":"R Valk","year":"1981","unstructured":"Valk, R., Vidal-Naquet, G.: Petri nets and regular languages. J. Comput. Syst. Sci. 23(3), 299\u2013325 (1981). https:\/\/doi.org\/10.1016\/0022-0000(81)90067-2","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/3-540-53863-1_36","volume-title":"Advances in Petri Nets 1990","author":"A Valmari","year":"1991","unstructured":"Valmari, A.: Stubborn sets for reduced state space generation. In: Rozenberg, G. (ed.) ICATPN 1989. LNCS, vol. 483, pp. 491\u2013515. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-53863-1_36"},{"issue":"4\u20135","key":"15_CR42","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s002360000041","volume":"37","author":"R Van Glabbeek","year":"2001","unstructured":"Van Glabbeek, R., Goltz, U.: Refinement of actions and equivalence notions for concurrent systems. Acta Informatica 37(4\u20135), 229\u2013327 (2001)","journal-title":"Acta Informatica"},{"key":"15_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/BFb0013026","volume-title":"Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency","author":"G Winskel","year":"1989","unstructured":"Winskel, G.: An introduction to event structures. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX 1988. LNCS, vol. 354, pp. 364\u2013397. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/BFb0013026"},{"key":"15_CR44","unstructured":"Winskel, G.: Event structures, stable families and concurrent games (2016)"},{"key":"15_CR45","doi-asserted-by":"crossref","unstructured":"Winskel, G., Nielsen, M.: Handbook of logic in computer science. In: Models for Concurrency, vol. 4, pp. 1\u2013148. Oxford University Press Inc., New York (1995). http:\/\/dl.acm.org\/citation.cfm?id=218623.218630","DOI":"10.1093\/oso\/9780198537809.003.0001"},{"issue":"1","key":"15_CR46","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0304-3975(76)90062-1","volume":"3","author":"C Wrathall","year":"1976","unstructured":"Wrathall, C.: Complete sets and the polynomial-time hierarchy. Theor. Comput. Sci. 3(1), 23\u201333 (1976)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"15_CR47","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1051\/ita\/1987210200991","volume":"21","author":"W Zielonka","year":"1987","unstructured":"Zielonka, W.: Notes on finite asynchronous automata. RAIRO-Theor. Inf. Appl. 21(2), 99\u2013135 (1987)","journal-title":"RAIRO-Theor. Inf. Appl."}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-39322-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:43:57Z","timestamp":1710269037000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-39322-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030393212","9783030393229"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39322-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"13 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"VMCAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Verification, Model Checking, and Abstract Interpretation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Orleans, LA","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 January 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 January 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"vmcai2020a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/popl20.sigplan.org\/home\/VMCAI-2020","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":"44","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":"21","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":"48% - 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":"4,4","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)"}}]}}