RT Book, Section
T1 Defining distances for all process semantics
A1 Romero Hernández, David
A1 Frutos Escrig, David De
A2 Giese, Holger
A2 Rosu, Grigore
AB 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.
PB Springer
SN 978-3-642-30792-8
YR 2012
FD 2012
LK https://hdl.handle.net/20.500.14352/45431
UL https://hdl.handle.net/20.500.14352/45431
LA eng
NO Romero Hernández, D. & Frutos Escrig, D. «Defining Distances for All Process Semantics». Formal Techniques for Distributed Systems, editado por Holger Giese y Grigore Rosu, vol. 7273, Springer Berlin Heidelberg, 2012, pp. 169-85. DOI.org (Crossref), https://doi.org/10.1007/978-3-642-30793-5_11.
NO Comunidad de Madrid
NO Ministerio de Ciencia, Innovación y Universidades (España)
NO Ministerio de Educación, Formación Profesional y Deportes (España)
DS Docta Complutense
RD 6 abr 2025