CN116432997A - Method and system for recovering and reproducing already-done process - Google Patents
Method and system for recovering and reproducing already-done process Download PDFInfo
- Publication number
- CN116432997A CN116432997A CN202310691908.0A CN202310691908A CN116432997A CN 116432997 A CN116432997 A CN 116432997A CN 202310691908 A CN202310691908 A CN 202310691908A CN 116432997 A CN116432997 A CN 116432997A
- Authority
- CN
- China
- Prior art keywords
- flow
- task
- node
- module
- transacted
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 195
- 230000008569 process Effects 0.000 title claims abstract description 162
- 238000011084 recovery Methods 0.000 claims abstract description 38
- 230000000694 effects Effects 0.000 claims abstract description 28
- 230000000977 initiatory effect Effects 0.000 claims abstract description 14
- 238000012790 confirmation Methods 0.000 claims description 16
- 238000005457 optimization Methods 0.000 claims description 6
- 230000003213 activating effect Effects 0.000 claims description 5
- 238000010200 validation analysis Methods 0.000 claims description 2
- 238000012545 processing Methods 0.000 description 6
- 230000007246 mechanism Effects 0.000 description 3
- RWSOTUBLDIXVET-UHFFFAOYSA-N Dihydrogen sulfide Chemical compound S RWSOTUBLDIXVET-UHFFFAOYSA-N 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000009969 flowable effect Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000004913 activation Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000006378 damage Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000012216 screening Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0633—Workflow analysis
-
- 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/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
-
- 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
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
- Y02P90/30—Computing systems specially adapted for manufacturing
Abstract
The invention relates to the technical field of process recovery, in particular to a method and a system for recovering and reproducing an already-done process. The method comprises the following steps: judging whether the process is a transacted process or not; retrieving the transacted flow, and moving the activity to a task initiating node of the transacted flow; querying all nodes in the transacted flow, selecting a designated node, moving the activity to the selected node, and generating a new task to be handled; and according to the flow chart of the transacted flow, transacting from the selected node. The system comprises a judging module, a retrieving module, a node selecting module and a handling module. The invention can meet the requirement that the process is submitted again after the recovery of the process manager if the process is found to be inappropriately handled in the process or after the process is finished, and the process can be continued according to the expected result trend by manually intervening the process trend.
Description
Technical Field
The invention belongs to the technical field of process recovery, and particularly relates to a method and a system for recovering and reproducing an already-done process.
Background
In an actual business scene, particularly in the government field, the requirement on the processing result of the flow is relatively normal, and for the processed flow, if the data is incorrectly filled in the processing process of the flow and needs to be modified, the demand for recovery is met, and after recovery, if all nodes are completely re-processed, the processing is obviously not very suitable, so that the process needs to jump to the designated node for processing.
However, the conventional flow engine has 2 problems aiming at the service scene, and at the first point, when the flow is completed, the objects such as the EXECUTION instance table object act_ru_execution, the executing flow VARIABLE table object act_ru_variable, the flow VARIABLE history table object act_ru_active and the like are automatically destroyed and cannot be operated any more; and secondly, when the task is completed, a task to be handled is automatically created for the next node, and any node cannot be selected for circulation.
Based on the above, the present invention provides a method and system for recovering and re-handling the already-handled flow to solve the above-mentioned problems.
Disclosure of Invention
In view of the foregoing, the present invention provides a method for reclaiming and re-hosting an already-sponsored process, the method comprising:
judging whether the process is a transacted process or not;
retrieving the transacted flow, and moving the activity to a task initiating node of the transacted flow;
querying all nodes in the transacted flow, selecting a designated node, moving the activity to the selected node, and generating a new task to be handled;
and according to the flow chart of the transacted flow, transacting from the selected node.
Preferably, before determining whether the process is a completed process, the method further comprises: and optimizing the process release and process handling processes.
Preferably, the optimizing the distribution of the flow includes:
and analyzing the flow chart element of the flow, generating a virtual task node in front of the end node of the flow, and marking the virtual task node as the end task element.
Preferably, the optimizing the procedure handling process includes:
judging whether the mark of the task node to be handled in the flow is an ending task element, if so, indicating that the branch in the flow is ended;
searching other to-be-handled task nodes, and if the identifiers of all to-be-handled task nodes are all ending task elements, describing that the flow is ended;
and marking the flow judged to be ended, wherein the marking is marked as a confirmation ending flow.
Preferably, determining whether the process is a completed process includes:
judging whether the flow mark is a confirmation ending flow:
if yes, the process is a checked process;
if not, the process is an unclassified process.
Preferably, when judging whether the flow is a flow which is already in the process of junction, if the flow is not in the process of junction, moving the activity to a node for initiating the task, and activating the task to be processed initiated by the flow.
Preferably, retrieving the completed flow includes:
deleting the identification of the flow which is confirmed to end the process, and adding a recovery mark for the flow.
Preferably, before querying all nodes of the already-done flow, the method further comprises:
judging whether the process is added with a recovery mark, and if not, transacting according to a flow chart of the process; if the retraction flag is added, all nodes are queried and a designated node selection application is submitted.
Preferably, after submitting the designated node selection application, deleting the recovery mark of the flow, moving the activity to the selected node, and generating a new task to be handled.
The invention also provides a system for recovering and reproducing the processed flow, which comprises a judging module, a recovering module, a node selecting module and a handling module;
the judging module is used for judging whether the flow is a transacted flow or not;
the recovery module is used for recovering the processed flow and moving the activity to a task initiating node of the processed flow;
the node selection module is used for inquiring all nodes in the transacted flow, selecting a designated node and moving the activity to the selected node to generate a new task to be handled;
the transacting module is used for transacting from the selected node according to the flow chart of the transacted flow.
Preferably, the system further comprises an optimization module;
the optimizing module is used for optimizing the process release and the process handling process.
Preferably, the optimizing module is configured to optimize the process release, and includes:
the optimization module is used for analyzing the flow chart elements of the flow, generating a virtual task node in front of the end node of the flow and marking the virtual task node, wherein the mark is marked as the end task element.
Preferably, the optimizing module is configured to optimize the process of handling the procedure, including:
the optimizing module is used for judging whether the mark of the task node to be handled in the flow is an ending task element, if so, the branch in the flow is ended;
searching other to-be-handled task nodes, and if the identifiers of all to-be-handled task nodes are all ending task elements, describing that the flow is ended;
and marking the flow judged to be ended, wherein the marking is marked as a confirmation ending flow.
Preferably, the determining module is configured to determine whether the process is a completed process, including:
judging whether the flow mark is a confirmation ending flow:
if yes, the process is a checked process;
if not, the process is an unclassified process.
Preferably, when the judging module judges whether the flow is a flow which is already in the process of junction, if the flow is not in the process of junction, the judging module moves the activity to the node initiating the task, and activates the task to be handled initiated by the flow.
Preferably, the retrieving module is configured to retrieve an already-done process, and includes:
the retraction module is used for deleting the identification of the flow which is confirmed to end by the process, and adding a retraction mark for the flow.
Preferably, the system further comprises a confirmation module:
the confirmation module is used for judging whether the process is added with the recovery mark, and if the recovery mark is not added, the process is conducted according to a flow chart of the process; if the retraction flag is added, all nodes are queried and a designated node selection application is submitted.
Preferably, after submitting the designated node selection application, deleting the recovery mark of the flow, moving the activity to the selected node, and generating a new task to be handled.
The invention has the following beneficial effects:
(1) The invention realizes the recovery function of the flow which is not in check and is in check on the basis of not damaging the flow logic structure, and can jump to any node to continue check after recovery;
(2) The invention can meet the requirement that the process is submitted again after the recovery of the process manager if the process is found to be inappropriately handled in the process or after the process is finished, and the process can be continued according to the expected result trend by manually intervening the process trend.
Additional features and advantages of the invention will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention. The objectives and other advantages of the invention may be realized and attained by the structure particularly pointed out in the written description and drawings.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions of the prior art, the following description will briefly explain the drawings used in the embodiments or the description of the prior art, and it is obvious that the drawings in the following description are some embodiments of the present invention, and other drawings can be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a diagram of a method for reclaiming replay of an already-done flow in an embodiment of the invention;
FIG. 2 is a system diagram illustrating a recovery replay for an already-done flow in accordance with an embodiment of the invention.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention, and it is apparent that the described embodiments are some embodiments of the present invention, but not all embodiments of the present invention. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
As shown in FIG. 1, the present invention proposes a method for reclaiming and re-hosting an already-sponsored process, the method comprising:
(1) Judging whether the process is a transacted process
Before judging whether the flow is the transacted flow, the method further comprises the following steps: and optimizing the process release and process handling processes. The flow distribution refers to analyzing the designed flow chart according to the bpmn2.0 specification to generate a standard flow chart document conforming to the bpmn2.0 specification.
The optimizing the process release comprises the following steps: and analyzing flow chart elements of the flow, generating a virtual Task node in front of an ending node of the flow, and marking the virtual Task node as an ending Task Element end Task Element. In this embodiment, the flowchart element is specifically a business process modeling symbol (Business Process Model and Notation, abbreviated as BPMN).
The optimizing the process handling process comprises: judging whether the mark of the Task node to be handled in the process is an end Task Element, if the end Task Element is a wire, indicating that the branch in the process is ended; searching other to-be-handled Task nodes, and if the end Task Element identifiers of all to-be-handled Task nodes are all wire, describing that the flow is finished; the flow judged to have ended is marked, and the mark is identified as a confirmation ending flow is End Process.
The judging whether the process is the transacted process comprises the following steps: judging whether the flow mark is a confirmation ending flow: if yes, the process is a checked process; if not, the process is an unclassified process.
And when judging whether the flow is the flow which is already in the process of junction, if the flow is not in the process of junction, moving the activity to a node for initiating the task, and activating the task to be processed initiated by the flow.
In this embodiment, the pseudo code for initiating the task to be handled by the activation flow is:
List<Execution>executions = runtimeService.createExecutionQuery().parentId(historicTaskInstance.getProcessInstanceId()).list();
executions.forEach(execution->executionIds.add(execution.getId()));
runtimeService.createChangeActivityStateBuilder()
.moveExecutionsToSingleActivityId(executionIds, activityId)
.changeState();
(2) Retrieving the processed flow, and moving the activity to a task initiating node of the processed flow
Retrieving the transacted flow includes: and deleting the identification of the flow which is confirmed to end by the process, and adding a recovery mark like Back for the flow.
(3) Querying all nodes in the processed flow, selecting a designated node, moving the activity to the selected node, and generating a new task to be processed
Before querying all nodes of the already-processed flow, the method further comprises the following steps: judging whether the process is added with a recovery mark, and if not, transacting according to a flow chart of the process; if the retraction flag is added, all nodes are queried and a designated node selection application is submitted.
In this embodiment, the pseudo code for querying all nodes is:
List<HistoricActivityInstance>list = historyService.createHistoricActivityInstanceQuery()
.processInstanceId(historicTaskInstance.getProcessInstanceId())
.orderByHistoricActivityInstanceStartTime().asc()
.orderByHistoricActivityInstanceEndTime().asc().list();
List<String>elementKeyList = new ArrayList<>();
for (HistoricActivityInstance activityInstance: list) {
if (!("userTask".equals(activityInstance.getActivityType()) ||
"callActivity".equals(activityInstance.getActivityType()))) {
continue;
}
if (elementKeyList.contains(activityInstance.getActivityId())) {
continue;
}
elementKeyList.add(activityInstance.getActivityId());
}
after the application of selecting the designated node is submitted, the recovery mark of the flow is deleted, the activity is moved to the selected node, and a new task to be handled is generated.
(4) Proceeding from the selected node according to the flow chart of the processed flow
In this embodiment, the flow used is a flow, and if the data needs to be cleaned when the flow is already checked, the method mainly includes the following parts:
screening out the processes of all knots exceeding one month;
finding the tasks of all end Task Element nodes in the process, and calling a complete () method to complete the tasks;
triggering a flow process ending mechanism, and automatically destroying objects such as an EXECUTION instance table object ACT_RU_EXECUTION, an executing flow VARIABLE table object ACT_RU_VARIABLE, a flow VARIABLE history table object ACT_RU_ACTINST and the like;
the flow of the clean call can not be reclaimed.
In summary, first, a Task node before an end node is identified during process release, a mechanism for triggering process handling and automatically destroying data during operation is avoided, a virtual Task node is automatically added before the end node to realize the logic, the virtual node is continuously marked, an attribute mark is realized through an expansion attribute extension Elements provided by a flowable, and the marked attribute is named end Task Element;
then when the process is finished, judging whether the next node is provided with an end Task Element mark or not after finishing a Task;
if the end Task Element mark exists, converting the extended attribute mark into an extended variable processVariables of the Task, so that the subsequent use is convenient;
judging whether all the expansion variables of the tasks to be handled are provided with end Task Element marks or not;
if the description flow without the mark exists, the junction is not checked;
if all the tasks to be handled are marked, describing that the Process is completed, marking the Process instance, wherein the marking attribute is an is End Process;
further, during the recovery operation, judging whether the current flow has an is End Process mark, and if so, canceling the mark;
then, the current activity is pointed to the application node through the mobile Executions, the current task to be handled is destroyed, a recovery task is generated for the application node, and the recovery task is identified through a recovery mark, namely a wake back mark;
further, when the task is handled, a take back identifier is judged, and if the identifier is not available, a task to be handled is generated for the next node according to normal logic circulation;
if the cake back identifier exists, the user selects a node to transact when transacting, and all the nodes which have been walked and the next node return as optional ranges are found by traversing the flow chart and the task which has been transacted by the current flow, namely, the flow is allowed to continue to flow backwards before being recovered, and the flow is also allowed to transact again from a certain node in the middle;
designating the current activity to the selected node by mobile execution upon submission by the user;
finally, the process instance object needs to be destroyed in time when running, the system destroys the process instance which is transacted for more than one month by scanning the transacted process through the timed task, the destroying method is to rely on a flow original mechanism, all branches of the process are moved to an ending event by completing all tasks to be handled, and real-time execution and real-time process instance are automatically destroyed;
finally, the whole process example forms a closed loop from creation to transaction, to retraction, and to destruction.
The process instance may also be referred to as a process, and when a user initiates a process application, a process instance is generated according to the flowchart;
the recovery is to the process of the already-done or not-done, the sponsor or process manager finds that the submitted data is wrong when applying, the process returns to the application node to revise the submitted data through the operation recovery, and the appointed node is selected for handling according to the data change condition after the submitting;
the handling is the processing of the tasks generated by the procedure, including the operations of approval passing, rejection, recovery, withdrawal, transfer, sponsorship and the like;
in the process of junction handling, all task nodes are transacted and completed, and all branches point to the junction node;
the node refers to a node on a flow chart generated by flow design, and the flow chart is composed of a plurality of nodes and connecting lines among the nodes.
The practical development frameworks in the embodiment are spring-closed 2020.0.4, spring-closed-alibaba 2.2.3.RELEASE and spring boot 2.5.7, the development language used is java 1.8, and the plug-in used is flowables 6.7.0.
As shown in FIG. 2, the invention further provides a system for recovering and re-processing the processed flow, which comprises a judging module, a recovering module, a node selecting module and a transacting module.
The judging module is used for judging whether the flow is a transacted flow or not, and comprises the following steps: judging whether the flow mark is a confirmation ending flow: if yes, the process is a checked process; if not, the process is an unclassified process. And when the judging module judges whether the flow is the flow which is already in the process of junction, if the flow is not in the process of junction, moving the activity to a node for initiating the task, and activating the task to be processed initiated by the flow.
The retrieving module is used for retrieving the processed flow and moving the activity to a task initiating node of the processed flow. The recovery module is used for recovering the processed knot flow, and comprises the following steps: the retraction module is used for deleting the identification of the flow which is confirmed to end by the process, and adding a retraction mark for the flow.
The node selection module is used for inquiring all nodes in the processed flow, selecting the designated node and moving the activity to the selected node to generate a new task to be handled.
The transacting module is used for transacting from the selected node according to the flow chart of the transacted flow.
The system further comprises an optimization module; the optimizing module is used for optimizing the process release and the process handling process; the optimizing module is used for optimizing the process release, and comprises the following steps: the optimization module is used for analyzing flow chart elements of the flow, generating a virtual task node in front of an ending node of the flow and marking the virtual task node, wherein the marking is marked as the ending task element; the optimizing module is used for optimizing the flow handling process and comprises the following steps: the optimizing module is used for judging whether the mark of the task node to be handled in the flow is an ending task element, if so, the branch in the flow is ended; searching other to-be-handled task nodes, and if the identifiers of all to-be-handled task nodes are all ending task elements, describing that the flow is ended; and marking the flow judged to be ended, wherein the marking is marked as a confirmation ending flow.
The system further includes a validation module: the confirmation module is used for judging whether the process is added with the recovery mark, and if the recovery mark is not added, the process is conducted according to a flow chart of the process; if the retraction flag is added, all nodes are queried and a designated node selection application is submitted. After the application of selecting the designated node is submitted, the recovery mark of the flow is deleted, the activity is moved to the selected node, and a new task to be handled is generated.
Those of ordinary skill in the art will appreciate that: although the invention has been described in detail with reference to the foregoing embodiments, it is to be understood that modifications may be made to the technical solutions described in the foregoing embodiments, or equivalents may be substituted for some of the technical features thereof; such modifications and substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present invention.
Claims (18)
1. A method of reclaiming a replay to an already-sponsored process, the method comprising:
judging whether the process is a transacted process or not;
retrieving the transacted flow, and moving the activity to a task initiating node of the transacted flow;
querying all nodes in the transacted flow, selecting a designated node, moving the activity to the selected node, and generating a new task to be handled;
and according to the flow chart of the transacted flow, transacting from the selected node.
2. A method of reclaiming a replay of an existing transaction flow according to claim 1,
before judging whether the flow is the transacted flow, the method further comprises the following steps: and optimizing the process release and process handling processes.
3. A method of reclaiming a replay of an existing transaction flow according to claim 2,
the optimizing the process release comprises the following steps:
and analyzing the flow chart element of the flow, generating a virtual task node in front of the end node of the flow, and marking the virtual task node as the end task element.
4. A method of reclaiming a replay of an existing transaction flow according to claim 2,
the optimizing the process handling process comprises:
judging whether the mark of the task node to be handled in the flow is an ending task element, if so, indicating that the branch in the flow is ended;
searching other to-be-handled task nodes, and if the identifiers of all to-be-handled task nodes are all ending task elements, describing that the flow is ended;
and marking the flow judged to be ended, wherein the marking is marked as a confirmation ending flow.
5. A method of reclaiming a replay of an existing transaction flow according to claim 4,
the judging whether the process is the transacted process comprises the following steps:
judging whether the flow mark is a confirmation ending flow:
if yes, the process is a checked process;
if not, the process is an unclassified process.
6. A method of reclaiming a replay of an existing transaction flow according to claim 5,
and when judging whether the flow is the flow which is already in the process of junction, if the flow is not in the process of junction, moving the activity to a node for initiating the task, and activating the task to be processed initiated by the flow.
7. A method of reclaiming a replay of an existing transaction flow according to claim 4,
retrieving the transacted flow includes:
deleting the identification of the flow which is confirmed to end the process, and adding a recovery mark for the flow.
8. A method of reclaiming a replay of an existing transaction flow according to claim 7,
before querying all nodes of the already-processed flow, the method further comprises the following steps:
judging whether the process is added with a recovery mark, and if not, transacting according to a flow chart of the process; if the retraction flag is added, all nodes are queried and a designated node selection application is submitted.
9. A method of reclaiming a replay of a sponsored process according to any one of claims 1 to 8,
after the application of selecting the designated node is submitted, the recovery mark of the flow is deleted, the activity is moved to the selected node, and a new task to be handled is generated.
10. The system for recovering and reproducing the processed flow is characterized by comprising a judging module, a recovering module, a node selecting module and a handling module;
the judging module is used for judging whether the flow is a transacted flow or not;
the recovery module is used for recovering the processed flow and moving the activity to a task initiating node of the processed flow;
the node selection module is used for inquiring all nodes in the transacted flow, selecting a designated node and moving the activity to the selected node to generate a new task to be handled;
the transacting module is used for transacting from the selected node according to the flow chart of the transacted flow.
11. The system for reclaiming a replay of an established transaction flow according to claim 10,
the system further comprises an optimization module;
the optimizing module is used for optimizing the process release and the process handling process.
12. The system for reclaiming a replay of an established transaction flow according to claim 11,
the optimizing module is used for optimizing the process release and comprises the following steps:
the optimization module is used for analyzing the flow chart elements of the flow, generating a virtual task node in front of the end node of the flow and marking the virtual task node, wherein the mark is marked as the end task element.
13. The system for reclaiming a replay of an established transaction flow according to claim 11,
the optimizing module is used for optimizing the flow handling process and comprises the following steps:
the optimizing module is used for judging whether the mark of the task node to be handled in the flow is an ending task element, if so, the branch in the flow is ended;
searching other to-be-handled task nodes, and if the identifiers of all to-be-handled task nodes are all ending task elements, describing that the flow is ended;
and marking the flow judged to be ended, wherein the marking is marked as a confirmation ending flow.
14. The system for reclaiming a replay of an established transaction flow according to claim 10,
the judging module is used for judging whether the flow is a transacted flow or not, and comprises the following steps:
judging whether the flow mark is a confirmation ending flow:
if yes, the process is a checked process;
if not, the process is an unclassified process.
15. The system for reclaiming a replay of an established transaction flow according to claim 14,
and when the judging module judges whether the flow is the flow which is already in the process of junction, if the flow is not in the process of junction, moving the activity to a node for initiating the task, and activating the task to be processed initiated by the flow.
16. The system for reclaiming a replay of an established transaction flow according to claim 10,
the recovery module is used for recovering the processed knot flow, and comprises the following steps:
the retraction module is used for deleting the identification of the flow which is confirmed to end by the process, and adding a retraction mark for the flow.
17. The system for reclaiming a replay of an established transaction flow according to claim 10,
the system further includes a validation module:
the confirmation module is used for judging whether the process is added with the recovery mark, and if the recovery mark is not added, the process is conducted according to a flow chart of the process; if the retraction flag is added, all nodes are queried and a designated node selection application is submitted.
18. The system for reclaiming a replay of an established transaction flow according to claim 17,
after the application of selecting the designated node is submitted, the recovery mark of the flow is deleted, the activity is moved to the selected node, and a new task to be handled is generated.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310691908.0A CN116432997B (en) | 2023-06-13 | 2023-06-13 | Method and system for recovering and reproducing already-done process |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310691908.0A CN116432997B (en) | 2023-06-13 | 2023-06-13 | Method and system for recovering and reproducing already-done process |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116432997A true CN116432997A (en) | 2023-07-14 |
| CN116432997B CN116432997B (en) | 2023-10-24 |
Family
ID=87080060
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310691908.0A Active CN116432997B (en) | 2023-06-13 | 2023-06-13 | Method and system for recovering and reproducing already-done process |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116432997B (en) |
Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH09198326A (en) * | 1996-01-19 | 1997-07-31 | Hitachi Ltd | Work flow system with collation function of related user information and work flow system |
| JP2000222500A (en) * | 1999-01-29 | 2000-08-11 | Hitachi Ltd | Method for managing work flow |
| CN103714414A (en) * | 2013-11-30 | 2014-04-09 | 北京科东电力控制系统有限责任公司 | Process node returning method used for intelligent power grid dispatching |
| CN104881759A (en) * | 2015-06-23 | 2015-09-02 | 四川久远银海软件股份有限公司 | Business fallback integrated system based on workflow and realization method thereof |
| US20160260040A1 (en) * | 2013-11-14 | 2016-09-08 | Huawei Technologies Co., Ltd. | Computer Device, Method, and Apparatus for Scheduling Business Flow |
| KR20180037811A (en) * | 2016-10-05 | 2018-04-13 | 주식회사 피앤피닷컴 | Task, Inducer, using the Performer how to manage business processes and project and system |
| CN108647277A (en) * | 2018-05-03 | 2018-10-12 | 山东师范大学 | A kind of mobile campus comprehensive service platform and its working method |
| CN111831988A (en) * | 2020-06-30 | 2020-10-27 | 中国建设银行股份有限公司 | Workflow engine system and implementation method thereof |
| CN112163840A (en) * | 2020-10-29 | 2021-01-01 | 银川安翰互联网医院有限公司 | Workflow definition method, cross-region management method and device of example |
| CN112712335A (en) * | 2020-12-30 | 2021-04-27 | 北京宇信科技集团股份有限公司 | Working method, server, medium and equipment of workflow engine |
| WO2022123291A1 (en) * | 2020-12-08 | 2022-06-16 | Telefonaktiebolaget Lm Ericsson (Publ) | Controlling user interface (ui) transitions based on business process model and notation (bpmn) ui flows |
| CN114707971A (en) * | 2022-06-07 | 2022-07-05 | 深圳市信润富联数字科技有限公司 | Workflow process refute method, device, equipment and computer readable storage medium |
| CN115169891A (en) * | 2022-07-07 | 2022-10-11 | 北京有生博大软件股份有限公司 | Workflow engine comprising multi-starting-point multi-branch flow |
| CN115471174A (en) * | 2022-08-12 | 2022-12-13 | 航天科工网络信息发展有限公司 | New symbol execution workflow process rejection approval method and system |
-
2023
- 2023-06-13 CN CN202310691908.0A patent/CN116432997B/en active Active
Patent Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH09198326A (en) * | 1996-01-19 | 1997-07-31 | Hitachi Ltd | Work flow system with collation function of related user information and work flow system |
| JP2000222500A (en) * | 1999-01-29 | 2000-08-11 | Hitachi Ltd | Method for managing work flow |
| US20160260040A1 (en) * | 2013-11-14 | 2016-09-08 | Huawei Technologies Co., Ltd. | Computer Device, Method, and Apparatus for Scheduling Business Flow |
| CN103714414A (en) * | 2013-11-30 | 2014-04-09 | 北京科东电力控制系统有限责任公司 | Process node returning method used for intelligent power grid dispatching |
| CN104881759A (en) * | 2015-06-23 | 2015-09-02 | 四川久远银海软件股份有限公司 | Business fallback integrated system based on workflow and realization method thereof |
| KR20180037811A (en) * | 2016-10-05 | 2018-04-13 | 주식회사 피앤피닷컴 | Task, Inducer, using the Performer how to manage business processes and project and system |
| CN108647277A (en) * | 2018-05-03 | 2018-10-12 | 山东师范大学 | A kind of mobile campus comprehensive service platform and its working method |
| CN111831988A (en) * | 2020-06-30 | 2020-10-27 | 中国建设银行股份有限公司 | Workflow engine system and implementation method thereof |
| CN112163840A (en) * | 2020-10-29 | 2021-01-01 | 银川安翰互联网医院有限公司 | Workflow definition method, cross-region management method and device of example |
| WO2022123291A1 (en) * | 2020-12-08 | 2022-06-16 | Telefonaktiebolaget Lm Ericsson (Publ) | Controlling user interface (ui) transitions based on business process model and notation (bpmn) ui flows |
| CN112712335A (en) * | 2020-12-30 | 2021-04-27 | 北京宇信科技集团股份有限公司 | Working method, server, medium and equipment of workflow engine |
| CN114707971A (en) * | 2022-06-07 | 2022-07-05 | 深圳市信润富联数字科技有限公司 | Workflow process refute method, device, equipment and computer readable storage medium |
| CN115169891A (en) * | 2022-07-07 | 2022-10-11 | 北京有生博大软件股份有限公司 | Workflow engine comprising multi-starting-point multi-branch flow |
| CN115471174A (en) * | 2022-08-12 | 2022-12-13 | 航天科工网络信息发展有限公司 | New symbol execution workflow process rejection approval method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116432997B (en) | 2023-10-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109684057B (en) | Task processing method and device and storage medium | |
| US5862327A (en) | Activity based long-lived transaction system | |
| CN110992038B (en) | Transaction processing method, device and equipment | |
| CN112114894A (en) | Process processing method and device based on Activiti process engine and electronic equipment | |
| CN109214785B (en) | Workflow implementation method, server and system | |
| US20030126163A1 (en) | Method for file deletion and recovery against system failures in database management system | |
| CN108829415B (en) | Model loading method, server and computer readable storage medium | |
| CN116432997B (en) | Method and system for recovering and reproducing already-done process | |
| CN114385816A (en) | Conversation flow mining method and device, electronic equipment and computer storage medium | |
| CN113961332A (en) | Method and device for realizing workflow engine, electronic equipment and storage medium | |
| CN108897569A (en) | The method for cleaning and computer readable storage medium of iOS engineering discarded record | |
| CN116911763A (en) | Flow approval method, device, terminal equipment and storage medium | |
| CN107621945A (en) | A kind of method and device for the mark for determining ios device | |
| CN116701063A (en) | Persistence method, device and system for internal memory state data for data language of digital networking | |
| CN113485776B (en) | Method and device for processing entity in multithreading rendering | |
| CN110221952B (en) | Service data processing method and device and service data processing system | |
| CN109901933B (en) | Operation method and device of business system, storage medium and electronic device | |
| US20030018683A1 (en) | Method, system and program for deleting work flow item | |
| CN117539451B (en) | Flow execution method, device, electronic equipment and storage medium | |
| CN113687882B (en) | Activiti-based flow rollback method, activiti-based flow rollback device and storage medium | |
| CN115562842A (en) | Process interaction method and system based on Activiti | |
| CN117539946A (en) | Service implementation method, device, computer equipment and storage medium | |
| CN112596783A (en) | Code automatic merging method and device, computer equipment and storage medium | |
| CN117493874A (en) | Method for determining label calculation task, processor and storage medium | |
| CN117114907A (en) | Accounting statistical processing method, device, equipment and storage medium |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |