Cross-organization emergency processing process discovery method based on message process tree

Abstract

The invention relates to a cross-organization emergency processing process discovery method based on a message process tree, and belongs to the field of process mining, and the method comprises the following steps: S1, obtaining an event log of a cross-organization emergency processing process; s2, dividing event logs of a cross-organization emergency processing process and obtaining message nodes; s3, constructing a message process tree of each organization in a cross-organization emergency processing process; s4, constructing a cross-organization message process tree corresponding to the cross-organization emergency processing process; and S5, reconstructing a cross-organization message process tree corresponding to the cross-organization emergency processing process. According to the method, the organizational information and message transmission mode in the cross-organizational emergency processing process is discovered, the structure of the constructed process model is ensured to be sound, modeling of the cross-organizational emergency processing process is realized, and support is provided for emergency processing decisions.

Description

Technical Field

[0001] The present invention belongs to the field of process mining and relates to a method for discovering cross-organizational emergency handling processes based on message process trees. Background Art

[0002] Cross-organizational emergency handling processes usually involve multiple organizations, each with its specific emergency handling process, and at the same time need to achieve the overall emergency response goal through collaboration modes such as message passing. This collaboration mode has become the norm in the emergency handling process. The methods for constructing cross-organizational emergency handling process models include process discovery methods and process discovery methods specifically for cross-organizational emergency scenarios. The existing process discovery methods mainly focus on the emergency processes within a single organization or the global processes of cross-organizational emergency handling, mainly focusing on process modeling at the control flow level, but unable to effectively capture collaboration modes between organizations such as message passing. Although the existing cross-organizational emergency handling process discovery methods can identify process models containing emergency organization information and message passing patterns, most of these models are based on Petri nets. Although Petri nets have powerful formal expression capabilities in process modeling, in complex emergency handling scenarios, it is difficult to ensure the soundness of the process model.

[0003] Therefore, there is a need for a process discovery method that can both discover organization information and message passing patterns in cross-organizational emergency handling processes and ensure the soundness of the discovered process model structure, so as to comprehensively restore the collaboration logic in cross-organizational emergency handling processes and provide reliable data support and model basis for subsequent process analysis, optimization decision-making, and emergency command and coordination. Summary of the Invention

[0004] Aiming at the problem that the above process discovery method is difficult to effectively capture emergency organization information and message passing patterns and ensure the soundness of the discovered process model, the present invention provides a method for discovering cross-organizational emergency handling processes based on message process trees, including the following steps:

[0005] S1: Obtain the event log related to the emergency handling process in the cross-organizational business process management system, and perform unified format conversion and preprocessing on the event log;

[0006] S2: Divide the event log of the cross-organizational emergency handling process and obtain message nodes. Divide the cross-organizational event log according to the organizational dimension to generate the event log corresponding to each emergency organization; at the same time, obtain message information from the emergency events for creating message nodes;

[0007] S3: Construct the message process tree of each organization in the cross-organizational emergency handling process. Conduct process discovery on the event logs of each emergency organization to obtain the process tree, and add the relevant message nodes to the process tree to form the message process tree of this organization;

[0008] S4: Construct the cross-organizational message process tree corresponding to the cross-organizational emergency handling process. By analyzing the message interaction behaviors in the message process trees of each emergency organization, match and connect the relevant message nodes to obtain the common message nodes, and at the same time construct a complete cross-organizational message process tree to present the collaboration mechanism in the cross-organizational emergency handling process;

[0009] S5: Reconstruct the cross-organizational message process tree corresponding to the cross-organizational emergency handling process. Utilize the task interaction relationships included in the common message nodes in the cross-organizational message process tree to adjust its structure and construct a cross-organizational emergency handling process model that can represent the event order between organizations and has a sound structure.

[0010] In the above S1, the following steps are included:

[0011] S11: Obtain the event logs of the cross-organizational emergency handling process in the cross-organizational emergency management system. The obtained event logs are in XML format. Filter and process the obtained event log data. For the event logs with a high missing rate (greater than 80%), they can be directly deleted. For the event logs with a low missing rate, they are filled according to the data distribution situation. At the same time, ensure that each event completely records the six items of the emergency handling case it belongs to, the associated emergency tasks, the set of emergency organizations it belongs to, the received message set, the sent message set, and the time stamp of the event; in case of data missing, it must be manually supplemented according to the actual situation. Convert the above processed event logs into XES format, and record the event logs with sorted and unified formats as CroL.

[0012] CroL = {C1, C2, …, C i , …, C n};

[0013] C i = <e i1 , e i2 , …, e ij , …, e im >;

[0014] e ij = (case ij , T ij , org ij , mR ij , mS ij , time ij )

[0015] Among them, CroL consists of n emergency handling cases C i . C i is a finite sequence composed of m emergency events e ij , where i = 1, …, n and j = 1, …, m. e ij is composed of the following attributes: case ij indicates the C ij to which e i belongs; T ij indicates the associated emergency task of e ij ; org ij indicates the set of emergency organizations to which e ij belongs; mR ij indicates the set of received messages of e ij , and mS ij indicates the set of sent messages of e ij ; time ij indicates the timestamp of e ij .

[0016] In S2, the following steps are included:

[0017] S21 traverses each emergency handling case C in the event log CroL of the cross-organizational emergency handling process i and the included emergency events e ij .

[0018] S211 obtains the set of emergency organizations Org ij of e ij , accesses all the emergency organizations included in Org ij , and adds the emergency event e ij to Log with these emergency organizations as keys respectively.

[0019] S212 traverses each message msg ij existing in mS ij and mR u , and creates a message node MN u .

[0020] MN u = {msg u , direction u , task u}

[0021] Among them, msg u represents the message; direction u represents the sending or receiving status of the message; the value of direction u is s or r. When direction uWhen the value is s, it means that this message is sent by a certain emergency task, direction u When the value of u is r, it means that this message is received by a certain emergency task; task u represents the emergency task that executes this message. msg u 、direction u 、task u together serve as the unique identifier of the message node MN u . When and only when the values of msg, direction, and task corresponding to two message nodes are exactly the same, the two are equivalent.

[0022] Determine the value of MN u .direction based on the ownership relationship between the message msg ij and the receiving set mR ij or the sending set mS u . Determine the value of MN ij .task based on the T ij of the event e u . Store all non-repeated message nodes MN u (u = 1,..., U, assuming there are U messages in the cross-organizational emergency handling process) into the set Msgns.

[0023] S22 constructs the event log Log l for the l-th emergency organization according to the relationship of the key values in the Log, l = 1,..., L, and stores Log l into the set Logs.

