A method and system for sharing and seamlessly continuing vehicle transaction status at toll stations

Abstract

This invention discloses a method and system for sharing and seamlessly continuing vehicle transaction status at toll stations, belonging to the field of intelligent transportation technology. The method includes: establishing a unified vehicle transaction status database at the toll station level, storing and synchronizing real-time snapshots of the transaction status of all vehicles in all lanes; monitoring lane status through an intelligent routing engine, and determining the optimal continuation plan when a transaction is interrupted; when a vehicle changes lanes, the new lane system queries the status database and resumes the transaction process from the point of interruption. This invention solves the problems of process status isolation, low interruption recovery efficiency, and high data consistency risks in existing technologies, achieving cross-lane transaction status sharing and intelligent continuation, reducing interruption processing time from minutes to seconds, avoiding duplicate billing, and improving transaction success rate and user experience.

Description

Technical Field

[0001] This invention relates to the field of intelligent transportation technology, specifically to a technology for fault-tolerant transaction processing, distributed state management, and business process continuity in a highway toll collection system. It is particularly suitable for solving the problem of intelligent recovery and seamless continuity after a vehicle's transaction is interrupted due to lane equipment failure, network anomalies, or other reasons at a toll station. Background Technology

[0002] In existing toll station systems, vehicle transaction processes are typically restricted to a single lane, which presents the following technical drawbacks:

[0003] 1. Process status isolation: The vehicle transaction progress (such as the status of identity authentication, billing, payment, etc.) is stored in the local system of the lane where the transaction occurred and cannot be shared across lanes within the station.

[0004] 2. Data consistency risk: Duplicate transactions may lead to billing conflicts, data inconsistencies and other problems, increasing the difficulty of reconciliation and operational risks.

[0005] 3. Serious waste of resources: Completed calculations and processing results are discarded due to lane switching, resulting in a waste of computing and time resources.

[0006] 4. Poor user experience: Drivers and passengers need to repeatedly provide the same information and perform the same operations in different lanes, which can easily lead to dissatisfaction and complaints.

[0007] 5. Existing technologies lack effective process status sharing and intelligent continuity mechanisms, making it impossible to achieve a highly efficient fault-tolerant processing mode of "one transaction, continuous throughout the entire site". Summary of the Invention

[0008] To address the existing problems, this invention provides a method and system for sharing and seamlessly continuing vehicle transaction status at toll stations, the specific solution of which is as follows:

[0009] A method for sharing and intelligently connecting vehicle transaction status within a toll station includes the following steps:

[0010] S1: Real-time capture of vehicle transaction progress in lanes, generation of transaction status snapshots, and storage in toll station-level status database to achieve full station synchronization of transaction status;

[0011] S2: When a transaction is interrupted, the system automatically marks the process as resumable. After the vehicle enters the new lane, the new lane system queries the toll station-level status database and resumes the transaction from the interruption point, achieving seamless cross-lane continuation. Specifically, step S2 uses a process continuation point intelligent decision algorithm to select the optimal continuation node for the interrupted process. The process continuation point intelligent decision algorithm includes:

[0012] Construct a decision model and define the successive decision function:

[0013] ;

[0014] in The set of all feasible continuation points; The optimal continuation point is determined by the maximum value of the continuation decision function; E(P) is the expected efficiency benefit function of continuing execution from continuation point P; S(P) is the business security score of continuation point P; R(P) is the data recovery cost of rolling back to continuation point P; α, β, and γ are weighting coefficients, satisfying α+β+γ=1;

[0015] The formula for calculating the expected efficiency benefit function E(P) is as follows:

[0016] ;

[0017] in This represents the total estimated duration of the process. The elapsed time for the successor point P. Let be the complexity of the remaining operations after the continuation point P, and k be an adjustment parameter.

[0018] Preferably, step S1 includes:

[0019] S11: After a vehicle begins a transaction in any lane, the system captures the status of key process nodes in real time. These key process nodes include vehicle information identification, billing, and payment.

