A digital management system for maintenance work orders of a complete set of library washing and printing equipment

Abstract

The application relates to the technical field of operation and maintenance digitization, and discloses a digital management system for maintenance work orders of a complete set of library collection developing and printing equipment, which comprises the following modules: a relation graph construction module for constructing an assembly relation graph containing node states and edge constraint attributes; an analysis and verification module for analyzing maintenance work orders to obtain target nodes and generating a set of preceding nodes through reverse traversal; a sequence deduction module for generating a compensation sequence through topological sorting and delivering the compensation sequence to a mobile terminal; a structure updating module for modifying edge constraint attributes based on uplink data packets of the mobile terminal, generating edge constraint attribute to-be-submitted data, a final sequence and a change log; and a closed-loop management module for starting a database transaction after electronic signature confirmation, synchronously updating node states and edge constraint attributes and writing back the change log. Through deduction of preceding procedures and dynamic updating of equipment topology, the application guarantees operation safety and data consistency of digital management of maintenance work orders of the complete set of library collection developing and printing equipment by combining concurrent transaction control.

Description

Technical Field

[0001] This invention relates to the field of digital operation and maintenance technology, specifically a digital management system for maintenance work orders of complete sets of museum printing and processing equipment. Background Technology

[0002] Film processing equipment is an early mechanical device used for developing and printing film images. Its internal structure includes a dense network of drive shafts and liquid tank pipelines. With the popularization of digital imaging technology, the film industry has gradually declined, and the frequency of use of such film processing equipment has decreased significantly, with only a small number of film processing production tasks remaining. However, as an important witness to the film industry and history, it has been included in specialized institutions for preservation and collection. Furthermore, it is necessary to retain normal film processing functions and maintain the structural integrity and maintainability of its internal components for future reference. This places extremely high demands on the integrity of the equipment's physical structure and the precision of its maintenance.

[0003] For the daily operation and maintenance of such facilities, the digital management of maintenance work orders is often adopted. The business process usually involves issuing electronic documents containing maintenance tasks, and on-site maintenance personnel use mobile devices to access static material lists or original factory drawings to find target parts. After the work is completed, the parts status is submitted by filling in an electronic form, thereby completing the ledger record and business flow.

[0004] Existing digital management processes have limitations in practical applications. Static bills of materials can only express hierarchical relationships but cannot reflect physical obstructions and interference in three-dimensional space. When maintenance personnel lack prior disassembly procedures, they are prone to causing collateral physical damage to surrounding old components. Furthermore, the deformation of components caused by long-term service of equipment makes their actual assembly condition deviate from the original design. Existing conventional methods cannot dynamically feed back and correct the underlying data model based on the actual structural variations on site. In addition, when processing work orders dispatched in parallel, they rely solely on form flow and lack underlying data concurrency control mechanisms. This can easily lead to the problem of the same component status being overlapped by concurrent actions, ultimately causing the digital ledger to gradually become disconnected from the actual working condition of the museum's equipment.

[0005] Therefore, this invention proposes a digital management system for maintenance work orders of complete sets of museum printing and processing equipment to address the shortcomings of existing technologies. Summary of the Invention

[0006] To address the shortcomings of existing technologies, this invention provides a digital management system for maintenance work orders of complete sets of museum printing and processing equipment. This system solves the problems of existing management methods, such as the lack of guidance on pre-processing leading to damage to old components, the inability of static ledgers to adapt to actual physical working conditions, and the distortion of underlying data caused by multiple concurrent work orders.

[0007] To achieve the above objectives, the present invention provides the following technical solution: a digital management system for maintenance work orders of a complete set of museum printing and processing equipment, comprising: The relationship graph construction module is used to construct an assembly relationship graph, which includes component nodes and assembly constraint edges connecting the component nodes. The component nodes are configured with node states, and the assembly constraint edges are configured with edge constraint attributes. The parsing and verification module is used to parse the input maintenance work order to obtain the target node and generate disassembly instructions, and to perform reverse traversal in the assembly relationship diagram to generate a set of preceding nodes; The sequence inference module is used to perform topological sorting on the set of preceding nodes, generate a compensation sequence, and send it to the mobile terminal. The structure update module is used to receive the mobile terminal uplink data packet returned by the mobile terminal based on the compensation sequence, modify the edge constraint attribute and generate edge constraint attribute to be submitted data when the mobile terminal uplink data packet contains assembly relationship correction feedback, and generate the final sequence from the compensation sequence. When the edge constraint attribute is modified, a change log is generated based on the modified edge constraint attribute. The closed-loop management module is used to initiate a database transaction after receiving the electronic signature confirmation of the final sequence from the mobile terminal, synchronously update the node status of the component nodes and the target node in the final sequence within the database transaction, write the edge constraint attribute data to the assembly relationship diagram data table when there is edge constraint attribute data to be submitted, write the change log to the persistent storage layer when the change log is generated, and submit the database transaction to complete the digital management of maintenance work orders.

[0008] Preferably, in the relationship diagram construction module, the step of constructing the assembly relationship diagram includes: Extract the associated object identifier from the initial configuration data to generate the component node, and assign the component node an assembled state; Based on the physical blocking relationship, the assembly constraint edge is established between the component nodes, and the assembly constraint edge is assigned a strong blocking attribute. Perform a directed acyclic verification mechanism and generate the assembly relationship diagram; After the assembly relationship diagram passes the directed acyclic verification, the component node data, assembly constraint edge data, node status data, edge constraint attribute data, data version number field, and edge record version number field corresponding to the assembly relationship diagram are written into the assembly relationship diagram data table in the persistent storage layer.

[0009] Preferably, in the parsing and verification module, the steps of parsing the input maintenance work order to obtain the target node and generating a disassembly instruction, and performing a reverse traversal to generate a set of predecessor nodes in the assembly relationship diagram include: The input maintenance work order is processed to perform string matching to locate the component node as the target node, and the disassembly instruction is generated by encapsulating the memory address of the target node and the disassembly operation identifier. In response to the disassembly command, the memory address of the target node is extracted from the disassembly command. In the assembly relationship graph, a reverse depth-first traversal is performed starting from the target node and moving in the opposite direction of the assembly constraint edge. Component nodes with directed connected paths pointing to the target node are searched to form an upstream candidate set. Component nodes in the upstream candidate set whose state is "assembled" and which have at least one directed connected path pointing to the target node, and whose edge constraint attributes of all assembly constraint edges on the directed connected path are "strong blocking" are combined to form the preceding node set.

[0010] Preferably, in the sequence deduction module, the step of performing topological sorting on the set of preceding nodes, generating a compensation sequence, and sending it to the mobile terminal includes: Determine whether the set of preceding nodes is empty. If the set of preceding nodes is not empty, extract the in-degree values ​​of all component nodes in the set of preceding nodes in the local inference subgraph. Based on the in-degree value, perform the topological sorting on all component nodes in the preceding node set to obtain the component node sequence; The component node sequences after the topological sorting are combined to form an ordered compensation sequence, which is then sent to the mobile terminal. If the set of preceding nodes is empty, an empty compensation sequence is generated as the compensation sequence, and a disassembly confirmation prompt containing only the target node is sent to the mobile terminal.

[0011] Preferably, in the structure update module, the step of modifying the edge constraint attribute and generating edge constraint attribute data to be submitted when the uplink data packet of the mobile terminal contains assembly relationship correction feedback includes: When the uplink data packet of the mobile terminal contains the assembly relationship correction feedback, all out-degree edges originating from the feedback associated node are located in the assembly relationship graph to form an out-degree edge set. Read the currently configured edge constraint attributes and the corresponding edge record version number of each out-degree edge in the set of out-degree edges; The edge constraint attribute corresponding to the out-degree edge that is determined to be the strong blocking attribute is modified to the weak blocking attribute, and the out-degree edges whose edge constraint attribute is modified from the strong blocking attribute to the weak blocking attribute are formed into a modified out-degree edge set. Extract the modified out-degree edge identifier, the previous edge constraint attribute, and the subsequent edge constraint attribute from the modified out-degree edge set. Combine the modified out-degree edge identifier, the previous edge constraint attribute, the subsequent edge constraint attribute, and the edge record version number to generate the edge constraint attribute data to be submitted.

[0012] Preferably, in the structure update module, the step of generating the final sequence from the compensation sequence and generating a change log based on the modified edge constraint attribute when the edge constraint attribute is modified includes: When the current disassembly step number verification is passed, the feedback associated node has been located, the physical removal requirement identifier indicates that the feedback associated node does not need to be physically removed in the current stage, and the full out-degree release identifier is a valid value or there is a record of not locating the out-degree edge starting from the feedback associated node, the feedback associated node that caused the assembly relationship correction feedback will be deleted from the compensation sequence to generate the final sequence. For each out-degree edge in the modified out-degree edge set, extract the connection relationship data and the corresponding modification timestamp; The change log is generated by reading the pre-modification constraint attribute and the post-modification constraint attribute from the edge constraint attribute to be submitted data, combining the connection relationship data, the pre-modification constraint attribute, the post-modification constraint attribute, and the modification timestamp.

