Novel method for looking for optimal route of service process based on modal Petri network

Abstract

The invention provides a novel method for looking for an optimal behavior execution route based on a modal Petri network, and relates to establishment of service process behavior effective intervals and route optimization based on branch effective intervals. The method includes the steps that firstly, a branch region set is determined according to the structural features of a process network; for each branch sub process in branch regions, a branch effective value is calculated by mapping an activity change constraint relation, and branch sub intervals are determined and further optimized into the branch effective intervals; in the branch effective intervals, according to the behavior constraint condition, a local optimal execution route in each branch sub process is determined, and then the optimal execution route of a whole process model is determined through step-by-step dynamic evolution. According to the novel method for looking for the optimal route, the problems of calculating behavior effectiveness in a model network under behavior constraint and looking for the optimal route are effectively solved, and the defect of the local optimal route change caused by behavior constraint in an existing fixed value method is overcome.

Description

technical field [0001] The invention belongs to the technical field of e-commerce information, and relates to a new method for finding an optimal path in a process model, including establishing effective intervals of branches and an interval-based path optimization method. Background technique [0002] With the continuous maturity of the computer technology software platform and the gradual expansion of the application field of the process model, there will inevitably be a large-grained business process model composed of multiple sub-processes to solve the problem that a single service object cannot meet the required functions. These sub-processes contain execution logic, and different sub-processes can achieve the same behavioral service, but the execution results often have certain differences. In view of this situation, on the premise of satisfying the functions required by users, it is particularly important to study the result attributes of behavior execution in the pro...

AI Technical Summary

Problems solved by technology

[0003] In the actual process model of the behavior execution path, the judgment of the optimal solution is complicated, and the execution path has great options

The traditional search method can only reflect the execution characteristics of an executable path in the entire model area, but does not consider the characteristic information contained in other executable paths

The established branch sub-interval contains a large amount of execution path information. In the process of using local optimal values ​​for reduction, it is necessary to consider the influence of behavioral constraints on the selection of execution paths, which loses a lot of useful information and reduces the accuracy of finding the optimal path. Spend

Using the fixed value method has the disadvantage of limiting the search area and cannot guarantee the accuracy of the optimal path

None of the existing search methods for the optimal execution path can improve the comprehensiveness and accuracy of the optimal path search.

Images