Transforming BPEL into annotated deterministic finite state automata for service discovery
- 1 January 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
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.Keywords
This publication has 8 references indexed in Scilit:
- Matchmaking for business processes based on choreographiesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- IPSI-PF: a business process matchmaking enginePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Contract representation for run-time monitoring and enforcementPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- UDDIe: an extended registry for Web servicesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A Service Level Agreement Language for Dynamic Electronic ServicesElectronic Commerce Research, 2003
- Workflow ManagementPublished by MIT Press ,2002
- Logics for Databases and Information SystemsPublished by Springer Nature ,1998
- Statecharts: a visual formalism for complex systemsScience of Computer Programming, 1987