Architecture model activity graph rapid design updating verification method based on activity blocks

Abstract

The invention relates to the technical field of activity graph updating, in particular to a method for quickly designing, updating and verifying an architecture model activity graph based on an activity block, and aims to improve the efficiency and accuracy of activity graph updating through an intelligent means. The method includes selecting a region to be updated, editing the region and generating a standardized logic fragment, and fusing an editing result with an original activity map. Through intelligent expansion, logic generation and a layout algorithm, a dependency relationship between nodes and a control flow path are automatically deduced, and consistency and accuracy of an activity graph in a design process are ensured. According to the method, the updating process of the activity graph is simplified, manual operation is reduced, and the processing capacity of large-scale complex graphs is improved.

Description

Technical Field

[0001] The present invention relates to the technical field of activity diagram updating, and particularly to a method for quickly designing, updating, and verifying an activity diagram of an architecture model based on activity blocks. Background Art

[0002] In the current field of activity diagram design and updating, as the architecture model becomes increasingly complex, the activity diagram, as a commonly used visual modeling tool, is widely used in software development, business process modeling, and system analysis. However, there are still some challenges in the rapid design, updating, and verification of activity diagrams in the prior art. In the traditional activity diagram design and updating process, designers usually rely on manual operations to modify the nodes and paths in the activity diagram. This method is not only time-consuming and laborious but also prone to design errors. For example, when a node in the activity diagram changes, the designer needs to manually adjust all the connection paths, dependencies, and control flows related to that node. Such operations often involve the update of complex logical relationships and dependency chains, increasing the difficulty of design and the possibility of errors.

[0003] The above patents all have the problems proposed in this background art: the lack of a flexible area selection and update expansion mechanism. To solve the above problems, this application designs a method for quickly designing, updating, and verifying an activity diagram of an architecture model based on activity blocks. Summary of the Invention

[0004] The technical problem to be solved by the present invention is to provide a method for quickly designing, updating, and verifying an activity diagram of an architecture model based on activity blocks in view of the deficiencies of the prior art, aiming to improve the efficiency and accuracy of activity diagram updating through intelligent means. The method includes selecting the area to be updated, editing the area and generating a standardized logical segment, and integrating the editing result with the original activity diagram. Through intelligent expansion, logic generation, and layout algorithms, the dependency relationships and control flow paths between nodes are automatically deduced to ensure the consistency and accuracy of the activity diagram during the design process. This method not only simplifies the activity diagram update process but also reduces manual operations and improves the processing ability of large-scale complex graphics.

[0005] To achieve the above object, the present invention provides the following technical solutions:

[0006] A method for quickly designing, updating, and verifying an activity diagram of an architecture model based on activity blocks, the method comprising:

[0007] Selecting the area to be updated in the activity diagram interface through an interaction device, the area to be updated being displayed in the form of a dynamic box, the dynamic box including activity blocks and logical relationships related to the enclosed range;

[0008] Generate a pop-up edit box corresponding to the area to be updated, and edit the area to be updated in the pop-up edit box;

[0009] Convert the editing result into a standardized logic fragment through a logic generation box, and fuse the standardized logic fragment with the original activity diagram according to the layout algorithm.

[0010] The selection of the area to be updated includes:

[0011] Perform a selection operation in the activity diagram interface through an interaction device to determine the initial update range. Among them, the selection operation includes a box selection operation, a node operation, and a path operation;

[0012] Combine the topological structure of the activity diagram to intelligently expand the initial update range;

[0013] Highlight the expanded area to be updated in the activity diagram interface through a dynamic box, perform a logical check on it, mark it as the area to be updated after passing the check, and re-expand it if the check fails.

[0014] The intelligent expansion includes:

[0015] Determine the directly connected nodes of each node in the initial update range through the topological structure of the activity diagram, obtain the connection strength between the node and the directly connected nodes, and calculate the node connectivity;

[0016] Identify the other nodes on which each node depends by analyzing the function and role of each node in the initial update range, and calculate the node dependency according to the dependency strength;

[0017] Derive the dynamic dependency chain between nodes according to the node connectivity and node dependency, and calculate the priority of the node path according to the dynamic dependency chain;

[0018] Compare with the merging threshold according to the priority, and merge the node paths greater than or equal to the merging threshold into the initial update range.

[0019] The calculation formula for the priority of the node path is:

[0020]

[0021] Among them, P represents the priority of the node path, i represents the starting point of the node path, j represents the ending point of the node path, k represents the points other than the starting point in the node path, f ( · ) represents the connectivity calculation function, C i represents the connection strength of node i, C j represents the connection strength of node j, C krepresents the connection strength of node k, and log represents the logarithmic function with base 2, dist ( i,k ) represents the path distance between node i and node k, Con ( i,j ) represents the degree of dependence between node i and node j, and D represents the total path distance from the path nodes to node i.