[0024] In the aforementioned S3, the following steps are included:

[0025] S31 uses Inductive Miner to generate a sound process tree PT l for the event log Log of each emergency organization l (TS l , OS l , ArcOTS l ).

[0026] S32 assigns the TS l , OS l , and ArcOTS l in PT l to the TS l , OS l , and ArcOTS l in the message process tree MPT l respectively, and initializes MNS l and ArcTMS l to be empty.

[0027] MPT l ={TS l , OS l , MNS l , ArcOTS l , ArcTMS l}

[0028] Among them, TS l represents a finite set of emergency task nodes T l,x (x = 1, …, X), and in the message process tree, T l,x may not be a leaf node; OS l is a finite set composed of operator nodes O l,s (s = 1, …, S), and in the message process tree, O l,s are all non-leaf nodes; MNS l represents a finite set of message nodes MN l,y (y = 1, …, Y), and in the message process tree, MN l,y is a leaf node; is a set of directed arcs between operator nodes and emergency task nodes, and between operator nodes and operator nodes. is a set of directed arcs between emergency task nodes and message nodes.

[0029] Identify operator nodes O l from each message process tree MPT l,s ∈ OS l and emergency task nodes T l,x ∈ TS l . OS l , TS l respectively represent the operator node set and the emergency task node set of the l-th message process tree.

[0030] S33 traverses each message node MN u in the message node set Msgns, and finds the emergency task node T l in MPT u corresponding to MN l,x .task. Add the message node MN u as a child node MN l,x of the emergency task node T l,y (MN u .msg, MN u .direction, T l,x ), and record the message node MN l,y into the message node set MNS l of the l-th message process tree. At the same time, add the message node MNl,y and the emergency task node T l,x The relationship between them is stored in ArcTMS l . The message process tree MPT l is stored in the message process tree set MPTS, l = 1, …, L.

[0031] In step S4, the following steps are included:

[0032] S41 Create a message relationship table msgtable with the number of records being U / 2, initially empty. Traverse MPTS to obtain the MNS l in each message process tree MPT l . Traverse each message node MN l in MNS l,y , and search for MN l,y .msg in msgtable.

[0033] S411 If there is no record of a message with the same value as MN l,y .msg, then insert and save a new record (MN l,y .msg, MN l,y .direction, the emergency task node T l,y associated with MN through ArcTMS l ) in msgtable. l,x )

[0034] S412 If there is a record of a message with the same value as MN l,y .msg, perform the following operations: ① Obtain the associated emergency task node and direction value saved in the record, add the message node MN l,y as a child node of the saved associated emergency task node, and establish the sending message emergency task node and receiving message emergency task node associated with the message node MN l,y . When the value of MN l,y .direction is r, the saved associated emergency task node is the sending message emergency task node, and T l,x is the receiving message emergency task node; when the value of MN l,y .direction is s, T l,x is the sending message emergency task node, and the saved associated emergency task node is the receiving message emergency task node. ② Modify the message node MN l,y , assign it to the common message node CMN k . Retain MN l,y .msg and T l,x , and make MN l,y.direction is replaced by the associated emergency task node saved in this record. CMN k (k = 1, …, U / 2) is stored in the set CMNS.

[0035] CMN k = {msg k , Tsent k , Trec k}

[0036] Among them, msg k represents the message and is the unique identifier of CMN k ; Tsent k and Trec k respectively represent the emergency task sending the message and the emergency task receiving the message. If and only if the values of msg, Tsent, and Trec corresponding to two common message nodes are exactly the same, the two are equivalent. At this time, the value of msg k is MN l,y .msg; according to the value of MN l,y .direction, the corresponding values are assigned to Tsent k and Trec k respectively.

[0037] S42 constructs the cross-organization message process tree CMPT by traversing and accessing all message process trees in MPTS, using the established msgtable and the message passing relationships of all sending / receiving message emergency task nodes.

[0038] CMPT = {TS, OS, CMNS, ArcOTS, ArcOTS}

[0039] Among them, TS is a finite set composed of emergency task nodes of L message process trees, T x ∈TS, x = 1, …, X; CMNS is a finite set composed of common message nodes CMN k (k = 1, …, K), and these common message nodes are all leaf nodes in the cross-organization message process tree; is the set of directed arcs between emergency task nodes and common message nodes.

[0040] In S5, the following steps are included:

[0041] S51 reconstructs the cross-organization message process tree CMPT and traverses the set CMNS of common message nodes. For each common message node CMN k (k = 1, …, K, assuming there are K common message nodes in the set CMNS of common message nodes), the following operations are performed:

[0042] S511 Find the emergency task node that sends messages in the tree and denote it as T S_k , and the emergency task node that receives messages and denote it as T R_k . At the same time, find T S_k 's parent node T S_k .parent.operator and T R_k 's parent node T R_k .parent.operator.

[0043] S512 Construct the sentAfterTree k subtree. Use T S_k 's parent node T S_k .parent.operator as the root node of this subtree.

[0044] Root(sentAfterTree k ) = T s_k .parent.operator

[0045] Use all the post-sibling nodes of T S_k as the children nodes of the root node T Safter_k,q .parent.operator. Add all the descendant nodes of each node T S_k to the sentAfterTree Safter_k,q subtree, still as the descendant nodes of T k . Safter_k,q

[0046] Children(T S_k .parent.operator) = T Safter_k,q

[0047] Children(T Safter_k,q ) = Descendants(T Safter_k,q )

[0048] Among them, T Safter_k,q (q = 0,..., Q, assuming T S_k has Q post-sibling nodes) represents the q-th post-sibling node of T S_k . Descendants(node) represents finding all the descendant nodes of the node node.

[0049] S513 Construct the recPreTree k subtree. Use T R_k 's parent node T R_k .parent.operator as the root node of this subtree. ​

[0050] Root(recPreTree k ) = TR _k .parent.operator

[0051] Make all the pre - sibling nodes T R_k of T Rpre_k,s be the children of the root node T R_k .parent.operator. Add all the descendant nodes of each node T Rpre_k,s to the recPreTree k sub - tree, still as the descendant nodes of T Rpre_k,s .

[0052] Children(T R_k .parent.operator) = T Rpre_k,s

[0053] Children(T Rpre_k,s ) = Descendants(T Rpre_k,s )

[0054] Among them, T Rpre_k,s (s = 0, …, S, assuming T R_k has S pre - sibling nodes) represents the s - th pre - sibling node of T R_k .

[0055] S514 Construct the recAfterTree k sub - tree. Make the parent node T R_k of T R_k .parent.operator be the root node of this sub - tree.

