Work

Transforming BPEL into annotated deterministic finite state automata for service discovery

Year: 2004

Type: conference-paper

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.

Source: IEEE International Conference on Web Services (ICWS)

DOI: 10.1109/icws.2004.1314753

Authors: A. Wombacher, P. Fankhauser, E. Neuhold

Institution: Fraunhofer-Gesellschaft

Language: English

Topic: Service-Oriented Architecture and Web Services

Subfield: Information Systems

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W4252523713

FWCI: 5.403

Cites: 17

Cited by: 76

Related to: 10