[0022] The pop-up edit box includes:

[0023] An attribute modification tool for displaying the attribute information of the selected node or path and supporting direct editing or modification of the attribute values, where the attribute information includes node type, execution order, and input / output conditions;

[0024] A logic modification tool for modifying the connections between nodes and the logical relationship between nodes through dragging or graphical operations, where the logical relationship includes dependence relationship, control flow path, and conditional judgment;

[0025] A structure preview tool for displaying a preview screen of the editing result during the editing process.

[0026] The editing of the area to be updated includes:

[0027] Select the node or path to be edited in the dynamic box through an interactive device, determine the target area to be modified, and display the attribute information and logical relationship according to the target area;

[0028] During the editing process, determine the relationship changes between nodes through an intelligent derivation strategy, and update the node connectivity and node dependence of the nodes in the target area;

[0029] Automatically adjust the connection relationship and path order between nodes according to the updated node connectivity and node dependence.

[0030] The intelligent derivation strategy includes:

[0031] During the editing process, analyze the relationship changes between each node and its adjacent nodes according to the captured node editing operations;

[0032] According to the relationship changes, deduce the dynamic dependence relationship between the nodes in the target area, and update the connection paths and dependence chains between the nodes;

[0033] According to the update situation of each node in the target area, update the priority of the node paths, and adjust the control flow path between the nodes according to the change of the path priority.

[0034] The logic generation box includes:

[0035] A standardization conversion tool for converting editing operations into standardized logical fragments that conform to a unified specification;

[0036] A function verification tool for verifying the functions of the generated standardized logical fragments;

[0037] A dependency relationship conversion tool for ensuring that the converted standardized logical fragments are consistent with the existing dependency relationships in the original activity diagram.

[0038] The layout algorithm includes:

[0039] Adjust the positions of the edited nodes according to the spatial layout of the activity diagram and the relationships between the nodes;

[0040] Map the edited logical fragments to the paths in the original activity diagram, check the connection relationships between the new fragments and the original paths, and adjust the path order according to the execution flow of the activity diagram;

[0041] Analyze the paths of the control flow in the activity diagram and adjust the control flow order of the edited nodes according to the execution priority of the control flow and the path dependency relationships.

[0042] A rapid design update verification system for an activity diagram of an architecture model based on activity blocks, the system includes a selection and extension module, an editing and derivation module, a logic verification module, and a layout adjustment module;

[0043] The selection and extension module is used to perform selection operations in the activity diagram interface through an interactive device to determine the initial update range and perform intelligent extension according to the topological structure of the activity diagram;

[0044] The editing and derivation module is used to modify the attributes of nodes or paths and adjust the logical relationships in a pop-up editing box, analyze the changes in the relationships between nodes according to the user's editing operations, update the node connectivity and dependencies, deduce the dynamic dependency chain between nodes, and adjust the priorities of node paths and the control flow paths;

[0045] The logic verification module is used to convert the editing results into standardized logical fragments and verify the functions of the generated logical fragments;

[0046] The layout adjustment module is used to adjust the positions of the edited nodes according to the spatial layout rules of the activity diagram and the relationships between the nodes.

[0047] Compared with the prior art, the beneficial effects of the present invention are:

[0048] 1. The present invention selects the area to be updated through an interactive device and dynamically displays it, and performs intelligent extension in combination with the topological structure of the activity diagram to ensure that the updated area is comprehensively covered without omission;

[0049] 2. The present invention automatically adjusts the connection relationships and dependencies between nodes through an intelligent derivation strategy, ensuring the logical consistency and correctness of each node and path in the activity diagram. Meanwhile, the combination of a standardized conversion tool and a function verification tool makes the edited logical fragments conform to a unified specification, ensuring the compatibility and reliability of design updates. BRIEF DESCRIPTION OF THE DRAWINGS

[0050] Other features, objectives, and advantages of the present invention will become more apparent by reading the following detailed description of non-limiting embodiments with reference to the accompanying drawings:

[0051] Figure 1 It is a schematic flowchart of a method for quickly designing, updating, and verifying an activity diagram of an architecture model based on activity blocks according to Embodiment 1 of the present invention;

[0052] Figure 2 It is a schematic flowchart of an initial scope delineation process according to Embodiment 1 of the present invention; Figure 3 It is a schematic flowchart of an intelligent expansion process according to Embodiment 1 of the present invention; Figure 4 It is a module diagram of a system for quickly designing, updating, and verifying an activity diagram of an architecture model based on activity blocks according to Embodiment 2 of the present invention. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0053] Next, the technical solutions in the embodiments of the present invention will be clearly and completely described in conjunction with the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all of the embodiments.

[0054] Embodiment 1:

[0055] Please refer to Figure 1 , an embodiment provided by the present invention: A method for quickly designing, updating, and verifying an activity diagram of an architecture model based on activity blocks, and the specific steps of the method are as follows:

