Skip to Main content Skip to Navigation
Conference papers

Defining Distances for All Process Semantics

Abstract : 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.
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Hal Ifip <>
Submitted on : Monday, May 29, 2017 - 3:53:54 PM
Last modification on : Wednesday, June 13, 2018 - 3:40:02 PM
Long-term archiving on: : Wednesday, September 6, 2017 - 11:41:20 AM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



David Romero Hernández, David Frutos Escrig. Defining Distances for All Process Semantics. 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), Jun 2012, Stockholm, Sweden. pp.169-185, ⟨10.1007/978-3-642-30793-5_11⟩. ⟨hal-01528728⟩



Record views


Files downloads