BPEL behavioral abstraction and matching

Authors:
Nomane Ould Ahmed M'bareck;Samir Tata
Affiliations:
Institut National des Télécommunications, GET/INT, Evry, France;Institut National des Télécommunications, GET/INT, Evry, France
Venue:
BPM'06 Proceedings of the 2006 international conference on Business Process Management Workshops
Year:
2006

Citing 4
Cited 1

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Branching programs and binary decision diagrams: theory and applications

Branching programs and binary decision diagrams: theory and applications
Treatment of epsilon moves in subset construction

Computational Linguistics - Special issue on finite-state methods in NLP
Extending BPEL for Run Time Adaptability

EDOC '05 Proceedings of the Ninth IEEE International EDOC Enterprise Computing Conference

Behavioral matchmaking for service retrieval: Application to conversation protocols

Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

BPEL is the most popular language for describing business process and business interaction based on Web services for inter-organizational cooperation. Nevertheless, BPEL requires a static binding of services to the flows. We propose in this paper a new approach enabling dynamic binding. This approach consists of, first, providing a high-level description of process, second, abstracting the process behavior using symbolic observation graphs and third providing an efficient algorithm for symbolic observation graphs matching which is used for binding dynamically business processes.