[0056] S1: Select the area to be updated;

[0057] In this step, a selection operation is performed on the activity diagram interface through an interaction device (such as a mouse, touch screen, etc.) to mark out the area that needs to be updated. The selected area will be presented through a dynamic box to facilitate highlighting this part of the content. The area to be updated includes a set of activity blocks in the activity diagram and the logical relationships between them. It is possible to accurately determine which areas need to be edited, thus laying a foundation for subsequent operations;

[0058] S2: Edit the area to be updated;

[0059] In this step, detailed editing is performed on the area to be updated selected in step S1. An intuitive operation interface is provided through a pop-up editing box, allowing modification of nodes or connections within the area, including node attributes (such as execution order, input / output conditions, etc.) and the logical relationships between nodes (such as dependency relationships, control flow paths, etc.). This editing box supports graphical operations, ensuring that adjustments can be made intuitively and modifying the logical structure and connection methods of the active blocks as needed;

[0060] S3: Convert and merge the updated content;

[0061] In this step, the edited content needs to be standardized and merged. The editing results will be converted into standard logical fragments through a logic generation box. The converted standardized logical fragments will be merged with the logical structure in the original activity diagram, and their positions will be automatically adjusted through a layout algorithm to ensure that all parts of the activity diagram can be reasonably connected and matched. The key to this step is to ensure that the edited content not only complies with the specifications but also can be correctly connected to other parts of the original activity diagram, maintaining the integrity and consistency of the activity diagram;

[0062] Please refer to Figure 2 , the schematic diagram of the initial scope delineation process of the embodiment of the present invention, and the specific steps of S1 are as follows:

[0063] S1.1: Perform a selection operation in the activity diagram interface through an interaction device to determine the initial update scope, where the selection operation includes a box selection operation, a node operation, and a path operation;

[0064] The box selection operation selects a rectangular area in the activity diagram by dragging the mouse or touching the screen. This operation is applicable to scenarios where a large area needs to be selected for editing;

[0065] The node operation selects a specific node and its associated nodes around it for update by clicking on the specific node. It is applicable to situations where a single node and its adjacent nodes need to be modified;

[0066] The path operation specifies the control flow path to be updated by selecting the path between nodes. This operation is used to adjust the control flow path to ensure that the process of the activity diagram conforms to the new requirements;

[0067] Through these three selection operations, the target area in the activity diagram can be accurately selected, and then the relationships between active blocks can be understood based on the topological structure of the diagram to accurately locate the area to be updated without modifying the entire graph. Compared with traditional methods, the update area can be flexibly specified, avoiding unnecessary interference. S1.2: Combine the topological structure of the activity diagram to intelligently expand the initial update scope;

[0068] In this step, the initially selected update area is intelligently expanded according to the topological structure of the activity diagram and the relationships between nodes. The scope of expansion is not limited to the initial area selected by the user. Instead, through algorithm analysis of its relationships with adjacent nodes, it is determined which nodes should be included in the update scope. For example, if a certain node is selected for update, all the nodes and paths directly associated with this node are automatically expanded according to the dependencies of this node;

[0069] S1.3: Highlight the expanded area to be updated in the activity diagram interface through a dynamic box, perform logical verification on it. After the verification passes, it is marked as the area to be updated. If the verification fails, expand it again;

[0070] Specifically, traditional activity diagram editing methods usually select and modify nodes or paths in the activity diagram manually, lacking intelligent analysis and verification of the diagram structure. Therefore, it is prone to situations of improper selection or logical conflicts in large-scale activity diagrams. However, the present invention greatly improves the accuracy and efficiency of editing by combining intelligent expansion and automatic verification based on the topological structure of the activity diagram. For example, in the prior art, if a user selects a certain node for update, the system may fail to automatically consider other nodes and paths related to this node, resulting in some key relationships being missed. However, through intelligent expansion and logical verification, the present invention can ensure that all relevant nodes and paths are included in the update scope, avoiding this situation and thus enhancing the intelligence level of activity diagram editing;

[0071] Traditional activity diagram editing methods usually rely on manual selection to connect nodes, or only select the update area based on the physical adjacency relationship of nodes. This method is prone to ignoring the complex dependency relationships between nodes, resulting in incomplete or inaccurate expansion of the update area. For example, in a complex activity diagram, some nodes may not have direct adjacent relationships, but they are indirectly dependent through multiple paths. Traditional methods are likely to miss these important indirect connections. Please refer to Figure 3 , the schematic diagram of the intelligent expansion process of the embodiment of the present invention. The specific steps of S1.2 are as follows:

[0072] S1.2.1: Determine the directly connected nodes of each node in the initial update scope through the topological structure of the activity diagram, obtain the connection strength between this node and the directly connected nodes, and calculate the node connectivity. Node connectivity refers to the direct connection strength between a certain node and its adjacent nodes;

