CN113344526B - Reference service flow under service network environment and construction method and application method thereof - Google Patents
Reference service flow under service network environment and construction method and application method thereof Download PDFInfo
- Publication number
- CN113344526B CN113344526B CN202110623477.5A CN202110623477A CN113344526B CN 113344526 B CN113344526 B CN 113344526B CN 202110623477 A CN202110623477 A CN 202110623477A CN 113344526 B CN113344526 B CN 113344526B
- Authority
- CN
- China
- Prior art keywords
- service
- flow
- service flow
- logic
- jump
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/10—Office automation; Time management
- G06Q10/103—Workflow collaboration or project management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
- G06F18/23—Clustering techniques
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F40/00—Handling natural language data
- G06F40/30—Semantic analysis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0639—Performance analysis of employees; Performance analysis of enterprise or organisation operations
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Theoretical Computer Science (AREA)
- Strategic Management (AREA)
- General Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- Entrepreneurship & Innovation (AREA)
- Physics & Mathematics (AREA)
- Economics (AREA)
- General Engineering & Computer Science (AREA)
- Development Economics (AREA)
- Artificial Intelligence (AREA)
- Operations Research (AREA)
- Marketing (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Educational Administration (AREA)
- General Business, Economics & Management (AREA)
- Evolutionary Computation (AREA)
- General Health & Medical Sciences (AREA)
- Computational Linguistics (AREA)
- Audiology, Speech & Language Pathology (AREA)
- Health & Medical Sciences (AREA)
- Evolutionary Biology (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Bioinformatics & Computational Biology (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Life Sciences & Earth Sciences (AREA)
- Game Theory and Decision Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Exchange Systems With Centralized Control (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a reference service flow under a service network environment and a construction method thereof, wherein the reference service flow comprises the following steps: (1) Generalizing and extracting a standardized service from general services with the same or similar targets as a reference service; (2) Replacing the general service with the reference service, modeling the service flow, and obtaining a hypergraph of the service flow for feature extraction of the service flow; (3) Deconstructing the hypergraph of the service flow and extracting the reference service flow. The invention also discloses a calling method of the reference service flow. The reference service flow of the invention can enable enterprises to quickly find the service flow which can realize the complex business requirements of the enterprises, and quickly establish the calling relationship between the enterprises and the service flow, thereby ensuring the stability of service execution.
Description
Technical Field
The invention relates to the field of service computing, in particular to a reference service flow under a service network environment, and a construction method and an application method thereof.
Background
Deep innovation and fusion of cross-boundary services spanning different industries, organizations and individual boundaries can bring a large number of multi-dimensional, high-quality and high-value services to service developers, and an important novel development idea is provided for the development of modern service industry.
Chinese patent publication No. CN111612330a discloses a service mode quantitative evaluation method for cross-border services, which can help product managers, entrepreneurs, business consultants and service designers to perform quantitative evaluation on existing service modes.
Chinese patent document No. CN111461566a discloses a method for integrating a cross-border service flow based on message stream division and merging, which can realize automatic integration of a multi-domain service flow chart in a cross-border service scene by methods such as flow fragment decomposition and flow integration rules under the constraint conditions of role, value, target, and the like of the cross-border integration scene, and help enterprises or software systems to complete expansion of services in other domains or generalize and expand services in the field to other domains.
With the continuous development of the cross-border service industry, the service using the process as the carrier plays an increasingly important role in the service computing field. Enterprises increasingly deploy their businesses in a network in the form of web services, and basic functional modules are provided for realizing complex businesses. Initially, these complex flow modules are usually implemented inside an enterprise, and different departments release their respective service modules according to the division of labor inside the initial enterprise, thereby implementing a complex complete product.
However, with the increasingly complex business of enterprises and the increasingly clear global division of labor, the services provided by a single enterprise cannot meet the market demand, and therefore, a service flow crossing the enterprise boundary is required to realize the upgrade of business value.
In this process, two important issues are faced in cross-border participation: what service flow can solve the current complex business problem; how to quickly and conveniently invoke the service flows. At present, no related technical scheme is available for solving the problem.
Disclosure of Invention
The invention provides a reference service flow under a service network environment and a construction method thereof, which can enable an enterprise to quickly find a service flow capable of realizing self complex business requirements, quickly establish a calling relationship in the enterprise and the service flow and ensure the stability of service execution.
The technical scheme of the invention is as follows:
a method for constructing a reference service flow under a service network environment comprises the following steps:
(1) Generalizing and extracting a standardized service from general services with the same or similar targets as a reference service;
(2) Replacing general services with reference services, modeling a service flow, and obtaining a hypergraph of the service flow for feature extraction of the service flow;
(3) Deconstructing the hypergraph of the service flow and extracting the reference service flow.
The step (1) comprises the following steps:
(1-1) mapping attributes of a general service into a vector space, and calculating semantic distances of different attributes in the vector space;
(1-2) clustering the attributes of the general services based on the semantic distances of different attributes in a vector space, clustering the attributes of the general services into a plurality of clusters, and obtaining a theme of each cluster of attributes, namely a reference theme;
(1-3) obtaining a reference service with the reference topic as an attribute; and constructing the mapping relation between the reference service and the general service by referring to the mapping relation between the theme and each general theme.
Preferably, attributes of the general service are mapped into the vector space by the word2vec algorithm.
Preferably, the attributes of the general service are clustered by KNN algorithm.
In the clustered attribute clusters, each cluster attribute has a reference theme, and one reference theme corresponds to a general theme corresponding to each attribute in the cluster.
Preferably, the step (1-2) further comprises: after clustering, clusters containing attributes with a number below a threshold are deleted.
The step (2) comprises the following steps:
(2-1) constructing a graph model of the service flow by taking the service in the service flow as a node and taking skip logic in the service flow as an edge;
(2-2) replacing general services in the graph model with reference services, reducing the number of nodes and edges in the graph model, and simplifying the graph model;
and (2-3) constructing an atlas formed by all general service flows into a hypergraph of the service flows according to rules based on a hypergraph theory.
The step (2-1) comprises the following steps:
(2-1-I) defining the service flow as P = { I, M, T, J }; wherein I represents an initial service in a service flow; m represents an intermediate service in the service flow; t represents a termination service in the service flow; j represents the jump logic of the service in the service flow,
J＝{And_split,Xor_split,loop_split,And_join,Xor_join,loop_join}；
(2-1-ii) defining a control flow pattern in the service flow, said control flow pattern comprising:
linear mode: all services in the service flow of the linear mode are executed in sequence according to the linear flow, and the in-degree and the out-degree of all task nodes are all 1;
condition mode: the conditional mode starts from the Xor _ split jump logic and ends at the Xor _ join jump logic; when Xor _ split jump logic is encountered, judging logic conditions, selecting logic meeting the conditions for jumping, executing the logic till the Xor _ join jump logic, and ending the execution logic of the current condition mode;
parallel mode: the parallel mode starts from the Ant _ split jump logic And ends from the Ant _ join jump logic; when the Add _ split jump logic is encountered, all subsequent flow branches are synchronously executed, the Add _ join jump logic is executed, and the current parallel mode execution logic is ended;
circulation mode: the loop mode has only one inlet and one outlet, starts from the loop _ split jump logic and ends from the loop _ join jump logic; when meeting the loop _ split jump logic, recording the specified cycle times in the logic, executing the subsequent flow until the loop _ join jump logic, then jumping to the loop _ split jump logic, repeating the steps until the specified cycle times are reached, and ending the cycle mode execution logic;
(2-1-iii) constructing a graph model G = { N, E, W } of the service flow based on a control flow pattern of the service flow; wherein, N represents a node in the graph, namely a service in the service flow; e represents an edge in the graph, i.e. a jump logic connecting two adjacent services; w represents the weight, i.e. the number of times a service jumps to the next service.
In step (2-1-iii), constructing a graph model of the service flow based on the control flow pattern of the service flow comprises:
(a) Judging the jump logic of the current service step:
if the node is in the linear mode, adding an edge with the weight of 1 between the current node and the next node;
if the current node is the Add _ split jump logic, traversing all next nodes of the current node; if the next node is a service, adding an edge with the weight of 1 between the current node and the next node; if the next node is the skip logic, replacing the next node with the preorder service of the current node;
if the node is the Add _ join jump logic, adding an edge with the weight of 1 between the current node And the next node;
if the node is Xor _ split jump logic, traversing all next nodes of the current node; if the next node is a service, an edge with the weight of 0.5 is added between the current node and the next node; if the next node is the jump logic, replacing the next node with the preorder service of the current node, and the reference weight of the next jump is 0.5;
if the node is Xor _ join jump logic, adding an edge with the weight of 0.5 between the current node and the next node;
(b) Repeating the step (a) until the service flow is finished;
(c) Repeating steps (a) and (b) for all initial services until all initial services are traversed.
Since the construction process of the hypergraph includes all service flow information and also includes a large amount of unimportant redundant information, preferably, the step (2) further includes the hypergraph optimization, including:
(A) Finding a service flow starting service which is used as an initiating point for the most times and is not traversed;
(B) Checking all jumps from the initial service, and if the weight of a jump is less than a specified threshold, deleting the jump and the subsequent jumps caused by the jump from the hypergraph;
(C) Taking the target point of the preorder jump as a new initiation point, and continuously repeating the step (B) until a termination point is met;
(D) If there are no hops in the current hypergraph with weights below a specified threshold, or all initial services have been traversed, the entire optimization process ends.
Based on the optimized hypergraph, a reference service flow SSP = { SSP-i, SSP-s, SSP-e, SSP-j _ m, SSP-c } can be constructed; wherein ssp-i represents all initial reference services; ssp-e stands for all terminating reference services; ssp-s represents all remaining reference services; ssp-j _ m represents all the jump information initiated from the service m, and comprises jump logic and target service; the ssp-c represents a configuration information file required when the reference service flow calls the general service flow, and comprises input and output format conversion information.
The method for calling the general service flow by the service flow caller by referring to the service flow comprises the following steps:
if a general service flow capable of meeting the requirements of the service flow caller exists, calling a reference flow by adopting a flow mapping mode, wherein the method comprises the following steps: establishing a logic corresponding relation between a reference service flow and a general service flow; the service flow caller provides service input information, converts the service input information into an input format adaptive to the initial reference service, performs service execution based on the execution logic of the reference service flow, and feeds back an execution result for the service flow caller;
if no existing general service flow can meet the requirement of a caller, calling a reference flow by adopting a service mapping mode, wherein the method comprises the following steps: and selecting corresponding general services meeting the functional requirements according to the reference services in the reference service flow, and then automatically constructing a general service flow based on the logical jump relation stored in the reference service node.
Compared with the prior art, the invention has the following beneficial effects:
(1) Establishing a corresponding relation between general services with the same or similar functions and reference services through the construction of the reference services, and ensuring the normal operation of each execution node of a service flow;
(2) Through the construction of the reference service flow, the problem of selection among a plurality of service flows by a user without domain expert knowledge is solved, the mapping between the reference flow and the general flow is automatically realized, and the flow with the best effect is selected through an evaluation algorithm;
(3) Through the construction of the reference service flow, a user can realize connection with all related general service flows by calling one reference service flow. Once the current execution flow fails, the current execution flow can be mapped into other normal flows as soon as possible, and the stability of service execution is ensured.
Drawings
FIG. 1 is a heteromorphic diagram of a service flow;
FIG. 2 is a service attribute cluster diagram;
FIG. 3 is a construction and mapping diagram of a reference service flow;
FIG. 4 is a sequence diagram of service flow execution;
FIG. 5 is a diagram of reference service flow invocation and execution.
Detailed Description
The invention will be described in further detail below with reference to the drawings and examples, which are intended to facilitate the understanding of the invention and are not intended to limit it in any way.
A method for constructing a reference service flow under a service network environment comprises the following steps:
FIG. 1 is a schematic diagram of a service flow. From the perspective of graph theory, the general service in the service flow (e.g. A in FIG. 1) 0 、A 1 、A 2 、B 0 、B 1 ……D 2 ) Like points in an abnormal graph, the execution flow between services (e.g. A in FIG. 1) 0 →B 0 →C 0 ) Such as an edge in an abnormal pattern. Although many service flows have the same or similar objectives, each general service flow may select a different general service and execution flow for different reasons.
As can be seen from fig. 1, the flows that achieve the same goal do not have any intersection, which brings difficulty to the extraction of the flows of the reference service, so that the creation of the reference service needs to be proposed first.
A reference service is an abstraction of all general services in a certain topic service cluster. The mapping between the general services and the reference service can be realized by mapping a plurality of attributes with different names but the same meaning in the general services onto the corresponding reference attributes of the reference service.
The reference service is constructed as follows:
and mapping the attributes of the general service into a vector space through a word2vec algorithm, and calculating semantic distances of different attributes in the vector space. The formula is as follows:
wherein x is i And y i Respectively representing the abscissa and the ordinate of the attribute i in the vector space; n represents the number of attributes of the service.
Based on semantic distances of different attributes in a vector space, clustering the attributes of the general service through a KNN algorithm, and deleting negligible clusters.
A negligible cluster is a cluster in which the number of attributes in the cluster is below a certain threshold.
Fig. 2 shows the result of clustering the attributes of a general service, where the attribute topic in each cluster is a reference topic, and a reference service can be obtained by the reference topic. The mapping of the reference service and the general service is realized through the mapping of the reference topic and the general topic in the cluster.
Replacing the generic services in the generic service flow with reference services results in a simplified service flow model, as shown in fig. 3.
FIG. 4 illustrates a defined service flow model that describes a general service flow.
A general service flow can be defined as a quadruplet P = { I, M, T, J }. Wherein I represents an initial service in a service flow; m represents an intermediate service in the service flow; t represents a termination service in the service flow; j represents the jump logic of the service in the service flow, J = { Add _ split, xor _ split, loop _ split, add _ join, xor _ join, loop _ join }.
Generally, there are four common control flow patterns in a service flow, including:
linear mode: all services in the service flow of the linear mode are executed in sequence according to the linear flow, and the in-degree and the out-degree of all task nodes are all 1.
Condition mode: conditional mode typically starts with Xor _ split jump logic and ends with Xor _ join jump logic. When Xor _ split judging logic is met, judging the logic condition, selecting the logic meeting the condition for jumping, executing the logic till Xor _ join, and ending the current condition mode execution logic.
Parallel mode: the parallel mode typically starts with the Add _ split jump logic And ends with the Add _ join jump logic. And when the Add _ split decision logic is encountered, synchronously executing all subsequent flow branches until Add _ join, and ending the current parallel mode execution logic.
Circulation mode: the loop pattern has only one entry and exit point, typically beginning with the loop _ split jump logic and ending with the loop _ join jump logic. When the loop _ split judgment logic is met, recording the cycle number specified in the logic, executing the subsequent flow until the loop _ join is reached, jumping to the loop _ split, repeating the steps until the cycle number is reached, and ending the cycle mode execution logic.
Based on a control flow mode of a service flow, constructing a graph model G = { N, E, W } of the service flow, wherein N represents a node in the graph, namely a general service in the service flow; e represents an edge in the graph, i.e. a jump logic connecting two adjacent services; w represents the weight, i.e. the number of times a service jumps to the next service. The weight of Xor _ split is defined as the actual number of hops based on the probability.
The following describes a method for converting the service flow logic in FIG. 4 into service flow subgraphs (all subgraphs of the same type of service flow are overlaid together to form a hypergraph):
(a) Judging skip logic of the current service step, wherein the skip logic comprises a linear mode, a conditional mode, a parallel mode and a circular mode;
if the node is in the linear mode, adding an edge with the weight of 1 between the two nodes;
if it is the Add _ split jump logic, all next nodes are traversed. If the next node is a service, adding an edge with the weight of 1 between the two nodes; if the next node is the skip logic, replacing the node with a preamble service;
if the node is the Add _ join jump logic, adding an edge with the weight of 1 between two nodes;
if it is Xor _ split jump logic, all child nodes are traversed. If the next node is a service, an edge with weight of 0.5 is added between the two nodes; if the next node is a jump logic, replacing the node with a preamble service, and the reference weight of the next jump is 0.5;
if the node is Xor _ join jump logic, adding an edge with the weight of 0.5 between two nodes;
(b) Repeating the step (a) until the service process is finished;
(c) Repeating steps (a) and (b) for all initial services until all initial services are traversed.
Through the steps, the service process of the similar execution logic can be converted into the hypergraph, however, since the construction process of the hypergraph includes all the service process information and also includes a large amount of unimportant redundant information, a method for removing the redundant edge in the hypergraph will be described as follows:
(A) Finding a service flow starting service which is used as an initiating point for the most times and is not traversed;
(B) Checking all jumps from the initial service, and if the weight of a jump is less than a specified threshold, deleting the jump and the subsequent jumps caused by the jump from the graph;
(C) Taking the target point of the preorder jump as a new initiation point, and continuously repeating the step (B) until a termination point is met;
(D) If the current hypergraph does not have jumps with weights below a specified threshold, or all initial services have been traversed, the entire optimization process ends.
Based on the optimized hypergraph, a reference service flow SSP = { SSP-i, SSP-s, SSP-e, SSP-j _ m, SSP-c } can be constructed; where ssp-i represents all initial reference services; ssp-e stands for all terminating reference services; ssp-s represents all remaining reference services; ssp-j _ m represents all the jump information initiated from the service m, and comprises jump logic and target service; the ssp-c represents a configuration information file required when the reference service flow calls the general service flow, and comprises input and output format conversion information and the like.
FIG. 5 shows two ways for a service flow caller to invoke a general flow by referencing a service flow:
first, if there is a general service flow that can satisfy the caller's requirement, the reference service flow will establish a logical correspondence with the general service flow. The service caller provides service input information and converts the service input information into an input format adapted to the initial reference service. Based on the execution logic of the reference service flow, the business executes and feeds back the execution result for the flow caller.
Secondly, if no existing general service flow exists, the requirement of the caller can be met. According to the reference service in the reference service flow, the corresponding general service meeting the functional requirements can be selected from the service registration center, and then a general service flow can be automatically constructed based on the logical jump relation stored in the service node. Eventually, a set of high QoS service flows may be recommended for the user.
The above-mentioned embodiments are intended to illustrate the technical solutions and advantages of the present invention, and it should be understood that the above-mentioned embodiments are only specific embodiments of the present invention, and are not intended to limit the present invention, and any modifications, additions, equivalents, etc. made within the scope of the principles of the present invention should be included in the scope of the present invention.
Claims (1)
1. A method for rapidly calling a service flow is characterized by comprising the following steps:
according to the requirement of the caller, determining whether there is a general service flow satisfying the requirement of the caller,
if the reference flow exists, calling the reference flow by adopting a flow mapping mode, wherein the reference flow comprises the following steps: establishing a logic corresponding relation between a reference service flow and a general service flow; the service flow caller provides service input information, converts the service input information into an input format adaptive to the initial reference service, performs service execution based on the execution logic of the reference service flow, and feeds back an execution result for the service flow caller;
if not, calling a reference flow in a service mapping mode, wherein the reference flow comprises the following steps: selecting corresponding general services meeting functional requirements according to reference services in the reference service flows, then automatically constructing a general service flow based on a logical jump relation stored in a reference service node, and recommending a group of high-QoS service flows for a service flow caller;
the construction method of the reference service flow comprises the following steps:
(1) Generalizing and extracting a standardized service from general services with the same or similar targets as a reference service; the method comprises the following steps:
(1-1) mapping attributes of a general service into a vector space, and calculating semantic distances of different attributes in the vector space;
(1-2) clustering the attributes of the general services based on the semantic distances of different attributes in a vector space, clustering the attributes of the general services into a plurality of clusters, and obtaining a theme of each cluster of attributes, namely a reference theme;
(1-3) obtaining a reference service with the reference topic as an attribute; constructing a mapping relation between a reference service and a general service through the mapping relation between the reference topic and each general topic;
(2) Replacing general services with reference services, modeling a service flow, obtaining a hypergraph of the service flow, and extracting characteristics of the service flow, wherein the hypergraph comprises the following steps:
(2-1) constructing a graph model of the service flow by taking the service in the service flow as a node and taking the jump logic in the service flow as an edge, wherein the graph model comprises the following steps:
(2-1-I) defining the service flow as P = { I, M, T, J }; wherein I represents an initial service in a service flow; m represents an intermediate service in the service flow; t represents a termination service in the service flow; j represents the jump logic of the service in the service flow, J = { Add _ split, xor _ split, loop _ split, add _ join, xor _ join, loop _ join };
(2-1-ii) defining a control flow pattern in the service flow, said control flow pattern comprising:
linear mode: all services in the service flow of the linear mode are executed in sequence according to the linear flow, and the in-degree and the out-degree of all task nodes are all 1;
condition mode: the conditional mode starts with Xor _ split jump logic and ends with Xor _ join jump logic; when Xor _ split jump logic is encountered, judging logic conditions, selecting logic meeting the conditions for jumping, executing the logic till the Xor _ join jump logic, and ending the execution logic of the current condition mode;
parallel mode: the parallel mode starts from the Ant _ split jump logic And ends from the Ant _ join jump logic; when the Add _ split jump logic is encountered, all subsequent flow branches are synchronously executed, the Add _ join jump logic is executed, and the current parallel mode execution logic is ended;
circulation mode: the loop mode has only one inlet and one outlet, starts from the loop _ split jump logic and ends from the loop _ join jump logic; when meeting the loop _ split jump logic, recording the specified cycle times in the logic, executing the subsequent flow until the loop _ join jump logic, then jumping to the loop _ split jump logic, repeating the steps until the specified cycle times are reached, and ending the cycle mode execution logic;
(2-1-iii) constructing a graph model G = { N, E, W } corresponding to the service flow based on a control flow pattern of the service flow; wherein, N represents a node in the graph, namely a service in the service flow; e represents an edge in the graph, i.e. a jump logic connecting two adjacent services; w represents the weight, i.e. the number of times a service jumps to the next service; in step (2-1-iii), constructing a graph model of the service flow based on the control flow pattern of the service flow comprises:
(a) Judging the jump logic of the current service step:
if the node is in the linear mode, adding an edge with the weight of 1 between the current node and the next node;
if the logic is the Add _ split jump logic, traversing all next jumps of the current node; if the next hop is service, adding an edge with the weight of 1 between the current node and the next node; if the next hop is a skip logic, replacing the next hop with a preorder service of the current node;
if the current node is the Add _ join jump logic, adding an edge with the weight of 1 between the current node And the next node;
if the node is Xor _ split jump logic, traversing all next jumps of the current node; if the next hop is service, adding an edge with the weight of 0.5 between the current node and the next node; if the next hop is a hop logic, replacing the next hop with the preorder service of the current node, and the reference weight of the next hop is 0.5;
if the node is Xor _ join jump logic, adding an edge with the weight of 0.5 between the current node and the next node;
(b) Repeating the step (a) until the service process is finished;
(c) Repeating steps (a) and (b) for all initial services until all initial services are traversed;
(2-2) replacing general services in the graph model with reference services, reducing the number of nodes and edges in the graph model, and simplifying the graph model;
(2-3) constructing an atlas formed by all general service flows into a hypergraph of the service flows according to rules based on a hypergraph theory;
and optimizing the hypergraph, which comprises the following steps:
(A) Finding a service flow initial service which is used as an initiation point for the most times and is not traversed yet;
(B) Checking all jumps from the initial service, and if the weight of a certain jump is less than a specified threshold, deleting the jump and the subsequent jumps caused by the jump from the hypergraph;
(C) Taking the target point of the preorder jump as a new initiation point, and continuously repeating the step (B) until a termination point is met;
(D) If no jump with the weight lower than the specified threshold value exists in the current hypergraph or all the initial services have been traversed, the whole optimization process is ended;
(3) Deconstructing the hypergraph of the service flow and extracting a reference service flow;
the constructed reference service flow is as follows:
SSP＝{ssp-i,ssp-s,ssp-e,ssp-j_m,ssp-c}；
wherein ssp-i represents all initial reference services; ssp-e stands for all terminating reference services; ssp-s represents all remaining reference services; ssp-j _ m represents all the jump information initiated from the service m, and comprises jump logic and target service; the ssp-c represents a configuration information file required when the reference service flow calls the general service flow, and comprises input and output format conversion information.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110623477.5A CN113344526B (en) | 2021-06-04 | 2021-06-04 | Reference service flow under service network environment and construction method and application method thereof |
| PCT/CN2021/098783 WO2022252250A1 (en) | 2021-06-04 | 2021-06-08 | Reference service process in service network environment, and construction method and application method therefor |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110623477.5A CN113344526B (en) | 2021-06-04 | 2021-06-04 | Reference service flow under service network environment and construction method and application method thereof |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113344526A CN113344526A (en) | 2021-09-03 |
| CN113344526B true CN113344526B (en) | 2023-04-07 |
Family
ID=77473809
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110623477.5A Active CN113344526B (en) | 2021-06-04 | 2021-06-04 | Reference service flow under service network environment and construction method and application method thereof |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN113344526B (en) |
| WO (1) | WO2022252250A1 (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116151597B (en) * | 2023-04-20 | 2023-07-07 | 华能信息技术有限公司 | Quick plug-in type flow management method and system based on private cloud architecture |
| CN117807939A (en) * | 2023-12-29 | 2024-04-02 | 苏州异格技术有限公司 | Circuit hypergraph determining method and device, computer equipment and storage medium |
Family Cites Families (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| DE102007042094A1 (en) * | 2007-09-05 | 2009-03-12 | Unycom Information Technology Services Gmbh | Computer-implemented system and method for the structured storage of data of at least one predefined sequence |
| CN103235801A (en) * | 2013-04-15 | 2013-08-07 | 武汉理工大学 | Semantic Web service combination method and system based on user requirements |
| CN104809242B (en) * | 2015-05-15 | 2018-03-02 | 成都睿峰科技有限公司 | A kind of big data clustering method and device based on distributed frame |
| CN105468371B (en) * | 2015-11-23 | 2018-08-28 | 赣南师范学院 | A kind of business process map merging method based on Subject Clustering |
| CN112470145A (en) * | 2018-08-14 | 2021-03-09 | 赫尔实验室有限公司 | Hypergraph-based method for segmenting and clustering consumer observable objects of a vehicle |
| CN111191088B (en) * | 2020-01-02 | 2022-02-01 | 武汉大学 | Method, system and readable medium for analyzing cross-boundary service demand |
| CN111461566B (en) * | 2020-04-10 | 2023-02-03 | 武汉大学 | Cross-border service flow fusion method and system based on message flow division and combination |
| CN112884248B (en) * | 2021-03-24 | 2023-01-06 | 苏州大学 | Optimization method of large-scale cloud service process |
-
2021
- 2021-06-04 CN CN202110623477.5A patent/CN113344526B/en active Active
- 2021-06-08 WO PCT/CN2021/098783 patent/WO2022252250A1/en active Application Filing
Also Published As
| Publication number | Publication date |
|---|---|
| CN113344526A (en) | 2021-09-03 |
| WO2022252250A1 (en) | 2022-12-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113344526B (en) | Reference service flow under service network environment and construction method and application method thereof | |
| CN104504143B (en) | A kind of flow graph optimization method and its device | |
| US7617230B2 (en) | Finding similarity among sets of coordinated tasks | |
| US8365170B2 (en) | Realizing jumps in an executing process instance | |
| Hamadi et al. | Recovery nets: Towards self-adaptive workflow systems | |
| CN109873715B (en) | Service calling relation rationality detection method under micro-service architecture | |
| Kim et al. | Experimental verification and validation of the SICN-oriented process mining algorithm and system | |
| CN102387264B (en) | The processing method of call control strategy, device and call center | |
| Kim et al. | Formal identification of right-grained services for service-oriented modeling | |
| CN112365239A (en) | Event-based cloud service management handling method and system | |
| CN110322230A (en) | A kind of Workflow system docks specification implementation method with operation system | |
| CN112380218B (en) | ETL-based automatic triggering method for summarizing data tables of data warehouse layers | |
| CN114996298A (en) | Efficient merging method for cross-main-body cross-process personalized service process nodes | |
| CN109144486A (en) | A kind of workflow implementation method statelessly changed | |
| CN115905353A (en) | Associated data export and import method, device, equipment and storage medium | |
| CN103793232A (en) | Component calling and extending frame implementation method based on AOP | |
| Hassine et al. | Timed use case maps | |
| Benzin et al. | Preventing object-centric discovery of unsound process models for object interactions with loops in collaborative systems: extended version | |
| CN102902519A (en) | Method for achieving composite prediction calculation based on dynamic system | |
| CN107943569B (en) | Time analysis method for early decision in real-time system based on feature model | |
| CN109062704A (en) | A kind of unbounded Petri net method of deploying towards Deadlock Detection | |
| KR20180010704A (en) | Method for interworking data between different systems by patterning services | |
| Pang et al. | Reference service process: a normalized cross-over service collaboration paradigm | |
| CN109495541B (en) | Cross-data-center-based cloud service workflow scheduling method | |
| CN108197172B (en) | Frequent pattern mining method based on big data platform |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |