String Comparators Based Algorithms for Process Model Matchmaking

Yacine Belhoul 1 Mohammed Haddad 1 Eric Duchene 1 Hamamache Kheddouci 1
1 GrAMA - Graphes, Algorithmes et Multi-Agents
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
Abstract : Retrieving matchings between process models becomes a significant challenge in many applications. Recent attempts have been done to measure similarity of process models based on graph-edit distance. This problem is known to be difficult and computational complexity of exact algorithms for graph matching is exponential. Thus, heuristics must be proposed to obtain approximations. In this paper, we propose an approach to find relevant process models based on their decomposition into paths of possible execution sequences. Then, we propose a schema to compute the similarity between two process models using the proposed decomposition. Moreover, we give particular attention to the problem of ranking a collection of process models according to a particular query.
Type de document :
Communication dans un congrès
IEEE Ninth International Conference on Services Computing (SCC), Jun 2012, Honolulu, HI, United States. IEEE, pp.649-656, 2012, 〈10.1109/SCC.2012.69〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01353071
Contributeur : Équipe Gestionnaire Des Publications Si Liris <>
Soumis le : mercredi 10 août 2016 - 16:21:21
Dernière modification le : jeudi 19 avril 2018 - 14:38:04

Identifiants

Citation

Yacine Belhoul, Mohammed Haddad, Eric Duchene, Hamamache Kheddouci. String Comparators Based Algorithms for Process Model Matchmaking. IEEE Ninth International Conference on Services Computing (SCC), Jun 2012, Honolulu, HI, United States. IEEE, pp.649-656, 2012, 〈10.1109/SCC.2012.69〉. 〈hal-01353071〉

Partager

Métriques

Consultations de la notice

139