[0073] In this step, by analyzing the topological structure of the activity diagram, the direct connection nodes of each node within the initial update scope are first determined. The topological structure of the activity diagram is usually a directed graph, where nodes represent activities and edges represent the logical relationships or control flows between activities. To expand the update area, it is necessary to understand the direct connection relationships of each node. These connection nodes may be nodes that depend on or are depended on by this node. Next, obtain the connection strength between these direct connection nodes and calculate the connectivity of each node. The connection strength is a quantified value;

[0074] Calculating the connection strength by analyzing data flows, control flows, etc. between nodes provides a quantified relationship strength indicator, making the expansion process more intelligent and accurate. By calculating the connectivity between each node and other nodes, it is possible to identify which nodes have strong relationships in the activity diagram and which nodes may need to be considered first during the update process;

[0075] Specifically, in the activity diagram, the connection strength between nodes is closely related to the roles and functions they play in the diagram. The connection strength reflects the degree of interaction between a node and other nodes. Therefore, when calculating the node connectivity, analyze the data flow and control flow of each node based on the topological structure, and quantify its importance based on the connection strength between nodes. By identifying the position of each node in the activity diagram and its relationship with other nodes, ensure that nodes with strong relevance are processed first when expanding the update scope.

[0076] S1.2.2: Identify other nodes that each node depends on by analyzing the functions and roles of each node within the initial update scope, and calculate the node dependency based on the dependency strength;

[0077] In this step, according to the topological structure of the activity diagram, analyze the functions and roles of each node within the update scope to identify other nodes that this node depends on. Dependency relationships mainly include dependencies on the control flow and dependencies on the data flow. Evaluate the dependency strength of each node on other nodes based on these relationships. Specifically, node dependency refers to whether the execution or state of a certain node depends on the execution results or states of other nodes, and the methods for measuring the dependency strength include:

[0078] Control flow dependency, according to whether the execution of a node needs to depend on the execution order of other nodes. For example, whether the execution of a certain node needs to pass through a precondition node first.

[0079] Data flow dependency, according to whether a certain node needs data provided by other nodes as input. For example, whether a certain calculation node depends on the calculation results of other nodes.

[0080] The functions and roles of each node need to be identified through the topological structure of the graph and the analysis of node attributes. The function of a node determines its dependencies. Through topological relationships and execution flow rules, it is identified which nodes are dependencies of the current node. Dependency strength calculation is not only about determining whether there is a dependency relationship between nodes, but also through the analysis of control flow and data flow, a strength value is given for each pair of dependent nodes. A high-strength dependency relationship indicates a close relationship between these two nodes and they must be updated synchronously;

[0081] Specifically, through the analysis of control flow and data flow, the dependency relationships between nodes can be identified. The principle of dependency calculation is to analyze the connections between each node and its adjacent nodes to determine the degree of dependency between these nodes. For example, for a node A, if it depends on the execution result (data flow) of node B, then the execution of A needs to wait until B is completed, and the dependency strength is relatively high. Dependency calculation is not only the identification of static relationships, but also involves the adjustment of dynamic relationships, because the dependencies between nodes will change with the editing operations of the activity graph. Through the precise calculation of node dependencies, it is possible to better identify which nodes play a core role in the topological graph and can effectively provide a basis for subsequent update or modification operations. For example, when updating a certain node, the system can automatically extend to all its direct or indirect dependent nodes to ensure that the modification does not miss affecting relevant nodes and avoid the risk of ignoring the dependency relationships between nodes in traditional methods.

[0082] S1.2.3: According to the node connectivity and node dependencies, deduce the dynamic dependency chain between nodes, and calculate the priority of the node path according to the dynamic dependency chain. The path priority reflects the importance of the node and the path in the entire activity graph process. The calculation formula for the priority of the node path is:

[0083]

[0084] where P represents the priority of the node path, i represents the starting point of the node path, j represents the ending point of the node path, k represents the points other than the starting point in the node path, f ( · ) represents the connectivity calculation function, C i represents the connection strength of node i, C j represents the connection strength of node j, C k represents the connection strength of node k, log represents the logarithmic function with base 2, dist ( i,k ) represents the path distance between node i and node k, Con ( i,j ) represents the degree of dependency between node i and node j, and D represents the total path distance from the path node to node i;

[0085] In this step, the system combines the connectivity and dependency information of each node in the activity diagram to derive the dynamic dependency chain between nodes, and calculates the priority of the node paths based on this dependency chain. The core of this process is to analyze the topological structure of the activity diagram and the logical relationships between nodes to obtain the priority order of node paths, so as to accurately handle the adjustment of nodes and paths in the subsequent update process;

[0086] The dynamic dependency chain refers to the path of interaction and dependency between nodes under specific conditions. As the activity diagram is updated and the execution flow changes, the dependency relationships between nodes will also change, forming different dependency chains. Based on the dynamic execution flow of the activity diagram, the dependency chains of different node paths are derived to predict the priority and impact of each node path during the execution of the activity diagram;

