Coinductive Definition of Distances between Processes: Beyond Bisimulation Distances

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

Cited literature [23 references]  Display  Hide  Download

https://hal.inria.fr/hal-01398019
Contributor : Hal Ifip <>
Submitted on : Wednesday, November 16, 2016 - 3:38:34 PM
Last modification on : Friday, September 29, 2017 - 2:36:04 PM
Long-term archiving on : Thursday, March 16, 2017 - 2:44:31 PM

File

978-3-662-43613-4_16_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

David Romero-Hernández, David Frutos Escrig. Coinductive Definition of Distances between Processes: Beyond Bisimulation Distances. 34th Formal Techniques for Networked and Distributed Systems (FORTE), Jun 2014, Berlin, Germany. pp.249-265, ⟨10.1007/978-3-662-43613-4_16⟩. ⟨hal-01398019⟩

Share

Metrics

Record views

46

Files downloads

117