[0013] Preferably, in the closed-loop management module, the step of initiating a database transaction after receiving the electronic signature confirmation of the final sequence from the mobile terminal includes: Extract the operator's identity identifier, digital certificate identifier, signature value, and signed data digest from the electronic signature confirmation; Obtain the signing public key based on the digital certificate identifier, perform one-way hash calculation based on the final sequence plaintext data, the target node, and the maintenance order number corresponding to the input maintenance order, generate a local comparison digest, and perform a consistency comparison between the local comparison digest and the signed data digest; When the local comparison digest matches the signed data digest, the digital signature validity verification is performed using the signing public key, the signature value, and the local comparison digest. After the digital signature validity verification is successful, the database transaction is initiated and a globally unique transaction number is assigned.

[0014] Preferably, in the closed-loop management module, the step of synchronously updating the node status of the component nodes and the target node within the final sequence within the database transaction, and writing the edge constraint attribute data to be submitted into the assembly relationship diagram data table when there is edge constraint attribute data to be submitted, includes: Within the database transaction, the node status of all component nodes included in the final sequence corresponding to the node in the assembly relationship diagram data table, as well as the node status corresponding to the target node, are synchronously updated to the disassembled state. The globally unique transaction number and the operator's identity are associated with the corresponding node status update record. When there is data to be submitted for the edge constraint attribute, the corresponding assembly constraint edge record is located in the assembly relationship diagram data table according to the modified out-degree edge identifier. The edge constraint attribute of the assembly constraint edge record is updated to the modified edge constraint attribute. The globally unique transaction number and the operator's identity identifier are associated with the corresponding edge constraint attribute update record.

[0015] Preferably, the closed-loop management module further includes: performing a concurrent conflict check during the process of synchronously updating the node status of the component nodes and the target node in the final sequence within the database transaction. When the database transaction starts, the corresponding current data version number is queried from the assembly relationship diagram data table based on all component nodes in the final sequence and the target node; When performing node status updates, the update condition in the assembly relationship diagram data table is set to the current data version number being equal to the data version number read when the transaction starts; If the number of affected records is inconsistent with the number of records to be updated, a transaction rollback will be triggered. If the number of affected records is the same as the number of records to be updated, then the data version number of the corresponding record will be updated to the data version number read when the transaction started plus one.

[0016] Preferably, in the closed-loop management module, the step of submitting the database transaction to complete the digital management of maintenance work orders includes: Before committing the database transaction, the update condition in the assembly graph data table is set to the current edge record version number being equal to the edge record version number contained in the edge constraint attribute data to be committed. If the number of affected records is inconsistent with the number of edge records to be updated, the transaction is rolled back. If the number of affected records is consistent with the number of edge records to be updated, the edge record version number of the corresponding assembly constraint edge record is updated to the edge record version number contained in the edge constraint attribute data to be committed plus one. When it is confirmed that there are no concurrent conflicts and the change log exists, the change log is written to the persistent storage layer, and the globally unique transaction number and the operator's identity are associated with the change log; The digital management of the maintenance work order is completed by sending a transaction commit instruction for the database transaction to the database engine.

[0017] This invention provides a digital management system for maintenance work orders of complete sets of museum printing and processing equipment. It has the following beneficial effects: 1. This invention constructs an assembly relationship diagram that includes the state of components and blocking constraint edges, and after parsing the maintenance work order, combines reverse traversal and topological sorting to deduce the pre-disassembly process of the target node. This solves the problem that the complex mechanical structure of the complete set of printing equipment in the collection is prone to blind disassembly. It uses the underlying topological model to plan the intervention path to avoid the associated physical damage, thereby establishing a data foundation for the digital management of process links.

[0018] 2. This invention receives uplink messages from mobile terminals, changes the strong blocking attribute of a specific assembly constraint edge to a weak blocking attribute, and generates a corrected final sequence. This overcomes the defect that the static ledger does not match the actual physical aging status of the museum's printing equipment, and enables the assembly topology to be adaptively adjusted according to the actual working conditions on site, thereby improving the fault tolerance of maintenance work orders in the process of circulation and digital management.

[0019] 3. This invention initiates database transactions through electronic signature verification and performs concurrent conflict verification using a data version number comparison mechanism to achieve synchronous updates of node status and edge constraint attributes. This avoids the problem of dirty data writing caused by concurrent operations of multiple terminals and establishes an audit link from the issuance of maintenance work orders to the write-back of status, ensuring data consistency in the entire digital management cycle of the business flow of the complete set of museum collection printing equipment. Attached Figure Description

[0020] Figure 1 This is a diagram illustrating the architecture of the digital management system for maintenance work orders of the complete set of printing and photocopying equipment for the collection, as presented in this invention. Figure 2 This is a flowchart illustrating the digital management method for maintenance work orders of complete sets of museum printing and photocopying equipment according to the present invention. Figure 3 This is a schematic diagram illustrating the assembly topology of the present invention; Figure 4 This is a schematic diagram of the work order parsing and pre-node filtering of the present invention; Figure 5 This is a schematic diagram illustrating the dynamic deduction of the disassembly sequence of the present invention; Figure 6 This is a schematic diagram of the on-site correction of the assembly relationship of the present invention; Figure 7This is a schematic diagram illustrating the data synchronization and closed-loop management of the present invention. Detailed Implementation

[0021] The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0022] Reference Figure 1 This invention provides a digital management system for maintenance work orders of complete sets of museum printing and processing equipment, including: a relationship diagram construction module, a parsing and verification module, a sequence deduction module, a structure update module, and a closed-loop management module.

[0023] The server-side runtime environment is deployed on physical servers or cloud computing nodes to provide data processing and network communication support. Specifically, the relationship graph construction module, parsing and verification module, sequence deduction module, structure update module, and closed-loop management module are connected for data communication sequentially according to the maintenance work order processing flow. The relationship graph construction module and closed-loop management module establish data read / write connections with the persistent storage layer to perform data initialization and persistent write operations. The sequence deduction module and structure update module are each configured with network communication interfaces for mobile terminals to support compensation sequence distribution, mobile terminal uplink data packet reception, and related data interaction.

[0024] The relationship graph construction module is used to construct an assembly relationship graph, which includes component nodes and assembly constraint edges connecting the component nodes. Component nodes are configured with node states, and assembly constraint edges are configured with edge constraint attributes.

[0025] The parsing and verification module is used to parse the input maintenance work order to obtain the target node and generate disassembly instructions, and to perform reverse traversal in the assembly relationship diagram to generate a set of predecessor nodes.

[0026] The sequence inference module is used to perform topological sorting on the set of preceding nodes, generate a compensation sequence, and send it to the mobile terminal.

[0027] The structure update module is used to receive the uplink data packets returned by the mobile terminal based on the compensation sequence, modify the edge constraint attributes and generate edge constraint attribute data to be submitted when the uplink data packets contain assembly relationship correction feedback, and generate the final sequence from the compensation sequence; when the edge constraint attributes are modified, a change log is generated based on the modified edge constraint attributes.

[0028] The closed-loop management module is used to initiate a database transaction after receiving the electronic signature confirmation of the final sequence from the mobile terminal. Within the database transaction, it synchronously updates the node status of the component nodes and target nodes in the final sequence. When there is edge constraint attribute data to be submitted, it writes the edge constraint attribute data to be submitted into the assembly relationship diagram data table. When generating a change log, it writes the change log into the persistent storage layer. Finally, it submits the database transaction to complete the digital management of maintenance work orders.

[0029] Reference Figure 2 Based on the aforementioned digital management system for maintenance work orders of complete sets of museum printing and processing equipment, this invention also provides a method for digital management of maintenance work orders for complete sets of museum printing and processing equipment, the method comprising the following steps: S1. Construct an assembly relationship diagram, which includes component nodes and assembly constraint edges connecting the component nodes. Component nodes are configured with node states, and assembly constraint edges are configured with edge constraint attributes. S2, parse the input maintenance work order to obtain the target node and generate disassembly instructions, and perform reverse traversal in the assembly relationship diagram to generate the set of predecessor nodes; S3, perform topological sorting on the set of preceding nodes, generate a compensation sequence and send it to the mobile terminal; S4, receive the uplink data packet returned by the mobile terminal based on the compensation sequence, modify the edge constraint attributes and generate edge constraint attribute data to be submitted when the uplink data packet contains assembly relationship correction feedback, and generate the final sequence from the compensation sequence; when the edge constraint attributes are modified, generate a change log based on the modified edge constraint attributes. S5 initiates a database transaction after receiving the electronic signature confirmation of the final sequence from the mobile terminal. Within the database transaction, the node status of the component nodes and target nodes in the final sequence is updated synchronously. When there is edge constraint attribute data to be submitted, the edge constraint attribute data to be submitted is written into the assembly relationship diagram data table. When generating a change log, the change log is written into the persistent storage layer. The database transaction is then submitted to complete the digital management of maintenance work orders.

