CN111461566A - Cross-boundary service flow fusion method and system based on message flow division and combination - Google Patents

Cross-boundary service flow fusion method and system based on message flow division and combination Download PDF

Info

Publication number
CN111461566A
CN111461566A CN202010277500.5A CN202010277500A CN111461566A CN 111461566 A CN111461566 A CN 111461566A CN 202010277500 A CN202010277500 A CN 202010277500A CN 111461566 A CN111461566 A CN 111461566A
Authority
CN
China
Prior art keywords
sub
flow
segments
fusion
segment
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.)
Granted
Application number
CN202010277500.5A
Other languages
Chinese (zh)
Other versions
CN111461566B (en
Inventor
李兵
闪意炜
乔雨
王健
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Wuhan University WHU
Original Assignee
Wuhan University WHU
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Wuhan University WHU filed Critical Wuhan University WHU
Priority to CN202010277500.5A priority Critical patent/CN111461566B/en
Publication of CN111461566A publication Critical patent/CN111461566A/en
Application granted granted Critical
Publication of CN111461566B publication Critical patent/CN111461566B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0633—Workflow 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/10—Office automation; Time management
    • G06Q10/103—Workflow collaboration or project management

Abstract

The invention discloses a cross-boundary service flow fusion method based on message flow division and combination, which comprises the following steps: 1: marking the message flow of the service flow chart, and dividing the message flow into sub-flow segments; 2: calculating according to the similarity to obtain a sub-process segment similarity matrix, and determining a pair of fusible segments; 3: fusing the pair of fusible fragments by adopting a corresponding fusion rule; 4: and integrating all the sub-process fragments after fusion according to the fragment integration rule so as to obtain the service flow chart after fusion. The invention has the beneficial effects that: under the constraint conditions of the role, value, target and the like of a cross-border fusion scene, the automatic fusion of the multi-field business flow chart in the cross-border service scene can be realized by methods such as flow fragment decomposition, flow fusion rules and the like, the enterprise or a software system and the like are helped to complete the expansion of other field businesses or generalize and expand the field businesses to other fields, and the method has good practicability.

Description

Cross-boundary service flow fusion method and system based on message flow division and combination
Technical Field
The invention relates to the technical field of business process management, in particular to a cross-boundary service process fusion method and system based on message flow division and combination.
Background
In recent years, more and more enterprises and the like use business expansion as an entrance, and the original industrial boundary is broken through by cross-industry, cross-organization, cross-value chain and the like to develop deep integration and mode innovation of business, so that multi-dimensional, high-quality and high-value service is provided for users, and cross-boundary service is developed at the same time. However, in this process, not only multi-level integration of information, data, flow, service, etc. but also deep fusion between them needs to be realized, and cross-border fusion is also receiving more and more attention.
The cross-border is a process of expanding or upgrading new services by enterprises, organizations and other organizations to realize service value increment or service innovation. Changes in enterprise value goals or strategic goals, etc., mean elimination, addition, or innovation of related elements such as business processes or services. The cross-boundary service is an important innovation way for the development of the modern service industry, which carries out deep fusion and mode innovation on services crossing boundaries of different industries, organizations, value chains and the like, provides multi-dimensional, high-quality and value-rich good services for users and is an important innovation way for the development of the modern service industry. The cross-boundary fusion is a way to realize the value target and the enterprise target of the multi-party interest correlators by breaking the boundary redistribution, combination and use of data, information, resources and the like of the original enterprises, industries, fields and the like in the cross-boundary service scene. Taking the Alibara as an example, the enterprise group realizes business expansion by investing an existing platform or establishing a new platform, develops service clusters related to multiple fields such as catering, education, tourism, media and the like from the original electronic commerce, interconnects and intercommunicates service resources, and the Alibara development embodies a typical cross-boundary service fusion process.
Different from other mature business management and service computing fields, the cross-boundary service fusion is still a new research subject in the modern service industry field, the cross-boundary fusion research developed for the cross-boundary service fusion is still in an exploration stage, and a mature cross-boundary fusion theory does not appear. An important component of the cross-border service fusion is the fusion of a Business Process level, in the field of traditional Business Process management, some works related to Business Process Model (Business Process Model) combination exist, and especially the reuse of the Process Model can provide partial reference for a Business Process fusion theory.
In the business process reuse research, partial work starts from the decomposition angle of process fragments and tries to break the original structure boundary. Vanhatalo et al proposed the concept of Single-in Single-out (SESE) fragments in the analysis of traffic flow control flows.
Figure BDA0002445355740000021
Indra et al propose a method for decomposing a business Process using an optimized Process Structure Tree (RPST) that can easily reconstruct an analysis Process by decomposing the business Process diagram into smaller parts, L a Rosa et al solve the problem of merging business Process models by identifying and sharing common business Process segments.
The method comprises the steps that a control flow can capture an internal execution sequence in a business flow, and a gateway is used for controlling a routing structure of the control flow, therefore, in order to realize the reuse of business flow segments, some researchers adopt a method for reconstructing the control flow, K ü ster and the like pay attention to control flow analysis and provide a solution for constructing a flow structure tree based on SESE.
The inventor of the present application finds that the method of the prior art has at least the following technical problems in the process of implementing the present invention:
the existing business process fusion method mainly performs research on aspects such as process fragment decomposition, process structure reconstruction, process similarity comparison and the like. These works usually find the mapping relationship of the process segments on the structure of the business process model, and the main purpose of these works is to solve the reuse problem in the management of the business process model version. However, in a cross-border service fusion scenario, interaction between different stakeholders in multiple organizations or software platforms is often involved, so that existing approaches tend to have difficulty balancing the complex goals of cross-border service fusion.
Therefore, the method in the prior art has the technical problem that the integration of the cross-border service flow cannot be realized.
Disclosure of Invention
The invention provides a method and a system for fusing a cross-boundary service flow based on message flow division and combination, which are used for solving or at least partially solving the technical problem that the method in the prior art cannot realize the fusion of the cross-boundary service flow.
In order to solve the above technical problem, a first aspect of the present invention provides a method for merging service flows across boundaries based on message flow partitioning and merging, including:
s1: acquiring a service flow to be fused, and performing message flow marking on the service flow to be fused, wherein the service flow to be fused comprises a flow object, and dividing the service flow into sub-flow segments according to the role of the flow object and the message flow marking result, wherein the sub-flow segments are flow sets executed by the same role;
s2: taking the sub-process segments with the same roles or the same associated roles as a segment pair to be fused, carrying out similarity calculation, and determining a fusible segment pair according to the similarity calculation result of the segment pair to be fused, wherein the fusible segment pair comprises two fusible sub-process segments, and each fusible sub-process segment comprises an active node;
s3: performing fragment fusion on the pair of fusible fragments according to the mapping relation between the active nodes;
s4: and integrating the merged sub-process segments to realize the merging of the business processes.
Based on the same inventive concept, a second aspect of the present invention provides a system for merging cross-border service flows based on message stream partitioning and merging, comprising:
the sub-process segment dividing module is used for acquiring the service process to be fused and carrying out message flow marking on the service process to be fused, wherein the service process to be fused comprises a flow object, the service process is divided into sub-process segments according to the role of the flow object and the message flow marking result, and the sub-process segments are process sets executed by the same role;
the fusion-enabled segment pair determining module is used for taking the sub-process segments with the same roles or the same associated roles as the segment pairs to be fused, carrying out similarity calculation, and determining a fusion-enabled segment pair according to the similarity calculation result of the segment pairs to be fused, wherein the fusion-enabled segment pair comprises two fusion-enabled sub-process segments, and each fusion-enabled sub-process segment comprises an active node;
the sub-process segment merging module is used for performing segment fusion on the fusible segment pairs according to the mapping relation between the active nodes;
and the integration module is used for integrating the merged sub-process segments to realize the merging of the business processes.
Based on the same inventive concept, a third aspect of the present invention provides a computer-readable storage medium having stored thereon a computer program which, when executed, performs the method of the first aspect.
Based on the same inventive concept, a fourth aspect of the present invention provides a computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the method of the first aspect when executing the program.
One or more technical solutions in the embodiments of the present application have at least one or more of the following technical effects:
the invention can divide the whole business flow into sub-flow segments according to the labeling result of the message flow, then takes the sub-flow segments with the same role or the same associated role as the segment pairs to be fused, obtains the fusible segment pairs after measuring the similarity, and fuses the fusible segment pairs according to the mapping relation between the active nodes, can realize the automatic fusion of the multi-field business flow chart under the cross-boundary service scene by the methods of flow segment decomposition, flow fusion and the like under the constraint condition of considering the role, the value, the target and the like of the cross-boundary fusion scene, helps enterprises or software systems and the like to complete the expansion of other fields of business or generalize and expand the field of business to other fields, and has good practicability.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to these drawings without creative efforts.
FIG. 1 is a general framework diagram of a cross-border service flow fusion method based on message flow division and merging according to the present invention;
FIG. 2 is a message flow annotation result of a business flow chart of a pig in an embodiment of the present invention;
FIG. 3 is a result of message flow annotation of a business flow diagram for insurance in an embodiment of the present invention;
FIG. 4 shows the segmentation and target labeling results of the business flow chart of the pig in the embodiment of the present invention;
FIG. 5 illustrates the segmentation and target labeling results of the insurance business process flow graph in an embodiment of the present invention;
FIG. 6 shows the expansion result of the fragment before fusion of the sub-flow fragment "s 2-fz" of the pig and the sub-flow fragment "s 4-bx" of insurance in the embodiment of the present invention;
FIG. 7 shows the segment expansion results of the fused sub-flow segment "s 2-fz" and the insurance sub-flow segment "s 4-bx" of the flying pig according to the embodiment of the present invention;
FIG. 8 shows the segment expansion result before the fusion of the sub-flow segment "ss 1-fz" of the flying pig and the sub-flow segment "sm 1-bx" of insurance in the embodiment of the present invention;
FIG. 9 shows the unfolding result of the fused sub-process fragment "ss 1-fz" and insurance sub-process fragment "sm 1-bx" of the pig under the embodiment of the present invention, using the inserted fusion rule;
FIG. 10 is a flow chart of a business of a pig and insurance of an embodiment of the present invention, where a sub-process segment fusion result is obtained according to a sub-process segment association matrix;
FIG. 11 is a flow chart of the operation of the pig and insurance system according to the present invention, and the integration result is obtained according to the parallel integration rule;
FIG. 12 is a flow chart of operations of the pig and insurance of the present invention with respect to the integration results obtained from the serial integration rules;
fig. 13 is a final business flow chart fusion result of the pig and insurance of the embodiment of the present invention.
Detailed Description
The invention mainly solves the problems of the business process fusion technology, provides a cross-boundary service process fusion method based on message flow division and combination, and can realize the automatic fusion of multi-field business process diagrams under a cross-boundary service scene, thereby helping enterprises or software systems and the like to complete the expansion of other fields of business or generalize and expand the field of business to other fields, and having good practicability.
In order to achieve the above object, the main concept of the present invention is as follows:
firstly, marking message flow to a service flow chart, and dividing the message flow into sub-flow segments; then, calculating according to the similarity to obtain a sub-process segment similarity matrix, and determining a pair of fusible segments; then, fusing the pair of fusible segments by adopting a corresponding fusion rule; and finally, integrating all the sub-process fragments after fusion according to the fragment integration rule so as to obtain the service flow chart after fusion.
The invention has the beneficial effects that: under the constraint conditions of the role, value, target and the like of a cross-border fusion scene, the automatic fusion of the multi-field business flow chart in the cross-border service scene can be realized by methods such as flow fragment decomposition, flow fusion rules and the like, the enterprise or a software system and the like are helped to complete the expansion of other field businesses or generalize and expand the field businesses to other fields, and the method has good practicability.
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Example one
The embodiment provides a cross-boundary service flow fusion method based on message flow division and combination, which comprises the following steps:
s1: acquiring a service flow to be fused, and performing message flow marking on the service flow to be fused, wherein the service flow to be fused comprises a flow object, and dividing the service flow into sub-flow segments according to the role of the flow object and the message flow marking result, wherein the sub-flow segments are flow sets executed by the same role;
s2: taking the sub-process segments with the same roles or the same associated roles as a segment pair to be fused, carrying out similarity calculation, and determining a fusible segment pair according to the similarity calculation result of the segment pair to be fused, wherein the fusible segment pair comprises two fusible sub-process segments, and each fusible sub-process segment comprises an active node;
s3: performing fragment fusion on the pair of fusible fragments according to the mapping relation between the active nodes;
s4: and integrating the merged sub-process segments to realize the merging of the business processes.
Specifically, the business process to be merged in S1 is shown in the form of a flowchart, and the stream object may be an event, an activity, or a gateway. An active node may also be considered a stream object.
Referring to fig. 1, an overall framework diagram of a method for a cross-border service flow fusion based on message flow division and merging provided by the present invention is shown, and the method includes firstly constructing a business flow chart, dividing the business flow chart into sub-flow segments through message flow labeling, then determining a pair of fusible segments, then performing segment fusion, and finally performing segment integration.
Fig. 2 is a result of labeling a message flow of a service flow chart of a pig in an embodiment of the present invention, where the result of labeling includes insurance request information, risk type selection information, and the like, and fig. 3 is a result of labeling a message flow of a service flow chart of an insurance in an embodiment of the present invention, where the result of labeling includes hotel selection information, payment request information, payment completion information, and the like.
In one embodiment, S1 specifically includes:
s1.1: acquiring a service flow to be fused, and carrying out message flow marking on the service flow to be fused to obtain a marking result;
s1.2: and dividing the service flow into sub-flow segments according to the role of the flow object in the service flow to be fused and the message flow marking result, wherein the flow object is a node of the service flow, the node comprises a role to which the role belongs and an associated role, the role to which the role belongs represents the role by which the activity is executed, and the associated role represents the role with which the role of the node has direct message flow interaction.
Specifically, service flow fusion in a cross-boundary scenario often involves the recombination of message flows and sequence flows between multiple roles, i.e., between the inside and the outside of multiple parties to be fused, so as to accomplish the same cross-boundary fusion objective and value expectation. The information and direction of the message flow are determined, which is very important to design the scheme of the service flow after the fusion is obtained. On the basis of S1.1, the sub-process segments are divided according to the belonged roles of the stream objects and the labeling results of the message streams, different types of sub-process segments are obtained, and the cross-boundary fusion targets are labeled after the segments are divided.
Please refer to fig. 4 and fig. 5, which respectively show the segmentation and target labeling results of the business flow chart of the pig, and the segmentation and target labeling results of the business flow chart of the insurance. Taking fig. 4 as an example, sub-process segments divided by the positions S1-fz, S2-fz and S3-fz indicate target labeling results such as hotel reservation, order processing and payment.
In a specific implementation process, five types of flow segments are defined, and related concepts are as follows:
definitions 1. active node (Activitynode)
Activity (SR, AR, G, Des, PreN, PosN) is the active node. Wherein
Wherein SR is the role to which the activity belongs, AR is the associated role with which the activity belongs and which has direct message flow interaction, G is the target to be achieved by the activity, Des is the detailed description of the activity, PreN refers to the front node of the activity, and PosN refers to the back node of the activity.
Definitions 2. sub-Process fragment (SPF)
A business process model can be decomposed into a plurality of sub-process segments according to a process dividing rule, wherein each sub-process segment is a process set executed by the same role and is single-input and single-output, a source node and an output node of each sub-process segment are connected with other sub-process segments through message flows, and only sequential flows exist in the sub-process segments, and no message flows exist in the sub-process segments.
SPF ═ N, E, SR, AR, G, PreF, PosF, where N is the set of nodes in the SPF, E is the set of edges in the SPF (i.e., sequential flow), SR is the role to which the SPF depends, AR is the associated role with the SPF with direct message flow connections, G refers to the target that SR wants to accomplish by executing the SPF, PreF refers to the pre-segment with message flow input to the current SPF, and PosF is the segment with message flow output by the current SPF.
Each flow object (including events, activities, and gateways) is considered a node of the traffic flow graph, and nodes in the SPF may be divided into "source nodes", "intermediate nodes", and "output nodes". Where reference is made to a node in the SPF segment having only outputs with no inputs, an "intermediate node" refers to a node in the segment having both inputs and outputs, and an "output node" refers to a node in the segment having only inputs with no outputs.
Referring to the fragment partitioning method in the existing literature, the present invention defines five fragment types as shown in table 1:
TABLE 1 sub-Process fragment type partitioning
Figure BDA0002445355740000071
Figure BDA0002445355740000081
In one embodiment, S2 specifically includes:
s2.1: taking the sub-process segments with the same roles or the same associated roles as the segment pairs to be fused, and putting the segment pairs into the candidate set of the segments to be fused;
s2.2: and performing similarity calculation on each segment pair to be fused in the segment candidate set to be fused to obtain the fusion similarity of the segment pair to be fused, and taking a group of segment pairs to be fused with the fusion similarity meeting the similarity threshold range as a fusible segment pair to be placed in the fusible segment pair set.
In a specific implementation process, for each sub-flow segment a in P1, traversing all sub-flow segments in P2 for the business flow diagrams P1 and P2 to be fused, if a sub-flow segment b with the same role as the associated role of a or the same role of the associated role of a is found in P2, placing W (a, b) as a group of segment pairs to be fused into a segment candidate set to be fused, and traversing all sub-flow segments in the business flow diagrams P1 and P2 to obtain a segment candidate set to be fused CFPSet.
S2.2, a set of fusible fragment pairs can be obtained. And performing similarity measurement on each group of fragments to be fused in the CFPSet to be fused to obtain the fusion similarity of the fragment pairs to be fused, regarding a group of fragments to be fused meeting the similarity threshold range, such as W (a, b), as a group of fusible fragment pairs M (a, b), and putting the fused fragment pairs into the MFPSet.
For example, determining a candidate set of fragments to be fused, using the following method:
given two business process flows P1 and P2, for each sub-process segment decomposed from P1 and P2, suppose there is a pair of sub-process segments (f)1,f2) Wherein f is1＝(N1,E1,SR1,AR1,G1,PreF1,PosF1)∈P1，f2＝(N2,E2,SR2,AR2,G2,PreF2,PosF2)∈P2If SR1＝SR2Or AR1＝AR2Then (f)1,f2) Can be regarded as a segment pair to be fused and is marked as W (f)1,f2)。
Acquiring pseudo codes of the segment pairs to be fused as follows:
Figure BDA0002445355740000091
wherein F1、F2For a given set of sub-flow segments of two business flow diagrams P1 and P2, f1SR is the role of the sub-process fragment, f1AR is the associated role of the sub-process segment, CFPSet is the candidate set of the segment to be fused, and all sub-process segment pairs capable of performing fusion calculation are recorded.
In one embodiment, the similarity calculation is performed on each to-be-fused segment pair in S2.2, specifically including:
s2.2.1: calculating grammar similarity of active nodes, dividing two active nodes into
activity1＝(SR1,AR1,G1,Des1,PreN1,PosN1)∈f1And
activity2＝(SR2,AR2,G2,Des2,PreN2,PosN2)∈f2the grammar similarity of each active node is the description activity of the active node1.Des1And activity2.Des2The calculation formula of the grammar similarity is as follows:
Figure BDA0002445355740000092
among them, SynSim (Des)1,Des2) Representing the syntactic similarity of active nodes, ed (Des)1,Des2) Represents Des1,Des2Editable distance between, if SynSim (Des)1,Des2)>α, there is a Map between active nodes1-1(activity1,activity2) Wherein α is a threshold;
s2.2.2: according to the grammar similarity of the active nodes, the message flow grammar similarity is calculated,
Figure BDA0002445355740000101
wherein, MessSim (f)1,f2) Indicating the similarity of the message stream syntax,
Figure BDA0002445355740000102
representing a sub-flow fragment f1,f2The input message stream annotation of (a) is,
Figure BDA0002445355740000103
in order to output a comment on the message stream,
Figure BDA0002445355740000104
the grammatical similarity of input message stream annotations representing message streams between sub-flow segments,
Figure BDA0002445355740000105
and representing the grammatical similarity of output message stream annotations for message streams between sub-flow segments.
S2.2.3: according to the grammar similarity and the active nodes of the message flow, the overall similarity of the sub-process segments is calculated as follows:
Figure BDA0002445355740000106
wherein, Sim (f)1,f2) Denotes the overall similarity, ω, of the sub-flow segments1And ω2Is a weight factor, and ω1+ω 21, | mappedactities | indicates the presence of Map1-1Active number of mapping relationships, Map1-1The mapping relation of (a) and (b) is a one-to-one corresponding relation of f1Node | and | f2Node | respectively refers to fragment f1And f2Number of active nodes of SynSim (G)1,G2) Finger target G1And G2The grammar similarity of (2);
fragment f in the pair of fragments to be fused1And f2The fusion similarity between them is finally calculated by formula (4):
Figure BDA0002445355740000107
wherein the content of the first and second substances,
Figure BDA0002445355740000108
and
Figure BDA0002445355740000109
is a weighting factor.
Specifically, given two sub-flow segments f1And f2The method comprises three steps of calculating the similarity of the activity grammar, calculating the semantic similarity of the message flow and calculating the similarity of the sub-process fragments to obtain the fusion similarity. The active grammar similarity can be calculated by the method of S2.2.1.
S2.2.2, the message flow may reflect to some extent the behavioral constraints in the business execution process, given the two sub-flow segments f1And f2Their message stream syntax similarity can be calculated by formula (2), formula syncim being used to calculate the syntax similarity.
S2.2.3, SynSim (G)1,G2) Finger target G1And G2Targeting the message stream syntax, the weighting factors can be set according to the situation, e.g.
Figure BDA0002445355740000111
Algorithm 2 embodies a detailed computational method to obtain the pair of fusible segments.
Figure BDA0002445355740000112
Given the screened candidate set of fragments to be fused CFPSet, for a set of pairs W (f) of fragments to be fused in CFPSeti,fj) Fragment f of (1)iWe find the fragment f with the greatest similarity to itnIf f isnAnd fiThe similarity of (f) is greater than a threshold value t (usually set to 0.7), and a pair of fusion-enabled fragments M (f) is obtainedi,fn). MFPSet is the resulting set of pairs of fusible fragments.
In one embodiment, S3 specifically includes:
s3.1: acquiring a mapping relation between active nodes in a middle flow segment of a fusible segment pair, wherein the mapping relation comprises a one-to-one correspondence relation;
s3.2: and if the mapping relation between the active nodes of the sub-process segments in the pair of fusible segments is in one-to-one correspondence, fusing the sub-process segments in the pair of fusible segments by adopting a merging rule, otherwise, fusing the sub-process segments in the pair of fusible segments by adopting an inserting rule.
Specifically, the Mapping relationship of the active nodes in the sub-flow segment is obtained. The active mapping relationship is specifically as follows: suppose two active nodes n1∈f1，n2∈f2In W (f)1，f2) In one-to-one correspondence, wherein f1Subject to the fusion body, f2Subject to the fusion object, then n1,n2∈Map1-1(f1,f2) I.e. the active nodes have a one-to-one correspondence, if node n1At f2If there is no corresponding node in the node, n1∈Map1-0(f1,f2). Similarly, if node n2At f1If there is no corresponding node in the node, n2∈Map0-1(f1,f2)。
In order to obtain Mapping relation of active nodes in the sub-process segment, an active grammar similarity calculation method in formula (1) is adopted. Given two active nodes activity1And activity2，Des1And Des2Are respectively the two activitiesAnd (4) describing the activity of the mobile node. When SynSim (Des)1,Des2)>α (usually, set the threshold α to 0.5), the label Des is considered to be1,Des2Belonging two activities1And activity2To each other, i.e. there is mapping relation Map1-1(activity1,activity2)。
In one embodiment, the fusible fragment includes a fused host and a fused guest for the neutron process fragment, and S3.2 specifically includes:
s3.2.1: when the mapping relation between the active nodes of the sub-process segments in the pair of fusible segments is in one-to-one correspondence, directly combining the two sub-process segments into one sub-process segment;
s3.2.1: otherwise, inserting the sub-process fragment as the fusion object into the sub-process fragment as the fusion subject.
In a specific implementation process, fusion of a pair of fusible fragments is performed according to a Mapping relationship of active nodes in a sub-process fragment, and two fusion rules are defined in a specific implementation manner as follows:
fusion rule 1 merge: given a set of fusible fragment pairs M (f)1,f2) Wherein f is1From the fusion partner. f. of2Subject to the fusion object, when f1,f2When the active Mapping relationship exists, the two sub-flow segments are considered to be in parallel relationship, and similar and same-level functions are executed. The two sub-flow segments can be directly merged into one sub-flow segment. At the time of merging, suppose node n1∈f1Node n2∈f2And n is1,n2∈Map1-1(n1,n2) Then we are at n1And n2Get n1Simultaneously adding n2Replacing front node of rear node with n1，n2Replacing the rear node of the front node with n1And n is1Set of nodes for putting fusion results
Figure BDA0002445355740000122
If n is1,n2∈Map1-0(n1,n2) N is to be1Set of nodes for putting fusion results
Figure BDA0002445355740000123
If n is1,n2∈Map0-1(n1,n2) N is to be2Node set NF with fusion resultf1,f2. Finally, the fusion results of all the pair of fusible fragments are put into the fused fragment Set FSCSet (fragment Set after the conversion).
The merging algorithm is as follows:
Figure BDA0002445355740000121
Figure BDA0002445355740000131
wherein Ei(*,nn) Set of finger edges EiAll of which are connected with a node nnFSCSet is the result of fusing sub-flow segment pairs as edges of the receiving node.
Fusion rule 2 insertion: given a set of fusible fragment pairs M (f)1,f2) Wherein f is1From the fusion partner. f. of2When the fusion object is subordinate to, and no active Mapping relation exists in the pair of the fusible fragments, the two sub-process fragments are considered to belong to the inclusion relation, namely, the fragment f subordinate to the fusion object1Containing fragments f subordinate to the fusion object2So that the fragment f can be directly inserted2Insert into fragment f1In the appropriate location. At this time, the segment f1And f2All the nodes in (1) are put into the node set of the fusion result.
In one embodiment, S4 specifically includes:
s4.1: constructing an incidence matrix among the sub-process segments aiming at the fused sub-process segments, wherein the incidence matrix is used for expressing the transfer relation of the message flow among the sub-process segments, and if the process segment f isiIs provided with aBar pointing flow segment fjThe corresponding f-th message in the matrixiLine fjThe column cell has a value of 1, otherwise the value is 0;
s4.2: integrating the sub-process segments into a service flow chart with a segment granularity by adopting two methods of parallel integration and serial integration according to the incidence matrix among the sub-process segments;
s4.3: and expanding the sub-process segments in the service flow chart obtained in the S4.2 to obtain a final service flow chart fusion result.
Specifically, the rule for constructing the sub-process segment association matrix is as follows: if flow segment fiWith a pointing flow segment fjThe f-th message is put in the matrixiLine fjThe column cell is labeled 1, otherwise labeled 0. As shown in Table 2, wherein f1Line f3The column is labeled "1" to indicate f1Having a direction f3The message stream of (2).
TABLE 2 subflow fragment relationship matrix
Start f1 f2 f3 END
Start 0 1 1 0 0
f1 0 0 0 1 0
f2 0 0 0 1 0
f3 0 0 0 0 1
END 0 0 0 0 0
The following is a specific embodiment of applying the method of the invention to perform the integration of the cross-boundary service flow based on message flow division and combination, taking a case that a travel platform 'flying pig' performs cross-boundary to the insurance field on the basis of keeping the original hotel reservation service as an embodiment, and combining with the attached drawings, the implementation process of the invention is described in detail.
Firstly, step 1 is executed, a business flow chart of the booking of the pig platform hotel and a business flow chart of the traditional insurance are respectively constructed, and the message flow is labeled, wherein the labeling result is shown in fig. 2 and fig. 3.
Then, the segmentation is performed according to the segmentation rule in step 1.2. The segmentation result of the business process diagram for hotel booking on the pig platform is shown in fig. 4, and the segmentation result of the insurance business process diagram is shown in fig. 5.
Then, step 2 is executed to determine the fusible segment pairs, and the fusible segment pair similarity is obtained, and the result is shown in table 3.
TABLE 3 fusibility fragment pair similarity
Figure BDA0002445355740000141
Figure BDA0002445355740000151
And then, executing step 3, and fusing the pair of fusible fragments by adopting a fusion method. We propose two fusion rules, the "merge" and the "insert", in which the "m-s 1" fragment is obtained from the fragments "s 2-fz" and "s 4-bx" using the merged fusion rule, as shown in FIG. 6 before fusion, and as shown in FIG. 7; the "m-ss 1" fragment was obtained from fragments "ss 1-fz" and "sm 1-bx" using the rule of fusion inserted, as shown in FIG. 8 before fusion, and as shown in FIG. 9.
Finally, executing step 4 to integrate the sub-process segments;
firstly, a sub-process segment incidence matrix is constructed, and table 4 shows the sub-process segment incidence matrix of the flying pig hotel reservation and the traditional insurance business process chart.
TABLE 4 sub-process fragment correlation matrix
Figure BDA0002445355740000152
Then, a sub-process fragment fusion result obtained according to the sub-process fragment correlation matrix is shown in fig. 10, and then the sub-process fragments are integrated into a service flow chart with a fragment granularity by adopting two methods of parallel integration and serial integration. The result of parallel integration is shown in fig. 11, and the result of serial integration is shown in fig. 12.
Finally, the sub-process segments are expanded by adopting a serial integration method, and the final service process fusion result is obtained as shown in fig. 13.
Example two
Based on the same inventive concept, the embodiment provides a system for fusing a cross-border service flow based on message flow division and merging, which comprises:
the sub-process segment dividing module is used for acquiring the service process to be fused and carrying out message flow marking on the service process to be fused, wherein the service process to be fused comprises a flow object, the service process is divided into sub-process segments according to the role of the flow object and the message flow marking result, and the sub-process segments are process sets executed by the same role;
the fusion-enabled segment pair determining module is used for taking the sub-process segments with the same roles or the same associated roles as the segment pairs to be fused, carrying out similarity calculation, and determining a fusion-enabled segment pair according to the similarity calculation result of the segment pairs to be fused, wherein the fusion-enabled segment pair comprises two fusion-enabled sub-process segments, and each fusion-enabled sub-process segment comprises an active node;
the sub-process segment merging module is used for performing segment fusion on the fusible segment pairs according to the mapping relation between the active nodes;
and the integration module is used for integrating the merged sub-process segments to realize the merging of the business processes.
Since the system described in the second embodiment of the present invention is a device used for implementing the method for merging message streams into a cross-border service flow, the specific structure and the deformation of the system can be known by those skilled in the art based on the method described in the first embodiment of the present invention, and thus the details are not described herein again. All systems adopted by the method of the first embodiment of the present invention are within the intended protection scope of the present invention.
EXAMPLE III
Based on the same inventive concept, the present application also provides a computer-readable storage medium, on which a computer program is stored, which when executed, implements the method as described in the first embodiment.
Since the computer-readable storage medium introduced in the third embodiment of the present invention is a computer-readable storage medium used for implementing the method for merging the cross-border service flows based on message stream partitioning and merging in the first embodiment of the present invention, based on the method introduced in the first embodiment of the present invention, persons skilled in the art can understand the specific structure and deformation of the computer-readable storage medium, and thus details are not described here. Any computer readable storage medium used in the method of the first embodiment of the present invention is within the scope of the present invention.
Example four
Based on the same inventive concept, the present application further provides a computer device, which includes a storage, a processor, and a computer program stored on the storage and running on the processor, and when the processor executes the computer program, the method in the first embodiment is implemented.
Since the computer device introduced in the fourth embodiment of the present invention is a computer device used for implementing the cross-border service flow fusion method for dividing and merging message streams in the first embodiment of the present invention, based on the method introduced in the first embodiment of the present invention, those skilled in the art can understand the specific structure and deformation of the computer device, and thus details are not described herein. All the computer devices used in the method in the first embodiment of the present invention are within the scope of the present invention.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
While preferred embodiments of the present invention have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all such alterations and modifications as fall within the scope of the invention.
It will be apparent to those skilled in the art that various modifications and variations can be made in the embodiments of the present invention without departing from the spirit or scope of the embodiments of the invention. Thus, if such modifications and variations of the embodiments of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to encompass such modifications and variations.

