Nowadays, Web Services technology has become a standard to integrate business processes across organizations. In general, there are two approaches for web service composition: Orchestration and Choreography. Orchestration is used to develop a single process that integrates services within or across an organization to achieve a business goal. On the other hand, Choreography is often used for cross-organizational communication and serves as a specification for communication. In a choreographed environment, each Web service is an independent entity, and each service selects the partner services using its own selection policy without knowing all the other services in the choreography. In this thesis, we use £k-calculus for modeling the Web Services. Afterwards, we propose an approach for each constituent process to choose and invoke other processes using the limited information provided by its partners. In our method, each service proclaims the requirments of its potential service providers (or consumers) and itself and provides to its partners. Subsequently each service will generate a local view using the information provided by its service consumers and providers to guide the selection. We evaluate our method by simulating 100,000 executions with different degrees of service availability. The experimental results indicate that our proposed method can indeed improve the success rate of the entire choreography.