{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:48:08Z","timestamp":1743000488115,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030684457"},{"type":"electronic","value":"9783030684464"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","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":[[2021]]},"DOI":"10.1007\/978-3-030-68446-4_13","type":"book-chapter","created":{"date-parts":[[2021,2,12]],"date-time":"2021-02-12T19:06:39Z","timestamp":1613156799000},"page":"249-268","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Verification of Multiplayer Stochastic Games via Abstract Dependency Graphs"],"prefix":"10.1007","author":[{"given":"S\u00f8ren","family":"Enevoldsen","sequence":"first","affiliation":[]},{"given":"Mathias Claus","family":"Jensen","sequence":"additional","affiliation":[]},{"given":"Kim Guldstrand","family":"Larsen","sequence":"additional","affiliation":[]},{"given":"Anders","family":"Mariegaard","sequence":"additional","affiliation":[]},{"given":"Ji\u0159\u00ed","family":"Srba","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,13]]},"reference":[{"issue":"5","key":"13_CR1","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1145\/585265.585270","volume":"49","author":"R Alur","year":"2002","unstructured":"Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. J. ACM 49(5), 672\u2013713 (2002). https:\/\/doi.org\/10.1145\/585265.585270","journal-title":"J. ACM"},{"key":"13_CR2","doi-asserted-by":"publisher","unstructured":"Andova, S., Hermanns, H., Katoen, J.: Discrete-time rewards model-checked. In: Formal Modeling and Analysis of Timed Systems: First International Workshop, FORMATS 2003, 6\u20137 September 2003, Marseille, France. Revised Papers, pp. 88\u2013104 (2003). https:\/\/doi.org\/10.1007\/978-3-540-40903-8_8","DOI":"10.1007\/978-3-540-40903-8_8"},{"key":"13_CR3","doi-asserted-by":"publisher","unstructured":"Ashok, P., Chatterjee, K., Kret\u00ednsk\u00fd, J., Weininger, M., Winkler, T.: Approximating values of generalized-reachability stochastic games. In: LICS 2020: 35th Annual ACM\/IEEE Symposium on Logic in Computer Science, 8\u201311 July 2020, Saarbr\u00fccken, Germany, pp. 102\u2013115 (2020). https:\/\/doi.org\/10.1145\/3373718.3394761","DOI":"10.1145\/3373718.3394761"},{"key":"13_CR4","series-title":"IFIP International Federation for Information Processing","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/1-4020-8141-3_38","volume-title":"Exploring New Frontiers of Theoretical Informatics","author":"C Baier","year":"2004","unstructured":"Baier, C., Gr\u00f6\u00dfer, M., Leucker, M., Bollig, B., Ciesinski, F.: Controller synthesis for probabilistic systems (Extended Abstract). In: Levy, J.-J., Mayr, E.W., Mitchell, J.C. (eds.) TCS 2004. IIFIP, vol. 155, pp. 493\u2013506. Springer, Boston, MA (2004). https:\/\/doi.org\/10.1007\/1-4020-8141-3_38"},{"key":"13_CR5","unstructured":"Baier, C., Katoen, J.: Principles of Model Checking. MIT Press, Cambridge (2008)"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-319-63387-9_8","volume-title":"Computer Aided Verification","author":"C Baier","year":"2017","unstructured":"Baier, C., Klein, J., Leuschner, L., Parker, D., Wunderlich, S.: Ensuring the reliability of your model checker: interval iteration for Markov decision processes. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10426, pp. 160\u2013180. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63387-9_8"},{"key":"13_CR7","doi-asserted-by":"publisher","unstructured":"Baldan, P., K\u00f6nig, B., Mika-Michalski, C., Padoan, T.: Fixpoint games on continuous lattices. Proc. ACM Program. Lang. 3(POPL), 26:1\u201326:29 (2019). https:\/\/doi.org\/10.1145\/3290339","DOI":"10.1145\/3290339"},{"key":"13_CR8","unstructured":"Baldan, P., K\u00f6nig, B., Padoan, T., Mika-Michalski, C.: Fixpoint games on continuous lattices. CoRR abs\/1810.11404 (2018). http:\/\/arxiv.org\/abs\/1810.11404"},{"key":"13_CR9","doi-asserted-by":"publisher","unstructured":"Bouyer, P., Fahrenberg, U., Larsen, K.G., Markey, N.: Quantitative analysis of real-time systems using priced timed automata. Commun. ACM 54(9), 78\u201387 (2011). https:\/\/doi.org\/10.1145\/1995376.1995396","DOI":"10.1145\/1995376.1995396"},{"key":"13_CR10","doi-asserted-by":"publisher","unstructured":"Br\u00e1zdil, T., Brozek, V., Forejt, V., Kucera, A.: Stochastic games with branching-time winning objectives. In: 21th IEEE Symposium on Logic in Computer Science (LICS 2006), Proceedings, 12\u201315 August 2006, Seattle, WA, USA, pp. 349\u2013358 (2006). https:\/\/doi.org\/10.1109\/LICS.2006.48","DOI":"10.1109\/LICS.2006.48"},{"key":"13_CR11","doi-asserted-by":"publisher","unstructured":"Cassez, F., David, A., Fleury, E., Larsen, K.G., Lime, D.: Efficient on-the-fly algorithms for the analysis of timed games. In: CONCUR 2005 - Concurrency Theory, 16th International Conference, CONCUR 2005, Proceedings, 23\u201326 August 2005, San Francisco, CA, USA, pp. 66\u201380 (2005). https:\/\/doi.org\/10.1007\/11539452_9","DOI":"10.1007\/11539452_9"},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Chatterjee, K., Randour, M., Raskin, J.: Strategy synthesis for multi-dimensional quantitative objectives. Acta Informatica 51(3-4), 129\u2013163 (2014). https:\/\/doi.org\/10.1007\/s00236-013-0182-6","DOI":"10.1007\/s00236-013-0182-6"},{"key":"13_CR13","doi-asserted-by":"publisher","unstructured":"Chen, T., Forejt, V., Kwiatkowska, M.Z., Parker, D., Simaitis, A.: Automatic verification of competitive stochastic systems. Formal Meth. Syst. Des. 43(1), 61\u201392 (2013). https:\/\/doi.org\/10.1007\/s10703-013-0183-7","DOI":"10.1007\/s10703-013-0183-7"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-642-40313-2_25","volume-title":"Mathematical Foundations of Computer Science 2013","author":"T Chen","year":"2013","unstructured":"Chen, T., Forejt, V., Kwiatkowska, M., Simaitis, A., Wiltsche, C.: On stochastic games with multiple objectives. In: Chatterjee, K., Sgall, J. (eds.) MFCS 2013. LNCS, vol. 8087, pp. 266\u2013277. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40313-2_25"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/978-3-642-40196-1_28","volume-title":"Quantitative Evaluation of Systems","author":"T Chen","year":"2013","unstructured":"Chen, T., Kwiatkowska, M., Simaitis, A., Wiltsche, C.: Synthesis for multi-objective stochastic games: an application to autonomous urban driving. In: Joshi, K., Siegle, M., Stoelinga, M., D\u2019Argenio, P.R. (eds.) QEST 2013. LNCS, vol. 8054, pp. 322\u2013337. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40196-1_28"},{"key":"13_CR16","doi-asserted-by":"publisher","unstructured":"Chen, T., Lu, J.: Probabilistic alternating-time temporal logic and model checking algorithm. In: Fourth International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2007, Proceedings, 24\u201327 August 2007, Haikou, Hainan, China, vol. 2, pp. 35\u201339 (2007). https:\/\/doi.org\/10.1109\/FSKD.2007.458","DOI":"10.1109\/FSKD.2007.458"},{"key":"13_CR17","doi-asserted-by":"publisher","unstructured":"Cloth, L., Katoen, J., Khattri, M., Pulungan, R.: Model checking Markov reward models with impulse rewards. In: 2005 International Conference on Dependable Systems and Networks (DSN 2005), 28 June - 1 July 2005, Yokohama, Japan, Proceedings, pp. 722\u2013731 (2005). https:\/\/doi.org\/10.1109\/DSN.2005.64","DOI":"10.1109\/DSN.2005.64"},{"key":"13_CR18","doi-asserted-by":"publisher","unstructured":"Condon, A.: On algorithms for simple stochastic games. In: Advances In Computational Complexity Theory, Proceedings of a DIMACS Workshop, 3\u20137 December 1990, New Jersey, USA, pp. 51\u201371 (1990). https:\/\/doi.org\/10.1090\/dimacs\/013\/04","DOI":"10.1090\/dimacs\/013\/04"},{"key":"13_CR19","doi-asserted-by":"publisher","unstructured":"Condon, A.: The complexity of stochastic games. Inf. Comput. 96(2), 203\u2013224 (1992). https:\/\/doi.org\/10.1016\/0890-5401(92)90048-K","DOI":"10.1016\/0890-5401(92)90048-K"},{"key":"13_CR20","doi-asserted-by":"publisher","unstructured":"Dalsgaard, A.E., et al.: A distributed fixed-point algorithm for extended dependency graphs. Fundam. Inform. 161(4), 351\u2013381 (2018). https:\/\/doi.org\/10.3233\/FI-2018-1707","DOI":"10.3233\/FI-2018-1707"},{"key":"13_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-319-47677-3_13","volume-title":"Dependable Software Engineering: Theories, Tools, and Applications","author":"AE Dalsgaard","year":"2016","unstructured":"Dalsgaard, A.E., Enevoldsen, S., Larsen, K.G., Srba, J.: Distributed computation of fixed points on dependency graphs. In: Fr\u00e4nzle, M., Kapur, D., Zhan, N. (eds.) SETTA 2016. LNCS, vol. 9984, pp. 197\u2013212. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-47677-3_13"},{"key":"13_CR22","doi-asserted-by":"publisher","unstructured":"Droste, M., Kuich, W., Vogler, H.: Handbook of Weighted Automata. Springer (2009). https:\/\/doi.org\/10.1007\/978-3-642-01492-5","DOI":"10.1007\/978-3-642-01492-5"},{"key":"13_CR23","doi-asserted-by":"publisher","unstructured":"Enevoldsen, S., Larsen, K.G., Mariegaard, A., Srba, J.: Dependency graphs with applications to verification. International Journal on Software Tools for Technology Transfer (STTT) pp. 1\u201322 (2020). https:\/\/doi.org\/10.1007\/s10009-020-00578-9","DOI":"10.1007\/s10009-020-00578-9"},{"key":"13_CR24","unstructured":"Enevoldsen, S., Larsen, K.G., Srba, J.: Extended abstract dependency graphs, manuscript Under Submission"},{"key":"13_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-030-17462-0_18","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S Enevoldsen","year":"2019","unstructured":"Enevoldsen, S., Guldstrand Larsen, K., Srba, J.: Abstract dependency graphs and their application to model checking. In: Vojnar, T., Zhang, L. (eds.) TACAS 2019. LNCS, vol. 11427, pp. 316\u2013333. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17462-0_18"},{"key":"13_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-642-23283-1_9","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2011","author":"U Fahrenberg","year":"2011","unstructured":"Fahrenberg, U., Juhl, L., Larsen, K.G., Srba, J.: Energy games in multiweighted automata. In: Cerone, A., Pihlajasaari, P. (eds.) ICTAC 2011. LNCS, vol. 6916, pp. 95\u2013115. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23283-1_9"},{"key":"13_CR27","doi-asserted-by":"publisher","unstructured":"Hartmanns, A., Junges, S., Katoen, J., Quatmann, T.: Multi-cost bounded reachability in MDP. In: Tools and Algorithms for the Construction and Analysis of Systems - 24th International Conference, TACAS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Proceedings, 14\u201320 April 2018, Thessaloniki, Greece, Part II, pp. 320\u2013339 (2018). https:\/\/doi.org\/10.1007\/978-3-319-89963-3_19","DOI":"10.1007\/978-3-319-89963-3_19"},{"key":"13_CR28","doi-asserted-by":"publisher","unstructured":"Hartmanns, A., Kaminski, B.L.: Optimistic value iteration. In: Computer Aided Verification - 32nd International Conference, CAV 2020, Proceedings, Part II, 21\u201324 July 2020, Los Angeles, CA, USA, pp. 488\u2013511 (2020). https:\/\/doi.org\/10.1007\/978-3-030-53291-8_26","DOI":"10.1007\/978-3-030-53291-8_26"},{"key":"13_CR29","doi-asserted-by":"publisher","unstructured":"Itai, A., Rodeh, M.: Symmetry breaking in distributed networks. Inf. Comput. 88(1), 60\u201387 (1990). https:\/\/doi.org\/10.1016\/0890-5401(90)90004-2","DOI":"10.1016\/0890-5401(90)90004-2"},{"key":"13_CR30","doi-asserted-by":"publisher","unstructured":"Jensen, M.C., Mariegaard, A., Larsen, K.G.: Symbolic model checking of weighted PCTL using dependency graphs. In: NASA Formal Methods - 11th International Symposium, NFM 2019, Proceedings, 7\u20139 May 2019, Houston, TX, USA, pp. 298\u2013315 (2019). https:\/\/doi.org\/10.1007\/978-3-030-20652-9_20","DOI":"10.1007\/978-3-030-20652-9_20"},{"key":"13_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/978-3-319-96145-3_36","volume-title":"Computer Aided Verification","author":"E Kelmendi","year":"2018","unstructured":"Kelmendi, E., Kr\u00e4mer, J., K\u0159et\u00ednsk\u00fd, J., Weininger, M.: Value iteration for simple stochastic games: stopping criterion and learning algorithm. In: Chockler, H., Weissenbacher, G. (eds.) CAV 2018. LNCS, vol. 10981, pp. 623\u2013642. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96145-3_36"},{"key":"13_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/978-3-030-53291-8_25","volume-title":"Computer Aided Verification","author":"M Kwiatkowska","year":"2020","unstructured":"Kwiatkowska, M., Norman, G., Parker, D., Santos, G.: PRISM-games 3.0: stochastic game verification with concurrency, equilibria and time. In: Lahiri, S.K., Wang, C. (eds.) CAV 2020. LNCS, vol. 12225, pp. 475\u2013487. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53291-8_25"},{"key":"13_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-030-31175-9_22","volume-title":"The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy","author":"M Kwiatkowska","year":"2019","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: Verification and control of turn-based probabilistic real-time games. In: Alvim, M.S., Chatzikokolakis, K., Olarte, C., Valencia, F. (eds.) The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy. LNCS, vol. 11760, pp. 379\u2013396. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31175-9_22"},{"key":"13_CR34","doi-asserted-by":"publisher","unstructured":"Kwiatkowska, M., Norman, G., Parker, D., Santos, G.: Equilibria-based probabilistic model checking for concurrent stochastic games. In: Formal Methods - The Next 30 Years - Third World Congress, FM 2019, Proceedings, 7\u201311 October 2019, Porto, Portugal, pp. 298\u2013315 (2019). https:\/\/doi.org\/10.1007\/978-3-030-30942-8_19","DOI":"10.1007\/978-3-030-30942-8_19"},{"key":"13_CR35","doi-asserted-by":"publisher","unstructured":"Liu, X., Smolka, S.A.: Simple linear-time algorithms for minimal fixed points (extended abstract). In: Automata, Languages and Programming, 25th International Colloquium, ICALP 1998, Proceedings, 13\u201317 July 1998, Aalborg, Denmark, pp. 53\u201366 (1998). https:\/\/doi.org\/10.1007\/BFb0055040","DOI":"10.1007\/BFb0055040"},{"key":"13_CR36","doi-asserted-by":"publisher","unstructured":"Nguyen, H.N., Rakib, A.: A probabilistic logic for resource-bounded multi-agent systems. In: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI 2019, 10\u201316 August 2019, Macao, China, pp. 521\u2013527 (2019). https:\/\/doi.org\/10.24963\/ijcai.2019\/74","DOI":"10.24963\/ijcai.2019\/74"},{"key":"13_CR37","doi-asserted-by":"publisher","unstructured":"Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley Series in Probability and Statistics, Wiley (1994). https:\/\/doi.org\/10.1002\/9780470316887","DOI":"10.1002\/9780470316887"},{"key":"13_CR38","doi-asserted-by":"publisher","unstructured":"Quatmann, T., Katoen, J.: Sound value iteration. In: Computer Aided Verification - 30th International Conference, CAV 2018, Held as Part of the Federated Logic Conference, FloC 2018, Proceedings, Part I, 14\u201317 July 2018, Oxford, UK, pp. 643\u2013661 (2018). https:\/\/doi.org\/10.1007\/978-3-319-96145-3_37","DOI":"10.1007\/978-3-319-96145-3_37"},{"key":"13_CR39","doi-asserted-by":"publisher","unstructured":"Shapley, L.S.: Stochastic games. Proc. Nat. Acad. Sci. 39(10), 1095\u20131100 (1953). https:\/\/doi.org\/10.1073\/pnas.39.10.1095","DOI":"10.1073\/pnas.39.10.1095"},{"key":"13_CR40","doi-asserted-by":"publisher","unstructured":"Svorenov\u00e1, M., Kwiatkowska, M.: Quantitative verification and strategy synthesis for stochastic games. Eur. J. Control 30, 15\u201330 (2016). https:\/\/doi.org\/10.1016\/j.ejcon.2016.04.009","DOI":"10.1016\/j.ejcon.2016.04.009"},{"issue":"2","key":"13_CR41","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A Tarski","year":"1955","unstructured":"Tarski, A., et al.: A lattice-theoretical fixpoint theorem and its applications. Pac. J. Math. 5(2), 285\u2013309 (1955). https:\/\/doi.org\/10.2140\/pjm.1955.5.285","journal-title":"Pac. J. Math."}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-68446-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T15:55:26Z","timestamp":1619279726000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-68446-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030684457","9783030684464"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-68446-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"13 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOPSTR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Logic-Based Program Synthesis and Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bologna","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lopstr2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/nms.kcl.ac.uk\/maribel.fernandez\/LOPSTR2020\/","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":"31","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":"15","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","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":"In addition, two invited talks are included in the proceedings. Due to the COVID-19 pandemic the conference was held virtually.","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)"}}]}}