[0030] To facilitate the explanation of the specific implementation of the above system and method, the following describes the execution process of relationship diagram construction, work order parsing, sequence deduction, structure update, and closed-loop management in conjunction with the processing flow of each functional module.

[0031] Reference Figure 3 The relationship graph construction module performs step S1, which includes the following steps: S101, extract the associated object identifier from the initial configuration data to generate component nodes, and assign the initial assembled state to the component nodes.

[0032] In this embodiment, the relationship diagram construction module reads the static electronic ledger and equipment bill of materials file of the target collection equipment through a data interface. The static electronic ledger and equipment bill of materials file are used to record the historical assembly structure of the collection equipment and the details of the components at each level, and belong to the equipment asset information recording carrier.

[0033] The relationship graph construction module performs hierarchical traversal and structured parsing of the tag nodes in the aforementioned digitized document according to the Extensible Markup Language (XML) format to obtain initial configuration data. Subsequently, it extracts the associated object identifiers from the initial configuration data one by one. These associated object identifiers are character-encoded and used to uniquely correspond to actual physical components within the digitized data.

[0034] In a preferred embodiment, when processing partial sets of mechanical devices such as the film traction mechanism of the museum's printing equipment, the relationship diagram construction module reads the independent data table corresponding to the film traction mechanism to obtain the associated object identifiers corresponding to each physical component within the partial set of mechanical devices.

[0035] Based on the extracted identifier of each associated object, the relationship graph construction module generates the corresponding component nodes in the graph data structure in the server's memory.

[0036] All generated component nodes together constitute a component node set. Component node set Any component node in the representation is as follows ,in For component node index parameters, are positive integers and , This represents the total number of associated object identifiers extracted from the initial configuration data. Its value is determined by the actual component entries recorded in the equipment bill of materials, for example, a value of 150.

[0037] After generating component nodes, configure node states for the component nodes. Node states are used to record and characterize the assembly stage of the corresponding physical component in the field equipment environment.

[0038] The relationship graph construction module configures the initial node state for each generated component node. It defines the state for any given component node. The node state is mapped as Its value range is the enumeration set. .in, This indicates a disassembled state, signifying that the corresponding physical component has been disassembled and separated. This indicates the assembled state, representing that the corresponding physical component is currently located on the equipment and has not yet been removed.

[0039] For component node set All component nodes undergo initialization assignment, and the corresponding data update method is to set the node status field of each component node to the assembled state. The logical relationship is expressed as follows: ; The initial assembled state is used to establish the assembly relationship diagram for the first time; in subsequent maintenance work order processing, the relationship diagram construction module reads the latest node state from the persistent storage layer as the current node state.

[0040] S102, based on the physical blocking relationship, establish assembly constraint edges between component nodes, and assign initial strong blocking properties to the assembly constraint edges.

[0041] Furthermore, the relationship graph construction module extracts the spatial assembly logical parameters contained in the initial configuration data. These parameters include the starting point associated object identifier, the ending point associated object identifier, the obstruction direction identifier, and the assembly level number.

[0042] Among them, the starting point associated object identifier corresponds to the outer physical component that forms the barrier, and the ending point associated object identifier corresponds to the inner physical component that is blocked; the barrier direction identifier is used to indicate that the assembly constraint edge points from the starting component node to the ending component node; the assembly level number is used to indicate the outer and inner hierarchical relationship of the corresponding physical component in the collection printing equipment, and is used to determine the spatial hierarchy of each physical component during actual assembly.

[0043] Based on the physical obstruction relationships corresponding to the above spatial assembly logic parameters, the relationship graph construction module determines the order constraints of which outer components must be removed before inner components can be disassembled.

[0044] For example, in the transmission module of a museum's film processing equipment, the outer panel physically covers and obscures the internal transmission gear components, preventing maintenance personnel from directly accessing them. In this case, a physical barrier is formed between the outer panel and the transmission gear components.

[0045] The relational graph construction module converts the obstruction order in physical space into directed connection relationships in a graph data structure, and establishes assembly constraint edges between corresponding component nodes.

[0046] For two component nodes that are physically obstructed and ,and and This indicates different component node index parameters. If the component node is on a physical entity... The corresponding physical component blocked the component node. The direct disassembly of the corresponding physical components generates a path starting from the initial component node. Pointing to the final component node Assembly constraint edges.

[0047] All assembly constraint edges together constitute the assembly constraint edge set. Assembly constraint edge set Any single assembly constraint edge in the equation is represented as: ,in, Indicates the components node Pointing to component nodes The assembly constraint edges are established. After establishing the assembly constraint edges, the relation graph construction module configures edge constraint attributes for the assembly constraint edges. The edge constraint attributes are used to characterize the constraint strength of the physical barrier relationship in subsequent sequence deduction.

[0048] Define the assembly constraint edges The edge constraint attribute is mapped to Its value range is the enumeration set. .in, This is a strong blocking attribute, used to characterize the preceding dismantling blocking relationship that needs to be followed; This is a weak barrier attribute used to characterize weakened associations where direct physical barriers have been removed after on-site correction.

[0049] For assembly constraint edges initially established based on the original design dimensions and assembly position records of the equipment, the default configuration is an initial strong blocking attribute. At this point, attribute assignments are performed on all initially established assembly constraint edges, and the logical relationship is expressed as follows: ; The initial strong blocking attribute is used to establish the assembly constraint edge for the first time. In subsequent maintenance work order processing, if the edge constraint attribute corrected by the structure update module already exists in the persistent storage layer, the relation graph construction module reads the latest edge constraint attribute as the current edge constraint attribute.

[0050] S103, execute the directed acyclic verification mechanism and generate the assembly relationship diagram.

[0051] Combined with the above-generated set of component nodes With assembly constraint edge set The graph construction module initially constructs the graph topology.

[0052] To avoid loops in assembly constraints caused by errors in the recording of basic drawing data, such as part A blocking part B and part B blocking part A in turn, the relationship graph construction module performs directed acyclic verification on the initially constructed graph topology.

[0053] In this embodiment, the Kahn topological sorting algorithm is used to traverse the set of component nodes. With assembly constraint edge set The process involves sequentially removing component nodes with an in-degree of zero for detection. If an unremovable loop is found during the traversal, an error log is generated, the assembly relationship diagram construction failure status is returned, the current assembly relationship diagram construction process is stopped, and the process waits for the corrected initial configuration data to trigger step S1 again. If the verification confirms that no loop exists, the assembly relationship diagram is confirmed to have passed the directed acyclic graph (DAG) verification.

[0054] After successful verification, the graph construction module generates an assembly relationship graph in the server's memory for subsequent modules to use. It then writes the corresponding component node data, assembly constraint edge data, node status data, and edge constraint attribute data into the assembly relationship graph data table in the persistent storage layer. The assembly relationship graph data table configures a data version number field for component node records and an edge record version number field for assembly constraint edge records. The assembly relationship graph data table stores component node data, assembly constraint edge data, node status data, edge constraint attribute data, data version number field, and edge record version number field, providing data writing objects for subsequent node status updates and edge constraint attribute updates. The data version number field corresponds to the component node record, and the edge record version number field corresponds to the assembly constraint edge record. When initially writing to the assembly relationship graph data table, the initial values ​​of both the data version number field and the edge record version number field are 1.

[0055] This assembly diagram is used for error-proofing verification and disassembly sequence simulation in the digital management process of maintenance work orders. This assembly diagram is... The mathematical definition of its overall structure is expressed as: ; When reading static electronic ledgers, parsing equipment bills of materials, and obtaining initial configuration data, relational database query statements and document parsing components can be used; initial configuration data extraction and file read / write operations are conventional techniques in this field.

[0056] Reference Figure 4 The parsing and verification module executes step S2, which includes the following steps: S201, parse the input maintenance work order to obtain the target node and generate disassembly instructions.

[0057] In this embodiment, the parsing and verification module receives an externally input structured data stream through a network interface. The structured data stream can be a message data packet encoded using Extensible Markup Language (EXPLAIN) format.

[0058] The parsing and verification module caches and extracts fields from the message data packet to obtain the input maintenance work order and the maintenance work order number included in the message header. The maintenance work order number is used to identify the current maintenance work order in subsequent electronic signature verification and database transaction records. The maintenance work order is used to record the pending fault information and maintenance requirements of the target equipment, serving as an electronic data record carrier.

[0059] The parsing and verification module performs string matching processing, which is configured with matching rules determined by the encoding rules of the associated object identifier. These matching rules are: identify letter identifiers that match the device prefix field in the associated object identifier, and then extract numeric combinations that match the component number field in the associated object identifier to form the string to be matched.

[0060] When performing string matching, the text fields of the maintenance work order are scanned line by line according to the matching rules, and the fault part codes recorded in the maintenance work order are extracted.

[0061] The parsing and verification module compares and matches the fault location code with the associated object identifiers bound to each component node in the assembly relationship diagram to locate the component node with the corresponding mapping relationship.

