Abstract
Recent works in web services have employed finite state machines for solving different problems, like matchmaking of web services, modelling of web service composition and verification of web service composition. Annotated Deterministic Finite State Automata (ADFSA) is used for matchmaking of web services. ADFSA is the combination of deterministic finite state automata (DFA) with logical annotation of transitions in state. BPEL4WS is a high level programming language to express the execution behavior of web services but this language is Turing-complete. For matchmaking of web services, only a fragment of BPEL suffice which is equivalent to regular language. A complex web service is obtained from simpler web services where each simpler web service is modeled as Communicating Automata (CA). A CA is a Non-deterministic Finite State Automata (NFA). In this paper, we show how CA can easily be used for matchmaking of services. For this purpose, we give translations of CA to ADFSA. Thus matchmaking of services can be carried out even when the services are modeled using CA.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
