Skip to Main content Skip to Navigation
Journal articles

Quantifying the Similarity of Non-bisimilar Labelled Transition Systems

Gwen Salaün 1
1 CONVECS - Construction of verified concurrent systems
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : 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.
Complete list of metadata
Contributor : Gwen Salaün Connect in order to contact the contributor
Submitted on : Saturday, November 21, 2020 - 10:38:09 AM
Last modification on : Thursday, October 21, 2021 - 3:45:27 AM
Long-term archiving on: : Monday, February 22, 2021 - 6:24:56 PM


Files produced by the author(s)




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



Les métriques sont temporairement indisponibles