{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T12:23:47Z","timestamp":1726057427709},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030311742"},{"type":"electronic","value":"9783030311759"}],"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-31175-9_11","type":"book-chapter","created":{"date-parts":[[2019,11,5]],"date-time":"2019-11-05T10:18:17Z","timestamp":1572949097000},"page":"182-205","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Stronger Validity Criteria for Encoding Synchrony"],"prefix":"10.1007","author":[{"given":"Rob","family":"van Glabbeek","sequence":"first","affiliation":[]},{"given":"Ursula","family":"Goltz","sequence":"additional","affiliation":[]},{"given":"Christopher","family":"Lippert","sequence":"additional","affiliation":[]},{"given":"Stephan","family":"Mennicke","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,4]]},"reference":[{"issue":"2","key":"11_CR1","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0304-3975(97)00223-5","volume":"195","author":"RM Amadio","year":"1998","unstructured":"Amadio, R.M., Castellani, I., Sangiorgi, D.: On bisimulations for the asynchronous pi-calculus. Theoret. Comput. Sci. 195(2), 291\u2013324 (1998). \n                      https:\/\/doi.org\/10.1016\/S0304-3975(97)00223-5","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1202","DOI":"10.1007\/11523468_97","volume-title":"Automata, Languages and Programming","author":"M Baldamus","year":"2005","unstructured":"Baldamus, M., Parrow, J., Victor, B.: A fully abstract encoding of the \n                      \n                        \n                      \n                      $${\\pi }$$\n                    -calculus with data terms. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1202\u20131213. Springer, Heidelberg (2005). \n                      https:\/\/doi.org\/10.1007\/11523468_97"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-540-68679-8_29","volume-title":"Concurrency, Graphs and Models","author":"R Beauxis","year":"2008","unstructured":"Beauxis, R., Palamidessi, C., Valencia, F.D.: On the asynchronous nature of the asynchronous \n                      \n                        \n                      \n                      $$\\pi $$\n                    -calculus. In: Degano, P., De Nicola, R., Meseguer, J. (eds.) Concurrency, Graphs and Models. LNCS, vol. 5065, pp. 473\u2013492. Springer, Heidelberg (2008). \n                      https:\/\/doi.org\/10.1007\/978-3-540-68679-8_29"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-642-82453-1_9","volume-title":"Logics and Models of Concurrent Systems","author":"G. Boudol","year":"1985","unstructured":"Boudol, G.: Notes on algebraic calculi of processes. In: Apt, K.R. (eds) Logics and Models of Concurrent Systems. NATO ASI Series (Series F: Computer and Systems Sciences), vol. 13, pp. 261\u2013303. Springer, Heidelberg (1985). \n                      https:\/\/doi.org\/10.1007\/978-3-642-82453-1_9"},{"key":"11_CR5","unstructured":"Boudol, G.: Asynchrony and the \n                      \n                        \n                      \n                      $$\\pi $$\n                    -calculus (Note). Technical Report, 1702, INRIA (1992)"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/3-540-60218-6_23","volume-title":"CONCUR \u201995: Concurrency Theory","author":"E Brinksma","year":"1995","unstructured":"Brinksma, E., Rensink, A., Vogler, W.: Fair testing. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol. 962, pp. 313\u2013327. Springer, Heidelberg (1995). \n                      https:\/\/doi.org\/10.1007\/3-540-60218-6_23"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-45446-2_16","volume-title":"Theoretical Computer Science","author":"D Cacciagrano","year":"2001","unstructured":"Cacciagrano, D., Corradini, F.: On synchronous and asynchronous communication paradigms. ICTCS 2001. LNCS, vol. 2202, pp. 256\u2013268. Springer, Heidelberg (2001). \n                      https:\/\/doi.org\/10.1007\/3-540-45446-2_16"},{"issue":"3","key":"11_CR8","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.tcs.2007.07.009","volume":"386","author":"D Cacciagrano","year":"2007","unstructured":"Cacciagrano, D., Corradini, F., Palamidessi, C.: Separation of synchronous and asynchronous communication via testing. Theoret. Comput. Sci. 386(3), 218\u2013235 (2007). \n                      https:\/\/doi.org\/10.1016\/j.tcs.2007.07.009","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R Nicola De","year":"1984","unstructured":"De Nicola, R., Hennessy, M.: Testing equivalences for processes. Theoret. Comput. Sci. 34, 83\u2013133 (1984). \n                      https:\/\/doi.org\/10.1016\/0304-3975(84)90113-0","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR10","doi-asserted-by":"publisher","unstructured":"Du, W., Yang, Z., Zhu, H.: A fully abstract encoding for sub asynchronous Pi calculus. In: Pang, J., Zhang, C., He, J., Weng, J. (eds.) Proceedings of TASE 2018, pp. 17\u201327. IEEE Computer Society Press (2018). \n                      https:\/\/doi.org\/10.1109\/TASE.2018.00011","DOI":"10.1109\/TASE.2018.00011"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2015.07.043","volume":"611","author":"Y Fu","year":"2016","unstructured":"Fu, Y.: Theory of interaction. Theoret. Comput. Sci. 611, 1\u201349 (2016). \n                      https:\/\/doi.org\/10.1016\/j.tcs.2015.07.043","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-319-10882-7_13","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2014","author":"T Given-Wilson","year":"2014","unstructured":"Given-Wilson, T.: Expressiveness via intensionality and concurrency. In: Ciobanu, G., M\u00e9ry, D. (eds.) ICTAC 2014. LNCS, vol. 8687, pp. 206\u2013223. Springer, Cham (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-319-10882-7_13"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"30","DOI":"10.4204\/EPTCS.160.4","volume":"160","author":"Thomas Given-Wilson","year":"2014","unstructured":"Given-Wilson, T.: On the expressiveness of intensional communication. In: Borgstr\u00f6m, J., Crafa, S. (eds.) Proceedings EXPRESS\/SOS 2014. EPTCS, vol. 160, pp. 30\u201346 (2014). \n                      https:\/\/doi.org\/10.4204\/EPTCS.160.4","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"99","DOI":"10.4204\/EPTCS.189.9","volume":"189","author":"Thomas Given-Wilson","year":"2015","unstructured":"Given-Wilson, T., Legay, A.: On the expressiveness of joining. In: Knight, S., Lanese, I., Lluch Lafuente, A., Torres Vieira, H. (eds.) Proceedings of ICE2015. EPTCS, vol. 189, pp. 99\u2013113 (2015). \n                      https:\/\/doi.org\/10.4204\/EPTCS.189.9","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-319-46750-4_9","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2016","author":"T Given-Wilson","year":"2016","unstructured":"Given-Wilson, T., Legay, A.: On the expressiveness of symmetric communication. In: Sampaio, A., Wang, F. (eds.) ICTAC 2016. LNCS, vol. 9965, pp. 139\u2013157. Springer, Cham (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-319-46750-4_9"},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-1-4471-2120-6_8","volume-title":"Workshops in Computing","author":"Rob van Glabbeek","year":"1995","unstructured":"van Glabbeek, R.J.: On the expressiveness of ACP. In: Ponse, A., Verhoef, C., van Vlijmen, S.F.M. (eds.) Algebra of Communicating Processes. Workshops in Computing, pp. 188\u2013217. Springer, London (1995), \n                      https:\/\/doi.org\/10.1007\/978-1-4471-2120-6_8"},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"81","DOI":"10.4204\/EPTCS.89.7","volume":"89","author":"Rob van Glabbeek","year":"2012","unstructured":"van Glabbeek, R.J.: Musings on encodings and expressiveness. In: Luttik, B., Reniers, M.A. (eds.) Proceedings EXPRESS\/SOS 2012. EPTCS, vol. 89, pp. 81\u201398 (2012). \n                      https:\/\/doi.org\/10.4204\/EPTCS.89.7","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.ipl.2018.04.015","volume":"137","author":"Rob J. van Glabbeek","year":"2018","unstructured":"van Glabbeek, R.J.: On the validity of encodings of the synchronous in the asynchronous \n                      \n                        \n                      \n                      $$\\pi $$\n                    -calculus. Inf. Process. Lett. 137, 17\u201325 (2018). \n                      https:\/\/doi.org\/10.1016\/j.ipl.2018.04.015\n                      \n                    . \n                      https:\/\/arxiv.org\/abs\/1802.09182","journal-title":"Information Processing Letters"},{"key":"11_CR19","unstructured":"van Glabbeek, R.J.: A Theory of Encodings and Expressiveness. Technical Report, Data61, CSIRO (2018). \n                      https:\/\/arxiv.org\/abs\/1805.10415\n                      \n                    . Full version of [20]"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-319-89366-2_10","volume-title":"Foundations of Software Science and Computation Structures","author":"RJ van Glabbeek","year":"2018","unstructured":"van Glabbeek, R.J.: A theory of encodings and expressiveness (extended abstract). In: Baier, C., Dal Lago, U. (eds.) FoSSaCS 2018. LNCS, vol. 10803, pp. 183\u2013202. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-89366-2_10"},{"issue":"4","key":"11_CR21","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s00446-010-0120-6","volume":"23","author":"Daniele Gorla","year":"2010","unstructured":"Gorla, D.: A taxonomy of process calculi for distribution and mobility. Distrib. Comput. 23(4), 273\u2013299 (2010). \n                      https:\/\/doi.org\/10.1007\/s00446-010-0120-6","journal-title":"Distributed Computing"},{"issue":"9","key":"11_CR22","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.1016\/j.ic.2010.05.002","volume":"208","author":"D Gorla","year":"2010","unstructured":"Gorla, D.: Towards a unified approach to encodability and separation results for process calculi. Inf. Comput. 208(9), 1031\u20131053 (2010). \n                      https:\/\/doi.org\/10.1016\/j.ic.2010.05.002","journal-title":"Inf. Comput."},{"issue":"4","key":"11_CR23","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1017\/S0960129514000279","volume":"26","author":"D Gorla","year":"2016","unstructured":"Gorla, D., Nestmann, U.: Full abstraction for expressiveness: history, myths and facts. Math. Struct. Comput. Sci. 26(4), 639\u2013654 (2016). \n                      https:\/\/doi.org\/10.1017\/S0960129514000279","journal-title":"Math. Struct. Comput. Sci."},{"key":"11_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BFb0057019","volume-title":"ECOOP 1991 European Conference on Object-Oriented Programming","author":"K Honda","year":"1991","unstructured":"Honda, K., Tokoro, M.: An object calculus for asynchronous communication. In: America, P. (ed.) ECOOP 1991. LNCS, vol. 512, pp. 133\u2013147. Springer, Heidelberg (1991). \n                      https:\/\/doi.org\/10.1007\/BFb0057019"},{"key":"11_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/978-3-642-14162-1_37","volume-title":"Automata, Languages and Programming","author":"I Lanese","year":"2010","unstructured":"Lanese, I., P\u00e9rez, J.A., Sangiorgi, D., Schmitt, A.: On the expressiveness of polyadic and synchronous communication in higher-order process calculi. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 442\u2013453. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-14162-1_37"},{"key":"11_CR26","unstructured":"Milner, R.: The Polyadic \n                      \n                        \n                      \n                      $$\\pi $$\n                    -Calculus: A Tutorial. Technical Report ECS-LFCS-91-180, The University of Edinburgh. Informatics Report Series (1991)"},{"issue":"2","key":"11_CR27","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1017\/S0960129500001407","volume":"2","author":"R Milner","year":"1992","unstructured":"Milner, R.: Functions as processes. Math. Struct. Comput. Sci. 2(2), 119\u2013141 (1992). \n                      https:\/\/doi.org\/10.1017\/S0960129500001407","journal-title":"Math. Struct. Comput. Sci."},{"key":"11_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1007\/3-540-60084-1_112","volume-title":"Automata, Languages and Programming","author":"V Natarajan","year":"1995","unstructured":"Natarajan, V., Cleaveland, R.: Divergence and fair testing. In: F\u00fcl\u00f6p, Z., G\u00e9cseg, F. (eds.) ICALP 1995. LNCS, vol. 944, pp. 648\u2013659. Springer, Heidelberg (1995). \n                      https:\/\/doi.org\/10.1007\/3-540-60084-1_112"},{"issue":"1\u20132","key":"11_CR29","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1006\/inco.1999.2822","volume":"156","author":"U Nestmann","year":"2000","unstructured":"Nestmann, U.: What is a \u201cGood\u201d encoding of guarded choice? Inf. Comput. 156(1\u20132), 287\u2013319 (2000). \n                      https:\/\/doi.org\/10.1006\/inco.1999.2822","journal-title":"Inf. Comput."},{"issue":"1","key":"11_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.2000.2868","volume":"163","author":"U Nestmann","year":"2000","unstructured":"Nestmann, U., Pierce, B.C.: Decoding choice encodings. Inf. Comput. 163(1), 1\u201359 (2000). \n                      https:\/\/doi.org\/10.1006\/inco.2000.2868","journal-title":"Inf. Comput."},{"issue":"5","key":"11_CR31","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1017\/S0960129503004043","volume":"13","author":"C Palamidessi","year":"2003","unstructured":"Palamidessi, C.: Comparing the expressive power of the synchronous and asynchronous pi-calculi. Math. Struct. Comput. Sci. 13(5), 685\u2013719 (2003). \n                      https:\/\/doi.org\/10.1017\/S0960129503004043","journal-title":"Math. Struct. Comput. Sci."},{"issue":"4","key":"11_CR32","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1017\/S0960129514000280","volume":"26","author":"J Parrow","year":"2016","unstructured":"Parrow, J.: General conditions for full abstraction. Math. Struct. Comput. Sci. 26(4), 655\u2013657 (2016). \n                      https:\/\/doi.org\/10.1017\/S0960129514000280","journal-title":"Math. Struct. Comput. Sci."},{"key":"11_CR33","doi-asserted-by":"publisher","first-page":"46","DOI":"10.4204\/EPTCS.190.4","volume":"190","author":"Kirstin Peters","year":"2015","unstructured":"Peters, K., van Glabbeek, R.J.: Analysing and comparing encodability criteria. In: Crafa, S., Gebler, D.E. (eds.) EXPRESS\/SOS 2015. EPTCS, vol. 190, pp. 46\u201360 (2015). \n                      https:\/\/doi.org\/10.4204\/EPTCS.190.4","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"11_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-642-28729-9_14","volume-title":"Foundations of Software Science and Computational Structures","author":"K Peters","year":"2012","unstructured":"Peters, K., Nestmann, U.: Is it a \u201cGood\u201d encoding of mixed choice? In: Birkedal, L. (ed.) FoSSaCS 2012. LNCS, vol. 7213, pp. 210\u2013224. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-28729-9_14"},{"key":"11_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-642-37036-6_18","volume-title":"Programming Languages and Systems","author":"K Peters","year":"2013","unstructured":"Peters, K., Nestmann, U., Goltz, U.: On distributability in process calculi. In: Felleisen, M., Gardner, P. (eds.) ESOP 2013. LNCS, vol. 7792, pp. 310\u2013329. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-37036-6_18"},{"key":"11_CR36","doi-asserted-by":"publisher","first-page":"89","DOI":"10.4204\/EPTCS.64.7","volume":"64","author":"Kirstin Peters","year":"2011","unstructured":"Peters, K., Schicke, J.-W., Nestmann, U.: Synchrony vs causality in the asynchronous pi-calculus. In: Luttik, B., Valencia, F. (eds.) Proceedings EXPRESS 2011, EPTCS, vol. 64, pp. 89\u2013103 (2011). \n                      https:\/\/doi.org\/10.4204\/EPTCS.64.7","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"11_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/3-540-46432-8_19","volume-title":"Foundations of Software Science and Computation Structures","author":"P Quaglia","year":"2000","unstructured":"Quaglia, P., Walker, D.: On synchronous and asynchronous mobile processes. In: Tiuryn, J. (ed.) FoSSaCS 2000. LNCS, vol. 1784, pp. 283\u2013296. Springer, Heidelberg (2000). \n                      https:\/\/doi.org\/10.1007\/3-540-46432-8_19"},{"key":"11_CR38","doi-asserted-by":"publisher","unstructured":"Riecke, J.G.: Fully abstract translations between functional languages. In: Wise, D.S. (ed.) Proceedings POPL 1991, pp. 245\u2013254. ACM Press (1991). \n                      https:\/\/doi.org\/10.1145\/99583.99617","DOI":"10.1145\/99583.99617"},{"key":"11_CR39","unstructured":"Sangiorgi, D., Walker, D.: The \n                      \n                        \n                      \n                      $$\\pi $$\n                    -Calculus: A Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)"},{"key":"11_CR40","doi-asserted-by":"publisher","unstructured":"Shapiro, E.Y.: Separating concurrent languages with categories of language embeddings. In: Koutsougeras, C., Vitter, J.S. (eds.) STOC 1991, pp. 198\u2013208. ACM (1991). \n                      https:\/\/doi.org\/10.1145\/103418.103423","DOI":"10.1145\/103418.103423"},{"key":"11_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/BFb0084811","volume-title":"CONCUR \u201992","author":"E Shapiro","year":"1992","unstructured":"Shapiro, E.: Embeddings among concurrent programming languages. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630, pp. 486\u2013503. Springer, Heidelberg (1992). \n                      https:\/\/doi.org\/10.1007\/BFb0084811"},{"key":"11_CR42","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0304-3975(85)90093-3","volume":"37","author":"R Simone de","year":"1985","unstructured":"de Simone, R.: Higher-level synchronising devices in Meije-SCCS. Theoret. Comput. Sci. 37, 245\u2013267 (1985). \n                      https:\/\/doi.org\/10.1016\/0304-3975(85)90093-3","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/3-540-56596-5_49","volume-title":"Semantics: Foundations and Applications","author":"FW Vaandrager","year":"1993","unstructured":"Vaandrager, F.W.: Expressiveness results for process algebras. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX 1992. LNCS, vol. 666, pp. 609\u2013638. Springer, Heidelberg (1993). \n                      https:\/\/doi.org\/10.1007\/3-540-56596-5_49"}],"container-title":["Lecture Notes in Computer Science","The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-31175-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,5]],"date-time":"2019-11-05T10:49:25Z","timestamp":1572950965000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-31175-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030311742","9783030311759"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-31175-9_11","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":"4 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}