[0056] Root(recAfterTree k ) = T R_k .parent.operator

[0057] Make T R_k and all the post - sibling nodes T R_k of T Rafter_k,t be the children of the root node T R_k .parent.operator. Add all the descendant nodes of T R_k to the recAfterTree k sub - tree, still as the descendant nodes of T R_k ; Add all the descendant nodes of each node T Rafter_k,t to the recAfterTree k sub - tree, still as the descendant nodes of TRafter_k,t The descendant nodes of

[0058] Children(T R_k .parent.operator) = T R_k ∪T Rafter_k,t

[0059] Children(T R_k ) = Descendants(T R_k )

[0060] Chidren(T Rafter_k,t ) = Descendants(T Rafter_k,t )

[0061] Where T Rafter_k,t (t = 0, …, T, assuming T R_k has T post - sibling nodes) represents the t - th post - sibling node of T R_k .

[0062] S515 is merged to obtain the subtree preTree k . Since each node T Rpre_k,s is the pre - sibling node of T R_k , the subtree recPreTree S_k with all nodes T Rpre_k,s as child nodes and T k can be merged to construct the subtree preTree k with the parallel operator (symbolized as +) node as the root node. Find all descendant nodes of T S_k , and add all descendant nodes of T S_k to the preTree k subtree, still as the descendant nodes of T S_k .

[0063] Root(preTree k ) = Node(+)

[0064] Children(Node(+)) = {T S_k} ∪ ecPreTree k

[0065] Children(T S_k ) = Descendants(T S_k )

[0066] S516 is merged to obtain the subtree afterTree k . Since each node T Safter_k,q is the TS_k The post - sibling nodes of each node T Rafter_k,t is the post - sibling node of T R_k is the post - sibling node of T, so the subtree sentAfterTree with all nodes T Safter_k,q as child nodes k , the subtree with T R_k and all nodes T Rafter_k,t as child nodes recAfterTree k can be merged to construct a subtree afterTree with a parallel operator (symbol: +) as the root node k .

[0067] Root(afterTree k ) = Node(+)

[0068] Children(Node(+)) = sentAfterTree k ∪recAfterTree k

[0069] S517 Delete nodes. In the cross - organizational message process tree CMPT, delete the subtree where T R_k is located, and all post - sibling nodes of T S_k . Because T Safter_k,q , all its pre - sibling nodes T R_k , all its post - sibling nodes T Rpre_k,s , all post - sibling nodes of T Rafter_k,t , T S_k , and all post - sibling nodes of T Safter_k,q , as well as all descendant nodes of these nodes, have been reconstructed in the above steps, and the original structure is no longer needed.

[0070]

[0071] Among them, SubTree represents getting the subtree where T R_k is located.

[0072] S518 Insert replacement nodes. In the cross - organizational message process tree CMPT, for each pre - sibling node T S_k of T Spre_k,p (p = 0, …, P, assuming T S_k has P pre - sibling nodes), and all descendant nodes of T Spre_k,p , the structural relationships of these nodes have not changed. afterTree k represents the merged relationship of all post - nodes of T S_k and T R_k and all its post - nodes, and insert it into T S_kAfter that, to ensure the correct execution order of received messages for all emergency tasks. preTree k represents T S_k and all the merging relationships of the pre-nodes of T R_k , and replace T with it S_k , to ensure the correct execution order of sent messages for all emergency tasks.

[0073] CMPT := InsertAfter(T S_k .parent.operator, T S_k , afterTre e ) ∪ Replace(T S_ k .parent.operator, T S_k , preTree k )

[0074] Among them, InsertAfter represents the insertion operation, and Replace represents the replacement operation.

[0075] Figure 2 shows the reconstruction process of the task nodes associated with the common message node CMN k in the cross-organization message process tree.

[0076] S52 Simplify nodes. In the reconstructed cross-organization message process tree, if an operator node has exactly one emergency task node as its child node, or the parent node and grandparent node of an emergency task node are both operator nodes of the same type, then the emergency task node needs to be made a child node of its grandparent node, the relationship between the emergency task node and its descendant nodes remains unchanged, and the operator node as the parent node is deleted. Figure 3 (a) and (c) respectively show two existing examples: (1) the reconstruction result of the received message task node T R_k without a pre-sibling node (s = 0 in T Rpre_k,s ); (2) the reconstruction result of the sent message task node T S_k with only one post-sibling node (q = 1 in T Safter_k,q ). Figure 3 (b) and (d) are the simplified structures of (a) and (c) respectively.

[0077] The beneficial effects of the present invention are as follows: The present invention proposes a method for discovering cross-organizational emergency processing processes based on message process trees. This method first divides event logs and creates message nodes, constructs message process trees for each organization, then integrates them to generate a cross-organizational message process tree, and reconstructs it to optimize the structure of task collaboration and message interaction, thereby significantly improving the decision-making efficiency and collaboration level of cross-organizational emergency responses.

[0078] Other advantages, objectives, and features of the present invention will be described to some extent in the subsequent specification, and to some extent, will be obvious to those skilled in the art based on the study of the following text, or can be taught from the practice of the present invention. The objectives and other advantages of the present invention can be achieved and obtained through the following specification. BRIEF DESCRIPTION OF THE DRAWINGS

[0079] In order to make the objectives, technical solutions, and advantages of the present invention clearer, the present invention will be described in detail preferably with reference to the accompanying drawings, where:

[0080] Figure 1 is a flowchart of the method for discovering cross-organizational emergency processing processes based on message process trees according to the present invention;

[0081] Figure 2 is the common message node CMN according to the present invention k and its associated task nodes in the reconstruction process in the cross-organizational message process tree, including four sub-diagrams (a)-(d);

[0082] Figure 3 is the simplified structure of the reconstructed cross-organizational message process tree according to the present invention, including four sub-diagrams (a)-(d);

[0083] Figure 4 is an overview diagram of the method for discovering cross-organizational emergency processing processes based on message process trees according to the embodiments of the present invention;

[0084] Figure 5 is the message process tree corresponding to each emergency organization in the embodiments of the present invention;

[0085] Figure 6 is the cross-organizational message process tree corresponding to the cross-organizational infectious disease emergency processing process in the embodiments of the present invention;

[0086] Figure 7 is the reconstructed cross-organizational message process tree corresponding to the cross-organizational infectious disease emergency processing process in the embodiments of the present invention. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0087] The following describes the embodiments of the present invention through specific examples. Those skilled in the art can easily understand the other advantages and effects of the present invention from the content disclosed in this specification. The present invention can also be implemented or applied through other different specific embodiments. Various details in this specification can also be modified or changed based on different viewpoints and applications without departing from the spirit of the present invention. It should be noted that the drawings provided in the following embodiments only illustrate the basic concept of the present invention in a schematic manner. Without conflict, the following embodiments and the features in the embodiments can be combined with each other.

