%0 Conference Proceedings
%T Coinductive Definition of Distances between Processes: Beyond Bisimulation Distances
%+ Universidad Complutense de Madrid =  Complutense University of Madrid  [Madrid] (UCM)
%A Romero-Hernández, David
%A Frutos Escrig, David, De
%Z Part 4: Bisimulation, Abstraction and Reduction
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 34th Formal Techniques for Networked and Distributed Systems (FORTE)
%C Berlin, Germany
%Y Erika Ábrahám
%Y Catuscia Palamidessi
%I Springer
%3 Formal Techniques for Distributed Objects, Components, and Systems
%V LNCS-8461
%P 249-265
%8 2014-06-03
%D 2014
%R 10.1007/978-3-662-43613-4_16
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X Bisimulation captures in a coinductive way the equivalence between processes, or trees. Several authors have defined bisimulation distances based on the bisimulation game. However, this approach becomes too local: whenever we have in one of the compared processes a large collection of branches different from those of the other, only the farthest away is taken into account to define the distance. Alternatively, we have developed a more global approach to define these distances, based on the idea of how much we need to modify one of the compared processes to obtain the other. Our original definition only covered finite processes. Instead, now we present here a coinductive approach that extends our distance to infinite but finitary trees, without needing to consider any kind of approximation of infinite trees by their finite projections.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-01398019/document
%2 https://inria.hal.science/hal-01398019/file/978-3-662-43613-4_16_Chapter.pdf
%L hal-01398019
%U https://inria.hal.science/hal-01398019
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-FORTE
%~ IFIP-LNCS-8461