[0020] S12: Generate a transaction status snapshot containing vehicle information, current progress, and results of completed steps;

[0021] S13: Upload and store transaction status snapshots in real time in the toll station-level status database to ensure that all system nodes within the station can query them.

[0022] Preferably, the method for efficiently generating a lightweight transaction state snapshot as described in step S12 includes the following steps:

[0023] S121: Construct the mathematical model of the process state as follows:

[0024] Suppose the business process contains n key nodes. The process status can be represented as:

[0025] ;

[0026] in, Indicates the current node identifier; C represents the set of business data generated up to the current node; T represents the business process context information; and T represents the status timestamp.

[0027] S122: Construct a state compression function to reduce network transmission and storage overhead:

[0028] ;

[0029] Among them, ΔD is incremental data, which only contains the changes relative to the previous state, and Sign(S) is the state digital signature to ensure integrity.

[0030] Preferably, step S2 includes:

[0031] S21: When the lane transaction is interrupted due to equipment failure, system failure or network exception, the system automatically marks this process as a resumable state;

[0032] S22: After the vehicle enters a new lane, the new lane system queries the toll station-level state library through the intelligent routing engine to check whether there is an unfinished transaction status snapshot for this vehicle;

[0033] S23: If there is an unfinished transaction status snapshot, the new lane system directly starts to execute subsequent operations from the breakpoint step recorded in the transaction status snapshot without repeating the completed steps.

[0034] Preferably, it further includes a distributed state consistency maintenance algorithm for ensuring the consistency of process states during multi-lane concurrent access. The algorithm includes:

[0035] Each process state is associated with a version vector V = [v1, v2, …, vi, …, vm], where m is the number of toll station lanes, and vi records the number of updates of lane i to the state;

[0036] When two lanes simultaneously attempt to update the same process state, compare the version vectors:

[0037] If VA > VB, accept the update of lane A,

[0038] If VA < VB, accept the update of lane B,

[0039] If VA ∥ VB, that is, there is a conflict, start a conflict resolution protocol to resolve the conflict based on timestamps or business rules; when the conflict states S A and S B need to be merged, the system calls the conflict resolution function ResolveConflict(S A , S B ): ; where S A and S B respectively represent the conflict states from two different lanes; T A and T B respectively represent S A and SB Corresponding timestamp; Validate(S A ) is the state validity verification function, returning a boolean value; S final This is the valid state that is finally written into the toll station-level state database after conflict resolution.

[0040] This invention also discloses a system for sharing and seamlessly connecting the status of the entire toll station vehicle transaction process, used to implement any of the methods described above, the system comprising:

[0041] The data layer includes a toll station-level state database, which is used to store and synchronize transaction status snapshots of all vehicles in all lanes in real time.

[0042] The scheduling layer includes an intelligent routing engine, which monitors the status of each lane and terminal, and decides on the optimal connection scheme when a transaction interruption or special situation is detected.

[0043] The execution layer, including lane industrial control computers, cloud warehouse remote terminals, and mobile handheld terminals, is used to receive scheduling instructions and resume the transaction process from the breakpoint.

[0044] Preferably, the intelligent routing engine of the scheduling layer includes:

[0045] The status monitoring module is used to detect lane equipment malfunctions, network anomalies, and transaction interruption events in real time.

[0046] The decision module is used to calculate the optimal connection point based on the intelligent decision-making algorithm for process connection points;

[0047] The routing module is used to guide vehicles to new lanes and trigger the connection process.

[0048] Preferably, the toll station-level status database adopts a distributed database, which supports high-concurrency access and data consistency maintenance; the lane industrial control computer, cloud warehouse remote terminal and mobile handheld terminal all have the ability to query status snapshots and handle continuity.

[0049] Preferably, the system further includes a communication module for real-time data synchronization between the data layer, scheduling layer, and execution layer. The communication protocols include TCP / IP and MQTT to ensure low-latency transmission.

