A Colored Petri Net-based Model for Automated Web Service Composition

In this Paper, we propose a colored Petri net-based model for Web service composition to provide the semantic support for automated Web service composition, and improve the reliability and maintainability of composite services. The composite constructs in the model are sequence, concurrent, choice, loop and replace. The Web service is formally defined by colored Petri net. A closed composing algebra is defined to obtain a framework which enables declarative composition of Web services. An automated composing algebra is defined to enable automated composition and semi-auto composition with manual operations.