Transforming BPEL into annotated deterministic finite state automata for service discovery

Wombacher, Andreas and Fankhauser, Peter and Neuhold, Erich (2004) Transforming BPEL into annotated deterministic finite state automata for service discovery. In: 2nd International Conference on Web Services, ICWS 2004, 6-9 July 2004, San Diego, CA, USA.

Preview

PDF
155Kb

Abstract:	Web services advocate loosely coupled systems, although current loosely coupled applications are limited to stateless services. The reason for this limitation is the lack of a method supporting matchmaking of state dependent services exemplarily specified in BPEL. In particular, the sender�s requirement that the receiver must support all possible messages sent at a certain state are not captured by models currently used for service discovery. Annotated deterministic finite state automata provide this expressiveness. In this paper the transformation of a local process specification given in BPEL to annotated deterministic finite state automata is presented.
Item Type:	Conference or Workshop Item
Copyright:	© 2004 IEEE
Faculty:	Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:	Information Systems (IS)
Link to this item:	http://purl.utwente.nl/publications/67599
Official URL:	http://dx.doi.org/10.1109/ICWS.2004.1314753
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page