String Comparators Based Algorithms for Process Model Matchmaking - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

String Comparators Based Algorithms for Process Model Matchmaking

Résumé

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.
Fichier non déposé

Dates et versions

hal-01353071 , version 1 (10-08-2016)

Identifiants

Citer

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. pp.649-656, ⟨10.1109/SCC.2012.69⟩. ⟨hal-01353071⟩
88 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More