[0050] The beneficial effects of this invention are as follows:

[0051] This invention solves the problems of process state isolation, low interruption recovery efficiency, and high data consistency risk in the prior art. It realizes cross-lane transaction state sharing and intelligent continuation, reduces interruption processing time from several minutes to seconds, avoids duplicate billing, and improves transaction success rate and user experience. Attached Figure Description

[0052] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0053] Figure 1 This is a flowchart of the method of the present invention. Detailed Implementation

[0054] To make the objectives, technical solutions, and advantages of the embodiments of the present invention clearer, the technical solutions of 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.

[0055] like Figure 1 A method for sharing and seamlessly continuing vehicle transaction status at toll stations includes the following steps:

[0056] S1: Synchronization Phase: Real-time capture of vehicle transaction progress in lanes, generation of transaction status snapshots, and storage in toll station-level status database to achieve full-station synchronization of transaction status;

[0057] Specifically, the following steps are included:

[0058] S11: Status Capture: Once a vehicle enters any lane and begins the transaction process, the industrial control machines deployed in each lane will monitor and capture the status of key process nodes in real time. These nodes include, but are not limited to: vehicle information identification completed, vehicle type determination completed, billing completed, special situation triggered, payment initiated, payment successful / failed, etc.

[0059] S12: Status Snapshot Generation: Generate a transaction status snapshot containing vehicle information, current progress, and results of completed steps; specifically including the following steps:

[0060] S121: Upon capturing a key node, the system generates a corresponding "transaction state snapshot." This snapshot is a lightweight data packet with the following structure: a mathematical model of the process state.

[0061] Suppose the business process contains n key nodes. The process status can be represented as:

[0062] ;

[0063] Where S stands for State Snapshot, representing a snapshot of the transaction state, which is a four-tuple data structure; Indicates the current node identifier; This represents the set of business data generated up to the current node (such as license plate number, billing amount); C represents business process context information; and T represents the status timestamp.

[0064] S122: To reduce network load, snapshot generation can employ an incremental compression algorithm, and the state compression function is constructed as follows:

[0065] ;

[0066] in, This represents a compressed snapshot of the transaction state, i.e., a lightweight snapshot of the state after compression, used for network transmission and storage. Represents the Compress Function, which is the compression function executed on the original transaction state snapshot S; Indicates the node identifier The value obtained by performing a hash operation is to convert a long string (such as a node name) into a short hash value Hash(Ni); ΔD is the incremental data, which only contains the change relative to the previous state; Sign(S) is the digital signature of the state, which ensures integrity.

[0067] This represents a mathematical mapping relationship, indicating that the original, complete transaction state data S is transformed into a new, lightweight data structure Scompact through a specific compression algorithm. Here, the original, complete transaction state data S refers to the complete, unprocessed state data before compression; the S in the mathematical model of step S121 defines an idealized data structure, which is a logical concept representing "a complete state containing all information"; while the original, complete transaction state data S in step S122 refers to the actual raw data S during runtime. When the system actually runs, if a vehicle triggers a node (e.g., "billing completed"), the system generates a real data packet that perfectly conforms to the structure defined in S121. .

[0068] S13: State Synchronization: The generated state snapshots are reported in real time via a low-latency communication protocol (such as MQTT) and stored in a toll station-level state database. This state database can be a distributed database to ensure that all lanes and terminals can query the latest vehicle status at any time.

[0069] S2: Seamless Cross-Lane Continuation Processing Stage: This stage, based on the established global state view, enables intelligent recovery after a transaction interruption. When a transaction is interrupted, the system automatically marks the process as connectable. After the vehicle enters the new lane, the new lane system queries the state database and continues the transaction from the point of interruption, achieving seamless cross-lane continuation.

[0070] S21: The system (especially the intelligent routing engine) continuously monitors the status of each lane. When a device malfunction, network timeout, or software anomaly is detected that prevents the current lane transaction from continuing, the system automatically marks the process corresponding to that vehicle as "continuable" in the status database and locks the status to prevent accidental operation.

