| Transforming BPEL into annotated deterministic finite state automata for service discovery (2004) | |||||||||||
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 senders 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. | |||||||||||
Publication details | |||||||||||
| |||||||||||