{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T08:27:41Z","timestamp":1746001661630,"version":"3.40.3"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030897154"},{"type":"electronic","value":"9783030897161"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/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":"https:\/\/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-89716-1_3","type":"book-chapter","created":{"date-parts":[[2021,10,25]],"date-time":"2021-10-25T09:08:02Z","timestamp":1635152882000},"page":"28-51","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Population Protocols: Beyond Runtime Analysis"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9862-4919","authenticated-orcid":false,"given":"Javier","family":"Esparza","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,22]]},"reference":[{"unstructured":"Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.: General decidability theorems for infinite-state systems. In: LICS, pp. 313\u2013321. IEEE Computer Society (1996)","key":"3_CR1"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2015.07.012","volume":"603","author":"S Abriola","year":"2015","unstructured":"Abriola, S., Figueira, S., Senno, G.: Linearizing well quasi-orders and bounding the length of bad sequences. Theor. Comput. Sci. 603, 3\u201322 (2015)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Alistarh, D., Aspnes, J., Eisenstat, D., Gelashvili, R., Rivest, R.L.: Time-space trade-offs in population protocols. In: SODA, pp. 2560\u20132579. SIAM (2017)","key":"3_CR3","DOI":"10.1137\/1.9781611974782.169"},{"doi-asserted-by":"crossref","unstructured":"Alistarh, D., Aspnes, J., Gelashvili, R.: Space-optimal majority in population protocols. In: SODA, pp. 2221\u20132239. SIAM (2018)","key":"3_CR4","DOI":"10.1137\/1.9781611975031.144"},{"issue":"3","key":"3_CR5","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/3289137.3289150","volume":"49","author":"D Alistarh","year":"2018","unstructured":"Alistarh, D., Gelashvili, R.: Recent algorithmic advances in population protocols. SIGACT News 49(3), 63\u201373 (2018)","journal-title":"SIGACT News"},{"doi-asserted-by":"crossref","unstructured":"Alistarh, D., Gelashvili, R., Vojnovic, M.: Fast and exact majority in population protocols. In: PODC, pp. 47\u201356. ACM (2015)","key":"3_CR6","DOI":"10.1145\/2767386.2767429"},{"doi-asserted-by":"crossref","unstructured":"Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. In: PODC, pp. 290\u2013299. ACM (2004)","key":"3_CR7","DOI":"10.1145\/1011767.1011810"},{"issue":"4","key":"3_CR8","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00446-005-0138-3","volume":"18","author":"D Angluin","year":"2006","unstructured":"Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distrib. Comput. 18(4), 235\u2013253 (2006)","journal-title":"Distrib. Comput."},{"doi-asserted-by":"crossref","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D.: Stably computable predicates are semilinear. In: PODC, pp. 292\u2013299. ACM (2006)","key":"3_CR9","DOI":"10.1145\/1146381.1146425"},{"issue":"3","key":"3_CR10","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s00446-008-0067-z","volume":"21","author":"D Angluin","year":"2008","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D.: Fast computation by population protocols with a leader. Distrib. Comput. 21(3), 183\u2013199 (2008)","journal-title":"Distrib. Comput."},{"issue":"4","key":"3_CR11","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s00446-007-0040-2","volume":"20","author":"D Angluin","year":"2007","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D., Ruppert, E.: The computational power of population protocols. Distrib. Comput. 20(4), 279\u2013304 (2007)","journal-title":"Distrib. Comput."},{"doi-asserted-by":"crossref","unstructured":"Balasubramanian, A.R.: Complexity of controlled bad sequences over finite sets of $$\\mathbb{N}^d$$. In: LICS, pp. 130\u2013140. ACM (2020)","key":"3_CR12","DOI":"10.1145\/3373718.3394753"},{"issue":"3","key":"3_CR13","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1145\/3436980.3436984","volume":"7","author":"M Blondin","year":"2020","unstructured":"Blondin, M.: The ABCs of Petri net reachability relaxations. ACM SIGLOG News 7(3), 29\u201343 (2020)","journal-title":"ACM SIGLOG News"},{"unstructured":"Blondin, M., Esparza, J., Genest, B., Helfrich, M., Jaax, S.: Succinct population protocols for presburger arithmetic. In: STACS. LIPIcs, vol. 154, pp. 40:1\u201340:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)","key":"3_CR14"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-030-53291-8_20","volume-title":"Computer Aided Verification","author":"M Blondin","year":"2020","unstructured":"Blondin, M., Esparza, J., Helfrich, M., Ku\u010dera, A., Meyer, P.J.: Checking qualitative liveness properties of replicated systems with stochastic scheduling. In: Lahiri, S.K., Wang, C. (eds.) CAV 2020. LNCS, vol. 12225, pp. 372\u2013397. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53291-8_20"},{"unstructured":"Blondin, M., Esparza, J., Jaax, S.: Large flocks of small birds: on the minimal size of population protocols. In: STACS. LIPIcs, vol. 96, pp. 16:1\u201316:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018)","key":"3_CR16"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1007\/978-3-319-96145-3_34","volume-title":"Computer Aided Verification","author":"M Blondin","year":"2018","unstructured":"Blondin, M., Esparza, J., Jaax, S.: Peregrine: a tool for the analysis of population protocols. In: Chockler, H., Weissenbacher, G. (eds.) CAV 2018. LNCS, vol. 10981, pp. 604\u2013611. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96145-3_34"},{"doi-asserted-by":"crossref","unstructured":"Blondin, M., Esparza, J., Jaax, S., Meyer, P.J.: Towards efficient verification of population protocols. In: PODC, pp. 423\u2013430. ACM (2017)","key":"3_CR18","DOI":"10.1145\/3087801.3087816"},{"unstructured":"Blondin, M., Esparza, J., Kucera, A.: Automatic analysis of expected termination time for population protocols. In: CONCUR. LIPIcs, vol. 118, pp. 33:1\u201333:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018)","key":"3_CR19"},{"doi-asserted-by":"crossref","unstructured":"Blondin, M., Finkel, A., Haase, C., Haddad, S.: The logical view on continuous Petri nets. ACM Trans. Comput. Log. (TOCL) 18(3), 24:1\u201324:28 (2017)","key":"3_CR20","DOI":"10.1145\/3105908"},{"issue":"1","key":"3_CR21","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1038\/srep00656","volume":"2","author":"L Cardelli","year":"2012","unstructured":"Cardelli, L., Csik\u00e1sz-Nagy, A.: The cell cycle switch computes approximate majority. Sci. Rep. 2(1), 656 (2012)","journal-title":"Sci. Rep."},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-642-16023-3_19","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"I Chatzigiannakis","year":"2010","unstructured":"Chatzigiannakis, I., Michail, O., Spirakis, P.G.: Algorithmic verification of population protocols. In: Dolev, S., Cobb, J., Fischer, M., Yung, M. (eds.) SSS 2010. LNCS, vol. 6366, pp. 221\u2013235. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16023-3_19"},{"doi-asserted-by":"crossref","unstructured":"Cl\u00e9ment, J., Delporte-Gallet, C., Fauconnier, H., Sighireanu, M.: Guidelines for the verification of population protocols. In: ICDCS, pp. 215\u2013224. IEEE Computer Society (2011)","key":"3_CR23","DOI":"10.1109\/ICDCS.2011.36"},{"doi-asserted-by":"crossref","unstructured":"Czerner, P., Esparza, J.: Lower bounds on the state complexity of population protocols. In: PODC, pp. 45\u201354. ACM (2021)","key":"3_CR24","DOI":"10.1145\/3465084.3467912"},{"doi-asserted-by":"crossref","unstructured":"Czerwinski, W., Lasota, S., Lazic, R., Leroux, J., Mazowiecki, F.: The reachability problem for Petri nets is not elementary. J. ACM 68(1), 7:1\u20137:28 (2021)","key":"3_CR25","DOI":"10.1145\/3422822"},{"unstructured":"Czerwinski, W., Orlikowski, L.: Reachability in vector addition systems is Ackermann-complete. CoRR abs\/2104.13866 (2021)","key":"3_CR26"},{"unstructured":"Els\u00e4sser, R., Radzik, T.: Recent results in population protocols for exact majority and leader election. Bull. EATCS 126, 32\u201364 (2018)","key":"3_CR27"},{"key":"3_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/978-3-319-58747-9_2","volume-title":"Computer Science \u2013 Theory and Applications","author":"J Esparza","year":"2017","unstructured":"Esparza, J.: Advances in parameterized verification of population protocols. In: Weil, P. (ed.) CSR 2017. LNCS, vol. 10304, pp. 7\u201314. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-58747-9_2"},{"key":"3_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-642-31424-7_14","volume-title":"Computer Aided Verification","author":"J Esparza","year":"2012","unstructured":"Esparza, J., Gaiser, A., Kiefer, S.: Proving termination of probabilistic programs using patterns. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol. 7358, pp. 123\u2013138. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31424-7_14"},{"unstructured":"Esparza, J., Ganty, P., Leroux, J., Majumdar, R.: Model checking population protocols. In: FSTTCS. LIPIcs, vol. 65, pp. 27:1\u201327:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016)","key":"3_CR30"},{"issue":"2","key":"3_CR31","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s00236-016-0272-3","volume":"54","author":"J Esparza","year":"2016","unstructured":"Esparza, J., Ganty, P., Leroux, J., Majumdar, R.: Verification of population protocols. Acta Inf. 54(2), 191\u2013215 (2016). https:\/\/doi.org\/10.1007\/s00236-016-0272-3","journal-title":"Acta Inf."},{"key":"3_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1007\/978-3-030-59152-6_32","volume-title":"Automated Technology for Verification and Analysis","author":"J Esparza","year":"2020","unstructured":"Esparza, J., Helfrich, M., Jaax, S., Meyer, P.J.: Peregrine 2.0: explaining correctness of population protocols through stage graphs. In: Hung, D.V., Sokolsky, O. (eds.) ATVA 2020. LNCS, vol. 12302, pp. 550\u2013556. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59152-6_32"},{"issue":"2","key":"3_CR33","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s00446-021-00390-x","volume":"34","author":"J Esparza","year":"2021","unstructured":"Esparza, J., Jaax, S., Raskin, M., Weil-Kennedy, C.: The complexity of verifying population protocols. Distrib. Comput. 34(2), 133\u2013177 (2021). https:\/\/doi.org\/10.1007\/s00446-021-00390-x","journal-title":"Distrib. Comput."},{"key":"3_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/978-3-319-08867-9_40","volume-title":"Computer Aided Verification","author":"J Esparza","year":"2014","unstructured":"Esparza, J., Ledesma-Garza, R., Majumdar, R., Meyer, P., Niksic, F.: An SMT-based approach to coverability analysis. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 603\u2013619. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08867-9_40"},{"issue":"2","key":"3_CR35","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1023\/A:1008743212620","volume":"16","author":"J Esparza","year":"2000","unstructured":"Esparza, J., Melzer, S.: Verification of safety properties using integer programming: beyond the state equation. Formal Methods Syst. Des. 16(2), 159\u2013189 (2000)","journal-title":"Formal Methods Syst. Des."},{"key":"3_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/978-3-030-21571-2_20","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"J Esparza","year":"2019","unstructured":"Esparza, J., Raskin, M., Weil-Kennedy, C.: Parameterized analysis of immediate observation Petri nets. In: Donatelli, S., Haar, S. (eds.) PETRI NETS 2019. LNCS, vol. 11522, pp. 365\u2013385. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-21571-2_20"},{"doi-asserted-by":"crossref","unstructured":"Figueira, D., Figueira, S., Schmitz, S., Schnoebelen, P.: Ackermannian and primitive-recursive bounds with Dickson\u2019s lemma. In: LICS, pp. 269\u2013278. IEEE Computer Society (2011)","key":"3_CR37","DOI":"10.1109\/LICS.2011.39"},{"issue":"1\u20132","key":"3_CR38","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theoret. Comput. Sci. 256(1\u20132), 63\u201392 (2001)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"3_CR39","first-page":"1","volume":"137","author":"E Fraca","year":"2015","unstructured":"Fraca, E., Haddad, S.: Complexity analysis of continuous Petri nets. Fundam. Inf. 137(1), 1\u201328 (2015)","journal-title":"Fundam. Inf."},{"doi-asserted-by":"crossref","unstructured":"Gasieniec, L., Stachowiak, G.: Enhanced phase clocks, population protocols, and fast space optimal leader election. J. ACM 68(1), 2:1\u20132:21 (2021)","key":"3_CR40","DOI":"10.1145\/3424659"},{"issue":"3","key":"3_CR41","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/3242953.3242964","volume":"5","author":"C Haase","year":"2018","unstructured":"Haase, C.: A survival guide to Presburger arithmetic. SIGLOG News 5(3), 67\u201382 (2018)","journal-title":"SIGLOG News"},{"issue":"6","key":"3_CR42","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/s00236-019-00338-6","volume":"56","author":"P Jancar","year":"2019","unstructured":"Jancar, P., Purser, D.: Structural liveness of Petri nets is EXPSPACE-hard and decidable. Acta Inf. 56(6), 537\u2013552 (2019)","journal-title":"Acta Inf."},{"doi-asserted-by":"crossref","unstructured":"Kosaraju, S.R.: Decidability of reachability in vector addition systems (preliminary version). In: STOC, pp. 267\u2013281. ACM (1982)","key":"3_CR43","DOI":"10.1145\/800070.802201"},{"key":"3_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-662-54577-5_29","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"O Leng\u00e1l","year":"2017","unstructured":"Leng\u00e1l, O., Lin, A.W., Majumdar, R., R\u00fcmmer, P.: Fair termination for parameterized probabilistic concurrent systems. In: Legay, A., Margaria, T. (eds.) TACAS 2017. LNCS, vol. 10205, pp. 499\u2013517. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54577-5_29"},{"unstructured":"Leroux, J.: Vector addition systems reachability problem (a simpler solution). In: Turing-100. EPiC Series in Computing, vol. 10, pp. 214\u2013228. EasyChair (2012)","key":"3_CR45"},{"unstructured":"Leroux, J.: The reachability problem for Petri nets is not primitive recursive. CoRR abs\/2104.12695 (2021)","key":"3_CR46"},{"doi-asserted-by":"crossref","unstructured":"Mayr, E.W.: An algorithm for the general Petri net reachability problem. In: STOC, pp. 238\u2013246. ACM (1981)","key":"3_CR47","DOI":"10.1145\/800076.802477"},{"issue":"3","key":"3_CR48","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0001-8708(82)90048-2","volume":"46","author":"EW Meyer","year":"1982","unstructured":"Meyer, E.W., Meyer, A.R.: The complexity of the word problems for commutative semigroups and polynomial ideals. Adv. Math. 46(3), 305\u2013329 (1982)","journal-title":"Adv. Math."},{"issue":"1","key":"3_CR49","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1017\/S0305004100033193","volume":"54","author":"PAP Moran","year":"1958","unstructured":"Moran, P.A.P.: Random processes in genetics. Math. Proc. Camb. Philos. Soc. 54(1), 60\u201371 (1958)","journal-title":"Math. Proc. Camb. Philos. Soc."},{"key":"3_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"issue":"4","key":"3_CR51","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/5.24143","volume":"77","author":"T Murata","year":"1989","unstructured":"Murata, T.: Petri nets: properties, analysis and applications. Proc. IEEE 77(4), 541\u2013580 (1989)","journal-title":"Proc. IEEE"},{"key":"3_CR52","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69968-9","volume-title":"Petri Nets: An introduction","author":"W Reisig","year":"1985","unstructured":"Reisig, W.: Petri Nets: An introduction. EATCS Monographs on Theoretical Computer Science, vol. 4. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/978-3-642-69968-9"},{"issue":"4","key":"3_CR53","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/s11047-008-9067-y","volume":"7","author":"D Soloveichik","year":"2008","unstructured":"Soloveichik, D., Cook, M., Winfree, E., Bruck, J.: Computation with finite stochastic chemical reaction networks. Nat. Comput. 7(4), 615\u2013633 (2008)","journal-title":"Nat. Comput."}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89716-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,25]],"date-time":"2021-10-25T09:08:58Z","timestamp":1635152938000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89716-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030897154","9783030897161"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89716-1_3","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":"22 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reachability Problems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Liverpool","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rp2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/rp2021.csc.liv.ac.uk\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}