Claims (10)

1. A cross-boundary service flow fusion method based on message flow division and combination is characterized by comprising the following steps:
s1: acquiring a service flow to be fused, and performing message flow marking on the service flow to be fused, wherein the service flow to be fused comprises a flow object, and dividing the service flow into sub-flow segments according to the role of the flow object and the message flow marking result, wherein the sub-flow segments are flow sets executed by the same role;
s2: taking the sub-process segments with the same roles or the same associated roles as a segment pair to be fused, carrying out similarity calculation, and determining a fusible segment pair according to the similarity calculation result of the segment pair to be fused, wherein the fusible segment pair comprises two fusible sub-process segments, and each fusible sub-process segment comprises an active node;
s3: performing fragment fusion on the pair of fusible fragments according to the mapping relation between the active nodes;
s4: and integrating the merged sub-process segments to realize the merging of the business processes.
2. The method of claim 1, wherein S1 specifically comprises:
s1.1: acquiring a service flow to be fused, and carrying out message flow marking on the service flow to be fused to obtain a marking result;
s1.2: and dividing the service flow into sub-flow segments according to the role of the flow object in the service flow to be fused and the message flow marking result, wherein the flow object is a node of the service flow, the node comprises a role to which the role belongs and an associated role, the role to which the role belongs represents the role by which the activity is executed, and the associated role represents the role with which the role of the node has direct message flow interaction.
3. The method of claim 1, wherein S2 specifically comprises:
s2.1: taking the sub-process segments with the same roles or the same associated roles as the segment pairs to be fused, and putting the segment pairs into the candidate set of the segments to be fused;
s2.2: and performing similarity calculation on each segment pair to be fused in the segment candidate set to be fused to obtain the fusion similarity of the segment pair to be fused, and taking a group of segment pairs to be fused with the fusion similarity meeting the similarity threshold range as a fusible segment pair to be placed in the fusible segment pair set.
4. The method of claim 1, wherein S3 specifically comprises:
s3.1: acquiring a mapping relation between active nodes in a middle flow segment of a fusible segment pair, wherein the mapping relation comprises a one-to-one correspondence relation;
s3.2: and if the mapping relation between the active nodes of the sub-process segments in the pair of fusible segments is in one-to-one correspondence, fusing the sub-process segments in the pair of fusible segments by adopting a merging rule, otherwise, fusing the sub-process segments in the pair of fusible segments by adopting an inserting rule.
5. The method of claim 4, wherein the fusible fragment comprises a fusion subject and a fusion guest for the neutron process fragment, and S3.2 specifically comprises:
s3.2.1: when the mapping relation between the active nodes of the sub-process segments in the pair of fusible segments is in one-to-one correspondence, directly combining the two sub-process segments into one sub-process segment;
s3.2.1: otherwise, inserting the sub-process fragment as the fusion object into the sub-process fragment as the fusion subject.
6. The method of claim 1, wherein S4 specifically comprises:
s4.1: constructing an incidence matrix among the sub-process segments aiming at the fused sub-process segments, wherein the incidence matrix is used for expressing the transfer relation of the message flow among the sub-process segments, and if the process segment f isiWith a pointing flow segment fjThe corresponding f-th message in the matrixiLine fjThe column cell has a value of 1, otherwise the value is 0;
s4.2: integrating the sub-process segments into a service flow chart with a segment granularity by adopting two methods of parallel integration and serial integration according to the incidence matrix among the sub-process segments;
s4.3: and expanding the sub-process segments in the service flow chart obtained in the S4.2 to obtain a final service flow chart fusion result.
7. The method according to claim 3, wherein the similarity calculation for each pair of to-be-fused segments in S2.2 specifically comprises:
s2.2.1: calculating grammar similarity of active nodes, dividing two active nodes into
activity1＝(SR1,AR1,G1,Des1,PreN1,PosN1)∈f1And
activity2＝(SR2,AR2,G2,Des2,PreN2,PosN2)∈f2the grammar similarity of each active node is the description activity of the active node1.Des1And activity2.Des2The calculation formula of the grammar similarity is as follows:
Figure FDA0002445355730000021
among them, SynSim (Des)1,Des2) Representing the syntactic similarity of active nodes, ed (Des)1,Des2) Represents Des1,Des2Editable distance between, if SynSim (Des)1,Des2)>α, there is a Map between active nodes1-1(activity1,activity2) Wherein α is a threshold;
s2.2.2: according to the grammar similarity of the active nodes, the message flow grammar similarity is calculated,
Figure FDA0002445355730000022
wherein, MessSim (f)1,f2) Indicating the similarity of the message stream syntax,
Figure FDA0002445355730000023
representing a sub-flow fragment f1,f2The input message stream annotation of (a) is,
Figure FDA0002445355730000031
in order to output a comment on the message stream,
Figure FDA0002445355730000032
the grammatical similarity of input message stream annotations representing message streams between sub-flow segments,
Figure FDA0002445355730000033
and representing the grammatical similarity of output message stream annotations for message streams between sub-flow segments.
S2.2.3: according to the grammar similarity and the active nodes of the message flow, the overall similarity of the sub-process segments is calculated as follows:
Figure FDA0002445355730000034
wherein, Sim (f)1,f2) Denotes the overall similarity, ω, of the sub-flow segments1And ω2Is a weight factor, and ω1+ω21, | mappedactities | indicates the presence of Map1-1Active number of mapping relationships, Map1-1The mapping relation of (a) and (b) is a one-to-one corresponding relation of f1Node | and | f2Node | respectively refers to fragment f1And f2Number of active nodes of SynSim (G)1,G2) Finger target G1And G2The grammar similarity of (2);
fragment f in the pair of fragments to be fused1And f2The fusion similarity between them is finally calculated by formula (4):
Figure FDA0002445355730000035
wherein the content of the first and second substances,
Figure FDA0002445355730000036
and
Figure FDA0002445355730000037
is a weighting factor.
8. A cross-border service flow fusion system based on message flow division and combination is characterized by comprising the following steps:
the sub-process segment dividing module is used for acquiring the service process to be fused and carrying out message flow marking on the service process to be fused, wherein the service process to be fused comprises a flow object, the service process is divided into sub-process segments according to the role of the flow object and the message flow marking result, and the sub-process segments are process sets executed by the same role;
the fusion-enabled segment pair determining module is used for taking the sub-process segments with the same roles or the same associated roles as the segment pairs to be fused, carrying out similarity calculation, and determining a fusion-enabled segment pair according to the similarity calculation result of the segment pairs to be fused, wherein the fusion-enabled segment pair comprises two fusion-enabled sub-process segments, and each fusion-enabled sub-process segment comprises an active node;
the sub-process segment merging module is used for performing segment fusion on the fusible segment pairs according to the mapping relation between the active nodes;
and the integration module is used for integrating the merged sub-process segments to realize the merging of the business processes.
9. A computer-readable storage medium, on which a computer program is stored, characterized in that the program, when executed, implements the method of any one of claims 1 to 7.
10. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the method according to any of claims 1 to 7 when executing the program.
CN202010277500.5A 2020-04-10 2020-04-10 Cross-border service flow fusion method and system based on message flow division and combination Active CN111461566B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010277500.5A CN111461566B (en) 2020-04-10 2020-04-10 Cross-border service flow fusion method and system based on message flow division and combination

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010277500.5A CN111461566B (en) 2020-04-10 2020-04-10 Cross-border service flow fusion method and system based on message flow division and combination