[0071] S22: The vehicle, guided by staff or based on guidance information, enters another normal lane (Lane B). After recognizing the vehicle (e.g., by license plate or CPC card), the system in Lane B immediately sends a query request to the intelligent routing engine. The intelligent routing engine queries the state database to determine if there is a "connectable" state snapshot for the vehicle. If so, the connection decision algorithm is triggered. The algorithm model is as follows:

[0072] ;

[0073] The meaning of this continuation decision function is: the system traverses all feasible continuation points. For each candidate point Taking into account the expected efficiency benefit function E(P), business security S(P), and data recovery cost R(P) continuing from this point, and performing a weighted calculation according to preset weights (α, β, γ), the point with the highest comprehensive score is finally selected. As the optimal continuation scheme.

[0074] in Let {a} be the set of all feasible connection points, representing all possible node locations from which a transaction can be resumed, for example: {vehicle identification node, billing node, payment node}. Let be a candidate continuation point, representing the set. For a specific continuation point in the formula, for each The score needs to be calculated each time. The optimal continuation point represents the continuation point with the highest score obtained through calculation, which is the final decision result.

[0075] E(P) is the expected efficiency benefit function, used to evaluate the efficiency benefit from the continuation point. Continuing execution raises questions about its safety and compliance in business operations. Some nodes (such as payments) may have high security requirements and require verification. In continuation scenarios, its role is to encourage the system to jump forward as much as possible, skipping more completed steps and improving efficiency.

[0076] S(P) is the service security scoring function for connection point P, which evaluates the security of services provided by the connection point. Continuing execution raises questions about its security and compliance in business operations. Some nodes (such as payments) may have high security requirements and require verification. In continuity scenarios, its role is to ensure that continuity does not skip necessary security checks, preventing evasion of fees or transaction risks.

[0077] R(P) is the data recovery cost function, which evaluates the cost of returning to the breakpoint. The system needs to roll back a certain amount of data and resources. The deeper the rollback, the higher the cost. In continuity scenarios, this helps avoid choosing continuity points that, while saving time, are extremely difficult to recover from.

[0078] α, β, and γ are weighting coefficients that satisfy α + β + γ = 1. Here, α is the efficiency weight, indicating how much the system values ​​"efficiency" in its decision-making. A larger α indicates a greater tendency to choose the most time-efficient point. β is the safety weight, indicating how much the system values ​​"safety" in its decision-making. A larger β indicates a greater tendency to choose the safest point. γ is the cost weight, indicating how much the system cares about "recovery costs" in its decision-making. A larger γ indicates a greater tendency to avoid points with high recovery costs.

[0079] The formula has a minus sign before R(P) because cost is a negative factor; the higher the cost, the lower the total score.

[0080] The formula for calculating the expected efficiency benefit function E(P) is as follows:

[0081] ;

[0082] in This represents the total estimated duration of the process. The elapsed time for the successor point P. Let be the complexity of the remaining operations after the continuation point P, and k be an adjustment parameter.

[0083] S23: Transaction continuation execution: Based on the decision results, Lane B system directly starts from the optimal continuation point. Execution begins. For example, if the original transaction is interrupted after "billing completed," the Lane B system will directly proceed to the "payment" stage without needing to re-identify the vehicle and re-bill. During execution, the Lane B system will update the snapshot information in the status database in real time.

[0084] This invention also includes a distributed state consistency maintenance algorithm. To handle concurrency conflicts in extreme cases (e.g., vehicles being processed simultaneously in two lanes), the system employs a version vector mechanism. The distributed state consistency maintenance algorithm ensures process state consistency during concurrent access across multiple lanes, and the algorithm includes:

[0085] Each process state is associated with a version vector V = [v1, v2, …, vi, …, vm], where m is the number of toll lanes, and vi records the number of updates to the state by lane i;

