{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T23:56:43Z","timestamp":1766102203644},"reference-count":25,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2010,2,4]],"date-time":"2010-02-04T00:00:00Z","timestamp":1265241600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2010,6]]},"abstract":"<jats:p>We study the functorial characterisation of bisimulation-based equivalences over a categorical model of labelled trees. We show that in a setting where all labels are visible, strong bisimilarity can be characterised in terms of enriched functors by relying on the <jats:italic>reflection of paths with their factorisations<\/jats:italic>. For an enriched functor <jats:italic>F<\/jats:italic>, this notion requires that a path (an internal morphism in our framework) \u03c0 going from <jats:italic>F<\/jats:italic>(<jats:italic>A<\/jats:italic>) to <jats:italic>C<\/jats:italic> corresponds to a path <jats:italic>p<\/jats:italic> going from <jats:italic>A<\/jats:italic> to <jats:italic>K<\/jats:italic>, with <jats:italic>F<\/jats:italic>(<jats:italic>K<\/jats:italic>) = <jats:italic>C<\/jats:italic>, such that every possible factorisation of \u03c0 can be lifted in an appropriate factorisation of <jats:italic>p<\/jats:italic>. This last property corresponds to a <jats:italic>Conduch\u00e9 property<\/jats:italic> for enriched functors, and a very rigid formulation of it has been used by Lawvere to characterise the determinacy of physical systems. We also consider the setting where some labels are not visible, and provide characterisations for weak and branching bisimilarity. Both equivalences are still characterised in terms of enriched functors that reflect paths with their factorisations: for branching bisimilarity, the property is the same as the one used to characterise strong bisimilarity when all labels are visible; for weak bisimilarity, a weaker form of path factorisation lifting is needed. This fact can be seen as evidence that strong and branching bisimilarity are strictly related and that, unlike weak bisimilarity, they preserve process determinacy in the sense of Milner.<\/jats:p>","DOI":"10.1017\/s0960129509990272","type":"journal-article","created":{"date-parts":[[2010,2,4]],"date-time":"2010-02-04T09:48:54Z","timestamp":1265276934000},"page":"319-358","source":"Crossref","is-referenced-by-count":3,"title":["Tree-functors, determinacy and bisimulations"],"prefix":"10.1017","volume":"20","author":[{"given":"ROCCO","family":"DE NICOLA","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DANIELE","family":"GORLA","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ANNA","family":"LABELLA","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2010,2,4]]},"reference":[{"key":"S0960129509990272_ref2","first-page":"41","article-title":"A quasi-universal realization of automata","volume":"14","author":"Betti","year":"1982","journal-title":"Rend. Ist. Mat. Univ. Trieste"},{"key":"S0960129509990272_ref9","first-page":"309","article-title":"Equivalences and refinement. In: Semantics of Systems of Concurrent Processes","volume":"469","author":"van Glabbeeck","year":"1990","journal-title":"Springer-Verlag Lecture Notes in Computer Science"},{"key":"S0960129509990272_ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00023-8"},{"key":"S0960129509990272_ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0039058"},{"key":"S0960129509990272_ref6","first-page":"A891","article-title":"Au sujet de l'existence d'adjoints \u00e0 dro\u00eete aux foncteurs \u2018image reciproque\u2019 dans la cat\u00e9gorie des cat\u00e9gories","volume":"275","author":"Conduch\u00e9","year":"1972","journal-title":"C. R. Acad. Sci. Paris"},{"key":"S0960129509990272_ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0026984"},{"key":"S0960129509990272_ref20","unstructured":"Pavlovi\u0107 D. (1996) Convenient categories of asynchronous processes and simulations II. In: Edalat, A. (ed.) Theory and Formal Methods of Computing '96, World Scientific 156\u2013167."},{"key":"S0960129509990272_ref18","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0017309"},{"key":"S0960129509990272_ref5","article-title":"Open Maps (at) Work","volume":"23","author":"Cheng","year":"1995","journal-title":"BRICS Report Series"},{"key":"S0960129509990272_ref21","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00303-5"},{"key":"S0960129509990272_ref12","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129599002935"},{"key":"S0960129509990272_ref11","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1993.287566"},{"key":"S0960129509990272_ref23","first-page":"283","article-title":"Sheaves and Cauchy-complete categories","volume":"22","author":"Walters","year":"1981","journal-title":"Cahiers de Topologie et Geometrie Diff."},{"key":"S0960129509990272_ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpaa.2009.05.008"},{"key":"S0960129509990272_ref14","volume-title":"Basic Concepts of Enriched Category Theory","author":"Kelly","year":"1982"},{"key":"S0960129509990272_ref1","doi-asserted-by":"publisher","DOI":"10.1137\/1016026"},{"key":"S0960129509990272_ref10","first-page":"555","article-title":"Branching Time and Abstraction in Bisimulation Semantics","volume":"43","author":"van","year":"1989","journal-title":"Journal of the ACM"},{"key":"S0960129509990272_ref24","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0013026"},{"key":"S0960129509990272_ref17","volume-title":"Communication and concurrency","author":"Milner","year":"1989"},{"key":"S0960129509990272_ref3","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129599003023"},{"key":"S0960129509990272_ref16","unstructured":"Lawvere F. W. (1986) State categories and response functors (unpublished manuscript)."},{"key":"S0960129509990272_ref22","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00056-6"},{"key":"S0960129509990272_ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(05)80249-X"},{"key":"S0960129509990272_ref25","volume-title":"Handbook of Logic in Computer Science","author":"Winskel","year":"1995"},{"key":"S0960129509990272_ref19","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-60164-3_17"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129509990272","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T19:38:19Z","timestamp":1556480299000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129509990272\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,4]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["S0960129509990272"],"URL":"https:\/\/doi.org\/10.1017\/s0960129509990272","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,4]]}}}