We have developed a notion of global bisimulation distance between processes
which goes somehow beyond the notions of bisimulation distance already existing
in the literature, mainly based on bisimulation games. Our proposal is based on
the cost of transformations: how much we need to modify one of the compared
processes to obtain the other. Our original definition only covered finite
processes, but a coinductive approach allows us to extend it to cover infinite
but finitary trees. After having shown many interesting properties of our
distance, it was our intention to prove continuity with respect to projections,
but unfortunately the issue remains open. Nonetheless, we have obtained several
partial results that are presented in this paper.Comment: In Proceedings PROLE 2015, arXiv:1512.0617
