Data & Knowledge Engineering
Constructing minimal protocol adaptors for service composition
Proceedings of the 4th Workshop on Emerging Web Services Technology
Querying graph-based repositories of business process models
DASFAA'10 Proceedings of the 15th international conference on Database systems for advanced applications
Similarity of business process models: Metrics and evaluation
Information Systems
Finding web services via BPEL fragment search
Proceedings of the 3rd International Workshop on Search-Driven Development: Users, Infrastructure, Tools, and Evaluation
Behavioral similarity: a proper metric
BPM'11 Proceedings of the 9th international conference on Business process management
A query language for analyzing business processes execution
BPM'11 Proceedings of the 9th international conference on Business process management
Perceived consistency between process models
Information Systems
Revealing hidden relations among web services using business process knowledge
ICSOC'11 Proceedings of the 9th international conference on Service-Oriented Computing
Semantic annotation of image processing tools
Proceedings of the 2nd International Conference on Web Intelligence, Mining and Semantics
On profiles and footprints --- relational semantics for petri nets
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
On efficient processing of BPMN-Q queries
Computers in Industry
Hi-index | 0.00 |
BPEL has emerged as the industrial standard language for modelling behavioral aspects of web services. To support business partners in dynamically and flexibly binding their services together, different BPEL processes need to be efficiently matched. This paper identifies and defines various types of structural matching for BPEL processes. The matching definitions are based on heuristics: they take behavioral interaction aspects of the compared services into account, but abstract from irrelevant syntactical differences. Since the definitions are structural, they can be efficiently computed, and thus are useful to support dynamic and flexible binding of services. The approach is illustrated with an example from an existing business scenario.