[0086] When two lanes attempt to update the same process state simultaneously, compare the version vectors:

[0087] If VA > VB, accept the update from lane A,

[0088] If VA < VB, accept the update from lane B,

[0089] If VA ∥ VB, i.e., there is a conflict, start the conflict resolution protocol to resolve the conflict based on timestamps or business rules: , where SA and SB represent the conflict states from two different lanes respectively; TA and TB represent the timestamps corresponding to SA and SB respectively; Validate(SA) is a state validity verification function that returns a boolean value; Sfinal is the valid state finally written into the toll station-level state library after conflict resolution.

[0090] The symbol "∥" means "incomparable" or "there is a conflict". This is a very classic symbol usage in the fields of distributed systems and vector clocks (Vector Clock).

[0091] Let VA and VB be the version vectors submitted by lane A and lane B respectively when attempting to update the same process state. The version vector is a multi-dimensional vector, with each dimension corresponding to a lane, recording the cumulative number of updates to the state by that lane. By comparing the magnitudes of the components of VA and VB, the timing relationship between the two updates can be determined: if one vector is greater than or equal to the other in all components and at least one component is strictly greater, it means that the former is a subsequent update to the latter; otherwise, there is a concurrent conflict and the conflict resolution protocol needs to be started.

[0092] The present invention also discloses a toll station vehicle transaction process full-station state sharing and seamless connection processing system for implementing any of the above methods. The system includes:

[0093] The data layer includes a toll station-level state library for real-time storing and synchronizing the transaction state snapshots of all vehicles in the lanes.

[0094] The scheduling layer includes an intelligent routing engine for monitoring the states of each lane and terminal, and making decisions on the optimal connection plan when detecting transaction interruptions or special situations.

[0095] The intelligent routing engine of the scheduling layer includes:

[0096] A state monitoring module for real-time detecting lane equipment failures, network anomalies, and transaction interruption events;

[0097] The decision module is used to calculate the optimal connection point based on the intelligent decision-making algorithm for process connection points;

[0098] The routing module is used to guide vehicles to new lanes and trigger the connection process.

[0099] The execution layer, including lane industrial control computers, cloud warehouse remote terminals, and mobile handheld terminals, is used to receive scheduling instructions and resume the transaction process from the breakpoint.

[0100] The toll station-level status database adopts a distributed database, which supports high-concurrency access and data consistency maintenance; the lane industrial control computer, cloud warehouse remote terminal and mobile handheld terminal all have the ability to query status snapshots and handle continuity.

[0101] The system also includes a communication module for real-time data synchronization between the data layer, scheduling layer, and execution layer. The communication protocols include TCP / IP and MQTT to ensure low-latency transmission.

[0102] Example 1: Switching lanes in case of equipment failure

[0103] Scenario: After a truck completes the billing process in lane A, the barrier gate in lane A suddenly malfunctions and cannot be raised.

[0104] 1. Synchronization Phase: At the “Toll Completion” node, Lane A system generates a status snapshot containing the toll amount, vehicle information, and the current node “Pending Barrier Lifting”, and synchronizes it to the toll station-level status database in real time.

[0105] 2. Follow-up stage:

[0106] (1) The intelligent routing engine detected a fault in the barrier gate of lane A and marked the transaction status of the truck as "continuable".

[0107] (2) Staff guide the truck to back out of lane A and into lane B, which is in normal working order. The camera in lane B recognizes the license plate and then queries the intelligent routing engine.

[0108] (3) The intelligent routing engine reports that the vehicle status is “billing completed” and determines the optimal connection point as “payment / gate opening”.

[0109] (4) Lane B system directly invokes the barrier lifting command, simultaneously displays the charged amount to the driver and completes the payment. The entire process is completed within a few seconds.

[0110] Example 2: Payment continuity caused by network anomaly

[0111] Scenario: When a bus is using lane C to make a payment via QR code, the network suddenly drops, and the payment channel returns an unknown status.

