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.
Original language | Undefined |
---|---|
Pages | 316-323 |
Number of pages | 8 |
DOIs | |
Publication status | Published - Jul 2004 |
Event | 2nd International Conference on Web Services, ICWS 2004 - San Diego, CA, USA Duration: 6 Jul 2004 → 9 Jul 2004 |
Conference
Conference | 2nd International Conference on Web Services, ICWS 2004 |
---|---|
Period | 6/07/04 → 9/07/04 |
Other | 6-9 July 2004 |
Keywords
- IR-67599
- EWI-10605