[0087] Specifically, based on the dependency analysis and path priority sorting principles in graph theory, combined with the topological structure of the activity diagram, the dynamic dependency chain is derived by calculating node connectivity and dependency, and finally the priority of each path is obtained. Paths with high dependency usually need to be executed first because they are key steps for subsequent execution. Paths with strong connectivity also have a higher priority because they play a connecting role in the execution flow of the activity diagram. If the execution of this path is improper, it will affect the execution of multiple other paths;

[0088] Traditional activity diagram editing methods usually rely on manually setting the priority of each node and path, or only sorting paths based on the direct connection relationships between nodes. This method is relatively simple, vulnerable to human factors, and difficult to handle the indirect relationships or conditional dependencies between nodes in complex graphs, resulting in errors or omissions easily occurring during the update process. By intelligently deriving the dependency chain and calculating the priority of node paths, the problem of inaccurate determination of node path priorities in traditional methods is solved. For example, in a complex activity diagram containing multiple conditional judgments, the traditional method may not be able to correctly identify the key nature of a certain node path during execution, resulting in the failure to adjust the order of relevant paths in a timely manner during the update. However, through the derivation of the dynamic dependency chain in the present invention, it is possible to accurately determine which paths need to be executed first, ensuring the efficiency and correctness of the activity diagram update. For example, there is a complex dependency relationship between a certain node A and B. The traditional method may not consider this complexity, while the present invention can accurately identify and optimize the update path based on dependency and connectivity, ensuring the completeness of the activity diagram logic.

[0089] S1.2.4: Compare according to the said priority with the merging threshold, and merge the node paths greater than or equal to the merging threshold into the initial update range.

[0090] In this step, the calculated node path priorities are compared with the set merging threshold to automatically determine which node paths should be included in the update scope. The merging threshold is a preset value used to define the critical value of the "importance" or "influence" of node paths during the topology expansion process. The higher the path priority, the greater the importance of the path to the update area, and it should be preferentially included in the update scope.

[0091] Specifically, the calculation of the priority takes into account the connectivity between nodes (i.e., the strength of the direct connection between nodes) and the dependency (i.e., the functional dependency of a node on other nodes). A high priority of a node path means that it has a greater role and influence in the activity diagram, so it must be given priority consideration during the update process. By comparing with the merging threshold, the system can intelligently screen out the paths that need to be merged, ensure the rationality of the expansion scope, automatically screen out the paths that are most important for the update of the activity diagram, and merge them into the initial update area, thus ensuring the integrity and accuracy of the update.

[0092] The activity diagram update methods in the prior art often rely on manual selection and rough area expansion, lacking an intelligent path screening mechanism. For example, traditional activity diagram update methods may wrongly include some redundant paths or low-priority paths in the update area, resulting in redundancy and inconsistency of the graph. However, the present invention can automatically exclude those unnecessary paths by introducing an intelligent comparison of priorities and merging thresholds, making the update area more concise and targeted. Such an automated screening mechanism not only improves the efficiency of the update process but also avoids logical errors caused by human selection mistakes.

[0093] In addition, the expansion of the update scope in traditional methods is usually static and does not consider the dynamic dependencies between nodes. However, the present invention expands and merges the update scope based on the dynamic derivation of the priorities of node paths and the actual topological relationship and dependencies, making the update process more in line with the actual structure and requirements of the activity diagram.

[0094] The specific steps of S2 are as follows:

[0095] S2.1: Select the nodes or paths to be edited within the dynamic box through the interaction device, determine the target area to be modified, and display the attribute information and logical relationship according to the target area.

[0096] In this step, nodes or paths to be edited are selected in the dynamic box through an interaction device (such as a touch screen, mouse, etc.). The selection of the target area is not limited to a single node, but can also be the connection path between nodes. The system will display all relevant attribute information and logical relationships within this area according to the selected target area. Specifically, the attribute information includes the type of the node, the execution order, input and output conditions, etc.; the logical relationships include the dependency relationship between nodes, the control flow path, conditional judgment, etc. The display method is usually a graphical interface to help users quickly identify and operate the required content. Users can directly modify these attributes or logical relationships in the editing box to achieve precise adjustment of the activity diagram.

[0097] Through this step, the required area can be quickly located and edited to ensure that the modification of the activity diagram can meet the design requirements. The use of the dynamic box makes the selection of the area to be updated clearer, and the display and editing of all information are concentrated in one interface, improving the operation efficiency and accuracy;

[0098] S2.2: During the editing process, determine the relationship changes between nodes through an intelligent derivation strategy, and update the node connectivity and node dependencies of the nodes in the target area;