Publications (2)

Publication Number Publication Date
CN111461566A true CN111461566A (en) 2020-07-28
CN111461566B CN111461566B (en) 2023-02-03

Family

ID=71683657

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010277500.5A Active CN111461566B (en) 2020-04-10 2020-04-10 Cross-border service flow fusion method and system based on message flow division and combination

Country Status (1)

Country Link
CN (1) CN111461566B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113344526A (en) * 2021-06-04 2021-09-03 浙江大学 Reference service flow under service network environment and construction method and application method thereof
CN113361232A (en) * 2021-05-14 2021-09-07 武汉大学 Cross-boundary service target fusion conflict detection method and device
CN114462900A (en) * 2022-04-13 2022-05-10 云智慧（北京）科技有限公司 Method, device and equipment for splitting service active node
CN115147096A (en) * 2022-09-06 2022-10-04 京华信息科技股份有限公司 OCR-based flow rapid modeling method and system

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090327106A1 (en) * 2008-06-26 2009-12-31 Joerg Bartelt Managing consistent interfaces for financial instrument business objects across heterogeneous systems
CN106651317A (en) * 2016-12-28 2017-05-10 浙江省公众信息产业有限公司 Method and device for judging business process correlation
CN107273913A (en) * 2017-05-11 2017-10-20 武汉理工大学 A kind of short text similarity calculating method based on multi-feature fusion
CN110287438A (en) * 2019-06-19 2019-09-27 天津大学 A kind of service convergence method transboundary based on micro services framework

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090327106A1 (en) * 2008-06-26 2009-12-31 Joerg Bartelt Managing consistent interfaces for financial instrument business objects across heterogeneous systems
CN106651317A (en) * 2016-12-28 2017-05-10 浙江省公众信息产业有限公司 Method and device for judging business process correlation
CN107273913A (en) * 2017-05-11 2017-10-20 武汉理工大学 A kind of short text similarity calculating method based on multi-feature fusion
CN110287438A (en) * 2019-06-19 2019-09-27 天津大学 A kind of service convergence method transboundary based on micro services framework

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113361232A (en) * 2021-05-14 2021-09-07 武汉大学 Cross-boundary service target fusion conflict detection method and device
CN113361232B (en) * 2021-05-14 2023-11-28 武汉大学 Cross-border service target fusion conflict detection method and device
CN113344526A (en) * 2021-06-04 2021-09-03 浙江大学 Reference service flow under service network environment and construction method and application method thereof
CN114462900A (en) * 2022-04-13 2022-05-10 云智慧（北京）科技有限公司 Method, device and equipment for splitting service active node
CN114462900B (en) * 2022-04-13 2022-07-29 云智慧（北京）科技有限公司 Method, device and equipment for splitting service active node
CN115147096A (en) * 2022-09-06 2022-10-04 京华信息科技股份有限公司 OCR-based flow rapid modeling method and system

