{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:22:51Z","timestamp":1742977371816,"version":"3.40.3"},"publisher-location":"Cham","reference-count":49,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031737084"},{"type":"electronic","value":"9783031737091"}],"license":[{"start":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T00:00:00Z","timestamp":1728432000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T00:00:00Z","timestamp":1728432000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-73709-1_11","type":"book-chapter","created":{"date-parts":[[2024,10,8]],"date-time":"2024-10-08T10:12:01Z","timestamp":1728382321000},"page":"168-185","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards a\u00a0Probabilistic Programming Approach to\u00a0Analyse Collective Adaptive Systems"],"prefix":"10.1007","author":[{"given":"Francesca","family":"Randone","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Romina","family":"Doz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesca","family":"Cairoli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Bortolussi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,9]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"e1516","DOI":"10.7717\/peerj-cs.1516","volume":"9","author":"O Abril-Pla","year":"2023","unstructured":"Abril-Pla, O., et al.: PyMC: a modern, and comprehensive probabilistic programming framework in Python. PeerJ Comput. Sci. 9, e1516 (2023)","journal-title":"PeerJ Comput. Sci."},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-319-41528-4_3","volume-title":"Computer Aided Verification","author":"G Barthe","year":"2016","unstructured":"Barthe, G., Espitau, T., Ferrer Fioriti, L.M., Hsu, J.: Synthesizing probabilistic invariants via Doob\u2019s decomposition. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9779, pp. 43\u201361. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41528-4_3"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/978-3-030-45190-5_28","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E Bartocci","year":"2020","unstructured":"Bartocci, E., Kov\u00e1cs, L., Stankovi\u010d, M.: Mora - automatic generation of moment-based invariants. In: TACAS 2020. LNCS, vol. 12078, pp. 492\u2013498. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45190-5_28"},{"key":"11_CR4","unstructured":"Billingsley, P.: Probability and Measure. Wiley, New York (2008)"},{"issue":"1","key":"11_CR5","first-page":"973","volume":"20","author":"E Bingham","year":"2019","unstructured":"Bingham, E., et al.: Pyro: deep universal probabilistic programming. J. Mach. Learn. Res. 20(1), 973\u2013978 (2019)","journal-title":"J. Mach. Learn. Res."},{"key":"11_CR6","doi-asserted-by":"publisher","unstructured":"Bishop, C.M., Nasrabadi, N.M.: Pattern Recognition and Machine Learning, vol.\u00a04. Springer, Cham (2006). https:\/\/doi.org\/10.1007\/978-1-4615-7566-5","DOI":"10.1007\/978-1-4615-7566-5"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-030-30281-8_15","volume-title":"Quantitative Evaluation of Systems","author":"L Bortolussi","year":"2019","unstructured":"Bortolussi, L., Cairoli, F.: Bayesian abstraction of Markov population models. In: Parker, D., Wolf, V. (eds.) QEST 2019. LNCS, vol. 11785, pp. 259\u2013276. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30281-8_15"},{"issue":"5","key":"11_CR8","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/j.peva.2013.01.001","volume":"70","author":"L Bortolussi","year":"2013","unstructured":"Bortolussi, L., Hillston, J., Latella, D., Massink, M.: Continuous approximation of collective system behaviour: a tutorial. Perform. Eval. 70(5), 317\u2013349 (2013)","journal-title":"Perform. Eval."},{"key":"11_CR9","doi-asserted-by":"publisher","unstructured":"Bortolussi, L., et al.: CARMA: collective adaptive resource-sharing Markovian agents. In: Bertrand, N., Tribastone, M. (eds.) Proceedings Thirteenth Workshop on Quantitative Aspects of Programming Languages and Systems, QAPL 2015, London, UK, 11th\u201312th April 2015. EPTCS, vol.\u00a0194, pp. 16\u201331 (2015). https:\/\/doi.org\/10.4204\/EPTCS.194.2","DOI":"10.4204\/EPTCS.194.2"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-319-99429-1_2","volume-title":"Computational Methods in Systems Biology","author":"L Bortolussi","year":"2018","unstructured":"Bortolussi, L., Palmieri, L.: Deep abstractions of chemical reaction networks. In: \u010ce\u0161ka, M., \u0160afr\u00e1nek, D. (eds.) CMSB 2018. LNCS, vol. 11095, pp. 21\u201338. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99429-1_2"},{"key":"11_CR11","unstructured":"Buchholz, P.: On a Markovian process algebra. Citeseer (1994)"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"114169","DOI":"10.1016\/j.tcs.2023.114169","volume":"977","author":"F Cairoli","year":"2023","unstructured":"Cairoli, F., Anselmi, F., d\u2019Onofrio, A., Bortolussi, L.: Generative abstraction of Markov population processes. Theoret. Comput. Sci. 977, 114169 (2023)","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-030-85633-5_2","volume-title":"Computational Methods in Systems Biology","author":"F Cairoli","year":"2021","unstructured":"Cairoli, F., Carbone, G., Bortolussi, L.: Abstraction of Markov population dynamics via generative adversarial nets. In: Cinquemani, E., Paulev\u00e9, L. (eds.) CMSB 2021. LNCS, vol. 12881, pp. 19\u201335. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-85633-5_2"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Cao, Z., et al.: Efficient and scalable prediction of spatio-temporal stochastic gene expression in cells and tissues using graph neural networks. bioRxiv pp. 2023\u201302 (2023)","DOI":"10.1101\/2023.02.28.530379"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-319-10936-7_6","volume-title":"Static Analysis","author":"A Chakarov","year":"2014","unstructured":"Chakarov, A., Sankaranarayanan, S.: Expectation invariants for probabilistic program loops as fixed points. In: M\u00fcller-Olm, M., Seidl, H. (eds.) SAS 2014. LNCS, vol. 8723, pp. 85\u2013100. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10936-7_6"},{"issue":"3","key":"11_CR16","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/3308897.3308909","volume":"46","author":"N Gast","year":"2019","unstructured":"Gast, N., Bortolussi, L., Tribastone, M.: Size expansions of mean field approximation: transient and steady-state analysis. ACM SIGMETRICS Perform. Eval. Rev. 46(3), 25\u201326 (2019)","journal-title":"ACM SIGMETRICS Perform. Eval. Rev."},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-319-41528-4_4","volume-title":"Computer Aided Verification","author":"T Gehr","year":"2016","unstructured":"Gehr, T., Misailovic, S., Vechev, M.: PSI: exact symbolic inference for probabilistic programs. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9779, pp. 62\u201383. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41528-4_4"},{"issue":"9","key":"11_CR18","doi-asserted-by":"publisher","first-page":"1876","DOI":"10.1021\/jp993732q","volume":"104","author":"MA Gibson","year":"2000","unstructured":"Gibson, M.A., Bruck, J.: Efficient exact stochastic simulation of chemical systems with many species and many channels. J. Phys. Chem. A 104(9), 1876\u20131889 (2000)","journal-title":"J. Phys. Chem. A"},{"issue":"4","key":"11_CR19","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/0021-9991(76)90041-3","volume":"22","author":"DT Gillespie","year":"1976","unstructured":"Gillespie, D.T.: A general method for numerically simulating the stochastic time evolution of coupled chemical reactions. J. Comput. Phys. 22(4), 403\u2013434 (1976)","journal-title":"J. Comput. Phys."},{"issue":"4","key":"11_CR20","doi-asserted-by":"publisher","first-page":"1716","DOI":"10.1063\/1.1378322","volume":"115","author":"DT Gillespie","year":"2001","unstructured":"Gillespie, D.T.: Approximate accelerated stochastic simulation of chemically reacting systems. J. Chem. Phys. 115(4), 1716\u20131733 (2001)","journal-title":"J. Chem. Phys."},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/3-540-58021-2_20","volume-title":"Computer Performance Evaluation Modelling Techniques and Tools","author":"S Gilmore","year":"1994","unstructured":"Gilmore, S., Hillston, J.: The PEPA workbench: a tool to support a process algebra-based approach to performance modelling. In: Haring, G., Kotsis, G. (eds.) TOOLS 1994. LNCS, vol. 794, pp. 353\u2013368. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58021-2_20"},{"key":"11_CR22","unstructured":"Goodman, N.D., Mansinghka, V.K., Roy, D., Bonawitz, K., Tenenbaum, J.B.: Church: a language for generative models. In: Proceedings of the Twenty-Fourth Conference on Uncertainty in Artificial Intelligence, pp. 220\u2013229 (2008)"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Gordon, A.D., Henzinger, T.A., Nori, A.V., Rajamani, S.K.: Probabilistic programming. In: Future of Software Engineering Proceedings, pp. 167\u2013181 (2014)","DOI":"10.1145\/2593882.2593900"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Grima, R.: An effective rate equation approach to reaction kinetics in small volumes: theory and application to biochemical reactions in nonequilibrium steady-state conditions. J. Chem. Phys. 133(3), 035101 (2010)","DOI":"10.1063\/1.3454685"},{"key":"11_CR25","unstructured":"Hensel, C., Junges, S., Katoen, J.P., Quatmann, T., Volk, M.: The probabilistic model checker storm. Int. J. Softw. Tools Technol. Transf. 1\u201322 (2022)"},{"key":"11_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-642-02658-4_27","volume-title":"Computer Aided Verification","author":"TA Henzinger","year":"2009","unstructured":"Henzinger, T.A., Mateescu, M., Wolf, V.: Sliding window abstraction for infinite Markov chains. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 337\u2013352. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02658-4_27"},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"Holtzen, S., Van\u00a0den Broeck, G., Millstein, T.: Scaling exact inference for discrete probabilistic programs. Proc. ACM Program. Lang. 4(OOPSLA), 1\u201331 (2020)","DOI":"10.1145\/3428208"},{"key":"11_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-030-88885-5_16","volume-title":"Automated Technology for Verification and Analysis","author":"Z Huang","year":"2021","unstructured":"Huang, Z., Dutta, S., Misailovic, S.: AQUA: automated quantized inference for probabilistic programs. In: Hou, Z., Ganesh, V. (eds.) ATVA 2021. LNCS, vol. 12971, pp. 229\u2013246. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-88885-5_16"},{"issue":"1","key":"11_CR29","doi-asserted-by":"publisher","first-page":"2618","DOI":"10.1038\/s41467-021-22919-1","volume":"12","author":"Q Jiang","year":"2021","unstructured":"Jiang, Q., et al.: Neural network aided approximation and parameter inference of non-Markovian models of gene expression. Nat. Commun. 12(1), 2618 (2021)","journal-title":"Nat. Commun."},{"issue":"4","key":"11_CR30","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1080\/10618600.2017.1322092","volume":"26","author":"R Kan","year":"2017","unstructured":"Kan, R., Robotti, C.: On moments of folded and truncated multivariate normal distributions. J. Comput. Graph. Stat. 26(4), 930\u2013934 (2017)","journal-title":"J. Comput. Graph. Stat."},{"key":"11_CR31","doi-asserted-by":"crossref","unstructured":"Kozen, D.: Semantics of probabilistic programs. In: 20th Annual Symposium on Foundations of Computer Science (FOCS 1979), pp. 101\u2013114. IEEE (1979)","DOI":"10.1109\/SFCS.1979.38"},{"issue":"1","key":"11_CR32","doi-asserted-by":"publisher","first-page":"49","DOI":"10.2307\/3212147","volume":"7","author":"TG Kurtz","year":"1970","unstructured":"Kurtz, T.G.: Solutions of ordinary differential equations as limits of pure jump Markov processes. J. Appl. Probab. 7(1), 49\u201358 (1970)","journal-title":"J. Appl. Probab."},{"issue":"2","key":"11_CR33","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.entcs.2005.10.030","volume":"153","author":"M Kwiatkowska","year":"2006","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: Quantitative analysis with the probabilistic model checker prism. Electron. Notes Theoret. Comput. Sci. 153(2), 5\u201331 (2006)","journal-title":"Electron. Notes Theoret. Comput. Sci."},{"issue":"5","key":"11_CR34","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1109\/TIT.1972.1054885","volume":"18","author":"J Lo","year":"1972","unstructured":"Lo, J.: Finite-dimensional sensor orbits and optimal nonlinear filtering. IEEE Trans. Inf. Theory 18(5), 583\u2013588 (1972)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"11_CR35","unstructured":"Mansinghka, V., Selsam, D., Perov, Y.: Venture: a higher-order probabilistic programming platform with programmable inference. arXiv preprint arXiv:1404.0099 (2014)"},{"issue":"OOPSLA2","key":"11_CR36","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1145\/3563341","volume":"6","author":"M Moosbrugger","year":"2022","unstructured":"Moosbrugger, M., Stankovi\u010d, M., Bartocci, E., Kov\u00e1cs, L.: This is the moment for probabilistic loops. Proc. ACM Program. Lang. 6(OOPSLA2), 1497\u20131525 (2022)","journal-title":"Proc. ACM Program. Lang."},{"key":"11_CR37","unstructured":"Morgan, C., McIver, A.: pGCL: formal reasoning for random algorithms. South Afr. Comput. J., 14\u201327 (1999)"},{"key":"11_CR38","doi-asserted-by":"crossref","unstructured":"Munsky, B., Khammash, M.: The finite state projection algorithm for the solution of the chemical master equation. J. Chem. Phys. 124(4), 044104 (2006)","DOI":"10.1063\/1.2145882"},{"key":"11_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-319-29604-3_5","volume-title":"Functional and Logic Programming","author":"P Narayanan","year":"2016","unstructured":"Narayanan, P., Carette, J., Romano, W., Shan, C., Zinkov, R.: Probabilistic inference by program transformation in Hakaru (system description). In: Kiselyov, O., King, A. (eds.) FLOPS 2016. LNCS, vol. 9613, pp. 62\u201379. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29604-3_5"},{"key":"11_CR40","doi-asserted-by":"crossref","unstructured":"Nori, A., Hur, C.K., Rajamani, S., Samuel, S.: R2: an efficient MCMC sampler for probabilistic programs. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a028 (2014)","DOI":"10.1609\/aaai.v28i1.9060"},{"key":"11_CR41","unstructured":"Pfeffer, A.: IBAL: a probabilistic rational programming language. In: IJCAI, pp. 733\u2013740. Citeseer (2001)"},{"key":"11_CR42","doi-asserted-by":"publisher","unstructured":"Randone, F., Bortolussi, L., Incerto, E., Tribastone, M.: Inference of probabilistic programs with moment-matching Gaussian mixtures. Proc. ACM Program. Lang. 8(POPL), 1882\u20131912 (2024). https:\/\/doi.org\/10.1145\/3632905","DOI":"10.1145\/3632905"},{"issue":"2","key":"11_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3460092","volume":"5","author":"F Randone","year":"2021","unstructured":"Randone, F., Bortolussi, L., Tribastone, M.: Refining mean-field approximations by dynamic state truncation. Proc. ACM Measure. Anal. Comput. Syst. 5(2), 1\u201330 (2021)","journal-title":"Proc. ACM Measure. Anal. Comput. Syst."},{"key":"11_CR44","doi-asserted-by":"crossref","unstructured":"Saad, F.A., Rinard, M.C., Mansinghka, V.K.: SPPL: probabilistic programming with fast exact symbolic inference. In: Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, pp. 804\u2013819 (2021)","DOI":"10.1145\/3453483.3454078"},{"issue":"9","key":"11_CR45","doi-asserted-by":"publisher","first-page":"093001","DOI":"10.1088\/1751-8121\/aa54d9","volume":"50","author":"D Schnoerr","year":"2017","unstructured":"Schnoerr, D., Sanguinetti, G., Grima, R.: Approximation and inference methods for stochastic biochemical kinetics-a tutorial review. J. Phys. A: Math. Theor. 50(9), 093001 (2017)","journal-title":"J. Phys. A: Math. Theor."},{"key":"11_CR46","doi-asserted-by":"crossref","unstructured":"Sukys, A., \u00d6cal, K., Grima, R.: Approximating solutions of the chemical master equation using neural networks. IScience 25(9), 105010 (2022)","DOI":"10.1016\/j.isci.2022.105010"},{"issue":"4","key":"11_CR47","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1038\/s42256-023-00632-6","volume":"5","author":"Y Tang","year":"2023","unstructured":"Tang, Y., Weng, J., Zhang, P.: Neural-network solutions to stochastic reaction networks. Nat. Mach. Intell. 5(4), 376\u2013385 (2023)","journal-title":"Nat. Mach. Intell."},{"key":"11_CR48","unstructured":"Van\u00a0Kampen, N.G.: Stochastic Processes in Physics and Chemistry, vol.\u00a01. Elsevier (1992)"},{"issue":"2","key":"11_CR49","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1103\/PhysRev.80.268","volume":"80","author":"GC Wick","year":"1950","unstructured":"Wick, G.C.: The evaluation of the collision matrix. Phys. Rev. 80(2), 268 (1950)","journal-title":"Phys. Rev."}],"container-title":["Lecture Notes in Computer Science","Leveraging Applications of Formal Methods, Verification and Validation. REoCAS Colloquium in Honor of Rocco De Nicola"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-73709-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T09:05:22Z","timestamp":1729674322000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-73709-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,9]]},"ISBN":["9783031737084","9783031737091"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-73709-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,10,9]]},"assertion":[{"value":"9 October 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISoLA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Leveraging Applications of Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Crete","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isola2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/isola-conference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}