[0088] Among them, the drawings are only for illustrative purposes, showing only schematic diagrams rather than physical diagrams, and should not be construed as a limitation on the present invention; in order to better illustrate the embodiments of the present invention, some components in the drawings will be omitted, enlarged or reduced, which do not represent the dimensions of the actual product; for those skilled in the art, it is understandable that some well-known structures and their descriptions in the drawings may be omitted.

[0089] In the drawings of the embodiments of the present invention, the same or similar reference numerals correspond to the same or similar components; in the description of the present invention, it should be understood that if there are terms such as "upper", "lower", "left", "right", "front", "rear", etc. indicating the orientation or positional relationship, they are based on the orientation or positional relationship shown in the drawings. This is only for the convenience of describing the present invention and simplifying the description, rather than indicating or implying that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation. Therefore, the terms describing the positional relationship in the drawings are only for illustrative purposes and should not be construed as a limitation on the present invention. For those of ordinary skill in the art, the specific meanings of the above terms can be understood according to specific circumstances.

[0090] The present invention will be further described below with reference to specific embodiments.

[0091] This embodiment provides a cross-organizational emergency handling process discovery method based on a message process tree. This method can effectively capture the organizational information and message passing patterns in the cross-organizational emergency handling process and ensure the soundness of the discovered process model. The overall overview diagram of this method is as Figure 4 shown, which includes the following steps:

[0092] In S1, the following steps are included:

[0093] S11 Taking the cross - organizational infectious disease emergency response process as an example, obtain the event log of this process from the cross - organizational emergency management system. The obtained event log is in XML format. Filter and process the above - obtained event log data. For event logs with a high missing rate (greater than 80%), they can be directly deleted. For event logs with a low missing rate, fill - in processing is performed according to the data distribution. At the same time, ensure that each event completely records the six items: the emergency response case it belongs to, the associated emergency tasks, the set of emergency organizations it belongs to, the set of received messages, the set of sent messages, and the timestamp of the event. In case of data missing, manual supplementation must be carried out according to the actual situation. Convert the above - processed event log into XES format, and record the event log with organized and unified format as CroL. Table 1 shows part of the content in CroL. As can be seen from Table 1, the cross - organizational infectious disease emergency response process involves 3 organizations: the Medical Disease Control Center (Disease Control Center, denoted as Org1), the Medical Rescue Team (Medical Rescue Team, denoted as Org2), and the Local Government (Local Government, denoted as Org3). At the same time, this process includes 11 tasks (denoted as T1 to T 11 ) and 2 messages (denoted as m1 and m2).

[0094] Table 1

[0095]

[0096] In S2 mentioned above, the following steps are included:

[0097] S21 Traverse each emergency response case C i and the included emergency events e ij . Taking case C1 as an example, the emergency event sequence of C1 is: C1 = <e 11 , e 12 , e 13 , e 14 , e 15 , e 16 , e 17 , e 18 , e 19 , e 110 , e 111 >. Other cases are processed according to the same process.

[0098] S211 For e 11 , first obtain the set of emergency organizations {Org1} it belongs to, denoted as Org 11 ; similarly, for e 12 obtain Org 12 , and so on until e 111 gets Org111 .

[0099] For e 11 , Org 11 only contains the organization Org1. Add e 11 to the event log Log with Org1 as the key. Similarly, for e 12 , e 13 , etc., add them to the event logs of their respective organizations respectively.

[0100] S212 For e 11 , traverse each message existing in mS 11 and mR 11 to create a message node MN1(m1, s, T1). m1 represents the message; s indicates that this message is sent by the emergency task T1; T1 represents the emergency task that executes this message. m1, s, and T1 together serve as the unique identifier of the message node MN1. Similarly, for e 12 , e 13 , etc., traverse their respective sets of sent messages mS and received messages mR in sequence, and create corresponding message nodes. Store all non-repeated message nodes in the set Msgns.

[0101] S22 After processing all emergency handling cases and the emergency events they contain, according to the relationship of the key values in Log, construct event logs Log1, Log2, and Log3 for the emergency organizations Org1, Org2, and Org3 respectively, and store them in the set Logs.

[0102] Table 2 shows some contents in Log1, Log2, and Log3. Table 3 shows the set of message nodes Msgns.

[0103] Table 2

[0104]

[0105] Table 3

[0106]

[0107] In the aforementioned S3, the following steps are included:

[0108] S31 Respectively use Inductive Miner on Log1, Log2, and Log3 to generate sound process trees PT1(TS1, OS1, ArcOTS1), PT2(TS2, OS2, ArcOTS2), and PT3(TS3, OS3, ArcOTS3). TS1 = {T 1,1 , T 1,2 , T 1,3 , T1,4}, where T 1,1 represents T1, T 1,2 represents T2, T 1,3 represents T3, T 1,4 represents T4, that is, TS1 = {T1, T2, T3, T4}; OS1 = {O 1,1}; ArcOTS1 = {(O 1,1 , T1), (O 1,1 , T2), (O 1,1 , T3), (O 1,1 , T4)}. TS2 = {T 2,1 , T 2,2 , T 2,3 , T 2,4}, where T 2,1 represents T5, T 2,2 represents T6, T 2,3 represents T7, T 2,4 represents T8, that is, TS2 = T5, T6, T7, T8}; OS2 = {O 2,1 , O 2,2}; ArcOTS2 = {(O 2,1 , T5), (O 2,1 , O 2,2 ), (O 2,2 , T6), (O 2,2 , T7), (O 2,1 , T8)}. TS3 = {T 3,1 , T 3,2 , T 3,3}, where T 3,1 represents T9, T 3,2 represents T 10 , T 3,3 represents T 11 , that is, TS3 = {T9, T 10 , T 11}; OS3 = {O 3,1}; ArcOTS3 = {(O 3,1 , T9), (O 3,1 , T 10 ), (O 3,1 , T 11 )}.

[0109] For PT1, PT2, and PT3, S32 assigns their TS, OS, and ArcOTS to the TS, OS, and ArcOTS in the corresponding message process trees MPT1, MPT2, and MPT3 respectively, and initializes their respective MNS and ArcTMS to be empty.