[0062] If the fault code fails to match a component node in the assembly relationship diagram, a parsing failure message is generated and the generation of disassembly instructions is stopped. A matching failure exception log is written to the persistent storage layer, the work order rejection status is returned to the server management interface, and the current digital management process of the maintenance work order is terminated directly.

[0063] The located component node is the target node. ,in, This refers to a specific index parameter in the component node index parameters used to identify the target node, and It is a positive integer. .

[0064] After successfully acquiring the target node Then, the parsing and verification module is based on the target node. The memory address and disassembly operation identifier are encapsulated to generate a control message. This control message is the disassembly command, which is used to trigger the assembly relationship diagram traversal and disassembly order deduction processing.

[0065] S202, responding to the disassembly command, extracts the target node and its memory address from the disassembly command, performs a reverse depth-first traversal in the assembly relationship graph, and retrieves all component nodes with directed connected paths pointing to the target node.

[0066] After receiving the disassembly command, the parsing and verification module extracts the target node from it. The memory address is used to determine the target node. In assembly relationship diagram The position in the assembly diagram. In the middle, the parsing and verification module uses the target node Starting from the traversal point, perform a reverse depth-first traversal in the opposite direction of the assembly constraint edge.

[0067] Since the assembly constraint edges in the assembly relationship diagram are used to represent the blocking relationship between outer components and inner components, the parsing and verification module reads the inverse adjacency list formed by the reverse index of the assembly constraint edges, and follows the path pointing to the target node. The in-degree edges are searched layer by layer to determine the upstream components that are physically located outside the target node and form a disassembly barrier.

[0068] During the traversal, the parsing and verification module searches for nodes that can reach the target node. The upstream component nodes. The specific traversal process is as follows: initialize the stack structure in memory, and set the target node... Push onto the stack; Read the assembly diagram The reverse adjacency list is used; the upstream component nodes corresponding to the in-degree edges pointing to the current stack top node are pushed onto the stack in sequence, and the edge sequence corresponding to the push is recorded simultaneously.

[0069] When traversing to a component node with a reverse in-degree of zero, the currently recorded ordered edge sequence is temporarily cached for subsequent filtering of the preceding node set; then, a pop operation is performed, and the traversal continues to the previous branch node until the stack structure is empty.

[0070] Through the above traversal, the parsing and verification module records the data from any upstream component node. To the target node An ordered sequence of edges, wherein, This ordered edge sequence forms from component nodes. To the target node A directed connected path, denoted as .

[0071] The parsing and verification module will retrieve the data that points to the target node. The component nodes of the directed connected path are combined to form the upstream candidate set. .

[0072] S203, filter component nodes whose node status is "assembled" and whose edge constraint attributes on all assembly constraint edges on the directed connected path are "strong blocking" attributes, and combine them to form the preceding node set.

[0073] The parsing and verification module obtains data from the upstream candidate set. Extracting component nodes one by one Read its current node state and judge Is it equal to the assembled state? .

[0074] like Then retain the node of that component. Then proceed to the next conditional filtering step.

[0075] like This means that the node is in a disassembled state. This indicates that the corresponding physical component has been removed during previous maintenance operations and no longer constitutes an obstacle to current disassembly. The parsing and verification module will then process the component node. From the upstream candidate set Remove from the list.

[0076] For satisfying Component nodes The parsing and verification module extracts the corresponding directed connected path. All assembly constraint edges on the directed connected path are read, and the edge constraint properties of each assembly constraint edge on the directed connected path are read.

[0077] The parsing and verification module determines whether the edge constraint properties of all assembly constraint edges on the directed connected path are equal to the strong blocking property. .

[0078] If the edge constraint properties of all assembly constraint edges on the directed connected path are equal to the strong blocking property. If so, the blocking relationship corresponding to that path is deemed valid.

[0079] If there exists an edge constraint property on any assembly constraint edge in the directed connected path that is not equal to the strong blocking property. That is, there exists an attribute value equal to the weak blocking attribute. If the condition is met, it indicates that the blocking relationship corresponding to the path has been removed from the direct forced constraint, and the parsing and verification module will not use the directed connected path as a preliminary screening criterion.

[0080] When component nodes When there exists at least one directed connected path that satisfies the above conditions, the parsing and verification module will use that path as... Participate in the calculation of the preceding node set and retain the node of this component. .

[0081] After the above condition judgment, the parsing and verification module extracts component nodes that simultaneously meet the following conditions: the node status is assembled, and there is a directed connected path participating in the pre-screening, and the edge constraint attributes of all assembly constraint edges on the directed connected path are strong blocking attributes.

[0082] The combination of component nodes that meet the above conditions forms the set of preceding nodes. .

[0083] Pre-node set This is used to record external component nodes that need to be removed first before disassembling the target node. This is the set of preceding nodes. The generation calculation satisfies the following mathematical logic expression: ; In the formula, For this connected path Any assembly constraint edge contained above; and The index parameters are the adjacent component nodes connected at both ends of the assembly constraint edge, and , All are positive integers and , .

[0084] Reference Figure 5 The sequence deduction module executes step S3, which includes the following steps: S301, determine whether the set of preceding nodes is empty. If it is empty, generate an empty compensation sequence and directly issue a disassembly confirmation prompt containing only the target node. If it is not empty, extract the in-degree values ​​of all component nodes in the set of preceding nodes in the local deduction subgraph.

[0085] In this embodiment, the sequence deduction module obtains the set of preceding nodes generated by the parsing and verification module. And count the set of predecessor nodes. The number of nodes in the set is used to determine whether it is an empty set.

[0086] If the set of predecessor nodes It is an empty set, that is This indicates that there is no need to target the node in the current assembly relationship diagram. External component nodes to be removed first before disassembly.

[0087] At this point, the sequence inference module determines the empty linear data list as an empty compensation sequence and encapsulates it to contain only the target node. The disassembly confirmation prompt is then sent to the mobile terminal of the on-site workers via the network channel.

[0088] This dismantling confirmation prompt is used to alert on-site personnel to the target node. The disassembly is confirmed, and the mobile terminal returns an uplink data packet after confirmation that does not contain feedback on the assembly relationship correction.

[0089] If the set of preceding nodes is a non-empty set ,Right now Then the sequence deduction module traverses the set of preceding nodes. Each component node .

[0090] To limit the disassembly sequence deduction to the obstructing components related to the current maintenance work order, the sequence deduction module constructs a local deduction subgraph in memory. This local deduction subgraph is based on the set of preceding nodes. Component nodes and assembly relationship diagrams The assembly constraint edges are constructed by connecting these component nodes and having a strong blocking property.

[0091] For each component node The sequence inference module statistically analyzes the nodes of the component in the local inference subgraph. The number of assembly constraint edges ending at a given point. This number of assembly constraint edges is the number of component nodes. The in-degree value is denoted as The in-degree value can be any natural number, i.e. and .

[0092] The in-degree value is used to indicate the node pointing to the component in the current local inference subgraph. The number of effective assembly constraint edges.

[0093] S302, based on the dynamic update mechanism of in-degree value, performs topological sorting on all component nodes in the preceding node set.

[0094] Sequence deduction module extracts nodes of each component corresponding in-degree value And build a key-value pair mapping structure between component nodes and in-degree values ​​in the server memory.

[0095] To ensure that the in-degree of a node is updated as assembly constraint edges are removed from the local deduction subgraph, the sequence deduction module uses the Kahn topological sorting algorithm based on dynamic in-degree updates for sequential deduction.

[0096] The specific deduction process is as follows: The sequence deduction module first retrieves the in-degree value in the local deduction subgraph. Component nodes with an in-degree value of zero are stored in the zero-in-degree node queue. A zero in-degree value indicates that there are no valid assembly constraint edges pointing to that component node in the current local deduction subgraph. Subsequently, the sequence deduction module retrieves a component node from the zero-in-degree node queue as the current detachable node and appends it to the sorting result list.

[0097] In the local deduction subgraph, the sequence deduction module removes the assembly constraint edge starting from the current detachable node and simultaneously updates the in-degree value of the adjacent downstream component nodes; wherein, the in-degree value of the adjacent downstream component nodes is reduced by one.

[0098] The sequence deduction module repeatedly performs zero-in-degree node retrieval, sorting result appending, and downstream node in-degree update until all component nodes in the local deduction subgraph have been appended to the sorting result list.

[0099] In a preferred embodiment, when multiple component nodes with the same in-degree value exist in a certain cycle, the sequence deduction module sorts the multiple component nodes in ascending order according to the lexicographical order of the associated object identifiers bound to the component nodes.

[0100] After the above sorting process, a sequence of component nodes arranged in the order of disassembly is obtained.

[0101] S303 combines the topologically sorted component nodes into an ordered compensation sequence and sends the compensation sequence to the mobile terminal.

[0102] If the set of predecessor nodes If the set is empty, the sequence deduction module will determine the empty linear data list as the compensation sequence. .

