Universidad Complutense de Madrid
E-Prints Complutense

Coinductive Definition of Distances between Processes: Beyond Bisimulation Distances



Downloads per month over past year

Romero Hernandez, David and Frutos Escrig, David de (2014) Coinductive Definition of Distances between Processes: Beyond Bisimulation Distances. In Formal Techniques for Distributed Objects, Components, and Systems. Lecture Notes in Computer Science (8461). Springer, Berlin, pp. 249-265. ISBN 978-3-662-43613-4

[img] PDF
Restringido a Repository staff only


Official URL: http://download.springer.com/static/pdf/219/chp%253A10.1007%252F978-3-662-43613-4_16.pdf?auth66=1422522922_b5d29d44915e98e81f0a5788517b6425&ext=.pdf



Bisimulation captures in a coinductive way the quivalence
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.

Item Type:Book Section
Additional Information:

34th IFIP WG 6.1 International Conference on Formal Techniques for Distributed Objects, Components and Systems (FORTE)

Uncontrolled Keywords:Simulation; Systems; Metrics; Games
Subjects:Sciences > Computer science > Artificial intelligence
ID Code:28128
Deposited On:10 Feb 2015 09:26
Last Modified:08 Jul 2015 08:08

Origin of downloads

Repository Staff Only: item control page