[0110] S33 traverses each message node in the message node set Msgns. When MN1 is traversed, the emergency task T1 corresponding to MN1.task in MPT1 is found. MN1 is added as the child node MN 1,1 (m1, s, T1), and MN 1,1 is recorded in MNS1, and at the same time (T1, MN 1,1 ) is stored in ArcTMS1. When MN2 is traversed, the emergency task T9 corresponding to MN2.task in MPT3 is found. MN2 is added as the child node MN 3,1 (m1, r, T9), and MN 3,1 is recorded in MNS3, and at the same time (T9, MN 3,1 ) is stored in ArcTMS3. When MN3 is traversed, the emergency task T 10 corresponding to MN3.task in MPT3 is found. MN3 is added as the child node of T 10 MN 3,2 (m2, s, T 10 ), and MN 3,2 is recorded in MNS3, and at the same time (T 10 , MN 3,2 ) is stored in ArcTMS3. When MN4 is traversed, the emergency task T5 corresponding to MN4.task in MPT2 is found. MN4 is added as the child node MN 2,1 (m2, r, T5), and MN 2,1 is recorded in MNS2, and at the same time (T5, MN 2,1 ) is stored in ArcTMS2. MPT1, MPT2, and MPT3 are stored in the message process tree set MPTS. The message process trees MPT1, MPT2, and MPT3 corresponding to each emergency organization are as Figure 5 shown.

[0111] In S4 described above, the following steps are included:

[0112] S41 creates a message relationship table msgtable with a record count of 2, which is initially empty. MPTS is traversed to obtain MNS1, MNS2, and MNS3 in MPT1, MPT2, and MPT3. Each message node in MNS1 is traversed. When MN 1,1 is traversed, m1 is searched for in msgtable.

[0113] S411 If there is no record of a message identical to m1, a new record (m1, s, T1) is inserted and saved in msgtable.

[0114] Furthermore, each message node in MNS2 is traversed. When MN 2,1When m2 is searched for in msgtable. If there is no record of a message identical to m2, a new record (m2, r, T5) is inserted and saved in msgtable.

[0115] Further, each message node in MNS3 is traversed. When MN 3,1 is traversed, m1 is searched for in msgtable. If there is a record of a message identical to m1, the following operations are performed: ① The associated emergency task node T1 and the direction value s saved in this record are obtained, and MN 3,1 is added as a child node of the saved associated emergency task node T1, and the sending message emergency task node T1 and the receiving message emergency task node T9 associated with the message node MN 3,1 are established. ② The message node MN 3,1 is modified and assigned to the common message node CMN1. m1 and T9 are retained, and r is replaced with the associated emergency task node T1 saved in this record. CMN1(m1, T1, T9) is stored in the set CMNS. m1 represents the message and is the unique identifier of CMN1; T1 represents the emergency task of sending the message; T9 represents the emergency task of receiving the message.

[0116] Further, each message node in MNS3 is traversed. When MN 3,2 is traversed, m2 is searched for in msgtable. If there is a record of a message identical to m2, the following operations are performed: ① The associated emergency task node T5 and the direction value r saved in this record are obtained, and MN 3,2 is added as a child node of the saved associated emergency task node T5, and the sending message emergency task node T 3,2 and the receiving message emergency task node T5 associated with the message node MN 10 are established. ② The message node MN 3,2 is modified and assigned to the common message node CMN2. m2 and T 10 are retained, and s is replaced with the associated emergency task node T5 saved in this record. CMN2(m2, T5, T 10 ) is stored in the set CMNS. m2 represents the message and is the unique identifier of CMN2; T 10 represents the emergency task of sending the message; T5 represents the emergency task of receiving the message.

[0117] S42 completes the construction of the cross-organizational message process tree CMPT(TS, OS, CMNS, ArcOTS, ArcTCMS) by traversing and accessing all message process trees in MPTS and using the established msgtable and the message passing relationships of all sending / receiving message emergency task nodes, as Figure 6As shown. TS = {T1, T2, T3, T4, T5, T6, T7, T8, T9, T 10 , T 11}; OS = {O 1,1 , O 2,1 , O 2,2 , O 3,1}; CMNS = {CMN1, CMN2}; ArcOTS = {(O 1,1 , T1), (O 1,1 , T2), (O 1,1 , T3), (O 1,1 , T4), (O 2,1 , T5), (O 2,1 , O 2,2 ), (O 2,2 , T6), (O 2,2 , T7), (O 2,1 , T8), (O 3,1 , T9), (O 3,1 , T 10 ), (O 3,1 , T 11 )}; ArcTCMS = {(T1, CMN1), (T5, CMN2), (T9, CMN1), (T 10 , CMN2)}

[0118] In S5 as described above, the following steps are included:

[0119] S51 Reconstruct the cross - organizational message process tree CMPT and traverse the common message node set CMNS. When CMN1 is traversed, the following operations are performed:

[0120] S511 Find the send - message emergency task node T1 and the receive - message emergency task node T9 in the tree. At the same time, find the parent node O 1,1 of T1 and the parent node O 3,1 of T9.

[0121] S512 Construct the sentAfterTree1 subtree. Use O 1,1 as the root node of this subtree.

[0122] Root(sentAfterTree1) = O 1,1

[0123] Take all the post - sibling nodes T2, T3, T4 of T1 as the child nodes of the root node O 1,1 .

[0124] Children(O 1,1 ) = {T2, T3, T4}

[0125] S513 constructs the recPreTree1 subtree. Set the parent node O of T9 3,1 as the root node of this subtree.

[0126] Root(recPreTree1) = O 3,1

[0127] T9 has no pre - nodes, so skip this step.

[0128] S514 constructs the recAfterTree1 subtree. Set the parent node O of T9 3,1 as the root node of this subtree.

[0129] Root(recAfterTree1) = O 3,1

[0130] Take T9 and all its post - sibling nodes T 10 , T 11 and make them all child nodes of the root node O 3,1 .

[0131] Children(O 3,1 ) = T9 ∪ {T 10 , T 11}

[0132] S515 combines to get the subtree preTree1. Since T9 has no pre - nodes, construct the subtree preTree1 with the parallel operator (symbol: +) node as the root node and T1 as the child node.

[0133] Root(preTree1) = Node(+)

[0134] Children(Node(+)) = {T1}

[0135] S516 combines to get the subtree afterTree1. Since T2, T3, T4 are all post - sibling nodes of T1, and T 10 , T 11 are all post - sibling nodes of T9, so the subtree sentAfterTree1 with T2, T3, T4 as child nodes and the subtree recAfterTree1 with T9 and T 10 , T 11 as child nodes can be combined to construct the subtree afterTree1 with the parallel operator (symbol: +) as the root node.

