{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:25:31Z","timestamp":1740108331060,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3-5","license":[{"start":{"date-parts":[[2020,5,6]],"date-time":"2020-05-06T00:00:00Z","timestamp":1588723200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,6]],"date-time":"2020-05-06T00:00:00Z","timestamp":1588723200000},"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":["Acta Informatica"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s00236-020-00375-6","type":"journal-article","created":{"date-parts":[[2020,5,6]],"date-time":"2020-05-06T15:04:01Z","timestamp":1588777441000},"page":"689-725","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A complete axiomatization of weighted branching bisimulation"],"prefix":"10.1007","volume":"57","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4106-1198","authenticated-orcid":false,"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"}]}],"member":"297","published-online":{"date-parts":[[2020,5,6]]},"reference":[{"key":"375_CR1","unstructured":"Bacci, G., Bacci, G., Larsen, K.G., Mardare, R.: Complete axiomatization for the bisimilarity distance on Markov chains. In: Desharnais, J., Jagadeesan, R. (eds.) 27th International Conference on Concurrency Theory, CONCUR 2016, 23\u201326 Aug 2016, Qu\u00e9bec City, Canada, LIPIcs, vol.\u00a059, pp. 21:1\u201321:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2016.21"},{"issue":"3","key":"375_CR2","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0020-0190(96)00034-8","volume":"58","author":"T Basten","year":"1996","unstructured":"Basten, T.: Branching bisimilarity is an equivalence indeed!. Inf. Process. Lett. 58(3), 141\u2013147 (1996). https:\/\/doi.org\/10.1016\/0020-0190(96)00034-8","journal-title":"Inf. Process. Lett."},{"key":"375_CR3","doi-asserted-by":"crossref","unstructured":"Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching-time temporal logic. In: Kozen, D. (ed.) Logics of Programs, Workshop, Yorktown Heights, New York, USA, May 1981, Lecture Notes in Computer Science, vol. 131, pp. 52\u201371. Springer (1981). https:\/\/doi.org\/10.1007\/BFb0025774","DOI":"10.1007\/BFb0025774"},{"issue":"2","key":"375_CR4","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1145\/201019.201032","volume":"42","author":"R De Nicola","year":"1995","unstructured":"De Nicola, R., Vaandrager, F.W.: Three logics for branching bisimulation. J. ACM 42(2), 458\u2013487 (1995). https:\/\/doi.org\/10.1145\/201019.201032","journal-title":"J. ACM"},{"key":"375_CR5","doi-asserted-by":"crossref","unstructured":"Desharnais, J., Gupta, V., Jagadeesan, R., Panangaden, P.: Metrics for labeled markov systems. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR \u201999: Concurrency Theory, 10th International Conference, Eindhoven, The Netherlands, 24\u201327 Aug 1999, Proceedings, Lecture Notes in Computer Science, vol. 1664, pp. 258\u2013273. Springer (1999). https:\/\/doi.org\/10.1007\/3-540-48320-9_19","DOI":"10.1007\/3-540-48320-9_19"},{"key":"375_CR6","unstructured":"Foshammer, L., Larsen, K.G., Mardare, R., Xue, B.: Logical characterization and complexity of weighted branching preorders and distances. Unpublished draft (2017)"},{"key":"375_CR7","doi-asserted-by":"crossref","unstructured":"Foshammer, L., Larsen, K.G., Mariegaard, A.: Weighted branching simulation distance for parametric weighted kripke structures. In: Brihaye, T., Delahaye, B., Jezequel, L., Markey, N., Srba, J. (eds.) Proceedings Cassting Workshop on Games for the Synthesis of Complex Systems and 3rd International Workshop on Synthesis of Complex Parameters and 3rd International Workshop on Synthesis of Complex Parameters, Cassting\/SynCoP 2016, Eindhoven, The Netherlands, 2\u20133 Apr 2016. EPTCS, vol. 220, pp. 63\u201375 (2016). https:\/\/doi.org\/10.4204\/EPTCS.220.6","DOI":"10.4204\/EPTCS.220.0"},{"key":"375_CR8","doi-asserted-by":"crossref","unstructured":"Groote, J.F., Vaandrager, F.W.: An efficient algorithm for branching bisimulation and stuttering equivalence. In: M.\u00a0Paterson (ed.) Automata, Languages and Programming, 17th International Colloquium, ICALP90, Warwick University, England, UK, 16\u201320 July 1990, Proceedings, Lecture Notes in Computer Science, vol. 443, pp. 626\u2013638. Springer (1990). https:\/\/doi.org\/10.1007\/BFb0032063","DOI":"10.1007\/BFb0032063"},{"key":"375_CR9","doi-asserted-by":"publisher","unstructured":"Hansen, M., Larsen, K.G., Mardare, R., Pedersen, M.R.: Reasoning about bounds in weighted transition systems. Log. Methods Comput. Sci. 14(4) (2018). https:\/\/doi.org\/10.23638\/LMCS-14(4:19)2018. https:\/\/lmcs.episciences.org\/4992","DOI":"10.23638\/LMCS-14(4:19)2018"},{"issue":"1","key":"375_CR10","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). https:\/\/doi.org\/10.1145\/2455.2460","journal-title":"J. ACM"},{"key":"375_CR11","doi-asserted-by":"crossref","unstructured":"Jensen, M.C., Larsen, K.G., Mardare, R.: Weighted branching systems: Behavioural equivalence, behavioural distance, and their logical characterisations. In: Jansen, D.N., Prabhakar, P. (eds.) Formal Modeling and Analysis of Timed Systems\u201416th International Conference, FORMATS 2018, Beijing, China, 4\u20136 Sept 2018, Proceedings, Lecture Notes in Computer Science, vol. 11022, pp. 145\u2013161. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-030-00151-3_9","DOI":"10.1007\/978-3-030-00151-3_9"},{"key":"375_CR12","doi-asserted-by":"crossref","unstructured":"Milner, R.: A Calculus of Communicating Systems, Lecture Notes in Computer Science, vol.\u00a092. Springer, Berlin (1980). https:\/\/doi.org\/10.1007\/3-540-10235-3","DOI":"10.1007\/3-540-10235-3"},{"issue":"3","key":"375_CR13","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/0022-0000(84)90023-0","volume":"28","author":"R Milner","year":"1984","unstructured":"Milner, R.: A complete inference system for a class of regular behaviours. J. Comput. Syst. Sci. 28(3), 439\u2013466 (1984). https:\/\/doi.org\/10.1016\/0022-0000(84)90023-0","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"375_CR14","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0890-5401(89)90070-9","volume":"81","author":"R Milner","year":"1989","unstructured":"Milner, R.: A complete axiomatisation for observational congruence of finite-state behaviors. Inf. Comput. 81(2), 227\u2013247 (1989). https:\/\/doi.org\/10.1016\/0890-5401(89)90070-9","journal-title":"Inf. Comput."},{"key":"375_CR15","doi-asserted-by":"publisher","unstructured":"Milner, R.: CHAPTER 19 - Operational and algebraic semantics of concurrent processes. In: Leeuwen, J.V. (ed.) Formal Models and Semantics. Handbook of Theoretical Computer Science, pp. 1201\u20131242. Elsevier, Amsterdam (1990). ISBN: 978-0-444-88074-1. https:\/\/doi.org\/10.1016\/B978-0-444-88074-1.50024-X","DOI":"10.1016\/B978-0-444-88074-1.50024-X"},{"issue":"1","key":"375_CR16","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). https:\/\/doi.org\/10.1006\/jagm.2001.1201","journal-title":"J. Algorithms"},{"key":"375_CR17","doi-asserted-by":"publisher","unstructured":"van Glabbeek, R.J.: A complete axiomatization for branching bisimulation congruence of finite-state behaviours. In: Borzyszkowski A.M., Sokolowski S. (eds.) Mathematical Foundations of Computer Science 1993. MFCS 1993. Lecture Notes in Computer Science, vol 711. Springer, Berlin, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57182-5_39","DOI":"10.1007\/3-540-57182-5_39"},{"key":"375_CR18","doi-asserted-by":"crossref","unstructured":"van Glabbeek, R.J.: The linear time \u2013 Branching time spectrum II. In: Best E. (ed.) CONCUR\u201993. Lecture Notes in Computer Science, vol 715. Springer, Berlin, Heidelberg (1993)","DOI":"10.1007\/3-540-57208-2_6"},{"key":"375_CR19","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":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-020-00375-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00236-020-00375-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-020-00375-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,5]],"date-time":"2021-05-05T23:28:36Z","timestamp":1620257316000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00236-020-00375-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,6]]},"references-count":19,"journal-issue":{"issue":"3-5","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["375"],"URL":"https:\/\/doi.org\/10.1007\/s00236-020-00375-6","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"type":"print","value":"0001-5903"},{"type":"electronic","value":"1432-0525"}],"subject":[],"published":{"date-parts":[[2020,5,6]]},"assertion":[{"value":"8 May 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}