Transforming BPEL into annotated deterministic finite state automata for service discovery

Andreas Wombacher; Peter Fankhauser; Erich Neuhold

doi:10.1109/ICWS.2004.1314753

Transforming BPEL into annotated deterministic finite state automata for service discovery

Andreas Wombacher, Peter Fankhauser, Erich Neuhold

Research output: Contribution to conference › Paper › peer-review

89 Citations (Scopus)

145 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 language	Undefined
Pages	316-323
Number of pages	8
DOIs	https://doi.org/10.1109/ICWS.2004.1314753
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

Access to Document

10.1109/ICWS.2004.1314753

P2004-05

http://eprints.eemcs.utwente.nl/secure2/10605/01/P2004-05.pdf

Cite this

@conference{fce60bb6af68495dac96ae63ebd40ece,

title = "Transforming BPEL into annotated deterministic finite state automata for service discovery",

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{\textquoteright}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.",

keywords = "IR-67599, EWI-10605",

author = "Andreas Wombacher and Peter Fankhauser and Erich Neuhold",

year = "2004",

month = jul,

doi = "10.1109/ICWS.2004.1314753",

language = "Undefined",

pages = "316--323",

note = "null ; Conference date: 06-07-2004 Through 09-07-2004",

}

TY - CONF

T1 - Transforming BPEL into annotated deterministic finite state automata for service discovery

AU - Wombacher, Andreas

AU - Fankhauser, Peter

AU - Neuhold, Erich

PY - 2004/7

Y1 - 2004/7

N2 - 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.

AB - 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.

KW - IR-67599

KW - EWI-10605

U2 - 10.1109/ICWS.2004.1314753

DO - 10.1109/ICWS.2004.1314753

M3 - Paper

SP - 316

EP - 323

Y2 - 6 July 2004 through 9 July 2004

ER -