%0 Conference Proceedings
%T Defining Distances for All Process Semantics
%+ Universidad Complutense de Madrid =  Complutense University of Madrid  [Madrid] (UCM)
%A Romero Hernández, David
%A Frutos Escrig, David, De
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 14th International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS) / 32nd International Conference on Formal Techniques for Networked and Distributed Systems (FORTE)
%C Stockholm, Sweden
%Y Holger Giese
%Y Grigore Rosu
%I Springer
%3 Formal Techniques for Distributed Systems
%V LNCS-7273
%P 169-185
%8 2012-06-13
%D 2012
%R 10.1007/978-3-642-30793-5_11
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X Recently several authors have proposed some notions of distance between processes that try to quantify “how far away” is a process to be related with some other with respect to a certain semantics. These proposals are usually based on the simulation game, and therefore are mainly defined for simulation semantics or other semantics more or less close to these. These distances have a local character since only one of the successors of each state is taken into account in their computation. Here, we present an alternative proposal exploiting the fact that processes are trees. We define the distance between two of them as the cost of the transformations that we need to apply to get two processes related by the corresponding semantics. Our new distances can be uniformly defined for all the semantics in the ltbt-spectrum.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-01528728/document
%2 https://inria.hal.science/hal-01528728/file/978-3-642-30793-5_11_Chapter.pdf
%L hal-01528728
%U https://inria.hal.science/hal-01528728
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-FORTE
%~ IFIP-FMOODS
%~ IFIP-LNCS-7273