{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,30]],"date-time":"2024-07-30T02:54:11Z","timestamp":1722308051193},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2021,2,18]],"date-time":"2021-02-18T00:00:00Z","timestamp":1613606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,18]],"date-time":"2021-02-18T00:00:00Z","timestamp":1613606400000},"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":["Form Methods Syst Des"],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1007\/s10703-021-00360-w","type":"journal-article","created":{"date-parts":[[2021,2,19]],"date-time":"2021-02-19T17:48:06Z","timestamp":1613756886000},"page":"83-125","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Compositional verification of concurrent systems by combining bisimulations"],"prefix":"10.1007","volume":"58","author":[{"given":"Fr\u00e9d\u00e9ric","family":"Lang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Radu","family":"Mateescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franco","family":"Mazzanti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,18]]},"reference":[{"key":"360_CR1","doi-asserted-by":"crossref","unstructured":"Andersen HR (1995) Partial model checking. In: Proceedings of the 10th annual IEEE symposium on logic in computer science LICS (San Diego, California, USA). IEEE Computer Society Press, pp 398\u2013407","DOI":"10.1109\/LICS.1995.523274"},{"issue":"4","key":"360_CR2","first-page":"481","volume":"20","author":"R Bolze","year":"2006","unstructured":"Bolze R, Cappello F, Caron E, Dayd\u00e9 Michel J, Desprez F, Jeannot E, J\u00e9gou Y, Lanteri S, Leduc J, Melab N, Mornet G, Namyst R, Primet P, Qu\u00e9tier B, Richard O, Talbi E-G, Touche I (2006) Grid\u20195000: a large scale and highly reconfigurable experimental grid testbed. IJHPCA 20(4):481\u2013494","journal-title":"IJHPCA"},{"issue":"4","key":"360_CR3","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1145\/321239.321249","volume":"11","author":"A Brzozowski Janusz","year":"1964","unstructured":"Brzozowski Janusz A (1964) Derivatives of regular expressions. J Assoc Comput Mach 11(4):481\u2013494","journal-title":"J Assoc Comput Mach"},{"key":"360_CR4","volume-title":"Reference manual of the LNT to LOTOS translator (version 6.7)","author":"D Champelovier","year":"2017","unstructured":"Champelovier D, Clerc X, Garavel H, Guerte Y, McKinty C, Powazny V, Lang F, Serwe W, Smeding G (2017) Reference manual of the LNT to LOTOS translator (version 6.7). INRIA, Grenoble"},{"key":"360_CR5","doi-asserted-by":"crossref","unstructured":"Cheung SC, Kramer J (1993) Enhancing compositional reachability analysis with context constraints. In: Proceedings of the 1st ACM SIGSOFT international symposium on the foundations of software engineering (Los Angeles, CA, USA). ACM Press, pp 115\u2013125","DOI":"10.1145\/167049.167071"},{"issue":"2","key":"360_CR6","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1145\/5397.5399","volume":"8","author":"EM Clarke","year":"1986","unstructured":"Clarke EM, Emerson EA, Sistla AP (1986) Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Trans Program Lang Syst 8(2):244\u2013263","journal-title":"ACM Trans Program Lang Syst"},{"key":"360_CR7","doi-asserted-by":"crossref","unstructured":"Cleaveland R, Klein M, Steffen B (1992) Faster model checking for the modal mu-calculus. In: Bochmann GV, Probst DK (eds) Proceedings of the 4th international workshop on computer aided verification CAV \u201992 (Montr\u00e9al, Canada). Lecture notes in computer science, vol 663. Springer, Berlin, pp 410\u2013422","DOI":"10.1007\/3-540-56496-9_32"},{"key":"360_CR8","doi-asserted-by":"crossref","unstructured":"Crouzen P, Lang F (2011) Smart reduction. In: Giannakopoulou D, Orejas F (eds) Proceedings of fundamental approaches to software engineering (FASE\u201911), Saarbr\u00fccken, Germany. Lecture notes in computer science, vol 6603. Springer, Berlin, pp 111\u2013126","DOI":"10.1007\/978-3-642-19811-3_9"},{"key":"360_CR9","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1145\/201019.201032","volume":"42","author":"R De Nicola","year":"1990","unstructured":"De Nicola R, Vaandrager FW (1990) Three logics for branching bisimulation. J Assoc Comput Mach 42:458\u2013487","journal-title":"J Assoc Comput Mach"},{"key":"360_CR10","doi-asserted-by":"crossref","unstructured":"De Nicola R, Vaandrager FW (1990) Action versus state based logics for transition systems. Lecture notes in computer science, vol 469. Springer, Berlin, pp 407\u2013419","DOI":"10.1007\/3-540-53479-2_17"},{"key":"360_CR11","doi-asserted-by":"crossref","unstructured":"de\u00a0Putter S, Wijs A, Lang F (2018) Compositional model checking is lively\u2014extended version. Sci Comput Program","DOI":"10.1007\/978-3-319-68034-7_7"},{"key":"360_CR12","unstructured":"Emerson EA, Lei C-L (1986) Efficient model checking in fragments of the propositional mu-calculus. In: Proceedings of the 1st international symposium on logic in computer science LICS\u201986, pp 267\u2013278"},{"key":"360_CR13","unstructured":"Fantechi A, Gnesi S, Ristori G (1992) From actl to $$\\mu $$-calculus (extended abstract). In: Proceedings of the workshop on theory and practice in verification. ERCIM"},{"issue":"2","key":"360_CR14","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","volume":"18","author":"J Fischer Michael","year":"1979","unstructured":"Fischer Michael J, Ladner Richard E (1979) Propositional dynamic logic of regular programs. J Comput Syst Sci 18(2):194\u2013211","journal-title":"J Comput Syst Sci"},{"key":"360_CR15","doi-asserted-by":"crossref","unstructured":"Garavel H, Lang F (2001) SVL: a scripting language for compositional verification. In: Kim M, Chin B, Kang S, Lee D (eds) Proceedings of the 21st IFIP WG 6.1 international conference on formal techniques for networked and distributed systems (FORTE\u201901), Cheju Island, Korea. Full version available as INRIA research report RR-4223. Kluwer Academic Publishers, pp 377\u2013392","DOI":"10.1007\/0-306-47003-9_24"},{"issue":"4","key":"360_CR16","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s00236-015-0226-1","volume":"52","author":"H Garavel","year":"2015","unstructured":"Garavel H, Lang F, Mateescu R (2015) Compositional verification of asynchronous concurrent systems using CADP. Acta Inform 52(4):337\u2013392","journal-title":"Acta Inform"},{"issue":"2","key":"360_CR17","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10009-012-0244-z","volume":"15","author":"H Garavel","year":"2013","unstructured":"Garavel H, Lang F, Mateescu R, Serwe W (2013) CADP 2011: a toolbox for the construction and analysis of distributed processes. Int J Softw Tools Technol Transf 15(2):89\u2013107","journal-title":"Int J Softw Tools Technol Transf"},{"key":"360_CR18","doi-asserted-by":"crossref","unstructured":"Garavel H, Mateescu R, Bergamini D, Curic A, Descoubes N, Joubert C, Smarandache-Sturm I, Stragier G (2006) Distributor and bcg\\_merge: Tools for distributed explicit state space generation. In: Hermanns H, Palberg J (eds) Proceedings of the 12th international conference on tools and algorithms for the construction and analysis of systems (TACAS\u201906), Vienna, Austria. Lecture notes in computer science, vol 3920. Springer, Berlin, pp 445\u2013449","DOI":"10.1007\/11691372_30"},{"key":"360_CR19","doi-asserted-by":"crossref","unstructured":"Garavel H, Thivolle D (2009) Verification of GALS systems by combining synchronous languages and process calculi. In: Pasareanu C (ed) Proceedings of the 16th international spin workshop on model checking of software (SPIN\u201909), Grenoble, France. Lecture notes in computer science, vol 5578. Springer, Berlin, pp 241\u2013260","DOI":"10.1007\/978-3-642-02652-2_20"},{"key":"360_CR20","doi-asserted-by":"crossref","unstructured":"Gerth R, Kuiper R, Penczek W, Peled D (1999) A partial order approach to branching time logic model checking. Inf Comput 150(2):132\u2013152. A short version of this paper was previously published at the third Israel symposium on theory of computing and systems ISTCS 1995","DOI":"10.1006\/inco.1998.2778"},{"key":"360_CR21","doi-asserted-by":"crossref","unstructured":"Godefroid P (1990) Using partial orders to improve automatic verification methods. In: Kurshan RP, Clarke EM (eds) Proceedings of the 2nd workshop on computer-aided verification (Rutgers, New Jersey, USA). DIMACS series in discrete mathematics and theoretical computer science, vol\u00a03. AMS-ACM, pp 321\u2013340","DOI":"10.1090\/dimacs\/003\/21"},{"key":"360_CR22","doi-asserted-by":"crossref","unstructured":"Graf S, Steffen B (1990) Compositional minimization of finite state systems. In: Clarke EM, Kurshan RP (eds) Proceedings of the 2nd workshop on computer-aided verification (CAV\u201990), Rutgers, New Jersey, USA. Lecture notes in computer science, vol 531. Springer, Berlin, pp 186\u2013196","DOI":"10.1007\/BFb0023732"},{"key":"360_CR23","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/9946.001.0001","volume-title":"Modeling and analysis of communicating systems","author":"JF Groote","year":"2014","unstructured":"Groote JF, Mousavi MR (2014) Modeling and analysis of communicating systems. The MIT Press, Cambridge"},{"key":"360_CR24","volume-title":"The syntax and semantics of $$\\mu $$CRL. CS-R 9076","author":"JF Groote","year":"1990","unstructured":"Groote JF, Ponse A (1990) The syntax and semantics of $$\\mu $$CRL. CS-R 9076. Centrum voor Wiskunde en Informatica, Amsterdam"},{"issue":"1\u20132","key":"360_CR25","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0304-3975(96)80702-X","volume":"170","author":"JF Groote","year":"1996","unstructured":"Groote JF, Sellink MPA (1996) Confluence for process verification. Theor Comput Sci 170(1\u20132):47\u201381","journal-title":"Theor Comput Sci"},{"key":"360_CR26","doi-asserted-by":"crossref","unstructured":"Groote JF, van de Pol J (2000) State space reduction using partial $$\\tau $$-confluence. In: Nielsen M, Rovan B (eds) Proceedings of the 25th international symposium on mathematical foundations of computer science (MFCS\u201900), Bratislava, Slovakia. Lecture notes in computer science, vol 1893. Springer, Berlin, pp 383\u2013393. Also available as CWI Technical Report SEN-R0008, Amsterdam","DOI":"10.1007\/3-540-44612-5_34"},{"key":"360_CR27","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/2516.001.0001","volume-title":"Dynamic logic","author":"D Harel","year":"2000","unstructured":"Harel D, Kozen D, Tiuryn J (2000) Dynamic logic. MIT Press, Berlin"},{"key":"360_CR28","unstructured":"ISO\/IEC (1989) LOTOS\u2014a formal description technique based on the temporal ordering of observational behaviour. International standard 8807, international organization for standardization\u2014information processing systems\u2014open systems interconnection, Geneva"},{"key":"360_CR29","unstructured":"ISO\/IEC (2001) Enhancements to LOTOS (E-LOTOS). International Standard 15437:2001, International Organization for Standardization\u2014Information Technology, Geneva"},{"key":"360_CR30","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D Kozen","year":"1983","unstructured":"Kozen D (1983) Results on the propositional $$\\mu $$-calculus. Theor Comput Sci 27:333\u2013354","journal-title":"Theor Comput Sci"},{"key":"360_CR31","unstructured":"Krimm J-P, Mounier L (1997) Compositional state space generation from LOTOS programs. In: Brinksma E (ed) Proceedings of the 3rd international workshop on tools and algorithms for the construction and analysis of systems (TACAS\u201997). Lecture notes in computer science, vol 1217. University of Twente, Enschede. Springer, Berlin. Extended version with proofs available as Research Report VERIMAG\u00a0RR97-01"},{"key":"360_CR32","doi-asserted-by":"crossref","unstructured":"Lang F (2005) EXP.OPEN 2.0: a flexible tool integrating partial order, compositional, and on-the-fly verification methods. In: Romijn J, Smith G, van de Pol J (eds) Proceedings of the 5th international conference on integrated formal methods (IFM\u201905), Eindhoven, The Netherlands. Lecture notes in computer science, vol 3771. Springer, Berlin, pp 70\u201388. Full version available as INRIA Research Report\u00a0RR-5673","DOI":"10.1007\/11589976_6"},{"key":"360_CR33","doi-asserted-by":"crossref","unstructured":"Lang F, Mateescu R (2012) Partial model checking using networks of labelled transition systems and boolean equation systems. In: Flanagan C, K\u00f6nig B (eds) Proceedings of the 18th international conference on tools and algorithms for the construction and analysis of systems (TACAS\u201912), Talinn, Estonia. Lecture notes in computer science, vol 7214. Springer, Berlin, pp 141\u2013156","DOI":"10.1007\/978-3-642-28756-5_11"},{"key":"360_CR34","doi-asserted-by":"crossref","unstructured":"Lang F, Mateescu R, Mazzanti F (2019) Compositional verification of concurrent systems by combining bisimulations. In: McIver A, ter Beek M (eds) Proceedings of the 23rd international symposium on formal methods\u20143rd World congress on formal methods FM 2019 (Porto, Portugal). Lecture notes in computer science, vol 11800. Springer, Berlin, pp 196\u2013213","DOI":"10.1007\/978-3-030-30942-8_13"},{"key":"360_CR35","doi-asserted-by":"crossref","unstructured":"Lang F, Mateescu R, Mazzanti F (2020) Sharp congruences adequate with temporal logics combining weak and strong modalities. In: Biere A, Parker D (eds) Proceedings of the 26th international conference on tools and algorithms for the construction and analysis of systems TACAS 2020 (Dublin, Ireland). Lecture notes in computer science, vol 12079. Springer, Berlin, pp 57\u201376","DOI":"10.1007\/978-3-030-45237-7_4"},{"key":"360_CR36","doi-asserted-by":"crossref","unstructured":"Larsen KG (1988) Proof systems for Hennessy\u2013Milner logic with recursion. In: Proceedings of the 13th colloquium on trees in algebra and programming CAAP \u201988 (Nancy, France). Lecture notes in computer science, vol 299. Springer, Berlin, pp 215\u2013230","DOI":"10.1007\/BFb0026106"},{"key":"360_CR37","doi-asserted-by":"crossref","unstructured":"Malhotra J, Smolka SA, Giacalone A, Shapiro R (1988) A tool for hierarchical design and simulation of concurrent systems. In: Proceedings of the BCS-FACS workshop on specification and verification of concurrent systems, stirling, Scotland, UK. British Computer Society, pp 140\u2013152","DOI":"10.1007\/978-1-4471-3534-0_7"},{"issue":"5","key":"360_CR38","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s10009-018-0499-0","volume":"20","author":"Radu Mateescu and Jose Ignacio Requeno","year":"2018","unstructured":"Radu Mateescu and Jose Ignacio Requeno (2018) On-the-fly model checking for extended action-based probabilistic operators. Int J Softw Tools Technol Transf 20(5):563\u2013587","journal-title":"Int J Softw Tools Technol Transf"},{"key":"360_CR39","doi-asserted-by":"crossref","unstructured":"Mateescu R, Thivolle D (2008) A model checking language for concurrent value-passing systems. In: Cuellar J, Maibaum T, Sere K (eds) Proceedings of the 15th international symposium on formal methods (FM\u201908), Turku, Finland. Lecture notes in computer science, vol 5014. Springer, Berlin, pp 148\u2013164","DOI":"10.1007\/978-3-540-68237-0_12"},{"issue":"10\u201311","key":"360_CR40","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1016\/j.scico.2011.07.004","volume":"77","author":"R Mateescu","year":"2012","unstructured":"Mateescu R, Wijs A (2012) Sequential and distributed on-the-fly computation of weak tau-confluence. Sci Comput Program 77(10\u201311):1075\u20131094","journal-title":"Sci Comput Program"},{"issue":"3","key":"360_CR41","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1016\/j.scico.2014.04.004","volume":"96","author":"R Mateescu","year":"2014","unstructured":"Mateescu R, Wijs A (2014) Property-dependent reductions adequate with divergence-sensitive branching bisimilarity. Sci Comput Program 96(3):354\u2013376","journal-title":"Sci Comput Program"},{"key":"360_CR42","volume-title":"Communication and concurrency","author":"R Milner","year":"1989","unstructured":"Milner R (1989) Communication and concurrency. Prentice-Hall, Upper Saddle River"},{"key":"360_CR43","first-page":"167","volume-title":"Theoretical computer science. Lecture notes in computer science","author":"D Park","year":"1981","unstructured":"Park D (1981) Concurrency and automata on infinite sequences. In: Deussen P (ed) Theoretical computer science. Lecture notes in computer science, vol 104. Springer, Berlin, pp 167\u2013183"},{"key":"360_CR44","unstructured":"Peled D. Partial order reduction: linear and branching temporal logics and process algebras. In: Peled et\u00a0al. [45]"},{"key":"360_CR45","doi-asserted-by":"crossref","unstructured":"Peled DA, Pratt VR, Holzmann GJ (eds) (1997) Proceedings of the workshop on partial order methods in verification. Dimacs series in discrete mathematics, vol 29","DOI":"10.1090\/dimacs\/029"},{"key":"360_CR46","first-page":"123","volume":"13","author":"A Pnueli","year":"1984","unstructured":"Pnueli A (1984) In transition from global to modular temporal reasoning about programs. Log Models Concurr Syst 13:123\u2013144","journal-title":"Log Models Concurr Syst"},{"key":"360_CR47","doi-asserted-by":"crossref","unstructured":"Ramakrishna YS, Smolka SA (1997) Partial-order reduction in the weak modal mu-calculus. In: Mazurkiewicz A, Winkowski J (eds) Proceedings of the 8th international conference on concurrency theory CONCUR\u201997. Lecture notes in computer science, vol 1243. Springer, Berlin, pp 5\u201324","DOI":"10.1007\/3-540-63141-0_2"},{"key":"360_CR48","volume-title":"The theory and practice of concurrency","author":"AW Roscoe","year":"1997","unstructured":"Roscoe AW (1997) The theory and practice of concurrency. Prentice Hall, Upper Saddle River"},{"issue":"9","key":"360_CR49","doi-asserted-by":"publisher","first-page":"940","DOI":"10.1109\/26.35374","volume":"37","author":"KK Sabnani","year":"1989","unstructured":"Sabnani KK, Lapone AM, \u00dcmit Uyar M (1989) An algorithmic procedure for checking safety properties of protocols. IEEE Trans Commun 37(9):940\u2013948","journal-title":"IEEE Trans Commun"},{"issue":"1\u20132","key":"360_CR50","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0019-9958(82)91258-X","volume":"54","author":"R Streett","year":"1982","unstructured":"Streett R (1982) Propositional dynamic logic of looping and converse is elementarily decidable. Inf Control 54(1\u20132):121\u2013141","journal-title":"Inf Control"},{"issue":"3","key":"360_CR51","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0890-5401(89)90031-X","volume":"81","author":"RS Streett","year":"1989","unstructured":"Streett RS, Emerson EA (1989) An automata theoretic decision procedure for the propositional mu-calculus. Inf Comput 81(3):249\u2013264","journal-title":"Inf Comput"},{"key":"360_CR52","unstructured":"Tai K-C, Koppol PV (1993) An incremental approach to reachability analysis of distributed programs. In: Proceedings of the 7th international workshop on software specification and design, Los Angeles, CA, USA. IEEE Press, Piscataway, NJ, pp 141\u2013150"},{"key":"360_CR53","unstructured":"Tai K-C, Koppol PV (1993) Hierarchy-based incremental reachability analysis of communication protocols. In:Proceedings of the IEEE international conference on network protocols, San Francisco, CA, USA. IEEE Press, Piscataway, NJ, pp 318\u2013325"},{"key":"360_CR54","unstructured":"Valmari A. Stubborn set methods for process algebras. In: Peled et\u00a0al. [45]"},{"key":"360_CR55","doi-asserted-by":"crossref","unstructured":"Valmari A (1993) Compositional state space generation. In: Rozenberg G (eds) Advances in Petri Nets 1993\u2014papers from the 12th international conference on applications and theory of petri nets (ICATPN\u201991), Gjern, Denmark. Lecture notes in computer science, vol 674. Springer, Berlin, pp 427\u2013457","DOI":"10.1007\/3-540-56689-9_54"},{"key":"360_CR56","unstructured":"van Glabbeek RJ, Weijland WP (1989) Branching-time and abstraction in bisimulation semantics (extended abstract). CS R8911. Centrum voor Wiskunde en Informatica, Amsterdam, 1989. Also in proc. IFIP 11th World computer congress, San Francisco"},{"issue":"3","key":"360_CR57","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/233551.233556","volume":"43","author":"RJ van Glabbeek","year":"1996","unstructured":"van Glabbeek RJ, Weijland WP (1996) Branching time and abstraction in bisimulation semantics. J ACM 43(3):555\u2013600","journal-title":"J ACM"},{"key":"360_CR58","doi-asserted-by":"crossref","unstructured":"Yeh WJ, Young M (1991) Compositional reachability analysis using process algebra. In: Proceedings of the ACM SIGSOFT symposium on testing, analysis, and verification (SIGSOFT\u201991). Victoria, British Columbia, Canada. ACM Press, pp 49\u201359","DOI":"10.1145\/120807.120812"}],"container-title":["Formal Methods in System Design"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10703-021-00360-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10703-021-00360-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10703-021-00360-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,26]],"date-time":"2022-08-26T15:52:26Z","timestamp":1661529146000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10703-021-00360-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,18]]},"references-count":58,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["360"],"URL":"https:\/\/doi.org\/10.1007\/s10703-021-00360-w","relation":{},"ISSN":["0925-9856","1572-8102"],"issn-type":[{"value":"0925-9856","type":"print"},{"value":"1572-8102","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,2,18]]},"assertion":[{"value":"9 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 January 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 February 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}