[0099] Specifically, when modifying the attributes or logical relationships of a certain node, the changes in the adjacent nodes, paths, and dependency relationships are derived according to the topological structure of the activity diagram. For example, if the execution order or input and output conditions of a certain node are adjusted, it will be derived according to the topological rules whether the other nodes dependent on this node change, and the connectivity and dependencies between nodes will be automatically updated. At this time, the new connection strength and dependency degree can be calculated, and the dynamic relationships between the nodes in the activity diagram can be updated accordingly, so that the relationship changes between the nodes can be automatically calculated and updated, avoiding the cumbersome process of manual modification and calculation, and reducing the error rate of manual operations.

[0100] S2.3: Automatically adjust the connection relationships and path orders between nodes according to the updated node connectivity and node dependencies;

[0101] In this step, the connection relationships and path orders between nodes are automatically adjusted according to the updated node connectivity and dependencies. Specifically, by evaluating the connection strength and dependency degree between nodes, a new path order is calculated to ensure that the logical flow and execution order of the activity diagram meet the expectations. If the connection relationship between nodes changes, the path direction is automatically adjusted or the order of the control flow is modified to ensure the consistency of each part in the diagram and avoid logical conflicts.

[0102] Specifically, in traditional activity diagram editing tools, it is necessary to manually adjust the dependency relationships and connection orders between nodes, which not only increases the complexity of operations but also easily leads to logical conflicts. For example, when the input conditions of a certain node are modified, the relationships between this node and other nodes cannot be automatically updated, resulting in logical conflicts or inconsistent path orders in the diagram. Eventually, users need to manually adjust multiple parts, which is very time-consuming and error-prone in complex activity diagrams. The present invention automatically updates the dependency relationships between nodes and adjusts the order of node paths according to the updated connectivity and dependency. Taking a simple example, assume that a user modifies the input conditions of a certain node in the activity diagram. At this time, the system will automatically deduce the relationship changes between this node and other nodes and accordingly adjust the path order without user intervention. This not only greatly reduces the burden of manual operations but also improves the accuracy and efficiency of activity diagram updates. Especially in complex activity diagrams, automated updates and adjustments can effectively avoid human errors and save a large amount of editing time;

[0103] The specific steps of the intelligent deduction strategy are as follows:

[0104] S2.2.1: During the editing process, analyze the relationship changes between each node and its adjacent nodes according to the captured node editing operations;

[0105] In this step, the system first captures the modification operations of nodes or paths by the user during the editing process. These modification operations include attribute adjustments of nodes, changes in connection relationships between nodes, and redirection of logical paths. By tracking the node editing operations, the system uses the topological structure of the activity diagram (such as nodes, edges, paths, etc.) to analyze the relationship changes between nodes in real time. For example, if the input-output relationship of a node changes, the system will analyze its impact on the nodes and paths connected to it and conduct subsequent step deductions based on this. This analysis process includes not only the direct connection relationships between nodes but also more complex indirect dependencies and influence relationships. In this way, the system can reflect the dynamic changes between nodes in the editing process in real time.

[0106] Specifically, this step relies on the real-time topology monitoring of the activity diagram and the tracking analysis of the changes in node relationships. Through the update of the graph structure, every relationship change between a node and its adjacent nodes can be captured. This method ensures that all relationship changes during the editing process can be accurately captured, avoiding omissions or incorrect derivations. Using the adjacency matrix or adjacency list in graph theory to describe the relationships between nodes, the relationship weights (such as dependence strength, execution order, etc.) between a node and its adjacent nodes can be updated in a timely manner according to the editing operation of each node. By analyzing these changes, the dynamic relationships between nodes are derived, and then adjustments are made. For example, if the input conditions of a certain node change due to an editing operation, it will affect the dependence relationship between this node and other nodes, thus affecting the execution order and logical path of the entire activity diagram.

[0107] S2.2.2: According to the relationship changes, derive the dynamic dependence relationships between nodes in the target area, and update the connection paths and dependence chains between nodes;

[0108] In this step, the system will derive the dynamic dependence relationships in the target area according to the relationship changes between nodes captured in the previous step. These dependence relationships are not limited to direct connection relationships, but also include logical dependencies such as control flow paths, conditional judgments, and event triggers. For example, if the execution order of a certain node is modified, it may affect the execution order of subsequent nodes, thereby affecting the control flow of the overall process. The system updates the connection paths and dependence chains between nodes according to this change, ensuring that the activity diagram is still logically reasonable and meets the predetermined execution conditions;

[0109] Specifically, when deriving the dynamic dependence relationships, not only the direct dependencies between nodes are considered, but also the indirect relationships between nodes are deduced through reasoning analysis. For example, the execution of some nodes may depend on the satisfaction of multiple conditions. All conditions can be comprehensively considered to derive a complete dynamic dependence chain. By comprehensively considering the changes in these dependence relationships, the connection paths and dependence chains of nodes are dynamically adjusted. When deriving the dependence relationships, the system will recalculate the dependence degree with other nodes according to the state of each node (such as the dependence conditions of the modified node), so as to update the node paths and dependence chains. For example, if the dependence conditions of a certain node are modified, the system will automatically adjust the dependence relationships of subsequent nodes and recalculate the execution order according to the dependence relationships.