[0103] If the set of predecessor nodes If the set is non-empty, the sequence deduction module will store the above component node sequences into a linear data list in order of sorting, forming an ordered compensation sequence. A linear data list is a data structure that stores and retrieves component nodes in index order. Compensation sequence. Used at the target node Before dismantling, provide on-site personnel with the layer-by-layer dismantling sequence of the external blocking components. This compensation sequence... The generation calculation satisfies the following mathematical logic expression: ; In the formula, It is a topology sorting operator based on the logic of dynamic update of in-degree.

[0104] In generating compensation sequences Then, the sequence deduction module calls the network communication interface to convert the compensated sequence. The data is converted into a structured network transmission message in JSON format. The sequence deduction module then sends this structured network transmission message to the designated mobile terminal via a wireless communication link.

[0105] In a preferred embodiment, the mobile terminal receives and parses structured network transmission messages and extracts compensation sequences. The disassembly sequence of the included components is displayed, along with a step-by-step disassembly guide.

[0106] The mobile terminal can also generate an electronic disassembly document containing details of the disassembly sequence based on the message data, which can be viewed and compared by the operators on site.

[0107] Network packet encapsulation and wireless link data transmission and reception based on the TCP / IP protocol suite can be implemented using network socket components.

[0108] Reference Figure 6 The structure update module executes step S4, which includes the following steps: S401, Receive the uplink data packet returned by the mobile terminal based on the compensation sequence. If the uplink data packet of the mobile terminal contains assembly relationship correction feedback, locate all out-degree edges starting from the feedback associated node in the assembly relationship graph.

[0109] In this embodiment, the structure update module receives uplink data packets from the mobile terminal sent by the on-site operator via the wireless network listening port.

[0110] The structure update module performs message parsing processing. According to the preset network transmission protocol parsing rules (such as HTTP or MQTT protocol parsing rules based on the TCP / IP protocol suite) and structured format templates (such as standard JSON Schema validation templates), it parses the message header fields and extracts the data payload of the mobile terminal uplink data message to identify whether the mobile terminal uplink data message contains assembly relationship correction feedback.

[0111] If the uplink data packet of the mobile terminal contains assembly relationship correction feedback, the structure update module extracts the assembly relationship correction feedback from the data payload.

[0112] If the uplink data packet of the mobile terminal does not contain assembly relationship correction feedback, the structure update module will not perform feedback associated node positioning and out-degree edge positioning, and will enter the uncorrected feedback branch in step S403 to generate the final sequence.

[0113] When the uplink data message of the mobile terminal contains assembly relationship correction feedback, the assembly relationship correction feedback is used to record the difference data in the actual working conditions on site, which is caused by assembly tolerance or non-standard deformation, resulting in the original theoretical interference relationship being eliminated. It includes the feedback associated node object identifier, the current disassembly step number, the full exit degree cancellation identifier, and the physical removal requirement identifier.

[0114] Among them, the feedback associated node object identifier is used to locate the compensation sequence. The feedback associated node; the current disassembly step number indicates the disassembly step currently displayed on the mobile terminal corresponding to this feedback associated node; the full out-degree release flag indicates that the direct forced obstruction relationship between this feedback associated node and its downstream component nodes has been released; the physical removal requirement flag indicates the feedback associated node Does it need to be physically removed during the current maintenance process?

[0115] The structure update module updates the compensation sequence based on the current disassembly step number. The corresponding component node is read from the middle, and it is verified whether the component node is consistent with the feedback associated node object identifier. If they are consistent, the feedback associated node positioning is continued. If they are inconsistent, the feedback associated node positioning, out-degree edge positioning, and edge constraint attribute modification are not performed.

[0116] The structure update module corrects the feedback based on the extracted assembly relationship and parses it to obtain the object identifier pointing to the compensation sequence.

[0117] The structure update module matches the previously verified and consistent feedback associated node object identifiers in the assembly relationship diagram to determine the corresponding component nodes as feedback associated nodes. The feedback associated nodes are set as follows: ,in, This is a specific index parameter in the component node index parameters used to identify the feedback associated node, and It is a positive integer. , This represents the total number of nodes contained in the assembly relationship diagram, which is the total number of associated object identifiers extracted from the initial configuration data.

[0118] In determining the feedback correlation nodes Subsequently, when the all-out-degree cancellation flag is a valid value (specifically configured as a boolean value of 1 or the string "True"), the structure update module executes to provide feedback on the associated nodes. Locate the out-degree edge of the starting point and read the assembly relationship diagram. The adjacency list data structure; when the full out-degree release flag is invalid (where the invalid value is specifically configured as a boolean value 0 or the string False), the structure update module does not perform out-degree edge positioning and edge constraint attribute modification.

[0119] The structure update module traverses the adjacency list to find associated nodes. All assembly constraint edges originating from this point are considered as out-degree edges. The found assembly constraint edges are the out-degree edges, and all out-degree edges constitute the out-degree edge set. Any single out-degree edge in this set of out-degree edges is represented as: .

[0120] S402, perform edge constraint attribute judgment on the located out-degree edge, and modify the out-degree edge that meets the strong blocking condition to the weak blocking attribute.

[0121] In a preferred embodiment, if step S401 fails to locate the set of out-degree edges... If the structure update module does not perform edge constraint attribute modification, does not generate edge constraint attribute data to be submitted and change log, and records the result of not locating the out-degree edge set.

[0122] If step S401 locates the set of out-degree edges Out-degree edge within Then the structure update module reads each out-degree edge sequentially from the server memory. Current configured edge constraint attributes And the corresponding edge record version number, the structure update module determines Is it equal to strong blocking attribute? .

[0123] like If this condition is met, it indicates that the out-degree edge in the current data record is still a strong blocking constraint, and the attribute modification process will begin.

[0124] like If the condition is met, it indicates that the constraint relationship corresponding to the out-degree edge has been corrected and removed previously. The structure update module skips the current out-degree edge and does not generate edge constraint attribute data to be submitted again.

[0125] The structure update module checks the assembly relationship diagram working copy corresponding to the current maintenance work order for items that are determined to be... The out-degree edge performs edge constraint attribute modification and generates edge constraint attribute data to be submitted.

[0126] The edge constraint attributes to be submitted include the modified out-degree edge identifier, the edge constraint attribute before modification, the edge constraint attribute after modification, and the edge record version number. The modified out-degree edge identifier and the edge constraint attribute after modification are used to write to the assembly relationship diagram data table, the edge constraint attribute before modification and the edge constraint attribute after modification are used to generate a change log, and the edge record version number is used to perform edge record version number verification.

[0127] Specifically, the structure update module will update the out-degree edges that meet the conditions. The corresponding edge constraint attribute is modified to a weak blocking attribute. And change the edge constraint property from strong blocking property Modified to weak blocking attribute The out-degree edges are composed of modified out-degree edge sets. .

[0128] The mathematical logic expression for this attribute modification mechanism is as follows: ; With the above modifications, the associated nodes will be fed back in the working copy of the assembly relationship diagram. The strong obstruction constraint on its downstream component nodes was adjusted to a weak obstruction constraint, so that the digital record can reflect the on-site status fed back by the mobile terminal.

[0129] S403, based on the uplink data packets of the mobile terminal, processes the compensation sequence to generate the final sequence.

[0130] In one embodiment, if the uplink data packet of the mobile terminal does not contain assembly relationship correction feedback, and the sequence deduction module has generated a compensation sequence... The structure update module will then use the compensation sequence. Determined as the final sequence If the uplink data packet from the mobile terminal does not contain assembly relationship correction feedback, and the aforementioned steps only send data containing the target node... If the disassembly confirmation prompt is received, the structure update module will generate an empty final sequence. If the mobile terminal's uplink data packet contains assembly relationship correction feedback, but the current disassembly step number verification fails or the full out-degree release flag is invalid, the structure update module will not perform edge constraint attribute modification and will update the compensation sequence. Determined as the final sequence If the compensation sequence is empty, then an empty final sequence is generated. .

[0131] In a preferred embodiment, if the uplink data packet of the mobile terminal contains assembly relationship correction feedback, and the aforementioned current disassembly step number has passed verification and the feedback associated node has been located. Furthermore, the physical removal requirement identifier indicates the feedback associated node. It does not need to be physically removed in the current stage and meets either of the following conditions: the full out-degree release flag is a valid value, or step S401 records a set of unlocated out-degree edges. As a result, the structure update module updates the compensation sequence generated by the sequence deduction module. Update.

[0132] The structure update module loads the compensation sequence in memory. And perform element retrieval in the sequence to locate the feedback associated nodes. The current index position. The structure update module performs a sequence deletion operation and will report the associated nodes. From the compensation sequence The deletion operation removes nodes while maintaining the original relative order of the remaining nodes in the sequence. The updated list output after this deletion operation is the final sequence. The final sequence is used as the basis for executing subsequent node state updates.

