Description PLM process modeling service flow definition change comparison method and system
By building the PLM business flow definition into a graph structure and using graph traversal and difference detection algorithms, the complexity problem of PLM system in multi-version management is solved, efficient change tracking and visual display is achieved, and the efficiency of business process management is improved. and accuracy.
Patent Information
- Application Number
- CN202411090888.2
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-09
- Publication Date
- 2024-11-22
AI Technical Summary
When managing multiple versions of business flow definitions, existing PLM systems have problems such as phase gate and process management complexity, change tracking difficulties, comparison complexity and lack of visualization tools, resulting in inefficient change management.
The business flow definition is constructed into a graph structure, and the graph traversal algorithm and the difference detection algorithm are used to identify changes in nodes and edges, generate changes reports, and display changes through a visual interface to analyze the impact of changes on business processes.
It has achieved simplification and efficiency improvement of the change comparison process in business process management, improved accuracy and visualization capabilities, and helped users understand and optimize business process changes.
Smart Images

Figure CN119005661A_ABST
Abstract
Description
Technical Field
[0001] The present invention belongs to the technical field of data analysis, and in particular relates to a method and system for comparing changes in business flow definitions for describing PLM process modeling. Background Art
[0002] PLM (Product Lifecycle Management) is a strategic business model that is product-centric and uses application software as a means. It uses a series of consistent business solutions to support the creation, management, distribution and use of product information throughout the entire enterprise and product life cycle (from concept to end of life cycle), integrating many elements such as processes and information. With PLM, enterprises can better manage their knowledge-based assets and strengthen their product innovation, thereby achieving the core competitiveness of "adapting to the market, adapting to demand, and being flexible".
[0003] In the existing PLM system, process modeling is an important part of product development and management. The PLM system supports enterprises to better manage product information and business processes by managing the entire process from product concept to the end of the life cycle. However, the existing PLM system has the following problems when managing multiple versions of business flow definition models, such as the stage-gate model (Note: The stage-gate model is a project management method that divides the project into multiple stages, and there is a review level at the end of each stage. It is a business process model widely used in PLM project management. It divides the project into multiple stages, and there is a review level at the end of each stage to evaluate the progress of the project and decide whether to enter the next stage):
[0004] 1. Complexity of phase gate and process management: In the process of product development, the business process definitions at different stages (such as concept stage, design stage, verification stage, etc.) often undergo multiple iterations and changes. Existing PLM systems mostly use documents and tables to record these changes, which makes it difficult to efficiently manage and track changes.
[0005] 2. Difficulty in change tracking: When faced with multiple versions of business process definitions, the existing system finds it difficult to quickly locate the specific location and impact scope of the change, resulting in inefficient change management.
[0006] 3. Complexity of comparing multiple versions: Manually comparing multiple versions of business flow definitions is time-consuming and error-prone, and it is impossible to intuitively display the differences between different versions.
[0007] 4. Lack of visualization tools: The existing PLM system lacks an intuitive visualization interface and cannot efficiently display different versions of business flow definitions and their changes, making it difficult for users to understand and manage changes in business processes. Summary of the invention
[0008] The present invention aims to solve the above-mentioned technical problems and provides a method and system for comparing changes in business flow definitions for describing PLM process modeling.
[0009] A method for comparing changes in business flow definitions for describing PLM process modeling includes:
[0010] The business flow definition of each version is constructed into a graph structure and stored, wherein the nodes of the graph structure represent the management elements of the business flow, and the edges of the graph structure represent the relationship between the nodes;
[0011] Obtaining two versions of business flow definitions, comparing the two versions of the business flow definitions, identifying changes in nodes and edges, and identifying attribute differences for the same nodes or edges;
[0012] Generate a change report to show the changes in the business flow definition.
[0013] Optionally, the management elements include phases, gates, processes, and process exits;
[0014] Alternatively, the management elements are the various steps of the business flow.
[0015] Optionally, comparing the two versions of the service flow definition to identify changes in nodes and edges includes:
[0016] Use the preset graph traversal algorithm to traverse the nodes and edges defined in the two versions of the business flow, identify the newly added, deleted, and modified nodes and edges, use the preset shortest path algorithm to locate the change points, and determine the optimal change path for the nodes and edges as well as the changed nodes and edges on the path.
[0017] Optionally, the graph traversal algorithm is a depth-first search algorithm (DFS) or a breadth-first search algorithm (BFS).
[0018] Optionally, comparing the two versions of the service flow definition to identify changes in nodes and edges includes:
[0019] The preset A* algorithm is used to compare the two versions of the business flow definition to obtain the optimal change path and the changed nodes and edges on the path.
[0020] Optionally, attribute differences are identified for identical nodes or edges, including:
[0021] Use the preset difference detection algorithm to compare the attribute differences of nodes or edges.
[0022] Optionally, the difference detection algorithm is one of a hash comparison algorithm and a longest common subsequence algorithm.
[0023] Optionally, two versions of the business flow definition are obtained, the two versions of the business flow definition are compared, changes in nodes and edges are identified, and attribute differences are identified for the same nodes or edges, including:
[0024] A preset graph matching algorithm is used to compare the two versions of the business flow definition to obtain changes in nodes, edges and their attributes.
[0025] Optionally, generate a change report to show changes to the business flow definition, including:
[0026] Provides a visual interface to graphically display the business flow definitions of two versions and their changes.
[0027] Optionally, generate a change report to show changes to the business flow definition, including:
[0028] Use preset identifiers to show the changes in nodes and edges between two versions of the business flow definition.
[0029] Optionally, the method for comparing changes in business flow definitions for describing PLM process modeling further includes:
[0030] Analyze the impact of the change on the entire business process, including potential risks and optimization suggestions, and present the impact of the change.
[0031] A system for comparing changes in business flow definitions for describing PLM process modeling, comprising:
[0032] A data module, used to store and manage various versions of business flow definitions in a graph structure, wherein the business flow definitions include nodes, edges and their attributes;
[0033] A construction module, used to construct the business flow definition of each version into a graph structure and store it in the data module, wherein the nodes of the graph structure represent the management elements of the business flow, and the edges of the graph structure represent the relationship between the nodes;
[0034] A change comparison module is used to obtain two versions of business flow definitions, compare the two versions of the business flow definitions, identify changes in nodes and edges, and identify attribute differences for the same nodes or edges;
[0035] The visual interface module is used to generate change reports and display changes in business flow definitions.
[0036] Optionally, the system for comparing changes in business flow definitions for PLM process modeling further includes:
[0037] The change impact analysis module is used to analyze the change impact on the entire business process, the change impact includes potential risks and optimization suggestions, and the change impact is displayed through the visual interface module.
[0038] Beneficial effects: The present invention has at least one or more of the following advantages:
[0039] 1. The present invention represents the traditional business flow definition as a graph structure. When comparing different versions of business flow definitions, it becomes a comparison of nodes and edges. It can intuitively express and compare the changes in the business flow definition, simplify the change comparison process in business process management, and improve the efficiency and accuracy of business process management.
[0040] 2. The present invention realizes efficient tracking and comparison of changes in business flow definitions through graph algorithms.
[0041] 3. The present invention provides an intuitive visual interface, allowing users to quickly understand the differences between different versions.
[0042] 4. Through the change impact analysis module, users can better understand the impact of changes on the overall business process and make effective optimization and adjustments. BRIEF DESCRIPTION OF THE DRAWINGS
[0043] Figure 1 and Figure 2 A schematic diagram of a graph structure defined for two versions of the business flow of the present invention;
[0044] Figure 3 for Figure 1 and Figure 2 Schematic diagram of the comparison results of two versions of business flow definitions. DETAILED DESCRIPTION
[0045] The preferred embodiments of the present invention will be described in detail below in conjunction with the accompanying drawings so that the purpose, features and advantages of the present invention can be more clearly understood. It should be understood that the embodiments shown in the accompanying drawings are not intended to limit the scope of the present invention, but are only intended to illustrate the essential spirit of the technical solution of the present invention.
[0046] In the following description, certain specific details are set forth for the purpose of illustrating the various disclosed embodiments to provide a thorough understanding of the various disclosed embodiments. However, those skilled in the relevant art will recognize that the embodiments may be practiced without one or more of these specific details. In other cases, well-known devices, structures, and techniques associated with the present application may not be shown or described in detail to avoid unnecessarily obscuring the description of the embodiments.
[0047] References throughout the specification to "one embodiment" or "an embodiment" indicate that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment. Thus, the appearances of "in one embodiment" or "in an embodiment" in various places throughout the specification are not necessarily all referring to the same embodiment. Furthermore, the particular features, structures, or characteristics may be combined in any manner in one or more embodiments.
[0048] In the following description, in order to clearly show the structure and working mode of the present invention, many directional words will be used for description, but the words "front", "back", "left", "right", "outside", "inside", "outward", "inward", "up", "down", etc. should be understood as convenient terms and should not be understood as restrictive terms.
[0049] An embodiment of the present invention provides a method for comparing changes in business flow definitions for describing PLM process modeling, the method comprising the following specific steps:
[0050] S1, build graph structure: build and store the business flow definition of each version into a graph structure. The nodes of the graph structure represent the management elements of the business flow, and the edges of the graph structure represent the relationship between the nodes.
[0051] In this step, management elements include phases, gates, processes, and process exits, that is, nodes represent each phase, gate, process, and process exit of the business flow. Management elements can also include each step of demand analysis, design, development, and testing, that is, nodes represent each step of the business flow, and edges represent dependencies or data flow relationships between steps.
[0052] like Figure 1 and Figure 2 Two different versions of business flow definitions are constructed into a graph structure. The nodes of the two different versions of the business flow definitions represent various stages, gates, processes, and process exits.
[0053] S2, change comparison: obtain two versions of business flow definitions, compare the two versions of business flow definitions, identify changes in nodes and edges, and identify attribute differences for the same nodes or edges.
[0054] In this step, user interaction is supported, and an interactive interface can be provided for the user to select specific versions for detailed comparison, so as to determine which two versions of the business flow definition to obtain.
[0055] In this step, the two versions of the business flow definition are compared in terms of nodes, node attributes (or node content), edges, and edge attributes to determine changes in nodes and edges, such as additions, deletions, and modifications. For the same nodes or edges, changes in node attributes or edge attributes are also performed to determine attribute differences.
[0056] In the graph structure of the business flow definition, the properties of the nodes or edges are hidden. When the user clicks the node or edge with the left mouse button, the properties of the node or edge are displayed.
[0057] In some embodiments, in step S2, when identifying changes in nodes and edges, a preset graph traversal algorithm is used to traverse the nodes and edges defined by the two versions of the business flow, identify newly added, deleted, and modified nodes and edges, use a preset shortest path algorithm to locate change points, and determine the optimal change path of the nodes and edges as well as the changed nodes and edges on the path.
[0058] In this step, graph algorithms are used to compare the business flow definitions of the two versions and identify changes in nodes and edges. Specifically, a graph traversal algorithm, such as the depth-first search algorithm (DFS) or breadth-first search algorithm (BFS), is used to traverse the nodes and edges of the business flow definition and identify newly added, deleted, and modified nodes and edges. The shortest path algorithm can identify and track the minimum set of changes, thereby most effectively determining the minimum change from one version to another. The shortest path algorithm is used to locate the change points and analyze the shortest change path (optimal change path) of nodes and edges, so that when a change report is generated later, it can be generated through the shortest change path, which is faster and more reliable.
[0059] Specifically, the graph traversal algorithm is used to fully scan and traverse the graph structure defined by the business flow to ensure that all changes in nodes and edges can be accurately captured. Commonly used graph traversal algorithms include depth-first search algorithm and breadth-first search algorithm.
[0060] The depth-first search algorithm starts from the starting node (such as the "start" node), goes deeper along the unvisited child nodes until it reaches the deepest node (such as the process end node), and then backtracks and continues to search for other unvisited nodes. This method is suitable for detecting all change paths in the graph structure. The specific steps are:
[0061] 1. Initialization: Start from the starting node.
[0062] 2. Visit the node: Select an unvisited child node and record the change information of the node (such as the addition, deletion or modification of the node).
[0063] 3. Recursive Drilling: Continue to visit in depth along the selected child nodes, repeatedly recording the changes of each node until the deepest part of the process is reached or there are no unvisited child nodes.
[0064] 4. Backtracking: If the current node has no unvisited child nodes, backtrack to the previous node and select another unvisited child node to continue going deeper.
[0065] 5. End: When all nodes have been visited and changes have been recorded, the traversal ends.
[0066] The breadth-first search algorithm starts from the starting node, visits all adjacent nodes first, and then goes deeper layer by layer to ensure that all nodes and edges at all levels are visited. This method is suitable for comprehensive scanning of large-scale graph structures. The specific steps are:
[0067] 1. Initialization: Start from the starting node.
[0068] 2. Visit nodes: record the change information of all adjacent nodes at the current level.
[0069] 3. Scan layer by layer: Visit all adjacent nodes of each node layer by layer, record the changes of each node and edge, and ensure that the nodes of each layer are visited.
[0070] 4. Continue scanning: Repeat scanning layer by layer until all nodes are visited and changes are recorded.
[0071] 5. End: When all nodes have been visited and changes have been recorded, the traversal ends.
[0072] The shortest path algorithm is used to locate change points, especially in large-scale graph structures. By calculating the shortest path from the starting point to the end point, the key nodes and edges where changes occur can be quickly located. The specific steps are:
[0073] 1. Graph structure simplification: After preliminary matching, the graph structure is simplified into a subgraph containing only changed nodes and changed edges.
[0074] 2. Shortest path calculation: Use Dijkstra algorithm or Floyd-Warshall algorithm to calculate the shortest path from the starting point to the end point, and mark the change points on the path.
[0075] 3. Change point location: Quickly locate the key change points in the graph structure through the changed nodes and edges on the shortest path for further analysis and processing.
[0076] In some embodiments, in step S2, when identifying changes in nodes and edges, the graph algorithm proposed in the above embodiment may not be used, but the following design may be used:
[0077] The preset A* algorithm is used to compare the business flow definitions of the two versions to obtain the optimal change path and the changed nodes and edges on the path.
[0078] The A* algorithm is used to optimize path selection in a graph structure. It finds the optimal path by combining heuristic estimation and actual cost. The specific steps are as follows:
[0079] 1. Graph structure construction: The business flow definition is represented as a directed graph, where nodes represent business steps and edges represent dependencies or data flow relationships between steps.
[0080] Of course, if the graph structure has been built for the business flow definition, this step can be omitted.
[0081] 2. Heuristic function design: Define the heuristic function h(n) to estimate the minimum cost from the current node n to the target node. Commonly used heuristic functions include Euclidean distance, Manhattan distance, etc.
[0082] 3. Path search: Use a priority queue (such as a heap) to maintain an open list of nodes, and select expansion nodes according to the priority of f(n) = g(n) + h(n), where g(n) is the actual cost from the starting point to node n.
[0083] 4. Path construction: During the expansion process, the predecessor node of each node is recorded, and after finding the target node, the optimal path is constructed by backtracking the predecessor node.
[0084] 5. Result output: Output the optimal path from the starting point to the target node, as well as the changed nodes and edges on the path.
[0085] In some embodiments, in step S2, when attribute differences are identified for the same node or edge, a preset difference detection algorithm is used to compare the attribute differences of the node or edge.
[0086] The difference detection algorithm is used to identify and analyze the specific differences between different versions of business flow definitions, especially the differences in the attributes of nodes and edges. The specific steps are:
[0087] 1. Attribute comparison: For the matched identical nodes and edges, compare their attributes one by one (such as basic node information, input, output, knowledge package, activity, checklist, etc. of node content, weight and type of edge, etc.), and mark the parts with changed attributes.
[0088] 2. Difference statistics: count the attribute changes of all nodes and edges, including added attributes, deleted attributes, and modified attributes.
[0089] In some embodiments, the difference detection algorithm is one of a hash comparison algorithm and a longest common subsequence algorithm.
[0090] The hash comparison algorithm is used to quickly detect differences between different versions of graph structures, and is particularly suitable for large-scale data sets or complex graph structures. The specific steps are:
[0091] 1. Graph structure construction: Each business flow definition is represented as a directed graph, where nodes represent the steps of the business flow definition and edges represent the dependencies or data flow relationships between the steps.
[0092] Of course, if the graph structure has been built for the business flow definition, this step can be omitted.
[0093] 2. Hash value calculation: Calculate the hash value for each node and edge. Commonly used hash algorithms include MD5, SHA-1, etc. The hash value serves as the unique identifier of the node and edge for subsequent comparison.
[0094] 3. Node comparison: By comparing the hash values of the nodes in the two versions, the newly added, deleted and modified nodes are marked. The specific steps are as follows:
[0095] (1) Nodes that exist in the new version but not in the old version are new nodes.
[0096] (2) Nodes that exist in the old version but not in the new version are deleted nodes.
[0097] (3) For nodes that exist in both versions, if the hash values are the same, the node is considered to have not been modified; if the hash values are different, the node attributes are considered to have been modified.
[0098] 4. Edge comparison: By comparing the hash values of the edges in the two versions, mark the newly added, deleted, and modified edges. The specific steps are as follows:
[0099] (1) Edges that exist in the new version but not in the old version are newly added edges.
[0100] (2) Edges that exist in the old version but not in the new version are deleted edges.
[0101] (3) For edges that exist in both versions, if the hash values are the same, the edge is considered to have not been modified; if the hash values are different, the edge attribute is considered to have been modified.
[0102] Based on the results of the hash comparison, a change report is generated, which lists in detail the addition, deletion, and modification information of nodes and edges in different versions of the graph structure.
[0103] The Longest Common Subsequence (LCS) algorithm is used to compare different versions of service flow definitions and find the longest common subsequence, thereby identifying the similarities and differences between versions. The specific steps are:
[0104] 1. Sequence extraction: Extract key step sequences from different versions of business flow definitions.
[0105] 2. Dynamic programming table construction: Construct a two-dimensional dynamic programming dp, where dp[i][j] represents the LCS length of the first i characters of sequence A and the first j characters of sequence B.
[0106] 3. State transfer:
[0107] (1) If A[i-1] == B[j-1], then dp[i][j] = dp[i-1][j-1] + 1;
[0108] (2) Otherwise, dp[i][j] = max(dp[i-1][j], dp[i][j-1]).
[0109] 4. Result backtracking: backtrack from the dynamic programming table to obtain the longest common subsequence, and mark the steps of addition, deletion and modification.
[0110] Based on the LCS results, analyze the similarities and differences in the business flow definitions of different versions, focusing on the added and deleted steps.
[0111] In some embodiments, step S2 uses a preset graph matching algorithm to compare the two versions of the business flow definition to obtain changes in nodes, edges and their attributes.
[0112] The graph matching algorithm is used to compare different versions of business flow definitions, including the addition, deletion, and modification of nodes and edges. The specific steps are:
[0113] 1. Graph structure construction: Each business flow definition is represented as a directed graph, where nodes represent the various steps of the business flow definition (such as requirements analysis, design, development, testing, etc.), and edges represent the dependencies or data flow relationships between steps.
[0114] Of course, if the graph structure has been built for the business flow definition, this step can be omitted.
[0115] 2. Node matching: Perform preliminary matching through the unique identifier of the node (such as node name, ID, etc.), marking the newly added, deleted and modified nodes. Unmatched nodes are newly added nodes; nodes that cannot be found in the new version are deleted nodes; the same nodes that exist in both versions are further compared in their attributes (such as input, output, activity, checklist, etc.).
[0116] 3. Edge matching: By matching the edges (i.e., the connection relationship between nodes) in the two versions, the newly added, deleted, and modified edges are marked. Unmatched edges are newly added edges; edges that cannot be found in the new version are deleted edges; the same edges in the two versions are further compared in their attributes (such as weight, type, etc.).
[0117] S3, display changes: Generate a change report to display the changes in the business flow definition.
[0118] In some embodiments, in this step, a visualization interface may be provided to graphically display the two versions of the business flow definitions and their changes.
[0119] In some embodiments, preset identifiers are used to display changes in nodes and edges between two versions of business flow definitions.
[0120] The mark can be a color, a line, etc. Different colors and lines can be used to indicate different changes, such as the marks shown in the following table:
[0121]
[0122] Therefore, step S2 of the present invention is to Figure 1 and Figure 2 After comparing the two different versions of the business flow definition, a graphical display of the changes is generated, as shown in the following figure: Figure 3 shown.
[0123] The attribute changes of nodes or edges can also be determined using similar definitions as above. For example, when the attributes of two versions of a node or edge are different, it is considered that the attributes of the node or edge have been modified, and the corresponding node or edge state is blue.
[0124] Of course, other methods of display may also be used, such as the table view comparison results shown in the following table:
[0125]
[0126]
[0127] In some embodiments, a method for comparing changes in PLM process modeling business flow definitions is described, further comprising:
[0128] S4, Analyze the impact of changes: Analyze the impact of changes on the entire business process, including potential risks and optimization suggestions, and demonstrate the impact of changes.
[0129] Specifically, the Failure Modes and Effects Analysis (FMEA) analysis model can be used to analyze the impact of the change on the entire business process.
[0130] A specific analysis step of the FMEA analysis model is as follows:
[0131] 1. Define the scope of analysis
[0132] 1.1. Identify changes
[0133] Node change: Add, delete or modify nodes in the business process (such as stages, processes, gates).
[0134] Edge changes: adding, deleting, or modifying dependencies or data flows between nodes.
[0135] 1.2. Determine the business process
[0136] Determine the specific business process or module that needs to be analyzed and collect the corresponding data from the preset data source.
[0137] 2. Identify potential failure modes
[0138] 2.1 Determine the failure mode
[0139] For each change (such as adding a new node or deleting an edge, etc.), identify possible failure modes. For example:
[0140] New nodes: The nodes have not been fully tested and may cause system instability.
[0141] Deleting nodes: Deleting critical nodes may result in data loss or process disruption.
[0142] Edge changes: Modifying dependencies may cause data flow problems or resource bottlenecks.
[0143] 2.2. List potential consequences
[0144] Identify the possible consequences of each failure mode. For example:
[0145] Adding more nodes may result in increased processing time.
[0146] Node deletion may cause data inconsistency.
[0147] Changes in edge attributes may lead to resource allocation errors.
[0148] 3. Evaluate the impact of failure modes
[0149] 3.1. Determine the severity of the impact
[0150] Assess the severity of the impact of each potential failure mode on the business process, typically using a 1 to 10 rating system, with 1 being a minimal impact and 10 being a severe impact.
[0151] 3.2. Determine the probability of failure
[0152] Assess the probability of each failure mode occurring using a rating system of 1 to 10, with 1 being extremely unlikely and 10 being extremely likely.
[0153] 3.3. Determine the difficulty of fault detection
[0154] Rate the ease of identifying and detecting each failure mode. Use a rating system of 1 to 10, with 1 being easy to detect and 10 being difficult to detect.
[0155] 3.4. Calculate the Risk Priority Number (RPN)
[0156] RPN = severity score × probability of occurrence score × detection difficulty score.
[0157] The RPN value is used to prioritize fault modes, the higher the RPN value, the higher the priority of the fault.
[0158] 4. Develop improvement measures
[0159] 4.1. Determine improvement measures: Determine improvement measures for each failure mode based on the RPN value. For example:
[0160] High RPN: Immediate action is required, such as increasing testing, modifying the design, or introducing additional control steps.
[0161] Medium RPN: Improvements can be planned for the future, such as optimizing processes and increasing monitoring.
[0162] Low RPN: ongoing concern, no immediate action required.
[0163] 4.2. Implement improvement measures
[0164] Implement identified improvement measures and document implementation process.
[0165] 4.3 Re-evaluation
[0166] After implementing improvement measures, re-evaluate the impact, probability of occurrence, and ease of detection of the failure mode and update the RPN value.
[0167] 5. Records and Reports
[0168] 5.1. Record FMEA results
[0169] Record detailed information for each failure mode, including failure mode, consequence, severity, probability of occurrence, ease of detection, RPN, and improvement measures.
[0170] 5.2. Generate FMEA report
[0171] Create a FMEA report summarizing the analysis results and improvement measures. The report should include the priority of failure modes, improvement plan and implementation status.
[0172] 5.3. Providing suggestions
[0173] Based on the FMEA analysis results, we provide optimization suggestions and improvement plans for business process changes.
[0174] Example:
[0175] Assuming that a new node "Approval Link" is added, the possible FMEA analysis steps are as follows:
[0176] Failure mode: The newly added node "Approval Link" causes approval delays.
[0177] Consequence: The total time of the entire process increases, which may affect the delivery time.
[0178] Severity: Rating: 8 (seriously affects business progress).
[0179] Probability of occurrence: Rating: 5 (medium likelihood).
[0180] Detection difficulty: Score: 6 (difficult to detect).
[0181] RPN: 8 (severity) x 5 (probability of occurrence) x 6 (difficulty of detection) = 240
[0182] Improvement measures: Add a testing phase before the node to ensure the processing efficiency of the approval process.
[0183] Implementation and re-evaluation: After implementing the improvement measures, re-evaluate the impact and detection difficulty of the "approval link".
[0184] An embodiment of the present invention further provides a system for comparing changes in business flow definitions for describing PLM process modeling, the system comprising:
[0185] The data module is used to store and manage various versions of business flow definitions in the form of graph structures. Business flow definitions include nodes, edges, and their attributes.
[0186] A construction module is used to construct the business flow definition of each version into a graph structure and store it in the data module. The nodes of the graph structure represent the management elements of the business flow, and the edges of the graph structure represent the relationship between the nodes.
[0187] The change comparison module is used to obtain two versions of business flow definitions, compare the two versions of business flow definitions, identify changes in nodes and edges, and identify attribute differences for the same nodes or edges;
[0188] The visual interface module is used to generate change reports and display changes in business flow definitions.
[0189] In some embodiments, a PLM process modeling business flow definition change comparison system is described, further comprising:
[0190] The change impact analysis module is used to analyze the impact of changes on the entire business process. The change impact includes potential risks and optimization suggestions, and the change impact is displayed through a visual interface module.
[0191] The preferred embodiments of the present invention have been described in detail above, but it should be understood that after reading the above teachings of the present invention, those skilled in the art may make various changes or modifications to the present invention. These equivalent forms also fall within the scope defined by the appended claims of this application.
Claims
1. A method for comparing changes in business flow definitions for PLM process modeling, characterized in that: include: The business flow definition of each version is constructed into a graph structure and stored, wherein the nodes of the graph structure represent the management elements of the business flow, and the edges of the graph structure represent the relationship between the nodes; Obtaining two versions of business flow definitions, comparing the two versions of the business flow definitions, identifying changes in nodes and edges, and identifying attribute differences for the same nodes or edges; Generate a change report to show the changes in the business flow definition.
2. The method for comparing changes in business flow definitions for describing PLM process modeling according to claim 1, characterized in that: The management elements include phases, gates, processes, and process exits; Alternatively, the management elements are the various steps of the business flow.
3. The method for comparing changes in business flow definitions for describing PLM process modeling according to claim 1, characterized in that: Compare the two versions of the business flow definition to identify changes in nodes and edges, including: Use the preset graph traversal algorithm to traverse the nodes and edges defined in the two versions of the business flow, identify the newly added, deleted, and modified nodes and edges, use the preset shortest path algorithm to locate the change points, and determine the optimal change path for the nodes and edges as well as the changed nodes and edges on the path; The graph traversal algorithm is preferably not a depth-first search algorithm or a breadth-first search algorithm.
4. The method for comparing changes in business flow definitions for describing PLM process modeling according to claim 1, characterized in that: Compare the two versions of the business flow definition to identify changes in nodes and edges, including: The preset A* algorithm is used to compare the two versions of the business flow definition to obtain the optimal change path and the changed nodes and edges on the path.
5. The method for comparing changes in business flow definitions for describing PLM process modeling according to any one of claims 1 to 4, characterized in that: For the same nodes or edges, attribute differences are identified, including: Use the preset difference detection algorithm to compare the attribute differences of nodes or edges; The difference detection algorithm is preferably one of a hash comparison algorithm and a longest common subsequence algorithm.
6. The method for comparing changes in business flow definitions for describing PLM process modeling according to claim 1 or 2, characterized in that: Obtain two versions of the business flow definition, compare the two versions of the business flow definition, identify changes in nodes and edges, and identify attribute differences for the same nodes or edges, including: A preset graph matching algorithm is used to compare the two versions of the business flow definition to obtain changes in nodes, edges and their attributes.
7. The method for comparing changes in business flow definitions for describing PLM process modeling according to claim 1, characterized in that: Generate a change report to show the changes in the business flow definition, including: Provides a visual interface to graphically display the business flow definitions of two versions and their changes; Use preset identifiers to show the changes in nodes and edges between two versions of the business flow definition.
8. The method for comparing changes in business flow definitions for describing PLM process modeling according to claim 1, characterized in that: The method for comparing changes in business flow definitions for PLM process modeling also includes: Analyze the impact of the change on the entire business process, including potential risks and optimization suggestions, and present the impact of the change.
9. A system for comparing changes in business flow definitions for PLM process modeling, characterized in that: include: A data module, used to store and manage various versions of business flow definitions in a graph structure, wherein the business flow definitions include nodes, edges and their attributes; A construction module, used to construct the business flow definition of each version into a graph structure and store it in the data module, wherein the nodes of the graph structure represent the management elements of the business flow, and the edges of the graph structure represent the relationship between the nodes; A change comparison module is used to obtain two versions of business flow definitions, compare the two versions of the business flow definitions, identify changes in nodes and edges, and identify attribute differences for the same nodes or edges; The visual interface module is used to generate change reports and display changes in business flow definitions.
10. The system for comparing changes in business flow definitions for describing PLM process modeling according to claim 9, characterized in that: The system for comparing changes in business flow definitions for PLM process modeling also includes: The change impact analysis module is used to analyze the change impact on the entire business process, the change impact includes potential risks and optimization suggestions, and the change impact is displayed through the visual interface module.
