CN112330298A - Consumption order flow management method and device, computer equipment and storage medium - Google Patents
Consumption order flow management method and device, computer equipment and storage medium Download PDFInfo
- Publication number
- CN112330298A CN112330298A CN202011290358.4A CN202011290358A CN112330298A CN 112330298 A CN112330298 A CN 112330298A CN 202011290358 A CN202011290358 A CN 202011290358A CN 112330298 A CN112330298 A CN 112330298A
- Authority
- CN
- China
- Prior art keywords
- state
- consumption order
- information
- order
- consumption
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/10—Office automation; Time management
- G06Q10/103—Workflow collaboration or project management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0601—Electronic shopping [e-shopping]
- G06Q30/0633—Lists, e.g. purchase orders, compilation or processing
- G06Q30/0635—Processing of requisition or of purchase orders
Abstract
The application relates to the technical field of business process optimization, and discloses a flow management method for a consumption order, which comprises the following steps: traversing the upstream and downstream relation between each process node in the service process of the consumption service, and client operation allowed by the process node and/or service processing operation which can be called to obtain service process information; configuring a finite state machine according to the service flow information; according to a state transition condition triggered by the state of a finite state machine in which the consumption order is positioned, carrying out state transition on the state of the consumption order; and performing a state transition process in the finite state machine according to the consumption order to generate order flow information of the consumption order. The application can also be applied to the technical field of block chains. The application also discloses a flow management device, computer equipment and a computer readable storage medium for the consumption order. The method and the device improve the generation efficiency of the order process information corresponding to the consumption order.
Description
Technical Field
The present application relates to the technical field of business process optimization, and in particular, to a method and an apparatus for managing a process of a consumption order, a computer device, and a storage medium.
Background
Since a consumption order generated by an online consumption service relates to a plurality of business process nodes, and the consumption order has different order states at different process nodes, when order process information corresponding to the consumption order needs to be generated, the order state of the consumption order at each process node needs to be judged.
At present, the order state of a consumption order at each flow node is generally checked step by using a traditional judgment statement, and corresponding order flow information is finally generated.
The above is only for the purpose of assisting understanding of the technical solutions of the present application, and does not represent an admission that the above is prior art.
Disclosure of Invention
The present application mainly aims to provide a method and an apparatus for managing a process of a consumption order, a computer device, and a storage medium, and aims to solve a problem of how to improve generation efficiency of order process information corresponding to the consumption order.
In order to achieve the above object, the present application provides a method for managing a process of a consumption order, comprising the following steps:
traversing the upstream and downstream relation between each process node in the service process of the consumption service, and the client operation allowed by the process node and/or the service processing operation called by the process node to obtain service process information;
configuring a finite state machine according to the business process information, wherein states in the finite state machine correspond to the process nodes, and a state transition condition of each state is generated according to the client operation and/or the business processing operation of the process node corresponding to the state;
receiving a creating instruction of a consumption order, and carrying out state transition on the state of the consumption order according to the state transition condition triggered by the state of the finite state machine where the consumption order is located;
and according to the process of state transition of the consumption order in the finite state machine, generating order flow information of the consumption order.
Further, the step of performing state transition on the state of the consumption order according to the state transition condition triggered by the state of the finite state machine where the consumption order is located includes:
acquiring a state transition condition corresponding to the state of the finite state machine where the consumption order is located;
detecting whether the state transition condition is triggered;
if so, transferring the state of the finite state machine where the consumption order is located to the state pointed by the state transfer relation according to the state transfer relation corresponding to the state transfer condition.
Further, after the step of configuring the finite state machine according to the service flow information, the method further includes:
creating a logic branch corresponding to each state according to the state transition condition of each state of the finite state machine;
executing a plurality of logic branches according to the sequence of each state transition of the finite state machine, and testing the logic branches;
detecting whether the logical branches all pass the test;
and if so, executing the creation instruction of the received consumption order, and carrying out state transition on the state of the consumption order according to the state transition condition triggered by the state of the finite state machine where the consumption order is located.
Further, after the step of detecting whether the logical branches all pass the test, the method further includes:
if not, determining the logic branch which fails the test, and generating the notification information of the state corresponding to the logic branch which fails the test.
Further, the step of generating order flow information of the consumption order according to the process of performing state transition in the finite state machine of the consumption order includes:
updating the state transition information of the consumption order according to a state identifier corresponding to the state experienced by the consumption order in the state transition process in the finite state machine; and the number of the first and second groups,
detecting whether the state of the consumption order is transferred to the end state of the finite-state machine;
and if so, generating order flow information of the consumption order according to the state transition information.
Further, after the step of updating the state transition information of the consumption order according to the state identifier corresponding to the state experienced by the consumption order in the process of performing state transition in the finite state machine, the method further includes:
and storing the updated state transition information to the block link point corresponding to the current state of the consumption order.
Further, after the step of configuring the finite state machine according to the service flow information, the method further includes:
detecting whether the state of the consumption order is transferred to a data auditing state of the finite-state machine or not in the process of transferring the state of the consumption order in the finite-state machine;
if yes, acquiring first information according to the data file uploaded by the client, wherein the first information comprises owner information and vehicle information;
detecting whether the first information is consistent with second information associated with the consumption order;
when the first information is detected to be consistent with the second information, the consumption order is transferred to a data auditing passing state of the finite state machine from the data auditing state;
and when the first information is detected to be inconsistent with the second information, transferring the consumption order from the data auditing state to a data auditing non-passing state of the finite state machine.
In order to achieve the above object, the present application further provides a process management device for a consumption order, including:
the system comprises a traversal module, a processing module and a processing module, wherein the traversal module is used for traversing the upstream and downstream relation between each process node in the service process of the consumption service, the client operation allowed by the process nodes and/or the service processing operation called by the process nodes to obtain service process information;
a configuration module, configured to configure a finite state machine according to the service flow information, where states in the finite state machine correspond to the flow nodes, and a state transition condition of each state is generated according to the client operation and/or the service processing operation of the flow node corresponding to the state;
the management module is used for receiving a creating instruction of a consumption order and carrying out state transition on the state of the consumption order according to the state transition condition triggered by the state of the finite state machine where the consumption order is located;
and the generating module is used for generating order flow information of the consumption order according to the process of state transition of the consumption order in the finite-state machine.
To achieve the above object, the present application also provides a computer device, comprising:
the computer device comprises a memory, a processor and a process management program of the consumption order stored on the memory and capable of running on the processor, wherein the process management program of the consumption order realizes the steps of the process management method of the consumption order when being executed by the processor.
In order to achieve the above object, the present application further provides a computer readable storage medium, where a process management program of a consumption order is stored, and when executed by a processor, the process management program of the consumption order implements the steps of the process management method of the consumption order.
According to the consumption order flow management method, the consumption order flow management device, the computer equipment and the computer readable storage medium, the service flow of the consumption order is obtained and associated based on the finite state machine, the order flow is simpler to build and convenient to maintain and expand, the low generation efficiency of order flow information caused by the fact that the order state is maintained by adopting complicated judgment sentences is avoided, the order state of the flow node related to the consumption order can be conveniently recorded by utilizing the finite state machine, and therefore the efficiency of generating the order flow information corresponding to the consumption order is improved.
Drawings
FIG. 1 is a schematic diagram illustrating steps of a method for managing a consumption order according to an embodiment of the present application;
FIG. 2 is a finite state machine framework diagram of a method for flow management of a consumption order according to an embodiment of the present application;
FIG. 3 is a block diagram illustrating an apparatus for managing a process of consuming an order according to an embodiment of the present disclosure;
fig. 4 is a block diagram illustrating a structure of a computer device according to an embodiment of the present application.
The implementation, functional features and advantages of the objectives of the present application will be further explained with reference to the accompanying drawings.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application.
Referring to fig. 1, in an embodiment, the method for managing a flow of a consumption order includes:
step S10, traversing the upstream and downstream relationship between each process node in the service process of the consumption service, and the client operation allowed by the process node and/or the service processing operation that can be called by the process node to obtain the service process information;
step S20, configuring a finite state machine according to the business process information, wherein states in the finite state machine correspond to the process nodes, and the state transition condition of each state is generated according to the client operation and/or the business processing operation of the process node corresponding to the state;
step S30, receiving a creating instruction of a consumption order, and carrying out state transition on the state of the consumption order according to the state transition condition triggered by the state of the finite state machine where the consumption order is located;
and step S40, performing a state transition process in the finite state machine according to the consumption order, and generating order process information of the consumption order.
In this embodiment, the terminal in this embodiment may be a computer device, such as an online service platform; the terminal may also be a process management device for the consumption order.
The consumption service in this embodiment is described by taking a vehicle consumption service as an example, and as described in step S10: the consumption may refer to a user (or owner) making a vehicle insurance purchase, an ETC (Electronic Toll Collection) fee deduction, a vehicle parking consumption, a vehicle maintenance service consumption, ETC. Aiming at various types of consumption of users, a one-stop vehicle online service platform is provided, the service platform provides a plurality of service modules such as 'vehicle insurance', 'vehicle service' and 'vehicle life' for the users, and the users can select and purchase consumption services from the service modules.
And in the process of establishing the consumption service, the business process of the consumption service is correspondingly involved. In the business process, a plurality of process nodes are included, such as new construction of a consumption order, payment of the consumption order, cancellation of the order, uploading of vehicle data, uploading of user data, verification of data, starting (or delivery) of consumption service, confirmation (or sign-in), activation, verification of data not passing, cancellation of the order, refund and the like.
In some process nodes, a user can be allowed to execute corresponding client operation on a client so as to promote business process of the vehicle message service. For example, in a process node where a consumption order is newly created, client operations executable by a user include paying for the order and canceling the order; in the process node where the consumption order is paid, the client operation which can be executed by the user comprises uploading vehicle data and canceling the order.
In some process nodes, according to the functions which can be realized by the process nodes, the service processing operation of the service platform can be called, and the service process of the vehicle message service is actively promoted. For example, in a process node for uploading data audit, a called business processing operation is used as data audit; in the flow node where the order is cancelled, if the order is cancelled after being paid, the called business processing operation is an order refund operation.
Optionally, when configuring a finite state machine of a service flow (or a subscription flow) of a consuming service, the terminal needs to acquire service flow information related to the consuming service, where the service flow information includes an upstream-downstream relationship between flow nodes in the service flow, and a client operation allowed by each flow node and/or a service processing operation that can be invoked by each flow node.
Optionally, the terminal writes a crawler script for capturing a service flow of the consumption service in advance, and the terminal may traverse all flow nodes of the service flow related to the consumption service on the vehicle service platform by using the crawler script by executing the crawler script on the vehicle service platform, and capture node information of each flow node to obtain a traversal result.
The node information includes upstream node information and/or downstream node information of the current node (based on which the upstream and downstream relationships between the process nodes can be obtained), and client operations allowed by the current node and/or service processing operations that can be invoked. The node information further includes a corresponding relationship between the client operation and the next process node, and/or a corresponding relationship between the business processing operation and the next process node.
According to the traversal result, node information corresponding to each process node in the business process can be obtained, and according to the upstream node information and/or the downstream node information of the current node included in each node information, the upstream-downstream relationship between the process nodes in the business process can be generated.
Further, generating business process information of the consumption service according to the upstream and downstream relationship between the process nodes, and the client operation allowed by each process node and/or the business processing operation that each process node can call (that is, the generated business process information includes the upstream and downstream relationship between each process node in the business process, and the client operation allowed by each process node and/or the business processing operation that each process node can call).
Therefore, the operation of manually inputting the business process information can be reduced by automatically generating the business process information of the consumption service, so that the efficiency of configuring the finite-state machine of the consumption order is improved.
As set forth in step S20: and after the terminal acquires the business process information related to the consumption service, configuring a finite state machine according to the business process information. The states of the finite state machines are set according to the process nodes in the business process included in the business process information, one process node corresponds to one state of the finite state machine, and then the upstream-downstream relationship between the states of the finite state machines is correspondingly configured according to the upstream-downstream relationship between the process nodes (namely, the upstream-downstream relationship between the states is determined by the upstream-downstream relationship between the process nodes corresponding to the states). Thus, the upstream state and the downstream state corresponding to each state can be determined.
And simultaneously, generating a state transition condition of the state of the finite state machine corresponding to the flow node according to the client operation allowed by each flow node and/or the service processing operation which can be called by each flow node. One service processing operation corresponds to at least one state transition condition, and one client operation corresponds to at least one state transition condition.
In addition, according to the specific service processing logic of the state transition condition of the finite state machine, the state transition relationship between the current state and the next state is determined, and the state transition relationships corresponding to different state transition conditions are different (namely, the triggering of different state transition conditions and the next state to which the state is transferred are different). And defining a logic relation for transferring the current state to the next state pointed by the state transfer relation according to the state transfer relation corresponding to the triggered state transfer condition when the state transfer condition of the current state of the finite state machine is triggered.
Optionally, a state identifier corresponding to each state of the finite-state machine is generated, so as to conveniently record a state transition condition corresponding to the current state. For example, the status identifier of the order new status may be Z1 and the status identifier of the order paid status may be Z2.
Optionally, corresponding operation codes may be further generated for different client operations to identify the different client operations, so as to record the operations corresponding to the trigger state transition conditions (that is, the operation codes may be used to generate state transition information). For example, the operation code for the payment order operation may be C1, the operation code for the cancellation order operation may be C0, etc.
Optionally, referring to the finite-state machine frame diagram shown in fig. 2, the finally configured states of the finite-state machine include: the order form payment state, the data uploading state, the data auditing failure state, the data auditing passing state, the consumption service started state, the service confirmed state, the order form cancelled state, the order form refund state and the end state.
Optionally, in the order new state, the allowed client operations include a payment order operation and a cancellation order operation. When the payment order operation is triggered, the next state transferred from the order newly-built state is the order paid state; when the order canceling operation is triggered, the next state from the order new state is the order cancelled state.
Optionally, in the order paid state, the allowed client operations include uploading data starting operation and canceling the order operation. When the uploading data starting operation is triggered, the next state from the order paid state is transferred to be a data uploading state; when the cancel order operation is triggered, the next state to which to transition from the order paid state is the order cancelled state.
Optionally, in the data uploading state, the allowed client operations include an uploading data operation (including uploading data corresponding to the vehicle information and uploading data corresponding to the owner information) and an order canceling operation. When the data uploading operation is triggered, the next state transferred from the data uploading state is a data checking state; when the cancel order operation is triggered, the next state from the data uploading state is the order cancelled state.
Optionally, in the data auditing state, the allowed client side operation includes an order cancelling operation, and the called service processing operation is a data auditing operation. When the order canceling operation is not triggered, and when the data checking operation is triggered and passes the data checking, the next state transferred from the data checking state is a data checking passing state; when the order canceling operation is not triggered, and when the data checking operation is triggered and does not pass the data checking, the next state transferred from the data checking state is a data checking non-passing state; when the order cancel operation is triggered, the next state from the data review state is the order cancelled state.
Optionally, in the state that the data review fails, the allowed client operations include a data re-uploading operation and an order canceling operation, and the called service processing operation may be a data re-review operation. When the operation of re-uploading the data is triggered, the operation of re-checking the data is automatically called, and after the data is checked to pass, the next state from the state that the data is not checked to pass is the state that the data is checked to pass; when the data is not approved, the data is continuously maintained in the state of not approved; when the order cancel operation is triggered, the next state to which the data audit fail state is transferred is the order cancelled state.
Optionally, in the material audit pass state, the invoked business process operation is to start consumption service (such as order delivery), and after the business process operation is triggered, the next state to which the business process operation is transferred from the material audit pass state is a consumption service started state (or a delivery state).
Optionally, in the activated state (or shipped state) of the consumption service, the allowed client operation includes a confirmation operation (e.g., receiving confirmation), the invoked business processing operation is an automatic confirmation operation (e.g., if the user does not send out the confirmation operation after a certain time, the automatic confirmation operation is executed), and when the confirmation operation or the automatic confirmation operation is triggered, the next state from the activated state (or shipped state) of the consumption service is a confirmed (or signed) state of the service.
Optionally, in the service confirmed (or signed) state, the allowed client operates with a service activation operation, and when the service activation operation is triggered, the next state to which the client is transferred from the service confirmed (or signed) state is the end state of the finite state machine.
Optionally, in the order cancelled state, it is checked whether the consumption order has been paid. If yes, the triggerable business processing operation is a refund operation, the next state transferred from the order cancelled state is the order refund state, and then the next state transferred from the order refund state is the end state of the finite state machine; if the order is not paid, the next state to which the order has been cancelled is the end state of the finite state machine.
After the configuration of the finite state machine is completed, if the terminal receives a creation instruction of a consumption order, it is determined that a newly created consumption order is generated (the consumption order is generated according to a specific consumption service purchased by a user), and then the terminal starts an order processing flow of the consumption order targeted by the creation instruction, and adds the consumption order to the finite state machine in the order processing flow for state transition, and matches the state of the finite state machine for the current consumption order as an order creation state when adding the consumption order to the finite state machine. It should be noted that the creation of the consumption order is also one of the business processing operations.
Starting from an order creating state, the terminal carries out state transition on the state of the consumption order according to the state transition condition triggered by the state of the finite state machine where the consumption order is located until the state of the consumption order reaches the ending state of the finite state machine.
Optionally, in the process of performing state transition on the state of the consumption order, a state transition condition corresponding to the current state to which the consumption order belongs is obtained, and whether the state transition condition is triggered is detected. It should be understood that there is at least one state transition condition for each state of the finite state machine, each state transition condition being associated with its corresponding state transition relationship, each state transition relationship pointing to a unique one of the states.
Optionally, when the terminal detects that the consumption order has the triggered state transition condition in the current state, the terminal obtains a state transition relationship corresponding to the triggered state transition condition, and performs state transition on the current state of the consumption order according to the state pointed by the state transition relationship, so as to transition the consumption order from the current state to the state pointed by the state transition relationship, that is, the state pointed by the state transition relationship is the next state to which the consumption order is transitioned from the current state. Meanwhile, the terminal records state identifiers corresponding to all states to which the consumption order is transferred, and records operation codes corresponding to client operation triggered in each state.
Optionally, if the terminal does not detect that the consumption order has the triggered state transition condition in the current state, the current state of the consumption order is maintained, that is, the consumption order is still in the current state.
As set forth in step S40: when the consumption order is created, the terminal can create state transition information for the consumption order at the same time, and the state transition information is used for recording the state identifier and/or the operation code of the state of the consumption order in the state transition process of the finite state machine.
Optionally, the newly created state transition information is null, and in the process of performing state transition on the consumption order in the finite state machine, the terminal may detect the state of the finite state machine where the consumption order is currently located, acquire a state identifier corresponding to the current state and/or an operation code corresponding to an operation triggered in the current state, and then update the state transition information corresponding to the consumption order according to the acquired state identifier and/or operation code.
For example, when the state identifier of the order new state is Z1, the state identifier of the order cancelled state is Z3, the state identifier of the end state is Z0, and the operation code for canceling the order operation is C0, the generated state transition information: Z1-C0-Z3-Z0, which can be used to characterize a complete state transition process.
Optionally, when there are multiple types of consumption orders, corresponding order type codes may be allocated to the different types of consumption orders, and the order type codes are added to the state transition information to distinguish the different types of consumption orders, that is, the newly-created state transition information at least includes the order type codes. For example, a vehicle insurance order is set to E0, a parking fee order is set to E1, and the like.
Optionally, each flow node in the service flow information of the consumption service corresponds to each state in the finite state machine one to one, and the state identifier and the operation code in the state transition information have corresponding literal meanings, so that after the state of the consumption order is transitioned to the ending state of the finite state machine, the terminal obtains the finally updated state transition information, and converts the state transition information into order flow information of the consumption order. Specifically, the state transition information is converted into corresponding text information according to the state identifier and the word meaning corresponding to the operation code included in the state transition information, so as to obtain order flow information. For example, the state identifier and the operator in the state transition information are converted into corresponding text information, and the text information content is combed and integrated.
In an embodiment, a business process for obtaining and associating a consumption order based on a finite state machine not only enables the order process to be built more simply and is convenient to maintain and expand, but also avoids the low generation efficiency of order process information caused by the fact that the order state is maintained by adopting complicated judgment statements, and the order state of a process node related to the consumption order can be conveniently recorded by utilizing the finite state machine, so that the efficiency of generating the order process information corresponding to the consumption order is improved, and the order process can be conveniently checked subsequently by recording the corresponding state transfer information.
In an embodiment, on the basis of the foregoing embodiment, after the step of configuring the finite state machine according to the service flow information, the method further includes:
step S50, creating a logic branch corresponding to each state according to the state transition condition of each state of the finite state machine;
step S60, according to the sequence of each state transition of the finite state machine, executing a plurality of logic branches and testing the logic branches;
step S61, detecting whether the logic branches pass the test;
step S62, if yes, executing the creation instruction of the received consumption order, and performing state transition on the state of the consumption order according to the state transition condition triggered by the state of the finite state machine where the consumption order is located; and
step S63, if not, determining the logical branch that fails the test, and generating notification information of the state corresponding to the logical branch that fails the test.
In this embodiment, after the configuration of the finite state machine is completed, the terminal may traverse each state of the finite state machine, the state transition condition of each state, and the next state to which each state transition condition is directed, and create a logic branch corresponding to each state. The logic branch is characterized in that when each state condition of the current state is triggered, the current state correspondingly carries out a state transition path.
Optionally, the terminal is pre-configured with an automatic test tool, the automatic test tool is used to traverse the plurality of logic branches and execute the plurality of logic branches sequentially or in parallel, and the automatic test tool can test the plurality of logic branches and record operations executed by the plurality of logic branches in the storage system.
The logic executed by the automated testing tool on each logic branch is as follows: the automated testing tool detects whether the state actually transferred to after the state transfer condition of the state is triggered is the same as the next state pointed by the state transfer condition in each state. If yes, the state transition condition test is passed; if not, the state transition condition test fails.
Optionally, after all the state transition condition tests in the current state pass, it is determined that the logic branch test corresponding to the current test state passes; and when at least one state transition condition test fails in the current state, judging that the logic branch test corresponding to the current test state fails.
Optionally, after testing all the logic branches, the terminal further detects whether all the logic branches pass the test.
Optionally, when the terminal detects that there is a logic branch that fails the test, it determines that the logic branch fails the test, and then generates notification information according to the relevant information of the state corresponding to the logic branch that fails the test and the state transition condition corresponding to the logic branch that fails the test. And then the notification information is output to the associated equipment of the engineer so as to facilitate the engineer to check the state of the specific fault.
Optionally, after the terminal detects that all the logic branches pass the test, it determines that the finite state machine operates normally, and formally puts the finite state machine into use, and executes the creation instruction of the received consumption order, and then performs a step of performing state transition on the state of the consumption order according to the state transition condition triggered by the state of the finite state machine where the consumption order is located (i.e., step S30).
Therefore, the finite-state machine of the consumption order is automatically tested, the finite-state machine is conveniently subjected to fault troubleshooting, and the finite-state machine is put into use after passing the test, so that the reliability of the finite-state machine can be improved.
In an embodiment, on the basis of the above embodiment, the step of generating order flow information of the consumption order according to the process of performing state transition of the consumption order in the finite state machine includes:
step S41, updating the state transition information of the consumption order according to the state identifier corresponding to the state experienced by the consumption order in the state transition process in the finite state machine; and the number of the first and second groups,
step S42, detecting whether the state of the consumption order is transferred to the ending state of the finite state machine;
and step S43, if yes, generating order flow information of the consumption order according to the state transition information.
In this embodiment, in the process of performing state transition on the consumption order in the finite state machine, the terminal may detect a state of the finite state machine where the consumption order is currently located, acquire a state identifier corresponding to the current state and/or an operation code corresponding to an operation triggered in the current state, and then update state transition information corresponding to the consumption order according to the acquired state identifier and/or operation code.
Optionally, the terminal may detect whether the current state of the consumption order is transferred to the end state of the finite state machine while updating the state transfer information of the consumption order according to the state identifier. And when the terminal detects that the state of the consumption order is transferred to the ending state of the finite state machine, the terminal acquires the finally updated state transfer information and converts the state transfer information into order flow information of the consumption order. Specifically, the state transition information is converted into corresponding text information according to the state identifier and the word meaning corresponding to the operation code included in the state transition information, so as to obtain order flow information.
Further, after the step S41, the terminal further performs the step S70: and storing the updated state transition information to the block link point corresponding to the current state of the consumption order.
Optionally, the terminal allocates a corresponding block link point for each state in the finite state machine in advance, and the block link point may be used to store the state transition information in a chain type account book manner. The Ledger (Ledger) is a general term for a block chain (also referred to as Ledger data) and a state database synchronized with the block chain.
The blockchain is a novel application mode of computer technologies such as distributed data storage, point-to-point transmission, a consensus mechanism and an encryption algorithm. A block chain (Blockchain), which is essentially a decentralized database, is a series of data blocks associated by using a cryptographic method, and each data block contains information of a batch of network transactions, so as to verify the validity (anti-counterfeiting) of the information and generate a next block. The blockchain may include a blockchain underlying platform, a platform product services layer, and an application services layer.
The block chain underlying platform can comprise processing modules such as user management, basic service, intelligent contract and operation monitoring. The user management module is responsible for identity information management of all blockchain participants, and comprises public and private key generation maintenance (account management), key management, user real identity and blockchain address corresponding relation maintenance (authority management) and the like, and under the authorization condition, the user management module supervises and audits the transaction condition of certain real identities and provides rule configuration (wind control audit) of risk control; the basic service module is deployed on all block chain node equipment and used for verifying the validity of the service request, recording the service request to storage after consensus on the valid request is completed, for a new service request, the basic service firstly performs interface adaptation analysis and authentication processing (interface adaptation), then encrypts service information (consensus management) through a consensus algorithm, transmits the service information to a shared account (network communication) completely and consistently after encryption, and performs recording and storage; the intelligent contract module is responsible for registering and issuing contracts, triggering the contracts and executing the contracts, developers can define contract logics through a certain programming language, issue the contract logics to a block chain (contract registration), call keys or other event triggering and executing according to the logics of contract clauses, complete the contract logics and simultaneously provide the function of upgrading and canceling the contracts; the operation monitoring module is mainly responsible for deployment, configuration modification, contract setting, cloud adaptation in the product release process and visual output of real-time states in product operation, such as: alarm, monitoring network conditions, monitoring node equipment health status, and the like.
Optionally, during the process that the terminal performs state transition on the consumption order in the finite state machine, the terminal may detect the state of the finite state machine where the consumption order is currently located, acquire a state identifier corresponding to the current state and/or an operation code corresponding to an operation triggered in the current state, and then update the state transition information corresponding to the consumption order according to the acquired state identifier and/or operation code.
Further, the terminal stores the updated state transition information into the block chain node corresponding to the current state of the consumption order. Therefore, when the consumption order is transferred to a state, the block chain link point corresponding to the state stores the latest state transfer information of the consumption order in a chain type account book mode, and updates and synchronizes the latest state transfer information to other block chain nodes.
When the terminal executes step S42, that is, when the terminal detects that the consumption order reaches the end state of the finite state machine, and needs to generate the order flow information of the consumption order according to the state transition information, the terminal may obtain the finally updated state transition information from any block chain node, so as to generate the order flow information.
In this way, the block chain technology is used for updating and storing the state transition information which can be used for the process of performing state transition on the double consumption orders in the finite state machine, so that the state transition information of the consumption orders which are performing state transition in the finite state machine is not easy to lose even if the system crashes.
In an embodiment, on the basis of the foregoing embodiment, after the step of configuring the finite state machine according to the service flow information, the method further includes:
step S80, in the process of the state transition of the consumption order in the finite state machine, detecting whether the state of the consumption order is transferred to the data auditing state of the finite state machine;
step S90, if yes, acquiring first information according to the data file uploaded by the client, wherein the first information comprises owner information and vehicle information;
step S91, detecting whether the first information is consistent with second information associated with the consumption order;
step S91, when the first information is detected to be consistent with the second information, the consumption order is transferred from the material auditing state to a material auditing passing state of the finite-state machine;
and step S92, when the first information is detected to be inconsistent with the second information, transferring the consumption order from the material auditing state to a material auditing non-passing state of the finite-state machine.
In this embodiment, the terminal pre-text recognition technology trains a text recognition model, and the application program interface corresponding to the data verification operation in the data verification state can call the text recognition model.
In the process of carrying out state transition on the consumption order in the finite state machine, the terminal can detect whether the state of the consumption order is transferred to a treatment auditing state of the finite state machine in real time.
Optionally, when the terminal detects that the state (i.e., the current state) of the consumption order is transferred to the data auditing state, the terminal invokes an application program interface corresponding to the data auditing operation, identifies the data file uploaded by the user in the data uploading state (i.e., the last state of the data auditing state) through the client by using the text recognition model, and extracts the owner information and the vehicle information from the data file as the first information.
And simultaneously, the terminal extracts the owner information and the vehicle information as second information according to the user information associated with the consumption order.
Further, the terminal detects whether the first information is consistent with the second information; when the terminal detects that the owner information in the first information is the same as the owner information in the second information and the vehicle information in the first information is the same as the vehicle information in the second information, the first information is judged to be consistent with the second information; and when the terminal detects that the owner information in the first information is different from the owner information in the second information and/or the vehicle information in the first information is different from the vehicle information in the second information, judging that the first information is inconsistent with the second information.
Optionally, when the terminal detects that the first information is consistent with the second information, it is determined that the state transition condition triggered in the data audit state is that the data audit is passed, and a state transition relation corresponding to the data audit pass is obtained, and the state transition is performed on the consumption order according to the data audit pass state pointed by the state transition relation, that is, the state transition is performed from the data audit state to the data audit pass state.
Optionally, when the terminal detects that the first information is inconsistent with the second information, it is determined that the state transition condition triggered in the data audit state is that the data audit is not passed, and a state transition relation corresponding to the data audit not passed is obtained, and the state transition is performed on the consumption order according to the data audit not passed state pointed by the state transition relation, that is, the state transition is performed from the data audit state to the data audit not passed state.
Therefore, the automatic checking of the owner information and the vehicle information based on the finite-state machine is realized, the cost of manually checking the data is saved, and the efficiency of checking the data is improved.
Referring to fig. 3, an embodiment of the present application further provides a flow management device 100 for a consumption order, including:
the traversal module 101 is configured to traverse an upstream-downstream relationship between each flow node in a business flow of a consumption service, and a client operation allowed by the flow node and/or a business processing operation that can be called by the flow node, to obtain business flow information;
a configuration module 102, configured to configure a finite state machine according to the service process information, where states in the finite state machine correspond to the process nodes, and a state transition condition of each state is generated according to the client operation and/or the service processing operation of the process node corresponding to the state;
the management module 103 is configured to receive a creation instruction of a consumption order, and perform state transition on a state of the consumption order according to the state transition condition triggered by the state of the finite state machine where the consumption order is located;
a generating module 104, configured to generate order flow information of the consumption order according to a process of performing state transition on the consumption order in the finite state machine.
Referring to fig. 4, a computer device, which may be a server and whose internal structure may be as shown in fig. 4, is also provided in the embodiment of the present application. The computer device includes a processor, a memory, a network interface, and a database connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program, and a database. The internal memory provides an environment for the operation of an operating system and computer programs in the non-volatile storage medium. The database of the computer device is used for a process management program for the consumption order. The network interface of the computer device is used for communicating with an external terminal through a network connection. The computer program is executed by a processor to implement a method of process management of a consumption order.
Those skilled in the art will appreciate that the architecture shown in fig. 4 is only a block diagram of some of the structures associated with the present solution and is not intended to limit the scope of the present solution as applied to computer devices.
Furthermore, the present application also proposes a computer-readable storage medium, which includes a process management program of a consumption order, and when being executed by a processor, the process management program of the consumption order implements the steps of the process management method of the consumption order as described in the above embodiments. It is to be understood that the computer-readable storage medium in the present embodiment may be a volatile-readable storage medium or a non-volatile-readable storage medium.
In summary, the consumption order flow management method, the consumption order flow management device, the computer device, and the storage medium provided in the embodiments of the present application acquire and associate a consumption order service flow based on a finite state machine, so that not only is the establishment of the order flow simpler, but also maintenance and expansion are facilitated, and low generation efficiency of order flow information due to maintenance of the order state by using a complicated judgment statement is avoided.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium provided herein and used in the examples may include non-volatile and/or volatile memory. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), double data rate SDRAM (SSRDRAM), Enhanced SDRAM (ESDRAM), synchronous Link (Synchlink) DRAM (SLDRAM), Rambus (Rambus) direct RAM (RDRAM), direct bused dynamic RAM (DRDRAM), and bused dynamic RAM (RDRAM).
It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, apparatus, article, or method that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, apparatus, article, or method. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, apparatus, article, or method that includes the element.
The above description is only for the preferred embodiment of the present application and not intended to limit the scope of the present application, and all modifications of equivalent structures and equivalent processes, which are made by the contents of the specification and the drawings of the present application, or which are directly or indirectly applied to other related technical fields, are intended to be included within the scope of the present application.
Claims (10)
1. A method for process management of a consumption order, comprising:
traversing the upstream and downstream relation between each process node in the service process of the consumption service, and the client operation allowed by the process node and/or the service processing operation called by the process node to obtain service process information;
configuring a finite state machine according to the business process information, wherein states in the finite state machine correspond to the process nodes, and a state transition condition of each state is generated according to the client operation and/or the business processing operation of the process node corresponding to the state;
receiving a creating instruction of a consumption order, and carrying out state transition on the state of the consumption order according to the state transition condition triggered by the state of the finite state machine where the consumption order is located;
and according to the process of state transition of the consumption order in the finite state machine, generating order flow information of the consumption order.
2. The process management method according to claim 1, wherein said step of performing a state transition on the state of the consumption order according to the state transition condition triggered by the state of the finite state machine in which the consumption order is located comprises:
acquiring a state transition condition corresponding to the state of the finite state machine where the consumption order is located;
detecting whether the state transition condition is triggered;
if so, transferring the state of the finite state machine where the consumption order is located to the state pointed by the state transfer relation according to the state transfer relation corresponding to the state transfer condition.
3. The process management method of a consumption order of claim 1, wherein after said step of configuring a finite state machine according to said business process information, further comprising:
creating a logic branch corresponding to each state according to the state transition condition of each state of the finite state machine;
executing a plurality of logic branches according to the sequence of each state transition of the finite state machine, and testing the logic branches;
detecting whether the logical branches all pass the test;
and if so, executing the creation instruction of the received consumption order, and carrying out state transition on the state of the consumption order according to the state transition condition triggered by the state of the finite state machine where the consumption order is located.
4. The method for process management of a consumption order of claim 3, wherein said step of detecting whether said logical branches each pass a test further comprises:
if not, determining the logic branch which fails the test, and generating the notification information of the state corresponding to the logic branch which fails the test.
5. The process management method of a consumption order according to claim 1, wherein said step of generating order process information of said consumption order according to the process of state transition of said consumption order in said finite state machine comprises:
updating the state transition information of the consumption order according to a state identifier corresponding to the state experienced by the consumption order in the state transition process in the finite state machine; and the number of the first and second groups,
detecting whether the state of the consumption order is transferred to the end state of the finite-state machine;
and if so, generating order flow information of the consumption order according to the state transition information.
6. The process management method according to claim 5, wherein after the step of updating the state transition information of the consumption order according to the state identifier corresponding to the state experienced by the consumption order during the state transition in the finite state machine, the process management method further comprises:
and storing the updated state transition information to the block link point corresponding to the current state of the consumption order.
7. The process management method of a consumption order of claim 1, wherein after said step of configuring a finite state machine according to said business process information, further comprising:
detecting whether the state of the consumption order is transferred to a data auditing state of the finite-state machine or not in the process of transferring the state of the consumption order in the finite-state machine;
if yes, acquiring first information according to the data file uploaded by the client, wherein the first information comprises owner information and vehicle information;
detecting whether the first information is consistent with second information associated with the consumption order;
when the first information is detected to be consistent with the second information, the consumption order is transferred to a data auditing passing state of the finite state machine from the data auditing state;
and when the first information is detected to be inconsistent with the second information, transferring the consumption order from the data auditing state to a data auditing non-passing state of the finite state machine.
8. A process management apparatus for a consumption order, comprising:
the system comprises a traversal module, a processing module and a processing module, wherein the traversal module is used for traversing the upstream and downstream relation between each process node in the service process of the consumption service, the client operation allowed by the process nodes and/or the service processing operation called by the process nodes to obtain service process information;
a configuration module, configured to configure a finite state machine according to the service flow information, where states in the finite state machine correspond to the flow nodes, and a state transition condition of each state is generated according to the client operation and/or the service processing operation of the flow node corresponding to the state;
the management module is used for receiving a creating instruction of a consumption order and carrying out state transition on the state of the consumption order according to the state transition condition triggered by the state of the finite state machine where the consumption order is located;
and the generating module is used for generating order flow information of the consumption order according to the process of state transition of the consumption order in the finite-state machine.
9. A computer device comprising a memory, a processor and a process management program for a consumption order stored on said memory and executable on said processor, said process management program for a consumption order when executed by said processor implementing the steps of the process management method for a consumption order according to any of claims 1 to 7.
10. A computer-readable storage medium, characterized in that the computer-readable storage medium has stored thereon a process management program for a consumption order, which when executed by a processor implements the steps of the process management method for a consumption order according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011290358.4A CN112330298A (en) | 2020-11-17 | 2020-11-17 | Consumption order flow management method and device, computer equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011290358.4A CN112330298A (en) | 2020-11-17 | 2020-11-17 | Consumption order flow management method and device, computer equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112330298A true CN112330298A (en) | 2021-02-05 |
Family
ID=74321200
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011290358.4A Pending CN112330298A (en) | 2020-11-17 | 2020-11-17 | Consumption order flow management method and device, computer equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112330298A (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110310170A (en) * | 2019-05-24 | 2019-10-08 | 深圳壹账通智能科技有限公司 | Order processing method, apparatus, electronic equipment and storage medium |
| CN110390500A (en) * | 2018-04-17 | 2019-10-29 | 阿里巴巴集团控股有限公司 | A kind of business progress processing method and processing device |
| CN111144982A (en) * | 2019-12-20 | 2020-05-12 | 网联清算有限公司 | Order state transition method and device, electronic equipment and storage medium |
| CN111507676A (en) * | 2019-01-31 | 2020-08-07 | 北京京东尚科信息技术有限公司 | Method, device, storage medium and system for establishing and implementing business order flow |
-
2020
- 2020-11-17 CN CN202011290358.4A patent/CN112330298A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110390500A (en) * | 2018-04-17 | 2019-10-29 | 阿里巴巴集团控股有限公司 | A kind of business progress processing method and processing device |
| CN111507676A (en) * | 2019-01-31 | 2020-08-07 | 北京京东尚科信息技术有限公司 | Method, device, storage medium and system for establishing and implementing business order flow |
| CN110310170A (en) * | 2019-05-24 | 2019-10-08 | 深圳壹账通智能科技有限公司 | Order processing method, apparatus, electronic equipment and storage medium |
| CN111144982A (en) * | 2019-12-20 | 2020-05-12 | 网联清算有限公司 | Order state transition method and device, electronic equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112632575A (en) | Authority management method and device of business system, computer equipment and storage medium | |
| CN110543788A (en) | Data storage method, data storage device, computer-readable storage medium and computer equipment | |
| CN109728954A (en) | Alliance's chain node management system and method | |
| CN112163131A (en) | Configuration method and device of business data query platform, computer equipment and medium | |
| CN112700246B (en) | Block chain-based data processing method, device, equipment and readable storage medium | |
| CN112667499A (en) | Page component testing method and device, computer equipment and storage medium | |
| CN111090581A (en) | Intelligent contract testing method and device, computer equipment and storage medium | |
| CN110597541B (en) | Interface updating processing method, device, equipment and storage medium based on block chain | |
| CN112487037A (en) | Cache data processing method and device, computer equipment and storage medium | |
| CN109120616A (en) | A kind of identity identifying method, device, agency service end and storage medium | |
| CN112434335A (en) | Business problem processing method and device, computer equipment and storage medium | |
| CN113660229B (en) | Multi-system single sign-on method, device, equipment and medium based on RPA | |
| CN114817055A (en) | Regression testing method and device based on interface, computer equipment and storage medium | |
| CN112395125A (en) | Method and device for notifying page error report, computer equipment and storage medium | |
| CN114510589A (en) | Enterprise financial data entry method and device and electronic equipment | |
| CN112328285A (en) | Method, device, equipment and medium for producing and updating new functions of system | |
| CN111865927B (en) | Vulnerability processing method and device based on system, computer equipment and storage medium | |
| CN112330298A (en) | Consumption order flow management method and device, computer equipment and storage medium | |
| CN110874492B (en) | Data processing method, device, computing equipment and system | |
| CN111797410A (en) | Multi-server authorization control method and device | |
| CN110619511A (en) | Electronic bill processing method and device, readable storage medium and computer equipment | |
| CN111797002A (en) | Workflow testing method, device, equipment and storage medium based on Oozie | |
| US11526625B2 (en) | Systems for sanitizing production data for use in testing and development environments | |
| CN112612555A (en) | Method, device, equipment and storage medium for acquiring call chain of third-party library | |
| CN112328260A (en) | SQL statement conversion method and device based on big data platform and computer equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |