Quantifying the Similarity of Non-bisimilar Labelled Transition Systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Science of Computer Programming Year : 2021

Quantifying the Similarity of Non-bisimilar Labelled Transition Systems


Equivalence checking is an established technique for automatically verifying that two behavioural models (Labelled Transition Systems, LTSs) are equivalent from the point of view of an external observer. When these models are not equivalent, the checker returns a Boolean result with a counterexample, which is a sequence of actions leading to a state where the equivalence relation is not satisfied. However, this counterexample does not give any indication of how far the two LTSs are one from another. One can wonder whether they are almost identical or totally different, which is quite different from a design or debugging point of view. In this paper, we present an approach for measuring the similarity between two LTS models. The set of metrics is computed automatically using a tool we implemented. Beyond presenting the foundations of the proposed solution, we will show how it can be applied to two concrete application domains for supporting the construction of IoT applications on the one hand and for contributing to the process model matching problem on the other.
Fichier principal
Vignette du fichier
main.pdf (855.37 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03017666 , version 1 (21-11-2020)



Gwen Salaün. Quantifying the Similarity of Non-bisimilar Labelled Transition Systems. Science of Computer Programming, 2021, 202, ⟨10.1016/j.scico.2020.102580⟩. ⟨hal-03017666⟩
84 View
149 Download



Gmail Mastodon Facebook X LinkedIn More