[0136] Root(afterTree1) = Node(+)

[0137] Children(Node(+)) = sentAfterTree1 ∪ recAfterTree1

[0138] S517 Delete nodes. In the cross-organizational message process tree CMPT, delete the subtree where T9 is located, and all the post-sibling nodes T2, T3, T4 of T1. Since T9, T 10 , T 11 , T2, T3, T4 have been reconstructed in the above steps, and the original structure is no longer needed.

[0139] CMPT := CMPT \({T9, T 10 , T 11}) ∪ {T2, T3, T4}

[0140] S518 Insert replacement nodes. afterTree1 represents the merged relationship of all the post-nodes of T1 and T9 and all its post-nodes. preTree1 represents the merged relationship of all the pre-nodes of T1 and T9. In the cross-organizational message process tree CMPT, insert afterTree1 after T1 to ensure the correct execution order of receiving messages for all emergency tasks. Replace T1 with preTree1 to ensure the correct execution order of sending messages for all emergency tasks.

[0141] CMPT := InsertAfter(O 1,1 , T1, afterTree1) ∪ Replace(O 1,1 , T1, preTree1)

[0142] S52 Simplify nodes. In the reconstructed cross-organizational message process tree, if there is only T1 under a certain parallel operator (+), T1 needs to be made a child node of its grandfather node, and the parallel operator node (+) as the parent node needs to be deleted.

[0143] Furthermore, when CMN2 is traversed, perform the following operations:

[0144] Find the send-message emergency task node T 10 , and the receive-message emergency task node T5 in the tree. At the same time, find the parent node O 10 of T 3,1 and the parent node O 2,1 of T5.

[0145] Construct the sentAfterTree2 subtree. Use O 3,1 as the root node of this subtree.

[0146] Root(sentAfterTree2) = O 3,1

[0147] Make all the post - sibling nodes of T 10 be the child nodes of the root node O 11 . 3,1 .

[0148] Children(O 3,1 ) = {T 11}

[0149] Construct the recPreTree2 subtree. Make the parent node O of T5 2,1 be the root node of this subtree.

[0150] Root(recPreTree2) = O 2,1

[0151] T5 has no pre - node, so skip this step.

[0152] Construct the recAfterTree2 subtree. Make the parent node O of T5 2,1 be the root node of this subtree.

[0153] Root(recAfterTree2) = O 2,1

[0154] Make T5 and all its post - sibling nodes O 2,2 , T8 be the child nodes of the root node O 2,1 . Add all the descendant nodes T6, T7 of O 2,2 to the recAfterTree2 subtree, still as the descendant nodes of O 2,2 .

[0155] Children(O 2,1 ) = T5 ∪ {O 2,2 , T8}

[0156] Children(O 2,2 ) = {T6, T7}

[0157] Merge to get the subtree preTree2. Since T5 has no pre - node, a subtree preTree2 can be constructed with the root node being a parallel operator (symbolically represented as +) node and T 10 as the child node.

[0158] Root(preTree2) = Node(+)

[0159] Children(Node(+)) = {T 10}

[0160] Merge to obtain the subtree afterTree2. Since T 11 is the post - sibling node of T 10 , and O 2,2 , T8 are both post - sibling nodes of T5, so the subtree sentAfterTree2 with T 11 as the child node and the subtree recAfterTree2 with T5, O 2,2 , T8 as the child nodes can be merged to construct the subtree afterTree2 with the parallel operator (symbolized as +) as the root node.

[0161] Root(afterTree2) = Node(+)

[0162] Children(Node(+)) = sentAfterTree2 ∪ recAfterTree2

[0163] Delete nodes. In the cross - organizational message process tree CMPT, delete the subtree where T5 is located and all post - sibling nodes of T 10 . Because T 11 , T5, O 11 , T6, T7, T8 have been reconstructed in the above steps and the original structure is no longer needed. 2,2

[0164] CMPT := CMPT \({T 11} ∪ {T5, O 2,2 , T6, T7, T8})

[0165] Insert replacement nodes. afterTree2 represents the merge relationship of all post - nodes of T 10 and all post - nodes of T5 and its post - nodes. preTree2 represents the merge relationship of all pre - nodes of T 10 and T5. In the cross - organizational message process tree CMPT, insert afterTree2 after T 10 to ensure the correct execution order of receiving messages for all emergency tasks. Replace T 10 with preTree2 to ensure the correct execution order of sending messages for all emergency tasks.

[0166] CMPT := InsertAfter(O 3,1 , T 10 , afterTree2) ∪ Replace(O 3,1 , T 10 , preTree2)

[0167] ​Simplified node. In the reconstructed cross-organizational message process tree, under a certain parallel operator (+), there is only T 10 , and it is necessary to make T 10 a child node of its grandfather node and delete the parallel operator node (+) that is the parent node.

[0168] Taking the cross-organizational infectious disease emergency handling process as an example, the reconstructed cross-organizational message process tree is as Figure 7 shown.

[0169] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention and not to limit them. Although the present invention has been described in detail with reference to the preferred embodiments, those of ordinary skill in the art should understand that the technical solutions of the present invention can be modified or equivalently replaced without departing from the purpose and scope of the present technical solution, and they should all be covered within the scope of the claims of the present invention.

Claims

1. A cross-organizational emergency handling process discovery method based on a message process tree, characterized in that It includes the following steps: S1: Obtain the event log related to the emergency handling process in the cross-organizational business process management system, and perform unified format conversion and preprocessing on the event log; S2: Divide the event log of the cross-organizational emergency handling process and obtain message nodes. Divide the cross-organizational event log by organizational dimension to generate the event log corresponding to each emergency organization; at the same time, obtain message information from the emergency events for creating message nodes; S3: Construct the message process tree of each organization in the cross-organizational emergency handling process. Perform process discovery on the event log of each emergency organization to obtain the process tree, and add the related message nodes to the process tree to form the message process tree of the organization; S4: Construct the cross-organizational message process tree corresponding to the cross-organizational emergency handling process. By analyzing the message interaction behaviors in the message process trees of each emergency organization, match and connect the relevant message nodes to obtain the common message nodes, and at the same time construct the complete cross-organizational message process tree to present the cooperation mechanism in the cross-organizational emergency handling process; S5: Reconstruct the cross-organizational message process tree corresponding to the cross-organizational emergency handling process. Utilize the task interaction relationship included in the common message nodes in the cross-organizational message process tree to adjust its structure and construct a cross-organizational emergency handling process model that can represent the event order between organizations and has a sound structure.

