Research On Limited Composition Based On Logical Workflow Nets

Today,business process management(BPM)technology has been developed and has been applied on a small scale and large scale.Many companies and organizations have implemented information systems for business processes.By combining existing business processes,a stronger and more adaptable business process can be formed.Business process(BP)can be combined through the form of Web service operations.In order to compose business processes without deadlock,we need to restrict the behavior of partner business processes.For business processes that do not want to disclose internal processes,although there are already methods to restrict partner business processes using existing methods,it cannot process business processes that include batch processing functions and uncertainties in passed values.Based on the significance of this research,this paper studies the theory of workflow model construction and analysis based on logical workflow net,that is,when designing a workflow management system,a concept of limited combination is proposed according to its operating characteristics and advantages,and combined with logical workflow net Perform a deadlock-free analysis of the model.The main research work of this article can be summarized as follows:(1)For the combination of logical workflow nets,according to the uncertainty of the transfer of logical changes and the characteristics of logical workflow net combinations,the introduction of multiple sets defines a new state transition graph,and defines the basic nature of the state transition graph,the state The combination of transition graphs,the mapping between state transition graphs,the algorithm for generating state transition graphs,and the K mapping and state assignments proposed for analyzing the logic workflow net.According to the K mapping and state assignment,the deadlock of the combinatorial logic workflow net can be judged.(2)For the process combination,the intermediary that passes the message has a capacity upper limit.For the combination of existing logical workflow nets,two types of limited combinations of logical workflow nets are defined by adding the constraints of the database.The limited combination is more in line with the characteristics of limited resources in reality,has better comprehensibility,and simplifies the difficulty of deadlock judgment to a certain extent.According to the two types of combinations of logical workflow netorks,the limited combinations of state transition graphs are defined,and the limited combinations of logical workflow netorks can be analyzed by using the limited combinations of state transition graphs.(3)Based on the state transition graph,according to the state assignment,the deadlock situation of a certain state can be calculated.Combining the symmetric characteristics of the state transition graph combination,the concept of the standard state transition graph is proposed.With the help of standard state transition graphs,according to the mapping properties between state transition graphs,a deadlock-free judgment method for finite combination logic workflow net is proposed.Finally,a simple e-commerce process is used to illustrate the deadlock-free judgment method.