[0133] In the case where the uplink data packet of the mobile terminal contains assembly relationship correction feedback, this final sequence The generating expression is represented as: ; In the formula, This represents a sequence deletion operation that removes feedback-related nodes from the compensation sequence while maintaining the original relative order of the remaining nodes.

[0134] S404 Extract the connection relationship data and corresponding modification timestamps of all out-degree edges whose edge constraint attributes have been modified to weak blocking attributes, and encapsulate them to generate a change log.

[0135] If no edge constraint attribute modification occurs, the structure update module will not perform change log encapsulation processing and will not generate a change log. The result of not generating a change log will be passed to the closed-loop management module, which will then continue to execute the database transaction processing according to the branch without a change log.

[0136] If an edge constraint attribute is modified, the structure update module will extract the data record corresponding to each attribute modification after the modification is completed, for business auditing and historical tracing.

[0137] Specifically, regarding the modification of the out-degree edge set Each out-degree edge in The structure update module extracts its connection relationship data. This connection relationship data includes the starting point identifier, i.e., the feedback association node. and endpoint identifiers, i.e., downstream component nodes. .

[0138] Meanwhile, the structure update module calls the server clock interface to obtain the current time when the modification action is performed, and converts it into a modification timestamp. .

[0139] The structure update module reads the edge constraint attributes before and after modification from the edge constraint attribute data to be submitted, and then updates the connection relationship data, the attribute values ​​before and after modification, and the modification timestamp. Combine them according to a structured format. This includes the attribute values ​​before and after modification. for The change log records all changes, and the structured format can be JSON or Extensible Markup Language. The combined structured data records constitute the change log. .

[0140] Change Log This change log is used to record the modification process of edge constraint attributes in assembly relationship diagrams, and is used for subsequent auditing or process document optimization. The data structure definition expression is expressed as: ; In generating the final sequence Then, the structure update module will use the final sequence The final sequence is sent to a mobile device for display. And collect electronic signature confirmation.

[0141] Reference Figure 7The closed-loop management module executes step S5, which includes the following steps: S501 verifies the validity of the digital signature confirmation of the final sequence returned by the mobile terminal. After successful verification, a globally unique transaction number is assigned to initiate the database transaction.

[0142] In this embodiment, the closed-loop management module receives the uplink data packets returned by the mobile terminal through the network interface.

[0143] The closed-loop management module performs message parsing and deserialization of the mobile terminal's uplink data packets according to a preset communication data structure format. This preset communication data structure format can be JSON. After deserialization, the closed-loop management module separates the message header and data payload, and extracts the electronic signature confirmation for the final sequence from the data payload based on a preset signature feature field. This preset signature feature field is specifically set to the key name Sign_Auth or Digital_Signature in the JSON key-value pair.

[0144] Electronic signature verification, generated based on public key infrastructure, includes the operator's identity and a digest of the signed data, used to prove that on-site personnel have confirmed the final sequence and target node. The corresponding disassembly requirements.

[0145] The closed-loop management module extracts the operator's identity, digital certificate identifier, signature value, and the digest of the signed data from the electronic signature confirmation.

[0146] The closed-loop management module obtains the corresponding signing public key based on the digital certificate identifier and caches the operator's identity identifier for writing the corresponding data change record.

[0147] The closed-loop management module first compares the final sequence plaintext data returned by the mobile terminal with the final sequence generated by the structure update module. A consistency check is performed; if the check fails, the digital signature validity verification is deemed unsuccessful, and the subsequent submission process is halted; if the check succeeds, the SM3 hash algorithm is used to verify the final sequence plaintext data and the target node. The system performs a one-way hash calculation on the maintenance work order number to generate a local comparison digest, which is then compared with the signed data digest. If the local comparison digest does not match the signed data digest, the digital signature validity verification is deemed unsuccessful, and the subsequent submission process is halted.

[0148] If the local comparison digest matches the digest of the signed data, the closed-loop management module uses the SM2 digital signature verification algorithm to perform digital signature validity verification using the signature public key, signature value, and local comparison digest.

[0149] If the verification passes, the digital signature is deemed valid.

[0150] If the verification fails, the closed-loop management module sends a re-signing request to the mobile terminal and stops the subsequent submission process.

[0151] After the digital signature validity verification is successful, the closed-loop management module calls the transaction management interface of the relational database.

[0152] The closed-loop management module sends a transaction start command to the database engine through this interface to initiate a database transaction and assign a globally unique transaction number. This globally unique transaction number is used for recording node status updates, edge constraint attribute updates, and change logs.

[0153] Database transactions are used to process node state updates, edge constraint attribute writes, and change log writes as a single transaction to maintain the atomicity and consistency of data modification processes.

[0154] S502, within the database transaction, synchronously updates the node status of all component nodes included in the final input sequence, as well as the node status of the target node, to the disassembled state.

[0155] After a database transaction is started, the closed-loop management module performs a status update operation within that database transaction.

[0156] Specifically, the closed-loop management module traverses the final sequence generated by the structure update module. Extract all component nodes contained therein; simultaneously obtain the target node corresponding to the currently processed maintenance work order. .

[0157] Within a database transaction, the closed-loop management module manages the final sequence. Component nodes and target nodes Perform batch status updates.

[0158] The closed-loop management module updates the status of the corresponding nodes of the above-mentioned component nodes in the assembly relationship diagram data table to the disassembled state. This synchronous update mechanism satisfies the following mathematical logic expression: ; In the formula, For any component node The node state; It is the set union operator.

[0159] This step ensures that the node status in the assembly relationship diagram data table is consistent with the disassembly result confirmed by the mobile terminal. Simultaneously, the closed-loop management module associates the globally unique transaction number and operator identification with the corresponding node status update record.

[0160] If the structure update module generates edge constraint attribute data to be submitted, the closed-loop management module, within the same database transaction, locates the corresponding assembly constraint edge record in the assembly relationship diagram data table based on the modified out-degree edge identifier in the edge constraint attribute data to be submitted, and updates the edge constraint attribute of the assembly constraint edge record to the modified edge constraint attribute in the edge constraint attribute data to be submitted; at the same time, it associates the globally unique transaction number and the operator's identity identifier with the edge constraint attribute update record.

[0161] S503 After confirming that there are no concurrent conflicts in the node status updates and edge constraint attribute updates of all the above component nodes and target nodes, write the change log to the persistent storage layer.

[0162] To maintain data consistency in multi-terminal concurrent operation scenarios, the closed-loop management module introduces an optimistic locking mechanism to perform concurrent conflict verification after the execution node status is updated and before the database transaction is committed.

[0163] The closed-loop management module, when a database transaction begins, determines the final sequence of events. Component nodes and target nodes The system queries and caches the corresponding current data version number from the assembly relationship diagram data table, denoted as . .

[0164] The current data version number is the data version number read when the database transaction started. When performing a node status update, the closed-loop management module sets the update condition in the assembly relationship diagram data table to the current data version number equal to... .

[0165] If the number of affected records is inconsistent with the number of records to be updated, it indicates that the current data has been modified by other concurrent threads during the transaction execution, resulting in a concurrency conflict. At this time, the closed-loop management module triggers a transaction rollback and rereads the latest assembly relationship diagram data.

[0166] If the number of affected records matches the number of records to be updated, then it is confirmed that there are no concurrent conflicts in the node status updates of component nodes and target nodes in the final sequence, and the data version number of the corresponding records is updated to [data version number]. .

[0167] For the assembly constraint edges corresponding to the data to be committed for the edge constraint attributes, the closed-loop management module synchronously performs edge record version number verification. The closed-loop management module sets the update condition in the assembly relationship graph data table to the current edge record version number equal to the edge record version number contained in the data to be committed for the edge constraint attributes. If the number of affected records is inconsistent with the number of edge records to be updated, it is determined that the edge record version number does not meet the update condition and a transaction rollback is triggered. If the number of affected records is consistent with the number of edge records to be updated, it is confirmed that there is no concurrent conflict in the edge constraint attribute update, and the edge record version number of the corresponding assembly constraint edge record is updated to the edge record version number contained in the data to be committed for the edge constraint attributes plus one.

[0168] After confirming that there are no concurrent conflicts, if the structure update module generates a change log, the closed-loop management module calls the storage input / output interface to write the change log to the persistent storage layer, and writes or associates the globally unique transaction number and the operator's identity to the change log; if the structure update module does not generate a change log, the change log writing operation is not performed.

[0169] A high-availability log table is set up in the persistent storage layer to store change logs for subsequent auditing and tracing.

[0170] When it is necessary to back up the change log to the distributed file system, the closed-loop management module first writes the change log to the high availability log table within the database transaction, and then backs up the change log to the distributed file system after the transaction is committed.

[0171] S504 sends a transaction commit instruction to the database engine, making the data change records within the database transaction effective and completing the digital management of maintenance work orders.

[0172] After the change logs that need to be written are written to the persistent storage layer, or after the node status update is completed without generating change logs, the closed-loop management module sends a transaction commit instruction for the database transaction to the database engine, that is, executes the COMMIT operation.

