MT Garcia, MM Nunes, M Fantinato, SM Peres… - Information Systems, 2023 - Elsevier
A better treatment of subprocesses by process model similarity techniques can provide improved results to stakeholders, allowing them to define which levels in the subprocess …
K Shahzad, I Pervaz, A Nawab - BIR Workshops, 2018 - ceur-ws.org
Process Model Matching (PMM) refers to the automatic identification of corresponding activities between a pair of process models. Due to the wider applicability of PMM …
Process model matching techniques aim at automatically identifying activity correspondences between two process models that represent the same or similar behavior …
A Boukhadra, K Benatchba… - 2014 17th International …, 2014 - ieeexplore.ieee.org
Semantic Web services (SWs) and P2P computing have emerged as new paradigms for solving complex problems by enabling large-scale aggregation and sharing of distributed …
F Kacimi, H Kheddouci, A Tari - 2023 9th International …, 2023 - ieeexplore.ieee.org
Over the last decade, graphs have gained in popularity and have been widely used to model complex real world structures and data in various application domains. This leads to a rapid …
In this paper, we propose a novel approach for graph based web service matching. Our approach is inspired by spectral graph matching methods, in particular, by eigen-based …
F Kacimi, A Tari - 2014 International Conference on Advanced …, 2014 - ieeexplore.ieee.org
With the rapid proliferation of business process model collections, a fast and efficient systems to find process models from hundreds or thousands model is necessary. Similarity …
A Boukhadra, K Benatchba… - … 2014 IEEE 6th Intl Symp on …, 2014 - ieeexplore.ieee.org
Semantic Web services (SWs) paradigm is considered as the most dominant technology of the Service-Oriented Computing (SOC). SWs have emerged as a major technology for …
Y Belhoul, S Yahiaoui, M Haddad… - 2015 IEEE …, 2015 - ieeexplore.ieee.org
Recent attempts have been done to measure similarity of process models based on graph matching. This problem is known to be difficult and its computational complexity is …