Also Published As

Publication number Publication date
CN111461566B (en) 2023-02-03

Similar Documents

Publication Publication Date Title
CN111461566B (en) Cross-border service flow fusion method and system based on message flow division and combination
Bortolussi et al. CARMA: collective adaptive resource-sharing Markovian agents
CN111383005B (en) Digital currency flow direction tracking method and device
CN1866206A (en) Generating performance tests from UML specifications using Markov chains
CN111145076A (en) Data parallelization processing method, system, equipment and storage medium
Korpela et al. Digital business ecosystem transformation--towards cloud integration
US8453127B2 (en) Systems and methods providing a token synchronization gateway for a graph-based business process model
CN110363407A (en) Risk of fraud appraisal procedure and device based on user behavior track
Iqbal et al. Statistical model checking of relief supply location and distribution in natural disaster management
CN110780879A (en) Decision execution method, device, equipment and medium based on intelligent compiling technology
Mucchi et al. Blockchain technologies for museum management. The case of the loan of cultural objects
CN111160638A (en) Conversion estimation method and device
CN109614263A (en) A kind of disaster tolerance data processing method, apparatus and system
Zaman et al. Prefix imputation of orphan events in event stream processing
Popovic et al. Formal verification of distributed transaction management in a SOA based control system
Shan et al. A process convergence approach for crossover services based on message flow partition and merging
CN106970795A (en) A kind of information interacting method and system
CN113392164B (en) Method for constructing longitudinal federal tree, main server, service platform and system
Lillehagen et al. Enterprise Architectures–Survey of Practices and Initiatives
CN114519445A (en) Prediction method and device of service interaction network
Shirowzhan et al. Spatial big data, BIM and advanced GIS for smart transformation: city, infrastructure and construction
CN110781313A (en) Graph storage optimization method and device and electronic equipment
Martelli et al. Using value network analysis to support data driven decision making in urban planning
KR101697992B1 (en) System and Method for Recommending Bug Fixing Developers based on Multi-Developer Network
Kalenkova An algorithm of automatic workflow optimization

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