{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:51:58Z","timestamp":1740099118443,"version":"3.37.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030001506"},{"type":"electronic","value":"9783030001513"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-030-00151-3_9","type":"book-chapter","created":{"date-parts":[[2018,8,25]],"date-time":"2018-08-25T09:54:31Z","timestamp":1535190871000},"page":"145-161","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Weighted Branching Systems: Behavioural Equivalence, Behavioural Distance, and Their Logical Characterisations"],"prefix":"10.1007","author":[{"given":"Mathias Claus","family":"Jensen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim Guldstrand","family":"Larsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Radu","family":"Mardare","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,26]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0304-3975(88)90098-9","volume":"59","author":"MC Browne","year":"1988","unstructured":"Browne, M.C., Clarke, E.M., Grumberg, O.: Characterizing finite Kripke structures in propositional temporal logic. Theor. Comput. Sci. 59, 115\u2013131 (1988)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9_CR2","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s10626-008-0057-0","volume":"20","author":"P Buchholz","year":"2010","unstructured":"Buchholz, P., Kemper, P.: Model checking for a class of weighted automata. Discret. Event Dyn. Syst. 20(1), 103\u2013137 (2010)","journal-title":"Discret. Event Dyn. Syst."},{"key":"9_CR3","volume-title":"Handbook of Modal Logic","author":"P Blackburn","year":"2006","unstructured":"Blackburn, P., van Benthem, J.F.A.K., Wolter, F.: Handbook of Modal Logic, vol. 3. Elsevier, Amsterdam (2006)"},{"key":"9_CR4","unstructured":"Christoffersen, P., Hansen, M., Mariegaard, A., Ringsmose, J.T., Larsen, K.G., Mardare, R.: Parametric verification of weighted systems. In: Andr\u00e9, \u00c9., Frehse, G. (eds.) 2nd International Workshop on Synthesis of Complex Parameters, SynCoP 2015, 11 April 2015, London, United Kingdom. OA-SICS, vol. 44, pp. 77\u201390. SchlossDagstuhl - Leibniz-Zentrum fuer Informatik (2015)"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/3-540-48320-9_19","volume-title":"CONCUR 1999 Concurrency Theory","author":"J Desharnais","year":"1999","unstructured":"Desharnais, J., Gupta, V., Jagadeesan, R., Panangaden, P.: Metrics for labeled Markov systems. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol. 1664, pp. 258\u2013273. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48320-9_19"},{"issue":"2","key":"9_CR6","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1145\/201019.201032","volume":"42","author":"R Nicola De","year":"1995","unstructured":"De Nicola, R., Vaandrager, F.W.: Three logics for branching bisimulation. J. ACM 42(2), 458\u2013487 (1995)","journal-title":"J. ACM"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"63","DOI":"10.4204\/EPTCS.220.6","volume":"220","author":"L Foshammer","year":"2016","unstructured":"Foshammer, L., Larsen, K.G., Mariegaard, A.: Weighted branching simulation distance for parametric weighted Kripke structures. EPTCS 220, 63\u201375 (2016)","journal-title":"EPTCS"},{"key":"9_CR8","unstructured":"Foshammer, L., Larsen, K.G., Mardare, R., Xue, B.: Logical characterization and complexity of weighted branching preorders and distances. Unpublished Draft (2017)"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"134","DOI":"10.4204\/EPTCS.57.10","volume":"57","author":"U Fahrenberg","year":"2011","unstructured":"Fahrenberg, U., Thrane, C.R., Larsen, K.G.: Distances for weighted transition systems: games and properties. EPTCS 57, 134\u2013147 (2011)","journal-title":"EPTCS"},{"key":"9_CR10","unstructured":"Giacalone, A., Jou, C.-C., Smolka, S.A.: Algebraic reasoning for probabilistic concurrent systems. In: Proceedings of the IFIP TC2 Working Conference on Programming Concepts and Methods. Citeseer (1990)"},{"issue":"1","key":"9_CR11","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M Hennessy","year":"1985","unstructured":"Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. J. ACM 32(1), 137\u2013161 (1985)","journal-title":"J. ACM"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Jensen, M.C.: Weighted branching systems: behavioural equivalence, metric structure, and their characterisations. Technical report, 9th Semester Report at Aalborg University (2018)","DOI":"10.1007\/978-3-030-00151-3_9"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s10009-014-0359-5","volume":"18","author":"JF Jensen","year":"2016","unstructured":"Jensen, J.F., Larsen, K.G., Srba, J., Oestergaard, L.K.: Efficient model-checking of weighted CTL with upper-bound constraints. Int. J. Softw. Tools Technol. Transfer 18, 409\u2013426 (2016)","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"issue":"28","key":"9_CR14","doi-asserted-by":"publisher","first-page":"3358","DOI":"10.1016\/j.tcs.2011.04.003","volume":"412","author":"KG Larsen","year":"2011","unstructured":"Larsen, K.G., Fahrenberg, U., Thrane, C.R.: Metrics for weighted transition systems: axiomatization and complexity. Theor. Comput. Sci. 412(28), 3358\u20133369 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/978-3-642-32589-2_59","volume-title":"Mathematical Foundations of Computer Science 2012","author":"KG Larsen","year":"2012","unstructured":"Larsen, K.G., Mardare, R., Panangaden, P.: Taking it to the limit: approximate reasoning for Markov processes. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 681\u2013692. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32589-2_59"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communicating Systems","year":"1980","unstructured":"Milner, R. (ed.): A Calculus of Communicating Systems. LNCS, vol. 92. Springer, Heidelberg (1980). https:\/\/doi.org\/10.1007\/3-540-10235-3"},{"issue":"1","key":"9_CR17","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1006\/jagm.2001.1201","volume":"42","author":"M Nyk\u00e4nen","year":"2002","unstructured":"Nyk\u00e4nen, M., Ukkonen, E.: The exact path length problem. J. Algorithms 42(1), 41\u201353 (2002)","journal-title":"J. Algorithms"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Theoretical Computer Science","author":"D Park","year":"1981","unstructured":"Park, D.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol. 104, pp. 167\u2013183. Springer, Heidelberg (1981). https:\/\/doi.org\/10.1007\/BFb0017309"},{"issue":"7","key":"9_CR19","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1016\/j.jlap.2010.07.010","volume":"79","author":"C Thrane","year":"2010","unstructured":"Thrane, C., Fahrenberg, U., Larsen, K.G.: Quantitative analysis of weighted transition systems. J. Log. Algebr. Program. 79(7), 689\u2013703 (2010)","journal-title":"J. Log. Algebr. Program."},{"key":"9_CR20","unstructured":"van Glabbeek, R.J., Weijland, W.P.,: Branching time and abstraction in bisimulation semantics (extended abstract). In: IFIP Congress, pp. 613\u2013618 (1989)"}],"container-title":["Lecture Notes in Computer Science","Formal Modeling and Analysis of Timed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00151-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T19:51:10Z","timestamp":1571773870000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-00151-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030001506","9783030001513"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00151-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}