Transforming BPEL into Annotated Deterministic Finite State Automata for Service Discovery

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.

• Type: Conference
• Year: 2004
• Where: ICWS
• Authors: Andreas Wombacher, Peter Fankhauser, Erich J. Neuhold
• Keywords: Deterministic Finite State, Finite State Automata, ICWS 2004, Internet Technology, State Dependent Services