Web Services are considered as self-contained, self-describing, modular applications that can be published, located, and invoked across the web. A composite web service is one that is built using multiple atomic web services and is typically specified using a set of rules in order to carry out a complicated practice.Current web service discovery methods mostly based on keywords, classified information of ontology, or data mining technologies. These methods focus on the information of a single web service, but not considered the composite activities. Current Web service composition methods always depend on atomic service discovery and process organization. That made it difficult to support obscure process or replace atomic service with a more proper one at composition time.In order to resolve the forementioned problems, this paper proposes a composite web service discovery method which is based on service behavior. By investigating the interaction model and composite patterns of web services, matchmaking algorithms for checking interactive replaceability and composite patterns are proposed. The composite service discovery algorithm accepts service profile as input from users, then a set of substituted services is selected based on their semantic or interactive properties, then the composite services which contain the substituted services are selected, they are matched or recomposed automatically based on their service contained circumstances. Finally the satisfied composite web service is sent to users. That improved efficient service composition and realized the reuse of web service in larger granularity. This paper also proposes several cases to make a better explanation. |