Coinductive Definition of Distances between Processes: Beyond Bisimulation Distances - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Coinductive Definition of Distances between Processes: Beyond Bisimulation Distances

Résumé

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.
Fichier principal
Vignette du fichier
978-3-662-43613-4_16_Chapter.pdf (245.35 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01398019 , version 1 (16-11-2016)

Licence

Paternité

Identifiants

Citer

David Romero-Hernández, David De 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⟩
26 Consultations
95 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More