Transforming BPEL into annotated deterministic finite state automata for service discovery

Andreas Wombacher, Peter Fankhauser, Erich Neuhold

    Research output: Contribution to conferencePaperAcademicpeer-review

    83 Citations (Scopus)
    71 Downloads (Pure)

    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 languageUndefined
    Pages316-323
    Number of pages8
    DOIs
    Publication statusPublished - Jul 2004
    Event2nd International Conference on Web Services, ICWS 2004 - San Diego, CA, USA
    Duration: 6 Jul 20049 Jul 2004

    Conference

    Conference2nd International Conference on Web Services, ICWS 2004
    Period6/07/049/07/04
    Other6-9 July 2004

    Keywords

    • IR-67599
    • EWI-10605

    Cite this