[0110] S2.2.3: According to the update situations of each node in the target area, update the priorities of the node paths, and adjust the control flow paths between nodes according to the changes in the path priorities.

[0111] In this step, the priorities of node paths are dynamically adjusted according to the update status of each node in the target area. Specifically, by analyzing the changes in the dependencies between nodes and the control flow paths during the editing process, the priority of each path is recalculated. The priority of a path is usually calculated based on the logical relationships between nodes, such as execution order, dependency strength, and other factors. The change in priority will directly affect the adjustment of node paths. Especially in the case of multiple paths or branches, the control flow paths will be adjusted according to the priority to ensure that the execution order of the activity diagram meets the design requirements.

[0112] Pop-up edit box, including:

[0113] Attribute modification tool, used to display the attribute information of the selected node or path, and support direct editing or modification of attribute values. Among them, the attribute information includes node type, execution order, and input / output conditions;

[0114] Logic modification tool, used to modify the connections between nodes through dragging or graphical operations, and modify the logical relationships between nodes. Among them, the logical relationships include dependency relationships, control flow paths, and conditional judgments;

[0115] Structure preview tool, used to display the preview screen of the editing result during the editing process.

[0116] Logic generation box, including:

[0117] Standardization conversion tool, used to convert the editing operations into standardized logic fragments that conform to a unified specification;

[0118] Function verification tool, used to verify the functions of the generated standardized logic fragments;

[0119] Dependency relationship conversion tool, used to ensure that the converted standardized logic fragments are consistent with the existing dependency relationships in the original activity diagram.

[0120] The specific steps of S3 are as follows:

[0121] S3.1: Adjust the positions of the edited nodes according to the spatial layout of the activity diagram and the relationships between nodes;

[0122] S3.2: Map the edited logic fragments to the paths in the original activity diagram, check the connection relationships between the new fragments and the original paths, and adjust the path order according to the execution flow of the activity diagram;

[0123] S3.3: Analyze the paths of the control flow in the activity diagram, and adjust the control flow order of the edited nodes according to the execution priority of the control flow and the path dependency relationships.

[0124] Embodiment 2:

[0125] Please refer toFigure 2 , the present invention provides an embodiment: a rapid design update verification system for an activity diagram of an architecture model based on activity blocks, the system comprising a selection and extension module, an editing and derivation module, a logic verification module, and a layout adjustment module;

[0126] The selection and extension module is configured to perform a selection operation in the activity diagram interface through an interaction device to determine an initial update range and perform intelligent extension according to the topological structure of the activity diagram;

[0127] The editing and derivation module is configured to modify the attributes of nodes or paths and adjust the logical relationships in a pop-up editing box, analyze the changes in the relationships between nodes according to the user's editing operations, update the connectivity and dependencies of nodes, derive the dynamic dependency chain between nodes, and adjust the priorities of node paths and control flow paths;

[0128] The logic verification module is configured to convert the editing result into a standardized logic fragment and perform functional verification on the generated logic fragment;

[0129] The layout adjustment module is configured to adjust the positions of the edited nodes according to the spatial layout rules of the activity diagram and the relationships between nodes.

[0130] Although the embodiments of the present invention have been shown and described above, it can be understood that the above embodiments are exemplary and should not be construed as limiting the present invention. Those of ordinary skill in the art can make changes, modifications, substitutions, and variations to the above embodiments within the scope of the present invention.

Claims

1. A method for rapid design update verification of an activity diagram of an architecture model based on activity blocks, characterized in that: The method comprises: Selecting a region to be updated in the activity diagram interface through an interactive device, wherein the region to be updated is displayed in the form of a dynamic frame, and the dynamic frame includes activity blocks and logical relationships related to the delimited range; According to the area to be updated, a pop-up edit box corresponding to the area is generated, and the area to be updated is edited in the pop-up edit box; The editing result is converted into a standardized logic fragment through a logic generation frame, and the standardized logic fragment is merged with the original activity diagram according to a layout algorithm.

2. According to claim 1, a method for rapid design, update and verification of an activity diagram of an architecture model based on an activity block, characterized in that: The step of selecting the area to be updated includes: Performing a selection operation in the activity diagram interface through an interactive device to determine an initial update range, wherein the selection operation includes a box selection operation, a node operation, and a path operation; In combination with the topological structure of the activity graph, the initial update range is intelligently expanded; The expanded area to be updated is highlighted in the activity diagram interface through a dynamic box, and a logic check is performed on it. If the check passes, it is marked as the area to be updated. If the check fails, it is expanded again.