[0112] 1. Synchronization Phase: When the Lane C system initiates a payment, it generates a snapshot with the status "Payment in Progress" and includes information such as the payment channel, order number, and amount, and uploads it to the status database.

[0113] 2. Follow-up stage:

[0114] (1) After the payment timeout, the system marks the process as "continuable".

[0115] (2) The vehicle reverses out of lane C and enters lane D. The system in lane D finds that the vehicle is in the "paying" status.

[0116] (3) The intelligent routing engine makes the decision that the optimal connection point is "query payment result".

[0117] (4) Based on the order information in the snapshot, the Lane D system actively queries the payment channel gateway for the final status of the order. If the query result shows that the payment was successful, the barrier will be raised directly to allow passage; if the payment failed, the payment will be re-initiated in Lane D.

[0118] This invention solves the problems of process state isolation, low interruption recovery efficiency, and high data consistency risk in the prior art. It realizes cross-lane transaction state sharing and intelligent continuation, reduces interruption processing time from several minutes to seconds, avoids duplicate billing, and improves transaction success rate and user experience.

[0119] Those skilled in the art will further appreciate that the various illustrative logic blocks, modules, circuits, and algorithm steps described in conjunction with the embodiments disclosed herein can be implemented as electronic hardware, computer software, or a combination of both. To clearly illustrate this interchangeability between hardware and software, the various illustrative components, blocks, modules, circuits, and steps are described above in a generalized manner in terms of their functionality. Whether such functionality is implemented as hardware or software depends on the specific application and the design constraints imposed on the overall system. Those skilled in the art may implement the described functionality in different ways for each specific application, but such implementation decisions should not be construed as departing from the scope of the invention.

[0120] The prior description of this disclosure is provided to enable any person skilled in the art to make or use this disclosure. Various modifications to this disclosure will be apparent to those skilled in the art, and the general principles defined herein may be applied to other variations without departing from the spirit or scope of this disclosure. Therefore, this disclosure is not intended to be limited to the examples and designs described herein, but should be accorded the widest scope consistent with the principles and novel features disclosed herein.

[0121] Although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that modifications can still be made to the technical solutions described in the foregoing embodiments, or equivalent substitutions can be made to some of the technical features; and these modifications or substitutions do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A method for sharing and seamlessly continuing vehicle transaction status at toll stations, characterized in that, It includes the following steps: S1: Real-time capture the transaction progress of the vehicle in the lane, generate a transaction status snapshot, and store it in the toll station-level status library to achieve full-station synchronization of the transaction status; S2: When the transaction is interrupted, the system automatically marks the process as a resumable state. After the vehicle enters a new lane, the new lane system queries the toll station-level status library and resumes the transaction from the breakpoint to achieve seamless cross-lane resumption; Specifically, step S2 uses a process resumption point intelligent decision-making algorithm to select the optimal resumption node for the interrupted process. The process resumption point intelligent decision-making algorithm includes: Construct a decision model and define a resumption decision function: ； in The set of all feasible continuation points; Candidate successor point; 'Optimal succession point' represents the succession point with the highest calculated score, i.e., the final decision result; E(P) is the expected efficiency benefit function for continuing execution from succession point P; S(P) is the business security scoring function for succession point P; R(P) is the data recovery cost function for rolling back to succession point P; α, β, and γ are weighting coefficients, satisfying α+β+γ=1; This is a mathematical operator that means "find P that maximizes the value inside the parentheses"; The calculation formula of the above expected efficiency gain function E(P) is: ； in This represents the total estimated duration of the process. The elapsed time for the successor point P. Let be the complexity of the remaining operations after the continuation point P, and k be an adjustment parameter.

2. The method as described in claim 1, characterized in that, Step S1 includes: S11: After the vehicle starts a transaction in any lane, the system real-time captures the status of key process nodes, and the key process nodes include vehicle information identification, charging, and payment links; S12: Generate a transaction status snapshot containing vehicle information, current progress, and the results of completed steps; S13: Real-time upload and store the transaction status snapshot in the toll station-level status library to ensure that all system nodes in the station can query it.