2. The method for discovering cross-organizational emergency handling processes based on message process trees according to claim 1, wherein: The specific steps of step S1 include the following steps: S11 Obtain the event log of the cross-organizational emergency handling process in the cross-organizational emergency management system, and the obtained event log is in XML format. Filter and process the obtained event log data. For the event log with a high missing rate (greater than 80%), it can be directly deleted. For the event log with a low missing rate, it is filled according to the data distribution situation. At the same time, ensure that each event completely records the six items of the emergency handling case it belongs to, the associated emergency task, the set of emergency organizations it belongs to, the received message set, the sent message set, and the timestamp of the event; in case of data missing, it must be supplemented manually according to the actual situation. Convert the above processed event log into XES format, and record the event log with organized and unified format as CroL. CroL = {C1, C2, …, C i , …, C n}; C i = <e i1 , e i2 , …, e ij , …, e im >; e ij = (case ij , T ij , org ij , mR ij , mS ij , time ij ) Among them, CroL consists of n emergency handling cases C i which are composed of C i is a finite sequence composed of m emergency events e ij , where i = 1, …, n and j = 1, …, m. e ij is composed of the following attributes: case ij indicating the C ij to which e i belongs; T ij indicating the associated emergency task of e ij ; org ij indicating the set of emergency organizations to which e ij belongs; mR ij indicating the set of received messages of e ij , and mS ij indicating the set of sent messages of e ij ; time ij indicating the timestamp of e ij .

3. The method for discovering cross-organizational emergency handling processes based on message process trees according to claim 1, wherein: The specific steps of step S2 include the following steps: S21 traverses each emergency handling case C in the event log CroL of the cross-organizational emergency handling process i and the included emergency events e ij . S211 Obtain e ij 's emergency organization set Org ij , access all the emergency organizations included in Org ij , and add this emergency event e ij to the Log with these emergency organizations as keys respectively. S212 traverses mS ij and mR ij for each message msg existing therein u to create a message node MN u . MN u = {msg u , direction u , task u} Among them, msg u represents a message; direction u represents the sending or receiving status of the message; direction u takes values of s or r. When the value of direction u is s, it means that this message is sent by a certain emergency task. When the direction u value is r, it means that this message is received by a certain emergency task; task u represents the emergency task that executes this message. msg u , direction u , task u together serve as the unique identifier of the message node MN u . Two message nodes are equivalent if and only if the values of msg, direction, and task corresponding to them are exactly the same. Determine the value of MN.direction based on the ownership relationship between the message msg u and the receive set mR ij or the send set mS ij . Determine the value of MN u .direction. Determine the value of MN ij .task based on the T ij of the event e u . Store all non-duplicate message nodes MN u (u = 1, …, U, assuming there are U messages in the cross-organizational emergency handling process) into the set Msgns. S22 constructs an event log Log for the l-th emergency organization according to the relationship of key values in Log, where l = 1, …, L, and stores Log in the set Logs. l , l = 1, …, L, and Log l is stored in the set Logs.

4. The method for discovering cross-organizational emergency handling processes based on message process trees according to claim 1, wherein: The specific steps of step S3 include the following steps: S31 logs the events of each emergency organization l Use Inductive Miner to generate a sound process tree PT l (TS l , OS l , ArcOTS l ) S32 assigns PT l the TS l , OS l , ArcOTS l to the message process tree MPT l the TS l , OS l , ArcOTS l , and initializes MNS l , ArcTMS l to be empty. MPT l ={TS l , OS l , MNS l , ArcOTS l , ArcTMS l} Among them, TS l represents a finite set of emergency task nodes T l,x (x = 1, …, X), and in the message process tree, T l,x may not be a leaf node; OS l is a finite set composed of operator nodes O l,s (s = 1, …, S), and in the message process tree, O l,s are all non-leaf nodes; MNS l represents a finite set of message nodes MN l,y (y = 1, …, Y), and in the message process tree, MN l,y is a leaf node; is a set of directed arcs between operator nodes and emergency task nodes, and between operator nodes and operator nodes. is a set of directed arcs between emergency task nodes and message nodes. Identify the operator node O l from each message process tree MPT l,s ∈ OS l and the emergency task node T l,x ∈ TS l . OS l , TS l respectively represent the operator node set and the emergency task node set of the l-th message process tree. S33 traverses each message node MN in the message node set Msgns u , find MPT l MN u .task corresponding to the emergency task node T l,x . The message node MN u Add as emergency task node T l,x The child node MN l,y (MN u .msg,MN u .direction,T l,x ), and the message node MN l,y Record the message node set MNS of the lth message process tree l At the same time, the message node MN l,y and emergency task node T l,x The relationship between l . The message process tree MPT l Store in the message process tree set MPTS, l=1,…,L.

5. The method for discovering cross-organizational emergency handling processes based on message process trees according to claim 1, characterized in that: The specific steps of step S4 include the following steps: S41 Create a message relationship table msgtable with the number of records being U / 2, initially empty. Traverse MPTS to obtain each message process tree MPT l in the MNS l . Traverse MNS l for each message node MN l,y in it, and search for MN l,y .msg in msgtable S411 If there is no record of a message with the same l,y .msg value, insert and save a new record (MN l,y .msg, MN l,y .direction, MN l,y associated with the emergency task node T l through ArcTMS l,x ) in the msgtable. S412 If there is a record of a message with the same.msg value as MN l,y .perform the following operations: ① Obtain the associated emergency task node and direction value saved in this record, and add the message node MN l,y as a child node of the associated emergency task node that has been saved, and establish the sending message emergency task node and receiving message emergency task node associated with the message node MN l,y . When the MN l,y .direction value is r, the associated emergency task node that has been saved is the sending message emergency task node, and T l,x is the receiving message emergency task node; when the MN l,y .direction value is s, T l,x is the sending message emergency task node, and the associated emergency task node that has been saved is the receiving message emergency task node. ② Modify the message node MN l,y , and assign it to the common message node CMN k . Retain MN l,y .msg and T l,x , replace MN l,y .direction with the associated emergency task node that has been saved in this record. Store CMN k (k = 1,..., U / 2) into the set CMNS. CMN k = {msg k , Tsent k , Trec k} Among them, msg k represents a message and is the unique identifier of CMN k ; Tsent k and Trec k respectively represent the emergency task that sends the message and the emergency task that receives the message. Two public message nodes are equivalent if and only if the values of msg, Tsent, and Trec corresponding to them are exactly the same. At this time, the value of msg k is MN l,y .msg; according to the value of MN l,y .direction, corresponding values are assigned to Tsent k and Trec k respectively. S42 Complete the construction of the cross-organizational message process tree CMPT by traversing and accessing all the message process trees in MPTS and utilizing the established msgtable and the message passing relationship of all the send / receive message emergency task nodes. CMPT = {TS, OS, CMNS, ArcOTS, ArcTCMS} Among them, TS is a finite set composed of the emergency task nodes of L message process trees, T x ∈TS, x = 1, …, X; CMNS is a finite set composed of common message nodes CMN k (k = 1, …, K), and these common message nodes are all leaf nodes in the cross-organizational message process tree; is the set of directed arcs between the emergency task nodes and the common message nodes.

