<> "The repository administrator has not yet configured an RDF license."^^ . <> . . . "Tree-functors, determinacy and bisimulations"^^ . "We study the functorial characterisation of bisimulation-based equivalences over a\r\ncategorical model of labelled trees. We show that in a setting where all labels are visible,\r\nstrong bisimilarity can be characterised in terms of enriched functors by relying on the\r\nreflection of paths with their factorisations. For an enriched functor F, this notion requires\r\nthat a path (an internal morphism in our framework) π going from F(A) to C corresponds\r\nto a path p going from A to K, with F(K) = C, such that every possible factorisation of π\r\ncan be lifted in an appropriate factorisation of p. This last property corresponds to a\r\nConduch´e property for enriched functors, and a very rigid formulation of it has been used by\r\nLawvere to characterise the determinacy of physical systems. We also consider the setting\r\nwhere some labels are not visible, and provide characterisations for weak and branching\r\nbisimilarity. Both equivalences are still characterised in terms of enriched functors that\r\nreflect paths with their factorisations: for branching bisimilarity, the property is the same as\r\nthe one used to characterise strong bisimilarity when all labels are visible; for weak\r\nbisimilarity, a weaker form of path factorisation lifting is needed. This fact can be seen as\r\nevidence that strong and branching bisimilarity are strictly related and that, unlike weak\r\nbisimilarity, they preserve process determinacy in the sense of Milner."^^ . "2010" . "20" . "3" . . "Cambridge University Press"^^ . . . "Mathematical Structures in Computer Science"^^ . . . "09601295" . . . . . . . . . . . . . "Rocco"^^ . "De Nicola"^^ . "Rocco De Nicola"^^ . . "Daniele"^^ . "Gorla"^^ . "Daniele Gorla"^^ . . "Anna"^^ . "Labella"^^ . "Anna Labella"^^ . . . . . "HTML Summary of #272 \n\nTree-functors, determinacy and bisimulations\n\n" . "text/html" . . . "QA75 Electronic computers. Computer science"@en . .