Proving Continuity of Coinductive Global Bisimulation Distances: A Never Ending Story

David Romero-Hernández
(Universidad Complutense de Madrid, Spain)
David de Frutos-Escrig
(Universidad Complutense de Madrid, Spain)
Dario Della Monica
(Reykjavik University, Iceland)

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.

In Marisa Navarro: Proceedings XV Jornadas sobre Programación y Lenguajes (PROLE 2015), Santander, Spain, 15-17th September 2015, Electronic Proceedings in Theoretical Computer Science 200, pp. 48–63.
Published: 19th December 2015.

ArXived at: http://dx.doi.org/10.4204/EPTCS.200.4 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org