{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T05:59:56Z","timestamp":1774331996493,"version":"3.50.1"},"reference-count":0,"publisher":"SAGE Publications","issue":"4","license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2009,6]]},"abstract":"<jats:p>We consider the relational characterisation of branching bisimilarity with explicit divergence. We prove that it is an equivalence and that it coincides with the original definition of branching bisimilarity with explicit divergence in terms of coloured traces. We also establish a correspondence with several variants of an action-based modal logic with until- and divergence modalities.<\/jats:p>","DOI":"10.3233\/fi-2009-109","type":"journal-article","created":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T22:46:20Z","timestamp":1575326780000},"page":"371-392","source":"Crossref","is-referenced-by-count":54,"title":["Branching Bisimilarity with Explicit Divergence"],"prefix":"10.1177","volume":"93","author":[{"given":"Rob","family":"van Glabbeek","sequence":"first","affiliation":[{"name":"National ICT Australia, Sydney, Australia. School of\r\t\t\t Computer Science and Engineering, University of New South Wales, Sydney,\r\t\t\t Australia. rvg@cs.stanford.edu"}]},{"given":"Bas","family":"Luttik","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Science,\r\t\t\t Technische Universiteit Eindhoven, The Netherlands. CWI, The Netherlands.\r\t\t\t s.p.luttik@tue.nl"}]},{"given":"Nikola","family":"Tr\u010dka","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Science,\r\t\t\t Technische Universiteit Eindhoven, The Netherlands. n.trcka@tue.nl"}]}],"member":"179","published-online":{"date-parts":[[2009,1,1]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2009-109","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2009-109","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T06:50:32Z","timestamp":1751352632000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2009-109"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1,1]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["10.3233\/FI-2009-109"],"URL":"https:\/\/doi.org\/10.3233\/fi-2009-109","relation":{"is-cited-by":[{"id-type":"doi","id":"10.4204\/EPTCS.255.1","asserted-by":"object"},{"id-type":"doi","id":"10.1007\/978-3-030-21759-4_11","asserted-by":"object"},{"id-type":"doi","id":"10.4204\/EPTCS.300.4","asserted-by":"object"}]},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1,1]]}}}