[0173] In response to the transaction commit command, the database engine completes data persistence according to the database transaction mechanism and releases the database resources or lock resources occupied during the execution of the database transaction.

[0174] Data change records within a database transaction include node status update data, edge constraint attribute update data, and change log write records. If there is no edge constraint attribute update data, the data change record will not include edge constraint attribute update data; if no change log is generated, the data change record will not include change log write records.

[0175] After the database transaction is successfully committed, the process of instruction parsing, disassembly sequence deduction, on-site correction, and status synchronization triggered by the maintenance work order is completed, and the digital management process of the maintenance work order ends.

[0176] To further illustrate the implementation process and technical effects of this invention, the following description is provided in conjunction with specific application scenarios. The specific numerical values ​​and scenario parameters described below are only used to explain the implementation principle of this invention and do not limit the scope of protection of this invention.

[0177] In the relationship graph construction module, the associated object identifiers are extracted from the initial configuration data, generating 4 component nodes, and the total number of associated object identifiers is [number missing]. The value is 4. The four component nodes are the outer shell panel nodes. Tension roller support node , transmission gear node and fixed support nodes .

[0178] Configure the initial node state for the above component nodes, perform initialization assignment, and the logical relationship is expressed as follows: ; Based on the extracted spatial assembly logic parameters, the physical obstruction relationship is determined as follows: outer shell panel node. Blocking tension roller support node With transmission gear node Tension roller support node Blocking transmission gear node Establish assembly constraint edges between the corresponding component nodes to form an assembly constraint edge set. The set contains assembly constraint edges. Assembly constraint edge With assembly constraint edge .

[0179] Configure edge constraint properties for assembly constraints, assign initial strong blocking properties, and the logical relationship is expressed as follows: ; After performing a directed acyclic loop (DAG) check to confirm the absence of loops, an assembly relationship diagram is generated. The initial values ​​of the data version number field and the edge record version number field are both configured to the value 1 and written to the assembly relationship diagram data table in the persistent storage layer.

[0180] In the parsing and verification module, the input maintenance work order and the maintenance work order number included in the message header are parsed, and the maintenance work order number with the value WO20231001 is extracted. The fault part code recorded in the maintenance work order is extracted and subjected to string matching processing to locate the transmission gear node. As the target node .

[0181] The system encapsulates and generates disassembly commands, and then extracts the target node from these commands in response. The memory address in the assembly diagram China-Israel target nodes A reverse depth-first traversal is performed from the starting point. The reverse adjacency list is read to check if a node pointing to the target node exists. The component nodes of the directed connected path constitute the upstream candidate set. The set contains shell panel nodes. Node with tension roller support .

[0182] Filtering upstream candidate sets The middle node is in the assembled state. And there exists at least one path pointing to the target node. A directed connected path, wherein all assembly constraint edges on the directed connected path have strong blocking properties. Component nodes. Shell panel nodes. Node with tension roller support All conditions are met, and they are combined to form a set of preceding nodes. The generated calculation satisfies the following mathematical logic expression: ; In the sequence deduction module, the set of preceding nodes Given a non-empty set, extract the in-degree values ​​of all component nodes in the local derivation subgraph. The local derivation subgraph is based on the shell panel nodes. Tension roller support node and assembly constraint edges Build.

[0183] Statistical analysis of the outer shell panel nodes in-degree value The value is 0, tension roller support node in-degree value The value is 1.

[0184] Topological sorting is performed based on a dynamic update mechanism of in-degree values, and in-degree values ​​are retrieved. Shell panel node equal to 0 And append it to the sorting results list; remove the assembly constraint edge originating from this node. Synchronously update the adjacent downstream tension roller support nodes. in-degree value, updated in-degree value Decrease from 1 to 0; retrieve in-degree value. Tension roller support node equal to 0 And append it to the sorted results list.

[0185] The topologically sorted sequence of component nodes is combined to form an ordered compensation sequence. The generated calculation satisfies the following mathematical logic expression: ; Output compensation sequence Includes sequentially arranged shell panel nodes Node with tension roller support , will compensate sequence Distribute to mobile devices.

[0186] In the structural update module, the system receives uplink data packets from the mobile terminal containing feedback on assembly relationship corrections. Based on the actual on-site working conditions, the original theoretical interference relationship has been resolved due to non-standard deformation, confirming the removal of the outer shell panel nodes. Afterwards, tension roller support node No longer for transmission gear nodes (i.e., target node) This forms a direct physical barrier.

[0187] Extract assembly relationship correction feedback, which includes the identifier of the associated node, the current disassembly step number, the full exit degree release identifier, and the physical removal requirement identifier; wherein, the current disassembly step number corresponds to the tension roller support node in the compensation sequence. The sorting position, the full exit degree release flag is a valid value (value 1), and the physical removal requirement flag is an invalid value (value 0). Based on the aforementioned consistent feedback association node object identifier matching, the tension roller support node is determined. As a feedback-related node .

[0188] Execute to provide feedback to associated nodes Locate the out-degree edges starting from the origin, and iterate through them to obtain the set of out-degree edges. The set contains assembly constraint edges. Read assembly constraint edges. The currently configured edge constraint attribute is a strong blocking attribute. Change the edge constraint property to a weak blocking property. , forming a modified set of out-degree edges The mathematical logic expression for the attribute modification mechanism is as follows: ; Extract the modified out-degree edge identifier, the constraint attributes before modification, the constraint attributes after modification, and the edge record version number. The modified out-degree edge identifier is the assembly constraint edge. The version number of each edge is set to 1, and the edge constraint attributes are combined to generate data to be submitted.

[0189] Assuming the current disassembly step number verification passes, the physical removal requirement identifier indicates the feedback associated node. If the node does not need to be physically removed in the current stage, and the all-out-degree release flag is valid (value 1), perform the sequence deletion operation. Feedback on the associated nodes will be provided. From the compensation sequence Delete, generating the final sequence. The generated expression is represented as: ; The final sequence generated Only retain the outer shell panel nodes .

[0190] Extract connection relationship data and corresponding modification timestamps Encapsulate and generate change logs The data structure definition expression is expressed as: ; In the closed-loop management module, the final sequence is received from the mobile terminal. The electronic signature is confirmed. The signature public key is obtained based on the digital certificate identifier. The final sequence plaintext data returned by the mobile terminal is first compared with the final sequence generated by the structure update module. A consistency comparison is performed; after the comparison is successful, the SM3 hash algorithm is used to verify the plaintext data and target nodes of the final sequence. The maintenance work order number WO20231001 is used for one-way hash calculation to generate a local comparison digest. Digital signature validity verification is performed if the local comparison digest matches the signed data digest.

[0191] After successful verification, a database transaction is initiated, and a globally unique transaction number TX_001 is assigned. This is based on the final sequence. Shell panel nodes and target node Query and cache the corresponding current data version number from the assembly relationship diagram data table. Among them, the outer shell panel node and target node The corresponding current data version number query value is 1.

[0192] Within a database transaction, the shell panel node Corresponding node status and target node The corresponding node status is synchronously updated to the disassembled state. The globally unique transaction number TX_001 and the operator's identity identifier are associated with the corresponding node status update record. The synchronization update mechanism satisfies the following mathematical logic expression: ; The assembly constraint edge is located based on the modified out-degree edge identifier in the data to be submitted according to the edge constraint attribute. Record the changes and update the edge constraint properties to weak blocking properties. The globally unique transaction number TX_001 and the operator's identity identifier are associated with the corresponding edge constraint attribute update record.

[0193] Perform a concurrent conflict check. Set the update condition in the assembly relationship diagram data table to the current data version number equal to 1, and ensure that the number of affected records matches the number of records to be updated. If no concurrent conflict is found, update the data version number to 2. Simultaneously, set the update condition to the current edge record version number equal to 1, and ensure that the number of affected records matches the number of edge records to be updated. Update the edge record version number to 2.

[0194] Associate the globally unique transaction number TX_001 and the operator's identity identifier with the change log. and change log Write to the persistent storage layer. Send a transaction commit command to the database engine to complete the digital management process of a digital management system for maintenance work orders of a complete set of museum printing equipment.

[0195] While specific embodiments of the present invention have been described above, those skilled in the art should understand that these specific embodiments are merely illustrative. Those skilled in the art can omit, substitute, and modify the details of the above methods and systems in various ways without departing from the principles and essence of the present invention. For example, combining the above method steps to perform substantially the same function and achieve substantially the same result using substantially the same method falls within the scope of the present invention.

Claims