6. The method for discovering cross-organizational emergency handling processes based on message process trees according to claim 1, characterized in that: The specific steps of step S5 include the following steps: S51 reconstructs the cross-organizational message process tree CMPT and traverses the common message node set CMNS. For each common message node CMN k (k = 1, …, K, assuming there are K common message nodes in the common message node set CMNS) perform the following operations: S511 Find the emergency task node that sends messages in the tree and denote it as T S_k , and denote the emergency task node that receives messages as T R_k . At the same time, find T S_k 's parent node T S_k .parent.operator and T R_k 's parent node T R_k .parent.operator. S512 constructs the sentAfterTree k subtree. Let T S_k 's parent node T S_k .parent.operator be the root node of this subtree. Root(sentAfterTree k ) = T S_k .parent.operator Take T S_k All the post-sibling nodes of T Safter_k,q As the root node T S_k .parent.operator's child nodes, and for each node T Safter_k,q All its descendant nodes are added to sentAfterTree k Subtree, still as the descendant nodes of T Safter_k,q . Children(T S_k .parent.operator) = T Safter_k,q Children(T Safter_k,q ) = Descendants(T Safter_k,q ) Among them, T Safter_k,q (q = 0, …, Q, assuming that T S_k has Q post-sibling nodes) represents the q-th post-sibling node of T S_k . Descendants(node) represents finding all descendant nodes of the node node. S513 Construct recPreTree k subtree. Let T R_k 's parent node T R_k .parent.operator be the root node of this subtree. Root(recPreTree k ) = T R_k .parent.operator Take T R_k All the preceding sibling nodes of T Rpre_k,s As the root node T R_k .parent.operator's child nodes, and for each node T Rpre_k,s Add all its descendant nodes to the recPreTree k Subtree, still as the descendant nodes of T Rpre_k,s . Children(T R_k .parent.operator) = T Rpre_k,s Children(T Rpre_k,s ) = Descendants(T Rpre_k,s ) Among them, T Rpre_k,s (s = 0, …, S, assuming T R_k has S pre - sibling nodes) represents the R_k s - th pre - sibling node of T. S514 Construct recAfterTree k Subtree. Set the R_k parent node T of T R_k .parent.operator as the root node of this subtree. Root(recAfterTree k ) = T R_k .parent.operator Take T R_k and all the post-sibling nodes T R_k of T Rafter_k,t as children of the root node T R_k .parent.operator. Add all the descendant nodes of T R_k to the recAfterTree k subtree, still as descendant nodes of T R_k ; add all the descendant nodes of each node T Rafter_k,t to the recAfterTree k subtree, still as descendant nodes of T Rafter_k,t . Children(T R_k .parent.operator) = T R_k ∪T Rafter_k,t Children(T R_k ) = Descendants(T R_k ) Chidren(T Rafter_k,t ) = Descendants(T Rafter_k,t ) Among them, T Rafter_k,t (t = 0, …, T, assuming T R_k has T post-sibling nodes) represents the R_k t-th post-sibling node of T. S515 is merged to obtain the subtree preTree k . Since each node T Rpre_k,s is the pre-sibling node of T R_k , therefore, T S_k , the subtree recPreTree Rpre_k,s with all nodes T k as its child nodes can be merged to construct the subtree preTree with the parallel operator (symbolized as +) node as the root node k . Find all descendant nodes of T S_k , and add all descendant nodes of T S_k to the preTree k subtree, still as the descendant nodes of T S_k . Root(preTree k ) = Node(+) Children(Node(+)) = {T S_k} ∪ recPreTree k Children(T S_k ) = Descendants(T S_k ) The subtrees sentAfterTree and recAfterTree with all nodes T as child nodes are merged to obtain the subtree afterTree k . Since each node T Safter_k,q is the post - sibling node of T S_k , and each node T Rafter_k,t is the post - sibling node of T R_k , so the subtrees sentAfterTree Safter_k,q with all nodes T as child nodes k , the subtree with T R_k and all nodes T Rafter_k,t as child nodes recAfterTree k can be merged to construct a subtree afterTree with a parallel operator (symbolized as +) as the root node k . Root(afterTree k ) = Node(+) Children(Node(+)) = sentAfterTree k ∪ recAfterTree k S517 Delete Node. In the Cross-Organization Message Process Tree CMPT, delete the subtree where T R_k is located, all the post-sibling nodes of T S_k . Since T Safter_k,q , all its pre-sibling nodes T R_k , all its post-sibling nodes T Rpre_k,s , all its post-sibling nodes T Rafter_k,t , T S_k , all the post-sibling nodes of T Safter_k,q , and all the descendant nodes of these nodes have been reconstructed in the above steps, and the original structure is no longer needed. Among them, SubTree represents the obtained sub-tree T R_k where it is located. S518 Insert and replace nodes. In the cross-organizational message process tree CMPT, for each pre-sibling node T S_k of T Spre_k,p (p = 0, …, P, assuming that T S_k has P pre-sibling nodes), and all descendant nodes of T Spre_k,p , the structural relationships of these nodes remain unchanged. afterTree k represents the merged relationship of all post-nodes of T S_k and T R_k and all its post-nodes, and inserts it after T S_k to ensure the correct execution order of received messages for all emergency tasks. preTree k represents the merged relationship of all pre-nodes of T S_k and T R_k , and replaces T S_k with it to ensure the correct execution order of sent messages for all emergency tasks. CMPT := InsertAfter(T S_k .parent.operator, T S_k , afterTree k ) ∪ Replace(T S_ k .parent.operator, T S_k , preTree k ) Among them, InsertAfter represents the insert operation, and Replace represents the replace operation. S52 Simplified Nodes. In the reconstructed cross-organizational message process tree, if an operator node has exactly one emergency task node as its child node, or the parent node and grandparent node of an emergency task node are both operator nodes of the same type, then the emergency task node needs to be made a child node of its grandparent node. The relationship between this emergency task node and its descendant nodes remains unchanged, and the operator node that serves as the parent node is deleted.

Images