The Extension of Semantic Formalization of Service Workflow Specification Language

Abstract

Service-Oriented Computing (SOC) is changing the way modern information systems that are designed, operated, and evolved. SOC makes possible to aggregate distributed resources at the phases of decision-making support and system operations. When myriads of resources with similar functionalities are available, effective methodologies are demanded to select services and compose them as service workflows for the specified goals. The computation for workflow composition is very complex since it depends on the numbers of services and their dynamic characteristics. Therefore, composing optimized workflows in a timely manner poses a great challenge. We are highly motivated to reduce the complexity of service selection and composition. The formalized semantics in SWSpec is extended so that unqualified or inferior services can be eliminated directly from the scope of the design solution space. In this paper, a brief review of the proposed SWSpec language is given and the focus is on the sematic formalization. A new compositional proof-system is developed with a set of inference rules and the proven system properties. The proposed semantic formalization has its great significance in reducing the complexity of composing workflows and developing efficient algorithms for compliance checking.