Universidad Complutense de Madrid
E-Prints Complutense

Defining distances for all process semantics



Downloads per month over past year

Romero Hernández, David and Frutos Escrig, David de (2012) Defining distances for all process semantics. In Formal Techniques for Distributed Systems : Joint 14th IFIP WG 6.1 International Conference, FMOODS 2012 and 32nd IFIP WG 6.1 International Conference, FORTE 2012, Stockholm, Sweden, June 13-16, 2012. Proceedings. Lecture notes in computer science (7273). Springer, pp. 169-185. ISBN 978-3-642-30792-8

[img] PDF
Restringido a Repository staff only


Official URL: http://link.springer.com/content/pdf/10.1007%2F978-3-642-30793-5_11



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.

Item Type:Book Section
Subjects:Sciences > Computer science
ID Code:20793
Deposited On:12 Apr 2013 09:08
Last Modified:30 Aug 2018 08:26

Origin of downloads

Repository Staff Only: item control page