The promise ofWeb Service Computing is to utilizeWeb services as fundamental elements for realizing distributed applications/solutions. In particular, when no available service can satisfy client request, (parts of) available services can be composed and orchestrated in order to satisfy such a request. In this paper, we address the automatic composition when component services have access control & authorization constraints, and impose further reputation constraints on other component services. In particular, access & authorization control is based on credentials, component services may (or not) trust of credentials issued by other component services and the service behavior is modeled by the possible conversations the service can have with its clients. We propose an automatic composition synthesis technique, based on reduction to satisfiability in Propositional Dynamic Logic, that is sound, complete and decidable. Moreover, we will characterize the computational complexity of the problem.
展开▼