3. The method as described in claim 2, characterized in that, A method for efficiently generating the lightweight transaction status snapshot described in step S12 includes the following steps: S121: Construct a process status mathematical model as follows: Suppose the business process contains n key nodes. The process status can be represented as: ； Where S stands for State Snapshot, representing a snapshot of the transaction state, which is a four-tuple data structure; Indicates the current node identifier; C represents the set of business data generated up to the current node; T represents the business process context information; and T represents the status timestamp. S122: Construct a status compression function to reduce network transmission and storage overheads: ； in, This represents a compressed snapshot of the transaction status. This represents the compression function executed on the original transaction state snapshot S; Indicates the node identifier The value obtained by performing a hash operation; ΔD is the incremental data, which only contains the change relative to the previous state; Sign(S) is the digital signature of the state, which ensures integrity.

4. The method as described in claim 1, characterized in that, Step S2 includes: S21: When the lane transaction is interrupted due to equipment failure, system failure, or network exception, the system automatically marks this process as a resumable state; S22: After the vehicle enters a new lane, the new lane system queries the toll station-level status library through the intelligent routing engine to check whether there is an unfinished transaction status snapshot for this vehicle; S23: If there is an unfinished transaction status snapshot, the new lane system directly starts to execute subsequent operations from the breakpoint step recorded in the transaction status snapshot without repeating the completed steps.

5. The method as described in claim 1, characterized in that, It also includes a distributed status consistency maintenance algorithm for ensuring the consistency of the process status during multi-lane concurrent access. The algorithm includes: Each process status is associated with a version vector V = [v1, v2,..., vi,..., vm], where m is the number of toll lanes in the toll station, and vi records the number of updates of the status by lane i; When two lanes simultaneously attempt to update the same process status, compare the version vectors: If VA > VB, accept the update of lane A, If VA < VB, accept the update of lane B, If VA∥VB, indicating a conflict, then the conflict resolution protocol is initiated to resolve the conflict based on timestamps or business rules; when the two lanes submit conflict status S... A and S B When a merge is required, the system calls the conflict resolution function ResolveConflict(S A ,S B ): ;where S A and S B These represent conflict states originating from two different lanes; T A and T B S represents A and S B Corresponding timestamp; Validate(S A ) is the state validity verification function, returning a boolean value; S final This is the valid state that is finally written into the toll station-level state database after conflict resolution.

6. A system for sharing and seamlessly connecting vehicle transaction status at toll stations, characterized in that, For implementing the method described in any one of claims 1-5, the system includes: The data layer includes a toll station-level status library for real-time storing and synchronizing the transaction status snapshots of vehicles in all lanes; The scheduling layer includes an intelligent routing engine for monitoring the status of each lane and terminal, and making a decision on the optimal resumption plan when detecting a transaction interruption or special situation; The execution layer includes lane industrial control computers, cloud warehouse remote terminals, and mobile handheld terminals for receiving scheduling instructions and resuming the transaction process from the breakpoint.

7. The system as described in claim 6, characterized in that, The intelligent routing engine of the scheduling layer includes: A status monitoring module for real-time detecting lane equipment failures, network exceptions, and transaction interruption events; A decision module for calculating the optimal resumption point based on the process resumption point intelligent decision-making algorithm; The routing module is used to guide vehicles to new lanes and trigger the connection process.

8. The system as described in claim 6, characterized in that: The toll station-level status database adopts a distributed database, which supports high-concurrency access and data consistency maintenance; the lane industrial control computer, cloud warehouse remote terminal and mobile handheld terminal all have the ability to query status snapshots and handle continuity.

9. The system as described in claim 6, characterized in that: The system also includes a communication module for real-time data synchronization between the data layer, scheduling layer, and execution layer. The communication protocols include TCP / IP and MQTT to ensure low-latency transmission.

Images