3. According to claim 2, a method for rapid design, update and verification of an activity diagram of an architecture model based on an activity block, characterized in that: The intelligent extension includes: Determine the directly connected nodes of each node in the initial update range through the topological structure of the activity graph, obtain the connection strength between the node and the directly connected nodes, and calculate the node connectivity; By analyzing the function and role of each node in the initial update scope, the other nodes that each node depends on are identified, and the node dependency is calculated according to the dependency strength; According to the node connectivity and node dependency, a dynamic dependency chain between nodes is derived, and the priority of the node path is calculated according to the dynamic dependency chain; According to the priority, a comparison is made with a merging threshold, and node paths that are greater than or equal to the merging threshold are merged into the initial update range.

4. According to claim 3, a method for rapid design, update and verification of an activity diagram of an architecture model based on an activity block, characterized in that: The calculation formula of the priority of the node path is: Among them, P represents the priority of the node path, i represents the starting point of the node path, j represents the end point of the node path, k represents the point in the node path except the starting point, and f ( · ) represents the connectivity calculation function, C i represents the connection strength of node i, C j represents the connection strength of node j, C k represents the connection strength of node k, log represents the logarithmic function with base 2, and dist ( i,k ) represents the path distance between node i and node k, Con ( i,j ) represents the degree of dependence between node i and node j, and D represents the sum of path distances from path nodes to node i.

5. According to claim 4, a method for rapid design, update and verification of an activity diagram of an architecture model based on an activity block, characterized in that: The pop-up edit box includes: Attribute modification tool, used to display the attribute information of the selected node or path, and supports direct editing or modification of attribute values, where the attribute information includes node type, execution order, and input and output conditions; Logic modification tool, used to modify the connection between nodes and the logical relationship between nodes by dragging or graphical operation, wherein the logical relationship includes dependency relationship, control flow path and condition judgment; The structure preview tool is used to display the preview screen of the editing results during the editing process.

6. According to claim 5, a method for rapid design, update and verification of an activity diagram of an architecture model based on activity blocks, characterized in that: The editing of the area to be updated includes: Select a node or path to be edited in the dynamic box through an interactive device, determine a target area to be modified, and display attribute information and logical relationships according to the target area; During the editing process, the relationship changes between nodes are determined through intelligent inference strategies, and the node connectivity and node dependencies of the nodes in the target area are updated; According to the updated node connectivity and node dependency, the connection relationship and path order between nodes are automatically adjusted.

7. According to claim 6, a method for rapid design, update and verification of an activity diagram of an architecture model based on activity blocks, characterized in that: The intelligent derivation strategy includes: During the editing process, the relationship changes between each node and its adjacent nodes are analyzed based on the captured node editing operations; According to the relationship changes, derive the dynamic dependency relationship between nodes in the target area, and update the connection path and dependency chain between the nodes; According to the update status of each node in the target area, the priority of the node path is updated, and the control flow path between the nodes is adjusted according to the change of the path priority.

8. According to claim 1, a method for rapid design, update and verification of an activity diagram of an architecture model based on activity blocks, characterized in that: The logic generation box includes: Standardization conversion tool, used to convert editing operations into standardized logical fragments that conform to unified specifications; Functional verification tool, used to perform functional verification on the generated standardized logic fragments; The dependency conversion tool is used to ensure that the converted standardized logic fragments are consistent with the existing dependencies in the original activity diagram.

9. The method for rapid design, update and verification of an activity diagram of an architecture model based on activity blocks according to claim 8, characterized in that: The layout algorithm comprises: Adjust the edited node positions according to the spatial layout of the activity diagram and the relationships between nodes; Map the edited logic fragment to the path in the original activity diagram, check the connection relationship between the new fragment and the original path, and adjust the path order according to the execution flow of the activity diagram; Analyze the control flow paths in the activity diagram and adjust the control flow order of the edited nodes according to the execution priority and path dependency of the control flow.

10. A system for rapid design, update and verification of an activity diagram of an architecture model based on an activity block, which is implemented based on a method for rapid design, update and verification of an activity diagram of an architecture model based on an activity block as claimed in any one of claims 1 to 9, characterized in that: The system includes a selection and expansion module, an editing and derivation module, a logic verification module and a layout adjustment module; The selection and expansion module is used to perform a selection operation in the activity graph interface through an interactive device, determine the initial update range, and perform intelligent expansion according to the topological structure of the activity graph; The editing and derivation module is used to modify the attributes of nodes or paths and adjust the logical relationships in a pop-up editing box, analyze the changes in the relationships between nodes according to the user's editing operations, update the node connectivity and dependencies, deduce the dynamic dependency chain between nodes, and adjust the priority of the node path and the control flow path; The logic verification module is used to convert the editing results into standardized logic fragments and perform functional verification on the generated logic fragments; The layout adjustment module is used to adjust the edited node positions according to the spatial layout rules of the activity graph and the relationship between the nodes.

Images