1. A digital management system for maintenance work orders of complete sets of museum printing and processing equipment, characterized in that, include: The relationship graph construction module is used to construct an assembly relationship graph, which includes component nodes and assembly constraint edges connecting the component nodes. The component nodes are configured with node states, and the assembly constraint edges are configured with edge constraint attributes. The parsing and verification module is used to parse the input maintenance work order to obtain the target node and generate disassembly instructions, and to perform reverse traversal in the assembly relationship diagram to generate a set of preceding nodes; The sequence inference module is used to perform topological sorting on the set of preceding nodes, generate a compensation sequence, and send it to the mobile terminal. The structure update module is used to receive the mobile terminal uplink data packet returned by the mobile terminal based on the compensation sequence, modify the edge constraint attribute and generate edge constraint attribute to be submitted data when the mobile terminal uplink data packet contains assembly relationship correction feedback, and generate the final sequence from the compensation sequence. When the edge constraint attribute is modified, a change log is generated based on the modified edge constraint attribute. The closed-loop management module is used to initiate a database transaction after receiving the electronic signature confirmation of the final sequence from the mobile terminal, synchronously update the node status of the component nodes and the target node in the final sequence within the database transaction, write the edge constraint attribute data to the assembly relationship diagram data table when there is edge constraint attribute data to be submitted, write the change log to the persistent storage layer when the change log is generated, and submit the database transaction to complete the digital management of maintenance work orders.

2. The digital management system for maintenance work orders of complete sets of museum printing and processing equipment according to claim 1, characterized in that, The steps for constructing the assembly relationship diagram in the relationship diagram construction module include: Extract the associated object identifier from the initial configuration data to generate the component node, and assign the component node an assembled state; Based on the physical blocking relationship, the assembly constraint edge is established between the component nodes, and the assembly constraint edge is assigned a strong blocking attribute. Perform a directed acyclic verification mechanism and generate the assembly relationship diagram; After the assembly relationship diagram passes the directed acyclic verification, the component node data, assembly constraint edge data, node status data, edge constraint attribute data, data version number field, and edge record version number field corresponding to the assembly relationship diagram are written into the assembly relationship diagram data table in the persistent storage layer.

3. The digital management system for maintenance work orders of complete sets of museum printing and processing equipment according to claim 2, characterized in that, In the parsing and verification module, the steps of parsing the input maintenance work order to obtain the target node and generating a disassembly instruction, and performing a reverse traversal to generate a set of preceding nodes in the assembly relationship diagram include: The input maintenance work order is processed to perform string matching to locate the component node as the target node, and the disassembly instruction is generated by encapsulating the memory address of the target node and the disassembly operation identifier. In response to the disassembly command, the memory address of the target node is extracted from the disassembly command. In the assembly relationship graph, a reverse depth-first traversal is performed starting from the target node and moving in the opposite direction of the assembly constraint edge. Component nodes with directed connected paths pointing to the target node are searched to form an upstream candidate set. Component nodes in the upstream candidate set whose state is "assembled" and which have at least one directed connected path pointing to the target node, and whose edge constraint attributes of all assembly constraint edges on the directed connected path are "strong blocking" are combined to form the preceding node set.

4. The digital management system for maintenance work orders of complete sets of museum printing and processing equipment according to claim 3, characterized in that, In the sequence deduction module, the steps of performing topological sorting on the set of preceding nodes, generating a compensation sequence, and sending it to the mobile terminal include: Determine whether the set of preceding nodes is empty. If the set of preceding nodes is not empty, extract the in-degree values ​​of all component nodes in the set of preceding nodes in the local inference subgraph. Based on the in-degree value, perform the topological sorting on all component nodes in the preceding node set to obtain the component node sequence; The component node sequences after the topological sorting are combined to form an ordered compensation sequence, which is then sent to the mobile terminal. If the set of preceding nodes is empty, an empty compensation sequence is generated as the compensation sequence, and a disassembly confirmation prompt containing only the target node is sent to the mobile terminal.

5. The digital management system for maintenance work orders of complete sets of museum printing and processing equipment according to claim 4, characterized in that, In the structure update module, the steps of modifying the edge constraint attributes and generating edge constraint attribute data to be submitted when the mobile terminal uplink data packet contains assembly relationship correction feedback include: When the uplink data packet of the mobile terminal contains the assembly relationship correction feedback, all out-degree edges originating from the feedback associated node are located in the assembly relationship graph to form an out-degree edge set. Read the currently configured edge constraint attributes and the corresponding edge record version number of each out-degree edge in the set of out-degree edges; The edge constraint attribute corresponding to the out-degree edge that is determined to be the strong blocking attribute is modified to the weak blocking attribute, and the out-degree edges whose edge constraint attribute is modified from the strong blocking attribute to the weak blocking attribute are formed into a modified out-degree edge set. Extract the modified out-degree edge identifier, the previous edge constraint attribute, and the subsequent edge constraint attribute from the modified out-degree edge set. Combine the modified out-degree edge identifier, the previous edge constraint attribute, the subsequent edge constraint attribute, and the edge record version number to generate the edge constraint attribute data to be submitted.

6. The digital management system for maintenance work orders of complete sets of museum printing and processing equipment according to claim 5, characterized in that, In the structure update module, the step of generating a final sequence from the compensation sequence and generating a change log based on the modified edge constraint attributes when the edge constraint attributes are modified includes: When the current disassembly step number verification is passed, the feedback associated node has been located, the physical removal requirement identifier indicates that the feedback associated node does not need to be physically removed in the current stage, and the full out-degree release identifier is a valid value or there is a record of not locating the out-degree edge starting from the feedback associated node, the feedback associated node that caused the assembly relationship correction feedback will be deleted from the compensation sequence to generate the final sequence. For each out-degree edge in the modified out-degree edge set, extract the connection relationship data and the corresponding modification timestamp; The change log is generated by reading the pre-modification constraint attribute and the post-modification constraint attribute from the edge constraint attribute to be submitted data, combining the connection relationship data, the pre-modification constraint attribute, the post-modification constraint attribute, and the modification timestamp.

7. The digital management system for maintenance work orders of complete sets of museum printing and processing equipment according to claim 6, characterized in that, In the closed-loop management module, the step of initiating a database transaction after receiving the electronic signature confirmation of the final sequence from the mobile terminal includes: Extract the operator's identity identifier, digital certificate identifier, signature value, and signed data digest from the electronic signature confirmation; Obtain the signing public key based on the digital certificate identifier, perform one-way hash calculation based on the final sequence plaintext data, the target node, and the maintenance order number corresponding to the input maintenance order, generate a local comparison digest, and perform a consistency comparison between the local comparison digest and the signed data digest. When the local comparison digest matches the signed data digest, the digital signature validity verification is performed using the signing public key, the signature value, and the local comparison digest. After the digital signature validity verification is successful, the database transaction is initiated and a globally unique transaction number is assigned.

8. The digital management system for maintenance work orders of complete sets of museum printing and processing equipment according to claim 7, characterized in that, In the closed-loop management module, the step of synchronously updating the node status of the component nodes and the target node in the final sequence within the database transaction, and writing the edge constraint attribute data to the assembly relationship diagram data table when there is edge constraint attribute data to be submitted, includes: Within the database transaction, the node status of all component nodes included in the final sequence corresponding to the node in the assembly relationship diagram data table, as well as the node status corresponding to the target node, are synchronously updated to the disassembled state. The globally unique transaction number and the operator's identity are associated with the corresponding node status update record. When there is data to be submitted for the edge constraint attribute, the corresponding assembly constraint edge record is located in the assembly relationship diagram data table according to the modified out-degree edge identifier. The edge constraint attribute of the assembly constraint edge record is updated to the modified edge constraint attribute. The globally unique transaction number and the operator's identity identifier are associated with the corresponding edge constraint attribute update record.

9. The digital management system for maintenance work orders of complete sets of museum printing and processing equipment according to claim 8, characterized in that, The closed-loop management module also includes: during the process of synchronously updating the node status of the component nodes and the target node in the final sequence within the database transaction, performing a concurrent conflict check step: When the database transaction starts, the corresponding current data version number is queried from the assembly relationship diagram data table based on all component nodes in the final sequence and the target node; When performing node status updates, the update condition in the assembly relationship diagram data table is set to the current data version number being equal to the data version number read when the transaction starts; If the number of affected records is inconsistent with the number of records to be updated, a transaction rollback will be triggered. If the number of affected records is the same as the number of records to be updated, then the data version number of the corresponding record will be updated to the data version number read when the transaction started plus one.

10. The digital management system for maintenance work orders of complete sets of museum printing and processing equipment according to claim 9, characterized in that, In the closed-loop management module, the steps for submitting the database transaction to complete the digital management of maintenance work orders include: Before committing the database transaction, the update condition in the assembly graph data table is set to the current edge record version number being equal to the edge record version number contained in the edge constraint attribute data to be committed. If the number of affected records is inconsistent with the number of edge records to be updated, the transaction is rolled back. If the number of affected records is consistent with the number of edge records to be updated, the edge record version number of the corresponding assembly constraint edge record is updated to the edge record version number contained in the edge constraint attribute data to be committed plus one. When it is confirmed that there are no concurrent conflicts and the change log exists, the change log is written to the persistent storage layer, and the globally unique transaction number and the operator's identity are associated with the change log; The digital management of the maintenance work order is completed by sending a transaction commit instruction for the database transaction to the database engine.

Images