{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:59:53Z","timestamp":1740099593685,"version":"3.37.3"},"publisher-location":"Cham","reference-count":49,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030349677"},{"type":"electronic","value":"9783030349684"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-34968-4_17","type":"book-chapter","created":{"date-parts":[[2019,11,21]],"date-time":"2019-11-21T19:14:54Z","timestamp":1574363694000},"page":"303-321","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Computing Bisimilarity Metrics for Probabilistic Timed Automata"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3335-234X","authenticated-orcid":false,"given":"Ruggero","family":"Lanotte","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3991-5123","authenticated-orcid":false,"given":"Simone","family":"Tini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,22]]},"reference":[{"issue":"2","key":"17_CR1","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1109\/TSE.2008.106","volume":"35","author":"L Alfaro de","year":"2009","unstructured":"de Alfaro, L., Faella, M., Stoelinga, M.: Linear and branching system metrics. IEEE Trans. Softw. Eng. 35(2), 258\u2013273 (2009)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0031984","volume-title":"Real-Time: Theory in Practice","year":"1992","unstructured":"de Bakker, J.W., Huizing, C., de Roever, W.P., Rozenberg, G. (eds.): REX 1991. LNCS, vol. 600. Springer, Heidelberg (1992). \nhttps:\/\/doi.org\/10.1007\/BFb0031984"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126, 183\u2013235 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-030-00151-3_12","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"E Asarin","year":"2018","unstructured":"Asarin, E., Basset, N., Degorre, A.: Distance on timed words and applications. In: Jansen, D.N., Prabhakar, P. (eds.) FORMATS 2018. LNCS, vol. 11022, pp. 199\u2013214. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-030-00151-3_12"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-36742-7_1","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G Bacci","year":"2013","unstructured":"Bacci, G., Bacci, G., Larsen, K.G., Mardare, R.: On-the-fly exact computation of bisimilarity distances. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013. LNCS, vol. 7795, pp. 1\u201315. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-36742-7_1"},{"key":"17_CR6","unstructured":"Bacci, G., Bacci, G., Larsen, K.G., Mardare, R.: On-the-fly computation of bisimilarity distances. Logical Methods Comput. Sci. 13(2) (2017)"},{"issue":"1","key":"17_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1017\/S0960129517000160","volume":"29","author":"G Bacci","year":"2019","unstructured":"Bacci, G., Bacci, G., Larsen, K.G., Mardare, R.: Converging from branching to linear metrics on Markov Chains. Math. Struct. Comp. Sci. 29(1), 3\u201337 (2019)","journal-title":"Math. Struct. Comp. Sci."},{"key":"17_CR8","unstructured":"Bacci, G., Bacci, G., Larsen, K.G., Mardare, R., Tang, Q., van Breugel: F.: Computing probabilistic bisimilarity distances for probabilistic automata. In: CONCUR. LIPiCS, vol. 140, pp. 9:1\u20139:17 (2019)"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0304-3975(01)00215-8","volume":"292","author":"D Beauquier","year":"2003","unstructured":"Beauquier, D.: On probabilistic timed automata. Theor. Comput. Sci. 292, 65\u201384 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Bertrand, N., et al.: Stochastic timed automata. Log. Meth. Comp. Sci. 10 (2014)","DOI":"10.2168\/LMCS-10(4:6)2014"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1023\/B:FORM.0000026093.21513.31","volume":"24","author":"P Bouyer","year":"2004","unstructured":"Bouyer, P.: Forward analysis of updatable timed automata. Formal Meth. Syst, Des. 24, 281\u2013320 (2004)","journal-title":"Formal Meth. Syst, Des."},{"issue":"2\u20133","key":"17_CR12","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.tcs.2004.04.003","volume":"321","author":"P Bouyer","year":"2004","unstructured":"Bouyer, P., Dufourd, C., Fleury, E., Petit, A.: Updatable timed automata. Theoret. Comput. Sci. 321(2\u20133), 291\u2013345 (2004)","journal-title":"Theoret. Comput. Sci."},{"issue":"19","key":"17_CR13","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1016\/j.ipl.2012.06.019","volume":"112","author":"F Breugel van","year":"2012","unstructured":"van Breugel, F.: On behavioural pseudometrics and closure ordinals. Inf. Process. Lett. 112(19), 715\u2013718 (2012)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"17_CR14","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.tcs.2004.09.035","volume":"331","author":"F Breugel van","year":"2005","unstructured":"van Breugel, F., Worrell, J.: A behavioural pseudometric for probabilistic transition systems. Theoret. Comput. Sci. 331(1), 115\u2013142 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"van Breugel, F., Sharma, B., Worrell, J.: Approximating a behavioural pseudometric without discount. Log. Methods Comput. Sci. 4(2) (2008)","DOI":"10.2168\/LMCS-4(2:2)2008"},{"issue":"1","key":"17_CR16","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/j.tcs.2006.05.021","volume":"360","author":"F Breugel van","year":"2006","unstructured":"van Breugel, F., Worrell, J.: Approximating and computing behavioural distances in probabilistic transition systems. Theor. Comput. Sci. 360(1), 373\u2013385 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-319-06880-0_10","volume-title":"Horizons of the Mind. A Tribute to Prakash Panangaden","author":"F Breugel van","year":"2014","unstructured":"van Breugel, F., Worrell, J.: The complexity of computing a bisimilarity pseudometric on probabilistic automata. In: van Breugel, F., Kashefi, E., Palamidessi, C., Rutten, J. (eds.) Horizons of the Mind. A Tribute to Prakash Panangaden. LNCS, vol. 8464, pp. 191\u2013213. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-06880-0_10"},{"key":"17_CR18","doi-asserted-by":"publisher","first-page":"44","DOI":"10.4204\/EPTCS.227.4","volume":"227","author":"Valentina Castiglioni","year":"2016","unstructured":"Castiglioni, V., Gebler, D., Tini, S.: Logical characterization of bisimulation metrics. In: QAPL 2016. EPTCS, vol. 227, pp. 44\u201362 (2016)","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"17_CR19","doi-asserted-by":"publisher","first-page":"104432","DOI":"10.1016\/j.ic.2019.06.001","volume":"268","author":"Valentina Castiglioni","year":"2019","unstructured":"Castiglioni, V., Tini, S.: Logical characterization of branching metrics for nondeterministic probabilistic transition systems. Inf. Comput. 268 (2019)","journal-title":"Information and Computation"},{"key":"17_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/3-540-56496-9_24","volume-title":"Computer Aided Verification","author":"K \u010cer\u0101ns","year":"1993","unstructured":"\u010cer\u0101ns, K.: Decidability of bisimulation equivalences for parallel timer processes. In: von Bochmann, G., Probst, D.K. (eds.) CAV 1992. LNCS, vol. 663, pp. 302\u2013315. Springer, Heidelberg (1993). \nhttps:\/\/doi.org\/10.1007\/3-540-56496-9_24"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Ibsen-Jensen, R., Majumdar, R.: Edit distance for timed automata. In: HSCC14, pp. 303\u2013312. ACM (2014)","DOI":"10.1145\/2562059.2562141"},{"issue":"9","key":"17_CR22","doi-asserted-by":"publisher","first-page":"2291","DOI":"10.1109\/TAC.2015.2404612","volume":"60","author":"K Chatterjee","year":"2015","unstructured":"Chatterjee, K., Prabhu, V.S.: Quantitative temporal simulation and refinement distances for timed systems. IEEE Trans. Automat. Contr. 60(9), 2291\u20132306 (2015)","journal-title":"IEEE Trans. Automat. Contr."},{"key":"17_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-3-642-28729-9_29","volume-title":"Foundations of Software Science and Computational Structures","author":"D Chen","year":"2012","unstructured":"Chen, D., van Breugel, F., Worrell, J.: On the complexity of computing probabilistic bisimilarity. In: Birkedal, L. (ed.) FoSSaCS 2012. LNCS, vol. 7213, pp. 437\u2013451. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-28729-9_29"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Chen, T., Han, T., Katoen, J.: Time-abstracting bisimulation for probabilistic timed automata. In: TASE08, pp. 177\u2013184. IEEE (2008)","DOI":"10.1109\/TASE.2008.29"},{"issue":"4","key":"17_CR25","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s10009-014-0361-y","volume":"17","author":"A David","year":"2015","unstructured":"David, A., Larsen, K.G., Legay, A., Miku\u010dionis, M., Poulsen, D.B.: Uppaal SMC tutorial. STTT 17(4), 397\u2013415 (2015)","journal-title":"STTT"},{"issue":"2","key":"17_CR26","first-page":"79","volume":"153","author":"Y Deng","year":"2006","unstructured":"Deng, Y., Chothia, T., Palamidessi, C., Pang, J.: Metrics for action-labelled quantitative transition systems. QAPL. ENTCS 153(2), 79\u201396 (2006)","journal-title":"QAPL. ENTCS"},{"issue":"3","key":"17_CR27","first-page":"73","volume":"253","author":"Y Deng","year":"2009","unstructured":"Deng, Y., Du, W.: The kantorovich metric in computer science: a brief survey. QAPL. ENTCS 253(3), 73\u201382 (2009)","journal-title":"QAPL. ENTCS"},{"issue":"3","key":"17_CR28","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.tcs.2003.09.013","volume":"318","author":"J Desharnais","year":"2004","unstructured":"Desharnais, J., Gupta, J., Jagadeesan, R., Panangaden, P.: Metrics for labelled Markov processes. Theoret. Comput. Sci. 318(3), 323\u2013354 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/3-540-52148-8_17","volume-title":"Automatic Verification Methods for Finite State Systems","author":"DL Dill","year":"1990","unstructured":"Dill, D.L.: Timing assumptions and verification of finite-state concurrent systems. In: Sifakis, J. (ed.) CAV 1989. LNCS, vol. 407, pp. 197\u2013212. Springer, Heidelberg (1990). \nhttps:\/\/doi.org\/10.1007\/3-540-52148-8_17"},{"key":"17_CR30","unstructured":"Ferns, N., Panangaden, P., Precup, D.: Metrics for finite markov decision processes. In: UAI, pp. 162\u2013169. AUAI Press (2004)"},{"key":"17_CR31","unstructured":"Giacalone, A., Jou, C., Smolka, S.A.: Algebraic reasoning for probabilistic concurrent systems. In: IFIP TC2 PROCOMET (1990)"},{"issue":"2","key":"17_CR32","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1006\/inco.1994.1045","volume":"111","author":"T Henzinger","year":"1994","unstructured":"Henzinger, T., Nicollin, X., Sifakis, J., Yovine, S.: Symbolic model checking for real-time systems. Inf. Comp. 111(2), 193\u2013244 (1994)","journal-title":"Inf. Comp."},{"key":"17_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/11603009_18","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"TA Henzinger","year":"2005","unstructured":"Henzinger, T.A., Majumdar, R., Prabhu, V.S.: Quantifying similarities between timed systems. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol. 3829, pp. 226\u2013241. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11603009_18"},{"key":"17_CR34","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0304-3975(01)00046-9","volume":"282","author":"M Kwiatkowska","year":"2002","unstructured":"Kwiatkowska, M., Norman, G., Segala, R., Sproston, J.: Automatic verification of real-time systems with discrete probability distributions. Theoret. Comput. Sci. 282, 101\u2013150 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/3-540-61550-4_167","volume-title":"Mathematical Foundations of Computer Science 1996","author":"M Kwiatkowska","year":"1996","unstructured":"Kwiatkowska, M., Norman, G.: Probabilistic metric semantics for a simple language with recursion. In: Penczek, W., Sza\u0142as, A. (eds.) MFCS 1996. LNCS, vol. 1113, pp. 419\u2013430. Springer, Heidelberg (1996). \nhttps:\/\/doi.org\/10.1007\/3-540-61550-4_167"},{"issue":"50","key":"17_CR36","doi-asserted-by":"publisher","first-page":"4291","DOI":"10.1016\/j.tcs.2010.09.003","volume":"411","author":"R Lanotte","year":"2010","unstructured":"Lanotte, R., Maggiolo-Schettini, A., Troina, A.: Weak bisimulation for probabilistic timed automata. Theor. Comput. Sci. 411(50), 4291\u20134322 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"17_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"KG Larsen","year":"1991","unstructured":"Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Inf. Comput. 94(1), 1\u201328 (1991)","journal-title":"Inf. Comput."},{"key":"17_CR38","doi-asserted-by":"crossref","unstructured":"Majumdar, R., Prabhu, V.S.: Computing the Skorokhod distance between polygonal traces. In: HSCC15, pp. 199\u2013208. ACM (2015)","DOI":"10.1145\/2728606.2728618"},{"key":"17_CR39","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/s10703-012-0177-x","volume":"43","author":"G Norman","year":"2013","unstructured":"Norman, G., Parker, D., Sproston, J.: Model checking for probabilistic timed automata. Formal Methods Syst. Des. 43, 164\u2013190 (2013)","journal-title":"Formal Methods Syst. Des."},{"key":"17_CR40","unstructured":"Segala, R.: Modeling and verification of randomized distributed real-time systems. Ph.D. thesis, MIT (1995)"},{"key":"17_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-540-27813-9_16","volume-title":"Computer Aided Verification","author":"K Sen","year":"2004","unstructured":"Sen, K., Viswanathan, M., Agha, G.: Statistical model checking of black-box probabilistic systems. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 202\u2013215. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-27813-9_16"},{"key":"17_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-642-15297-9_17","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"J Sproston","year":"2010","unstructured":"Sproston, J., Troina, A.: Simulation and bisimulation for probabilistic timed automata. In: Chatterjee, K., Henzinger, T.A. (eds.) FORMATS 2010. LNCS, vol. 6246, pp. 213\u2013227. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-15297-9_17"},{"key":"17_CR43","unstructured":"Stoelinga, M.: Alea jacta est: verification of probabilistic, real-time and parametric systems. Ph.D. thesis, University of Nijmegen, The Netherlands (2002)"},{"key":"17_CR44","unstructured":"Tang, Q., van Breugel, F.: Computing probabilistic bisimilarity distances via policy iteration. In: CONCUR, pp. 22:1\u201322:15. LIPIcs (2016)"},{"key":"17_CR45","unstructured":"Tang, Q., van Breugel, F.: Algorithms to compute probabilistic bisimilarity distances for Labelled Markov Chains. In: CONCUR, pp. 27:1\u201327:16. LIPiCS (2017)"},{"key":"17_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/3-540-61604-7_75","volume-title":"CONCUR \u201996: Concurrency Theory","author":"S Ta\u015eiran","year":"1996","unstructured":"Ta\u015eiran, S., Alur, R., Kurshan, R.P., Brayton, R.K.: Verifying abstractions of timed systems. In: Montanari, U., Sassone, V. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 546\u2013562. Springer, Heidelberg (1996). \nhttps:\/\/doi.org\/10.1007\/3-540-61604-7_75"},{"key":"17_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-540-40965-6_18","volume-title":"Advances in Computing Science \u2013 ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation","author":"S Yamane","year":"2003","unstructured":"Yamane, S.: Probabilistic timed simulation verification and its application to stepwise refinement of real-time systems. In: Saraswat, V.A. (ed.) ASIAN 2003. LNCS, vol. 2896, pp. 276\u2013290. Springer, Heidelberg (2003). \nhttps:\/\/doi.org\/10.1007\/978-3-540-40965-6_18"},{"key":"17_CR48","unstructured":"Younes, H.L.S.: Verification and planning for stochastic processes with asynchronous events. Ph.D. thesis, Pittsburgh, PA, USA (2004)"},{"key":"17_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/3-540-65193-4_20","volume-title":"Lectures on Embedded Systems","author":"S Yovine","year":"1998","unstructured":"Yovine, S.: Model checking timed automata. In: Rozenberg, G., Vaandrager, F.W. (eds.) EEF School 1996. LNCS, vol. 1494, pp. 114\u2013152. Springer, Heidelberg (1998). \nhttps:\/\/doi.org\/10.1007\/3-540-65193-4_20"}],"container-title":["Lecture Notes in Computer Science","Integrated Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-34968-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,21]],"date-time":"2019-11-21T19:18:22Z","timestamp":1574363902000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-34968-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030349677","9783030349684"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-34968-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"22 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integrated Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bergen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2019","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":"ifm2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ifm2019.hvl.no\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}