@article{eprints350,
           pages = {46--64},
          author = {Rocco De Nicola and Anna Labella},
            year = {1998},
          volume = {18},
           title = {Tree morphisms and bisimulations},
            note = {MFCS'98 Workshop on Concurrency},
         journal = {Electronic Notes in Theoretical Computer Science},
       publisher = {Elsevier},
             url = {http://eprints.imtlucca.it/350/},
        abstract = {A category of (action labelled) trees is defined that can be used to model unfolding of labelled transition systems and to study behavioural relations over them. In this paper we study five different equivalences based on bisimulation for our model. One, that we called resource bisimulation, amounts essentially to three isomorphism. Another, its weak counterpart, permits abstracting from silent actions while preserving the tree structure. The other three are the well known strong, branching and weak bisimulation equivalence. For all bisimulations, but weak, canonical representatives are constructed and it is shown that they can be obtained via enriched functors over our categories of trees, with and without silent actions. Weak equivalence is more problematic; a canonical minimal representative for it cannot be denned by quotienting our trees. The common framework helps in understanding the relationships between the various equivalences and the results provide support to the claim that branching bisimulation is the natural generalization of strong bisimulation to systems with silent moves and that resource and weak resource have an interest of their own.}
}