A promising way to model the global behavior of a Web Service composition is to characterize the set of conversations among the participating Web Services. A conversation protocol specifies the desired global behaviors of a Web Service composition. The realizability problem is to decide whether, given a conversation protocol, a Web Service composition can be synthesized that generates exactly the same set of conversations specified by the protocol. This is a key problem in the top-down specification of the Web Service compositions. In our earlier work, we developed sufficient conditions for realizability of conversation protocols based on a model that abstracts the contents of the messages. The present paper extends our earlier work by allowing message contents to be used in the realizability analysis. We show that taking the message contents into account yields more accurate analysis. To overcome the state-space explosion caused by the message contents, we propose symbolic analysis techniques for the realizability conditions. In addition, we show that the analysis of one of the realizability conditions — the autonomy condition — can be done using an iterative refinement approach.
2 November 2011 in Service Oriented Computing and Applications
A business process or workflow is an assembly of tasks that accomplishes a business goal. Business process management is the study of the design, configuration/implementation, enactment and monitoring, analysis, and re-design of workflows. The traditional methodology for the re-design and improvement of workflows relies on the well-known sequence of extract, transform, and load (ETL), data/process warehousing, and online analytical processing (OLAP) tools. In this paper, we study the ad hoc queryiny of process enactments for (data-centric) business processes, bypassing the traditional methodology for more flexibility in querying. We develop an algebraic query language based on “incident patterns” with four operators inspired from Business Process Model and Notation (BPMN) representation, allowing the user to formulate ad hoc queries directly over workflow logs. A formal semantics of this query language, a preliminary query evaluation algorithm, and a group of elementary properties of the operators are provided.