Formal techniques for consistency checking of orchestrations of semantic web services
Web service orchestrations aim at offering value-added services that meet the increasing
complex requirements of business processes. Since it becomes harder to manually check …
complex requirements of business processes. Since it becomes harder to manually check …
String comparators based algorithms for process model matchmaking
Y Belhoul, M Haddad, E Duchêne… - 2012 IEEE Ninth …, 2012 - ieeexplore.ieee.org
Retrieving matchings between process models becomes a significant challenge in many
applications. Recent attempts have been done to measure similarity of process models …
applications. Recent attempts have been done to measure similarity of process models …
A summary-based approach for enhancing process model matchmaking
The importance gained by the process models in modern information systems led to the
increasing proliferation of process model repositories. Matching process models and …
increasing proliferation of process model repositories. Matching process models and …
A graph-based approach for semantic process model discovery
One of the key tasks in the service oriented architecture that Semantic Web services aim to
automate is the discovery of services that can fulfill the applications or user needs. OWL-S is …
automate is the discovery of services that can fulfill the applications or user needs. OWL-S is …
Multi-tenant services monitoring for accountability in cloud computing
F Masmoudi, M Loulou… - 2014 IEEE 6th International …, 2014 - ieeexplore.ieee.org
Software as a Service (SaaS) is a delivery model in which software resources are accessed
remotely by users. Multi-tenancy is one of key properties of SaaS to achieve higher profit …
remotely by users. Multi-tenancy is one of key properties of SaaS to achieve higher profit …
Spectral graph approach for process model matchmaking
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 …
approach is inspired by spectral graph matching methods, in particular, by eigen-based …
Web service matchmaking by subgraph matching
H Seba, S Lagraa, H Kheddouci - … , The Netherlands, May 6-9, 2011 …, 2012 - Springer
Several approaches have been proposed to deal with the web service matchmaking
problem. Unfortunately, most of these solutions are purely syntactic measures based on the …
problem. Unfortunately, most of these solutions are purely syntactic measures based on the …
Vectorial signature for matching business process graphs
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 …
systems to find process models from hundreds or thousands model is necessary. Similarity …
A graph approach for enhancing process models matchmaking
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 …
matching. This problem is known to be difficult and its computational complexity is …
Business process graph matching based on vectorial signatures
During the last decade, business processes have gained in popularity leading to a rapid
proliferation of business process model collections. The need for efficient and fast systems …
proliferation of business process model collections. The need for efficient and fast systems …