{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T01:40:31Z","timestamp":1759628431358,"version":"build-2065373602"},"reference-count":65,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,12,22]],"date-time":"2024-12-22T00:00:00Z","timestamp":1734825600000},"content-version":"vor","delay-in-days":1482,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/http\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.15223\/policy-004"}],"funder":[{"name":"Chaire ISC : Engineering Complex Systems"},{"DOI":"10.13039\/501100009454","name":"\u00c9cole Polytechnique Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100009454","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007034","name":"Thales","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007034","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100009454","name":"FX","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100009454","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006021","name":"DGA","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006021","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Dassault Aviation"},{"name":"Naval Group"},{"name":"ENSTA Paris"},{"name":"T\u00e9l\u00e9com Paris"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1016\/j.tcs.2020.10.001","type":"journal-article","created":{"date-parts":[[2020,10,5]],"date-time":"2020-10-05T12:18:22Z","timestamp":1601900302000},"page":"134-146","update-policy":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Computing branching distances with quantitative games"],"prefix":"10.1016","volume":"847","author":[{"given":"Uli","family":"Fahrenberg","sequence":"first","affiliation":[]},{"given":"Axel","family":"Legay","sequence":"additional","affiliation":[]},{"given":"Karin","family":"Quaas","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.tcs.2020.10.001_br0010","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(94)00202-T","article-title":"The algorithmic analysis of hybrid systems","volume":"138","author":"Alur","year":"1995","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"10.1016\/j.tcs.2020.10.001_br0020","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","article-title":"A theory of timed automata","volume":"126","author":"Alur","year":"1994","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2020.10.001_br0030","series-title":"CONCUR","first-page":"84","article-title":"Making weighted containment feasible: a heuristic based on simulation and abstraction","volume":"vol. 7454","author":"Avni","year":"2012"},{"issue":"1","key":"10.1016\/j.tcs.2020.10.001_br0040","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1145\/343369.343402","article-title":"Model-checking continuous-time Markov chains","volume":"1","author":"Aziz","year":"2000","journal-title":"ACM Trans. Comput. Log."},{"key":"10.1016\/j.tcs.2020.10.001_br0050","series-title":"MFCS","first-page":"60","article-title":"Quantitative refinement for weighted modal transition systems","volume":"vol. 6907","author":"Bauer","year":"2011"},{"issue":"2","key":"10.1016\/j.tcs.2020.10.001_br0060","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s10703-012-0178-9","article-title":"Weighted modal transition systems","volume":"42","author":"Bauer","year":"2013","journal-title":"Form. Methods Syst. Des."},{"key":"10.1016\/j.tcs.2020.10.001_br0070","series-title":"CSR","first-page":"18","article-title":"General quantitative specification theories with modalities","volume":"vol. 7353","author":"Bauer","year":"2012"},{"key":"10.1016\/j.tcs.2020.10.001_br0080","series-title":"FORMATS","first-page":"33","article-title":"Infinite runs in weighted timed automata with energy constraints","volume":"vol. 5215","author":"Bouyer","year":"2008"},{"issue":"1","key":"10.1016\/j.tcs.2020.10.001_br0090","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s00236-016-0276-z","article-title":"Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games","volume":"54","author":"Brihaye","year":"2017","journal-title":"Acta Inform."},{"key":"10.1016\/j.tcs.2020.10.001_br0100","series-title":"ATVA","first-page":"84","article-title":"TAPAAL: editor, simulator and verifier of timed-arc Petri nets","volume":"vol. 5799","author":"Byg","year":"2009"},{"issue":"1","key":"10.1016\/j.tcs.2020.10.001_br0110","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.tcs.2011.08.002","article-title":"Simulation distances","volume":"413","author":"\u010cern\u00fd","year":"2012","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"10.1016\/j.tcs.2020.10.001_br0120","doi-asserted-by":"crossref","DOI":"10.1145\/1805950.1805953","article-title":"Quantitative languages","volume":"11","author":"Chatterjee","year":"2010","journal-title":"ACM Trans. Comput. Log."},{"key":"10.1016\/j.tcs.2020.10.001_br0130","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.ic.2016.10.006","article-title":"Quantitative fair simulation games","volume":"254","author":"Chatterjee","year":"2017","journal-title":"Inf. Comput."},{"issue":"1","key":"10.1016\/j.tcs.2020.10.001_br0140","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/j.tcs.2005.07.033","article-title":"Model checking discounted temporal properties","volume":"345","author":"de Alfaro","year":"2005","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"10.1016\/j.tcs.2020.10.001_br0150","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1109\/TSE.2008.106","article-title":"Linear and branching system metrics","volume":"35","author":"de Alfaro","year":"2009","journal-title":"IEEE Trans. Softw. Eng."},{"key":"10.1016\/j.tcs.2020.10.001_br0160","series-title":"ICALP","first-page":"1022","article-title":"Discounting the future in systems theory","volume":"vol. 2719","author":"de Alfaro","year":"2003"},{"issue":"3","key":"10.1016\/j.tcs.2020.10.001_br0170","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/j.tcs.2003.09.013","article-title":"Metrics for labelled Markov processes","volume":"318","author":"Desharnais","year":"2004","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2020.10.001_br0180","series-title":"QEST","first-page":"264","article-title":"Approximate analysis of probabilistic processes","author":"Desharnais","year":"2008"},{"key":"10.1016\/j.tcs.2020.10.001_br0190","series-title":"VALUETOOLS","first-page":"12","article-title":"How to solve large scale deterministic games with mean payoff by policy iteration","volume":"vol. 180","author":"Dhingra","year":"2006"},{"key":"10.1016\/j.tcs.2020.10.001_br0200","series-title":"ACSD","first-page":"77","article-title":"Robustness of sequential circuits","author":"Doyen","year":"2010"},{"key":"10.1016\/j.tcs.2020.10.001_br0210","doi-asserted-by":"crossref","first-page":"129","DOI":"10.4064\/fm-49-2-129-141","article-title":"An application of games to the completeness problem for formalized theories","volume":"49","author":"Ehrenfeucht","year":"1961","journal-title":"Fundam. Math."},{"key":"10.1016\/j.tcs.2020.10.001_br0220","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01768705","article-title":"Positional strategies for mean payoff games","volume":"8","author":"Ehrenfeucht","year":"1979","journal-title":"Int. J. Game Theory"},{"key":"10.1016\/j.tcs.2020.10.001_br0230","series-title":"FACS","first-page":"306","article-title":"Compositionality for quantitative specifications","volume":"vol. 8997","author":"Fahrenberg","year":"2014"},{"issue":"4","key":"10.1016\/j.tcs.2020.10.001_br0240","doi-asserted-by":"crossref","first-page":"1139","DOI":"10.1007\/s00500-017-2519-5","article-title":"Compositionality for quantitative specifications","volume":"22","author":"Fahrenberg","year":"2018","journal-title":"Soft Comput."},{"issue":"6+","key":"10.1016\/j.tcs.2020.10.001_br0250","first-page":"1311","article-title":"A quantitative characterization of weighted Kripke structures in temporal logic","volume":"29","author":"Fahrenberg","year":"2010","journal-title":"Comput. Inform."},{"key":"10.1016\/j.tcs.2020.10.001_br0260","series-title":"FIT","first-page":"5","article-title":"A robust specification theory for modal event-clock automata","volume":"vol. 87","author":"Fahrenberg","year":"2012"},{"issue":"5","key":"10.1016\/j.tcs.2020.10.001_br0270","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s00236-014-0196-8","article-title":"General quantitative specification theories with modal transition systems","volume":"51","author":"Fahrenberg","year":"2014","journal-title":"Acta Inform."},{"key":"10.1016\/j.tcs.2020.10.001_br0280","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.tcs.2013.07.030","article-title":"The quantitative linear-time-branching-time spectrum","volume":"538","author":"Fahrenberg","year":"2014","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2020.10.001_br0290","series-title":"SOFSEM","first-page":"49","article-title":"A linear-time-branching-time spectrum of behavioral specification theories","volume":"vol. 10139","author":"Fahrenberg","year":"2017"},{"key":"10.1016\/j.tcs.2020.10.001_br0300","article-title":"A linear-time-branching-time spectrum for behavioral specification theories","volume":"110","author":"Fahrenberg","year":"2020","journal-title":"J. Log. Algebraic Methods Program."},{"key":"10.1016\/j.tcs.2020.10.001_br0310","series-title":"ICTAC","first-page":"59","article-title":"Computing branching distances using quantitative games","volume":"vol. 11884","author":"Fahrenberg","year":"2019"},{"key":"10.1016\/j.tcs.2020.10.001_br0320","series-title":"FSTTCS","first-page":"103","article-title":"The quantitative linear-time\u2013branching-time spectrum","volume":"vol. 13","author":"Fahrenberg","year":"2011"},{"key":"10.1016\/j.tcs.2020.10.001_br0330","first-page":"35","article-title":"Sur quelques classifications des syst\u00e8mes de relations","volume":"1","author":"Fra\u00efss\u00e9","year":"1954","journal-title":"Publ. Sci. Univ. Alger, S\u00e9r. a Alger-Math."},{"issue":"3","key":"10.1016\/j.tcs.2020.10.001_br0340","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s10703-006-0031-0","article-title":"HySAT: an efficient proof engine for bounded model checking of hybrid systems","volume":"30","author":"Fr\u00e4nzle","year":"2007","journal-title":"Form. Methods Syst. Des."},{"key":"10.1016\/j.tcs.2020.10.001_br0350","series-title":"CAV","first-page":"379","article-title":"SpaceEx: scalable verification of hybrid systems","volume":"vol. 6806","author":"Frehse","year":"2011"},{"key":"10.1016\/j.tcs.2020.10.001_br0360","series-title":"CAV","first-page":"418","article-title":"Romeo: a tool for analyzing time Petri nets","volume":"vol. 3576","author":"Gardey","year":"2005"},{"key":"10.1016\/j.tcs.2020.10.001_br0370","series-title":"CPE","first-page":"353","article-title":"The PEPA workbench: a tool to support a process algebra-based approach to performance modelling","volume":"vol. 794","author":"Gilmore","year":"1994"},{"issue":"5","key":"10.1016\/j.tcs.2020.10.001_br0380","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1109\/TAC.2007.895849","article-title":"Approximation metrics for discrete and continuous systems","volume":"52","author":"Girard","year":"2007","journal-title":"IEEE Trans. Autom. Control"},{"issue":"2","key":"10.1016\/j.tcs.2020.10.001_br0390","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/0890-5401(92)90013-6","article-title":"Structured operational semantics and bisimulation as a congruence","volume":"100","author":"Groote","year":"1992","journal-title":"Inf. Comput."},{"key":"10.1016\/j.tcs.2020.10.001_br0400","series-title":"ATPN","first-page":"282","article-title":"Analysis of place\/transition nets with timed arcs and its application to batch process control","volume":"vol. 691","author":"Hanisch","year":"1993"},{"issue":"5","key":"10.1016\/j.tcs.2020.10.001_br0410","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1007\/BF01211866","article-title":"A logic for reasoning about time and reliability","volume":"6","author":"Hansson","year":"1994","journal-title":"Form. Asp. Comput."},{"issue":"1","key":"10.1016\/j.tcs.2020.10.001_br0420","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/2455.2460","article-title":"Algebraic laws for nondeterminism and concurrency","volume":"32","author":"Hennessy","year":"1985","journal-title":"J. ACM"},{"issue":"1\u20132","key":"10.1016\/j.tcs.2020.10.001_br0430","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1007\/s100090050008","article-title":"HYTECH: a model checker for hybrid systems","volume":"1","author":"Henzinger","year":"1997","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"10.1016\/j.tcs.2020.10.001_br0440","series-title":"FORMATS","first-page":"226","article-title":"Quantifying similarities between timed systems","volume":"vol. 3829","author":"Henzinger","year":"2005"},{"issue":"2","key":"10.1016\/j.tcs.2020.10.001_br0450","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1006\/inco.1994.1045","article-title":"Symbolic model checking for real-time systems","volume":"111","author":"Henzinger","year":"1994","journal-title":"Inf. Comput."},{"key":"10.1016\/j.tcs.2020.10.001_br0460","series-title":"CONCUR","first-page":"273","article-title":"From model checking to model measuring","volume":"vol. 8052","author":"Henzinger","year":"2013"},{"year":"1996","author":"Hillston","series-title":"A Compositional Approach to Performance Modelling","key":"10.1016\/j.tcs.2020.10.001_br0470"},{"issue":"4","key":"10.1016\/j.tcs.2020.10.001_br0480","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01995674","article-title":"Specifying real-time properties with metric temporal logic","volume":"2","author":"Koymans","year":"1990","journal-title":"Real-Time Syst."},{"key":"10.1016\/j.tcs.2020.10.001_br0490","series-title":"TACAS","first-page":"52","article-title":"Probabilistic symbolic model checking with PRISM: a hybrid approach","volume":"vol. 2280","author":"Kwiatkowska","year":"2002"},{"issue":"28","key":"10.1016\/j.tcs.2020.10.001_br0500","doi-asserted-by":"crossref","first-page":"3358","DOI":"10.1016\/j.tcs.2011.04.003","article-title":"Metrics for weighted transition systems: axiomatization and complexity","volume":"412","author":"Larsen","year":"2011","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20132","key":"10.1016\/j.tcs.2020.10.001_br0510","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/s100090050010","article-title":"UPPAAL in a nutshell","volume":"1","author":"Larsen","year":"1997","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"10.1016\/j.tcs.2020.10.001_br0520","series-title":"POPL","first-page":"344","article-title":"Bisimulation through probabilistic testing","author":"Larsen","year":"1989"},{"issue":"2","key":"10.1016\/j.tcs.2020.10.001_br0530","doi-asserted-by":"crossref","first-page":"363","DOI":"10.2307\/1971035","article-title":"Borel determinacy","volume":"102","author":"Martin","year":"1975","journal-title":"Ann. Math."},{"issue":"9","key":"10.1016\/j.tcs.2020.10.001_br0540","doi-asserted-by":"crossref","first-page":"1036","DOI":"10.1109\/TCOM.1976.1093424","article-title":"Recoverability of communication protocols\u2013implications of a theoretical study","volume":"24","author":"Merlin","year":"1976","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/j.tcs.2020.10.001_br0550","series-title":"CONCUR","first-page":"481","article-title":"Probabilistic simulations for probabilistic processes","volume":"vol. 836","author":"Segala","year":"1994"},{"year":"1994","author":"Stewart","series-title":"Introduction to the Numerical Solution of Markov Chains","key":"10.1016\/j.tcs.2020.10.001_br0560"},{"key":"10.1016\/j.tcs.2020.10.001_br0570","series-title":"Banff Higher Order Workshop","first-page":"149","article-title":"Modal and temporal logics for processes","volume":"vol. 1043","author":"Stirling","year":"1995"},{"issue":"7","key":"10.1016\/j.tcs.2020.10.001_br0580","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1016\/j.jlap.2010.07.010","article-title":"Quantitative analysis of weighted transition systems","volume":"79","author":"Thrane","year":"2010","journal-title":"J. Log. Algebraic Program."},{"issue":"1\u20132","key":"10.1016\/j.tcs.2020.10.001_br0590","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(00)00403-5","article-title":"An introduction to metric semantics: operational and denotational models for programming and specification languages","volume":"258","author":"van Breugel","year":"2001","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10.1016\/j.tcs.2020.10.001_br0600","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.tcs.2004.09.035","article-title":"A behavioural pseudometric for probabilistic transition systems","volume":"331","author":"van Breugel","year":"2005","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2020.10.001_br0610","series-title":"Horizons of the Mind. A Tribute to Prakash Panangaden","first-page":"191","article-title":"The complexity of computing a bisimilarity pseudometric on probabilistic automata","volume":"vol. 8464","author":"van Breugel","year":"2014"},{"key":"10.1016\/j.tcs.2020.10.001_br0620","series-title":"Handbook of Process Algebra","first-page":"3","article-title":"The linear time \u2013 branching time spectrum I","author":"van Glabbeek","year":"2001"},{"key":"10.1016\/j.tcs.2020.10.001_br0630","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01448847","article-title":"Zur Theorie der Gesellschaftsspiele","volume":"100","author":"von Neumann","year":"1928","journal-title":"Math. Ann."},{"key":"10.1016\/j.tcs.2020.10.001_br0640","series-title":"FME","first-page":"632","article-title":"Symbolic model checking for distributed real-time systems","volume":"vol. 670","author":"Wang","year":"1993"},{"issue":"1&2","key":"10.1016\/j.tcs.2020.10.001_br0650","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0304-3975(95)00188-3","article-title":"The complexity of mean payoff games on graphs","volume":"158","author":"Zwick","year":"1996","journal-title":"Theor. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0304397520305636?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0304397520305636?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T01:04:22Z","timestamp":1759626262000},"score":1,"resource":{"primary":{"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397520305636"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12]]},"references-count":65,"alternative-id":["S0304397520305636"],"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.1016\/j.tcs.2020.10.001","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2020,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Computing branching distances with quantitative games","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.1016\/j.tcs.2020.10.001","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2020 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}