Petri nets are frequently used formal tools to analyze the compatibility of interactive service processes described by Web Services Business Process Execution Language (WS-BPEL). However, the traditional methods based on Petri nets were with a high computable complexity for state space explosion. To resolve such problem, a logic Petri net-based path detecting method for compatibility analysis of interactive service processes is proposed. From the provided mapping rules, the service process described by WS-BPEL is modeled as a service net based on logic Petri nets. The evaluation of interactive compatibility of two service processes is converted to analyze whether their service nets can be composed as a non-blocked synthetic service net. The non-blocked property is checked by detecting the reachability of the potential connected paths in a service net. To reduce the complexity of computing the connected paths in a service net, we propose a merge-reduced method to generate the path expression of its skeleton service net.The potential connected paths of a service net can be obtained by unfolding the path expression.Compared with the traditional method based Petri nets, the proposed method is with high efficiency and it can greatly alleviate the problem of state space explosion in analyzing interactive compatibility of service processes.
Summary
Alignment is the state‐of‐the‐art technique in conformance checking and becoming more important for the analysis of business processes. To improve the efficiency of alignment, a new alignment approach is presented based on Petri net models and traces. It takes artificial logs and models as an example to illustrate the procedure of the new alignment approach. The approach can generate an optimal alignment tree including all of the optimal alignments between the given trace and the Petri net model based on standard likelihood cost function. This paper gives the approach a specific and rigorous characterization. The approach is implemented on ProM as a plugin and has been evaluated using complex logs and models as a case study.
Since the basic binding unit of current service request and response schema is an atomic Web service, it needs to costly find a substitute service or reconstruct the service process in the original service space once a fine granular evolution requirement occurs. To reduce the complexity of fine granular service evolution, an isomorphic evolution mechanism based on service clusters is proposed. Searching space can be reduced and responding flexibility will also be improved by adopting service cluster as the unit of service response. Simple evolution and merging evolution were put forward to handle the evolution of atomic Web services. Meanwhile, a formal model and the quality computing method for service processes built by service clusters were presented based on the logic Petri nets. Two types of evolution patterns including dot isomorphic evolution and chain isomorphic evolution were proposed to evolve service processes. The algorithms for different isomorphic evolution patterns of atomic service and service processes were designed in the paper. Simulation experiments were conducted on 10000 Web services with different process patterns. Compared with the traditional service request and response schema, the efficiencies of service discovery and isomorphic evolution are improved greatly in our proposed method.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.