CN115829521A - Business process management method and device, terminal equipment and storage medium - Google Patents
Business process management method and device, terminal equipment and storage medium Download PDFInfo
- Publication number
- CN115829521A CN115829521A CN202310043322.3A CN202310043322A CN115829521A CN 115829521 A CN115829521 A CN 115829521A CN 202310043322 A CN202310043322 A CN 202310043322A CN 115829521 A CN115829521 A CN 115829521A
- Authority
- CN
- China
- Prior art keywords
- state
- service
- service request
- state machine
- finite
- 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
- 238000000034 method Methods 0.000 title claims abstract description 148
- 230000008569 process Effects 0.000 title claims abstract description 103
- 238000007726 management method Methods 0.000 title claims abstract description 29
- 230000007704 transition Effects 0.000 claims description 73
- 238000012546 transfer Methods 0.000 claims description 46
- 238000004590 computer program Methods 0.000 claims description 21
- 238000012163 sequencing technique Methods 0.000 claims description 12
- 238000007499 fusion processing Methods 0.000 claims description 6
- 238000012545 processing Methods 0.000 description 11
- 230000004044 response Effects 0.000 description 9
- 238000004806 packaging method and process Methods 0.000 description 7
- 230000006870 function Effects 0.000 description 6
- 238000012098 association analyses Methods 0.000 description 5
- 238000010586 diagram Methods 0.000 description 5
- 238000004458 analytical method Methods 0.000 description 4
- 238000012217 deletion Methods 0.000 description 4
- 230000037430 deletion Effects 0.000 description 4
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000005538 encapsulation Methods 0.000 description 2
- 230000003993 interaction Effects 0.000 description 2
- 238000013507 mapping Methods 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 238000013475 authorization Methods 0.000 description 1
- 238000010219 correlation analysis Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
- 238000012800 visualization Methods 0.000 description 1
Images
Landscapes
- Computer And Data Communications (AREA)
Abstract
The application is applicable to the technical field of computers, and provides a business process management method, a business process management device, a terminal device and a storage medium, wherein the method comprises the following steps: acquiring a service request input by a user to a service system; routing the service request to a start state of the finite state machine; repeatedly executing the following steps until the service request is transferred to the ending state of the finite state machine: and determining the target state of the service request from the finite state machine according to the service data corresponding to the current state of the service request in the finite state machine in the service request, and transferring the service request to the target state. The method and the device can improve the throughput of the service system.
Description
Technical Field
The present application belongs to the field of computer technologies, and in particular, to a method and an apparatus for managing a business process, a terminal device, and a storage medium.
Background
As the business demand increases, the business process of the business system becomes more and more complex. Based on this, when the service system responds to the service request, the process of performing association analysis on each node of the service flow becomes more and more complicated, so that the throughput of the service system is low.
Disclosure of Invention
The embodiment of the application provides a business process management method, a business process management device, a terminal device and a storage medium, and can solve the problem of low throughput of a business system.
In a first aspect, an embodiment of the present application provides a method for managing a business process, including:
acquiring a service request input by a user to a service system;
routing the service request to a start state of the finite state machine; the finite state machine is configured in advance according to the service process of the service system;
repeatedly executing the following steps until the service request is transferred to the ending state of the finite state machine: and determining the target state of the service request from the finite state machine according to the service data corresponding to the current state of the service request in the finite state machine in the service request, and transferring the service request to the target state.
Optionally, before routing the service request to the start state of the finite state machine, the method further includes:
analyzing the service process of the service system to obtain the service index of the service system;
using each obtained service index as a state of a finite state machine;
setting transfer conditions among states in a finite state machine to obtain a configured finite state machine;
the configured finite state machine includes a start state, an end state, and at least one intermediate state between the start state and the end state.
Optionally, after setting a transition condition between states in the finite state machine and obtaining the configured finite state machine, the method further includes:
respectively packaging the state and the transfer conditions transferred from the state to other states into tasks aiming at each state except the ending state in the finite state machine, and distributing the tasks to an operation node;
and the finite-state machine has different operation nodes corresponding to each state except the ending state.
Optionally, after the service request is transferred to the end state of the finite state machine, the method further includes: outputting the state transition process information of the service request in the finite state machine;
the state transition process information comprises a starting state, a target state reached by the service request, service data corresponding to the starting state and service data corresponding to the target state reached by the service request.
Optionally, after outputting the state transition process information of the service request in the finite state machine, the method further includes:
performing fusion processing on the content of the state transition process information to obtain service alarm information;
and sending the service alarm information to a service system.
Optionally, the fusion processing is performed on the content of the state transition process information to obtain the service alarm information, and the method includes:
respectively aiming at each state reached by the service request, the service index corresponding to the state and the service request are sent
Obtaining a transfer condition for transferring from the state to a target state corresponding to the state, and using the service data corresponding to the state as a data group;
sequencing the obtained data groups according to the sequence of the service requests transferred to each arrived state;
and taking the data group sequence obtained by sequencing as service alarm information.
Optionally, determining a target state of the service request from the finite state machine according to the service data corresponding to the current state of the service request in the service request, where the determining includes:
matching the service data corresponding to the current state in the service request with at least one transfer condition corresponding to the current state in the finite state machine;
taking a transfer condition matched with the service data corresponding to the current state in at least one transfer condition as a target transfer condition;
and taking the state pointed by the target transition condition in the finite state machine as the target state of the service request.
In a second aspect, an embodiment of the present application provides a business process management apparatus, including:
the acquisition module is used for acquiring a service request input by a user to the service system;
the first transfer module is used for routing the service request to the starting state of the finite state machine; the finite state machine is configured in advance according to the service process of the service system;
the second transfer module is used for repeatedly executing the following steps until the service request is transferred to the ending state of the finite state machine: and determining the target state of the service request from the finite state machine according to the service data corresponding to the current state of the service request in the finite state machine in the service request, and transferring the service request to the target state.
Optionally, the business process management apparatus further includes:
the analysis module is used for analyzing the business process of the business system to obtain the business index of the business system;
the determining module is used for taking each obtained service index as one state of the finite state machine;
the setting module is used for setting transfer conditions among all states in the finite state machine to obtain the configured finite state machine;
the configured finite state machine includes a start state, an end state, and at least one intermediate state between the start state and the end state.
Optionally, the business process management apparatus further includes:
the encapsulation module is used for encapsulating the state and the transfer conditions transferred from the state to other states into tasks aiming at each state except the ending state in the finite state machine and distributing the tasks to an operation node;
and the finite state machine has different operation nodes corresponding to each state except the ending state.
Optionally, the business process management apparatus further includes:
the output module is used for outputting the state transition process information of the service request in the finite state machine;
the state transition process information comprises a starting state, a target state reached by the service request, service data corresponding to the starting state and service data corresponding to the target state reached by the service request.
Optionally, the business process management apparatus further includes:
the processing module is used for carrying out fusion processing on the content of the state transition process information to obtain service alarm information;
and the sending module is used for sending the service alarm information to the service system.
Optionally, the processing module includes:
a first determining unit, configured to take, as a data group, a service index corresponding to a state, a transfer condition for transferring a service request from the state to a target state corresponding to the state, and service data corresponding to the state, for each state where the service request has arrived;
the sequencing unit is used for sequencing the obtained data group according to the sequence of the service request transferred to each arrived state;
and the second determining unit is used for taking the data group sequence obtained by sequencing as service alarm information.
Optionally, the second transfer module includes:
the matching unit is used for matching the service data corresponding to the current state in the service request with at least one transfer condition corresponding to the current state in the finite state machine;
a third determining unit, configured to take, as a target transition condition, a transition condition that is matched with the service data corresponding to the current state in the at least one transition condition;
and the fourth determining unit is used for taking the state pointed by the target transition condition in the finite state machine as the target state of the service request.
In a third aspect, an embodiment of the present application provides a terminal device, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, and the processor implements the method when executing the computer program.
In a fourth aspect, the present application provides a computer-readable storage medium, where a computer program is stored, and when the computer program is executed by a processor, the computer program implements the foregoing method.
In a fifth aspect, the present application provides a computer program product, which when run on a terminal device, causes the terminal device to execute the method of any one of the above first aspects.
Compared with the prior art, the embodiment of the application has the advantages that:
in the embodiment of the application, after a service request input by a user to a service system is acquired, the service request is routed to a start state of a finite state machine configured in advance according to a service flow of the service system, and then the service request is transferred in the finite state machine according to service data carried by the service request until the service request is transferred to an end state of the finite state machine. The method comprises the steps of configuring a finite state machine according to a service process, wherein each state of the finite state machine is configured in advance according to the service process, so that the incidence relation among the states in the finite state machine can reflect the incidence relation among nodes of the service process, and further, when the service request is responded, the nodes of the service process do not need to be subjected to incidence analysis, but the service request is subjected to state transfer through the incidence relation among the states in the finite state machine, so that the response to the service request can be completed, and the throughput of the service system is greatly improved.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the embodiments or the prior art descriptions will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings without creative efforts.
Fig. 1 is a flowchart of a business process management method according to an embodiment of the present application;
FIG. 2 is a flow diagram of a configuration of a finite state machine according to an embodiment of the present application;
FIG. 3 is a block diagram of a finite state machine according to an example of the present application;
FIG. 4 is a block diagram of a finite state machine and a compute node according to an embodiment of the present application;
fig. 5 is a schematic structural diagram of a business process management apparatus according to an embodiment of the present application;
fig. 6 is a schematic structural diagram of a terminal device according to an embodiment of the present application.
Detailed Description
In the following description, for purposes of explanation and not limitation, specific details are set forth, such as particular system structures, techniques, etc. in order to provide a thorough understanding of the embodiments of the present application. It will be apparent, however, to one skilled in the art that the present application may be practiced in other embodiments that depart from these specific details. In other instances, detailed descriptions of well-known systems, devices, circuits, and methods are omitted so as not to obscure the description of the present application with unnecessary detail.
It will be understood that the terms "comprises" and/or "comprising," when used in this specification and the appended claims, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
It should also be understood that the term "and/or" as used in this specification and the appended claims refers to any and all possible combinations of one or more of the associated listed items and includes such combinations.
As used in this specification and the appended claims, the term "if" may be interpreted contextually as "when", "upon" or "in response to" determining "or" in response to detecting ". Similarly, the phrase "if it is determined" or "if a [ described condition or event ] is detected" may be interpreted contextually to mean "upon determining" or "in response to determining" or "upon detecting [ described condition or event ]" or "in response to detecting [ described condition or event ]".
Furthermore, in the description of the present application and the appended claims, the terms "first," "second," "third," and the like are used for distinguishing between descriptions and not necessarily for describing or implying relative importance.
Reference throughout this specification to "one embodiment" or "some embodiments," or the like, means that a particular feature, structure, or characteristic described in connection with the embodiment is included in one or more embodiments of the present application. Thus, appearances of the phrases "in one embodiment," "in some embodiments," "in other embodiments," or the like, in various places throughout this specification are not necessarily all referring to the same embodiment, but rather "one or more but not all embodiments" unless specifically stated otherwise. The terms "comprising," "including," "having," and variations thereof mean "including, but not limited to," unless otherwise specifically stated.
At present, when a service system responds to a service request, the process of performing association analysis on each node of a service flow is more and more complex, and the throughput of the service system is low.
In view of the above problems, an embodiment of the present application provides a method for managing a service flow, where after a service request input by a user to a service system is obtained, the service request is routed to a start state of a finite state machine configured in advance according to the service flow of the service system, and then the service request is transferred in the finite state machine according to service data carried in the service request until the service request is transferred to an end state of the finite state machine.
The method comprises the steps of configuring a finite state machine according to a service process, wherein each state of the finite state machine is configured in advance according to the service process, so that the incidence relation among the states in the finite state machine can reflect the incidence relation among nodes of the service process, and further, when the service request is responded, the nodes of the service process do not need to be subjected to incidence analysis, but the service request is subjected to state transfer through the incidence relation among the states in the finite state machine, so that the response to the service request can be completed, and the throughput of the service system is greatly improved.
The business process management method provided by the present application is exemplarily described below with reference to specific embodiments.
Example one
As shown in fig. 1, an embodiment of the present application provides a business process management method, which may be executed by a scheduling node of a finite state machine. Specifically, the method comprises the following steps:
and 11, acquiring a service request input by a user to the service system.
In some embodiments of the present application, the service request is used to indicate an operation request of a user on the service system, for example, a request to delete a file of the service system, a request to delete a database of the service system, and the like.
In some embodiments of the present application, the finite state machine is configured in advance according to a business process of a business system. The configuration process of the finite-state machine can be as follows: firstly, each service index of the service process is taken as a state of a finite state machine, the state corresponding to the starting index in the service indexes is defined as the starting state, and meanwhile, the downstream of the state corresponding to the ending index in the service indexes is defined as an ending state.
For example, the finite state machine may be a Non-deterministic finite state machine (NFA).
The current state refers to the state in which the service request is currently in the finite state machine. In some embodiments of the present application, after obtaining the service request, the scheduling node first routes the service request to the start state of the finite state machine, and then transfers the service request one or more times until the service request is transferred to the end state.
It should be noted that the ending state of the finite state machine represents the end point of the service flow, that is, if the service request reaches the ending state, it indicates that the service flow corresponding to the service request is ended, and the response to the service request is completed.
It should be noted that, in some embodiments of the present application, since each state of the finite state machine is configured in advance according to the service flow, the association relationship between each state in the finite state machine can reflect the association relationship between each node of the service flow, so that when a service request is responded, the service request can be responded by performing state transfer on the service request through the association relationship between each state in the finite state machine without performing association analysis on each node of the service flow, thereby greatly improving the throughput of the service system.
The configuration process of the finite state machine is illustratively described below in conjunction with specific embodiments.
In some embodiments of the present application, as shown in fig. 2, the configuration process of the finite state machine includes the following steps:
and step 21, analyzing the service process of the service system to obtain the service index of the service system.
It should be noted that, the service system may have a plurality of service flows, and therefore, each service flow needs to be analyzed respectively to obtain a service index corresponding to each service flow.
And step 22, taking each obtained service index as one state of the finite state machine.
In some embodiments of the present application, after obtaining the service indexes of all the service flows of the service system, each service index may be used as a state of the finite state machine. When mapping the service index to the state of the finite state machine, the state corresponding to the start index in the service index may be defined as the start state, and an end state may be defined downstream of the state corresponding to the end index in the service index.
And step 23, setting transfer conditions among the states in the finite state machine to obtain the configured finite state machine.
In some embodiments of the present application, in the process of analyzing the business process to obtain the business index, the association relationship between the business indexes can be obtained. Based on this, after mapping the service index into the state of the finite state machine, the association relations can be converted into the transition conditions between the corresponding states, so that the configured finite state machine includes a start state, an end state, at least one intermediate state between the start state and the end state, and the transition conditions between the states.
In some embodiments of the present application, after performing step 23, the configured finite state is obtained
After the machine, the method also comprises the following steps of distributing operation nodes: and respectively packaging the state and the transition conditions of the state to other states into a task (joba) aiming at each state except the ending state in the finite state machine, and distributing the task to an operation node (Worker).
The operation nodes are nodes in a correlation analysis cluster, and when the operation nodes are distributed, the operation nodes corresponding to each state except for the ending state in the finite state machine are different, so that the finite state machine supports distributed operation. In addition, the association analysis cluster is a cluster capable of expanding capacity and balancing load, so that when the utilization rate of the overall resources of the operation nodes in the association analysis cluster exceeds 80%, the scheduling node can add a new operation node to execute tasks, and the response efficiency of the service system to the service request is improved.
To facilitate understanding of the finite state machine, the configuration process of the finite state machine is illustrated herein with a specific example.
In this example, it is assumed that the business system includes two business processes (respectively: a first business process for deleting a file of the business system and a second business process for deleting a database of the business system), and the business indexes of the first business process include a login index, a right-lifting index and a file deletion index, and the business indexes of the second business process include a login index, a login database index and a database deletion index. Then, the login index is set as a state S0 of the finite state machine, the right-raising index is set as a state S1 of the finite state machine, the login database index is set as a state S2 of the finite state machine, the delete file index is set as a state S3 of the finite state machine, and the delete database index is set as a state S4 of the finite state machine, and an end state end is defined downstream of a state (i.e., the state S3 and the state S4) corresponding to an end index (i.e., the last service index) of each service flow (it should be noted that each service flow shares one end). Next, a transition condition f for a transition from the state S0 to the state S1 is set 01 Comprises the following steps: the login user (user) is the administrator, and sets the transition condition f for the state S0 to transition to the state S2 02 Comprises the following steps: the user is a non-administrator, and sets a transition condition f for the state S1 to transition to the state S1 11 Comprises the following steps: if the right is not successfully issued, a transition condition f for the state S1 to the state S3 is set 12 Comprises the following steps: the right is successfully lifted, and the transition condition f for the state S3 to be transferred to the end is set 3 Comprises the following steps: confirming the deleted file, setting the transition condition f for the state S2 to the state S4 2 Comprises the following steps: the user logging in the database is an administrator, and sets a transition condition f for the state S4 to transition to the end 4 Comprises the following steps: the deletion of the database is confirmed, thus obtaining the finite state machine shown in fig. 3.
In the above example, in order for the finite state machine to support distributed operation, after the finite state machine is configured, division of the operation node needs to be performedAnd (3) preparing. As shown in fig. 4, the specific allocation process is as follows: the state S0 and the transition condition f 01 And transfer conditions f 02 Packaging the task into a task, and distributing the task to an operation node worker1; the state S1 and the transition condition f 11 And transfer conditions f 12 Packaging the task into a task, and distributing the task to an operation node worker2; the state S2 and the transition condition f 2 Packaging the task into a task, and distributing the task to an operation node worker3; state S3, and transition condition f 3 Packaging the data into a task, and distributing the task to an operation node worker4; state S4, and transition condition f 4 And packaging the task into a task, and distributing the task to the operation node worker5.
The following describes an exemplary visualization management of a business process with reference to specific embodiments.
In some embodiments of the present application, to implement the visual management of the business process, after the step 13 is executed, the method further includes the following steps of processing a business request: and outputting the state transition process information of the service request in the finite state machine.
In some embodiments of the present application, the state transition process information is used to describe a transition process of a service request in a finite state machine, and the state transition process information includes a start state, a target state reached by the service request, service data corresponding to the start state, and service data corresponding to the target state reached by the service request.
For convenience of understanding, the above example is used for illustration, and it is assumed that the service request is used for requesting to delete a file of the service system, in the service request, the service data corresponding to the state S0 is the login user as the administrator, the service data corresponding to the state S1 is the successful authorization, and the service data corresponding to the state S3 is the file for confirming deletion. After acquiring the service request, the scheduling node transfers the service request to the state S0, the state S1, the state S3, and the end in sequence, completes the response to the service request, and then outputs the state transfer process information for the service data corresponding to the state S0, the state S1, the state S3, the state S0, the state S1, and the state S3.
In some embodiments of the present application, in order to make the relevant management personnel of the service system clearly understand the specific processing process of the service request, after the scheduling node outputs the state transition process information, the scheduling node may send the specific processing process of the service request to the service system by sending service alarm information to the service system.
In some embodiments of the present application, the service alarm information may be obtained by performing fusion processing on the content of the state transition process information. The process of fusing the content of the state transition process information comprises the following steps:
step one, aiming at each state reached by the service request, respectively taking a service index corresponding to the state, a transfer condition for transferring the service request from the state to a target state corresponding to the state, and service data corresponding to the state as a data group.
It should be noted that, here, the content of the state transition process information is fused, so the state in the first step is a state other than the end state in the finite state machine. Also by taking the above example as an example, assuming that the state transition process information includes state S0, state S1, state S3, service data corresponding to state S0, service data corresponding to state S1, and service data corresponding to state S3, the data group corresponding to state S0 is (S0, f) 01 The login user is the administrator), the data group corresponding to the state S1 is (S1, f) 12 Successful right-lifting), the data set corresponding to the state S3 is (S3, f) 3 Confirm the deleted file).
And step two, sequencing the obtained data groups according to the sequence of the service requests transferred to each reached state.
And step three, using the data group sequence obtained by sequencing as service alarm information.
In the embodiment of the application, the data groups corresponding to the states are sequenced according to the transfer sequence of the service request, and the sequenced data group sequence is sent to the service system as the service alarm confidence, so that the relevant management personnel of the service system can know the specific processing process of the service request.
In some embodiments of the present application, the process of transferring service requests in a finite state machine is described herein for ease of understanding. Specifically, in step 13, the specific implementation process of determining the target state of the service request from the finite state machine according to the service data corresponding to the current state of the service request in the finite state machine includes the following steps:
firstly, matching the service data corresponding to the current state in the service request with at least one transfer condition corresponding to the current state in the finite state machine.
In some embodiments of the present application, the current state of the service request in the finite state machine may correspond to one transition condition, and may also correspond to one transition condition. For example, in the above example, state S0 corresponds to two transition conditions (i.e., transition condition f) 01 And transfer conditions f 02 ) The state S2 corresponds to a transition condition (i.e., transition condition f) 2 ）。
It should be noted that the matching of the service data corresponding to the current state and the at least one transition condition corresponding to the current state is performed to determine a condition that is satisfied by the service data from the at least one transition condition.
And secondly, taking the transfer condition matched with the service data corresponding to the current state in at least one transfer condition as a target transfer condition.
In some embodiments of the present application, the target transition condition is a transition condition that is matched with service data corresponding to the current state, among transition conditions corresponding to the current state. For example, in the above example, when the service data corresponding to the state S0 in the service request is the login user is the administrator, the target transition condition is the transition condition f 01 。
And thirdly, taking the state pointed by the target transition condition in the finite state machine as the target state of the service request.
In some embodiments of the present application, after the target transfer condition is determined,the state pointed to by the target transition condition in the finite state machine may be the target state of the service request. For example, in the above example, when the service data corresponding to the state S0 in the service request is the login user is the administrator, the target transition condition is the transition condition f 01 Then the corresponding target state is state S1.
Example two
Corresponding to the business process management method described in the foregoing embodiment, as shown in fig. 5, an embodiment of the present application provides a business process management apparatus, where the business process management apparatus 500 includes:
an obtaining module 501, configured to obtain a service request input by a user to a service system;
a first forwarding module 502 for routing the service request to a start state of the finite state machine; the finite state machine is configured in advance according to the service process of the service system;
a second transfer module 503, configured to repeatedly perform the following steps until the service request is transferred to the end state of the finite state machine: and determining the target state of the service request from the finite state machine according to the service data corresponding to the current state of the service request in the finite state machine in the service request, and transferring the service request to the target state.
Optionally, the business process management apparatus 500 further includes:
the analysis module is used for analyzing the business process of the business system to obtain the business index of the business system;
the determining module is used for taking each obtained service index as one state of the finite state machine;
the setting module is used for setting transfer conditions among all states in the finite state machine to obtain the configured finite state machine;
the configured finite state machine includes a start state, an end state, and at least one intermediate state between the start state and the end state.
Optionally, the business process management apparatus 500 further includes:
the encapsulation module is used for encapsulating the state and the transfer conditions transferred from the state to other states into tasks aiming at each state except the ending state in the finite state machine and distributing the tasks to an operation node;
and the finite state machine has different operation nodes corresponding to each state except the ending state.
Optionally, the business process management apparatus 500 further includes:
the output module is used for outputting the state transition process information of the service request in the finite state machine;
the state transition process information comprises a starting state, a target state reached by the service request, service data corresponding to the starting state and service data corresponding to the target state reached by the service request.
Optionally, the business process management apparatus 500 further includes:
the processing module is used for carrying out fusion processing on the content of the state transition process information to obtain service alarm information;
and the sending module is used for sending the service alarm information to the service system.
Optionally, the processing module includes:
a first determining unit, configured to take, as a data group, a service index corresponding to a state, a transfer condition for transferring a service request from the state to a target state corresponding to the state, and service data corresponding to the state, for each state where the service request has arrived;
the sequencing unit is used for sequencing the obtained data group according to the sequence of the service request transferred to each arrived state;
and the second determining unit is used for taking the data group sequence obtained by sequencing as service alarm information.
Optionally, the second transfer module 503 includes:
the matching unit is used for matching the service data corresponding to the current state in the service request with at least one transfer condition corresponding to the current state in the finite state machine;
a third determining unit, configured to take, as a target transition condition, a transition condition that is matched with the service data corresponding to the current state in the at least one transition condition;
and the fourth determining unit is used for taking the state pointed by the target transition condition in the finite state machine as the target state of the service request.
It should be noted that, for the information interaction, execution process, and other contents between the above-mentioned devices/units, the specific functions and technical effects thereof are based on the same concept as those of the embodiment of the method of the present application, and specific reference may be made to the part of the embodiment of the method, which is not described herein again.
It will be apparent to those skilled in the art that, for convenience and brevity of description, only the above-mentioned division of the functional units and modules is illustrated, and in practical applications, the above-mentioned function distribution may be performed by different functional units and modules according to needs, that is, the internal structure of the apparatus is divided into different functional units or modules to perform all or part of the above-mentioned functions. Each functional unit and module in the embodiments may be integrated in one processing unit, or each unit may exist alone physically, or two or more units are integrated in one unit, and the integrated unit may be implemented in a form of hardware, or in a form of software functional unit. In addition, specific names of the functional units and modules are only for convenience of distinguishing from each other, and are not used for limiting the protection scope of the present application. The specific working processes of the units and modules in the system may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
As shown in fig. 6, an embodiment of the present application provides a terminal device, and as shown in fig. 6, a terminal device D10 of the embodiment includes: at least one processor D100 (only one processor is shown in fig. 6), a memory D101, and a computer program D102 stored in the memory D101 and operable on the at least one processor D100, wherein the processor D100 implements the steps of any of the method embodiments described above when executing the computer program D102.
The terminal device may be a device, such as a computer, a server, and the like, where the scheduling node is located in the foregoing method embodiment.
The Processor D100 may be a Central Processing Unit (CPU), and the Processor D100 may also be other general purpose processors, digital Signal Processors (DSPs), application Specific Integrated Circuits (ASICs), field-Programmable Gate arrays (FPGAs) or other Programmable logic devices, discrete Gate or transistor logic devices, discrete hardware components, etc. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
The storage D101 may be an internal storage unit of the terminal device D10 in some embodiments, for example, a hard disk or a memory of the terminal device D10. In other embodiments, the memory D101 may also be an external storage device of the terminal device D10, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), and the like, which are equipped on the terminal device D10. Further, the memory D101 may include both an internal storage unit and an external storage device of the terminal device D10. The memory D101 is used for storing an operating system, an application program, a BootLoader (BootLoader), data, and other programs, such as program codes of the computer programs. The memory D101 may also be used to temporarily store data that has been output or is to be output.
It should be noted that, for the information interaction, execution process, and other contents between the above-mentioned devices/units, the specific functions and technical effects thereof are based on the same concept as those of the embodiment of the method of the present application, and specific reference may be made to the part of the embodiment of the method, which is not described herein again.
It will be apparent to those skilled in the art that, for convenience and brevity of description, only the above-mentioned division of the functional units and modules is illustrated, and in practical applications, the above-mentioned function distribution may be performed by different functional units and modules according to needs, that is, the internal structure of the apparatus is divided into different functional units or modules to perform all or part of the above-mentioned functions. Each functional unit and module in the embodiments may be integrated in one processing unit, or each unit may exist alone physically, or two or more units are integrated in one unit, and the integrated unit may be implemented in a form of hardware, or in a form of software functional unit. In addition, specific names of the functional units and modules are only for convenience of distinguishing from each other, and are not used for limiting the protection scope of the present application. The specific working processes of the units and modules in the system may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
The embodiments of the present application further provide a computer-readable storage medium, where a computer program is stored, and when the computer program is executed by a processor, the computer program implements the steps in the above-mentioned method embodiments.
The embodiments of the present application provide a computer program product, which when running on a terminal device, enables the terminal device to implement the steps in the above method embodiments when executed.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, all or part of the processes in the methods of the embodiments described above may be implemented by instructing relevant hardware by a computer program, which may be stored in a computer-readable storage medium, and when the computer program is executed by a processor, the steps of the embodiments of the methods described above may be implemented. Wherein the computer program comprises computer program code, which may be in the form of source code, object code, an executable file or some intermediate form, etc. The computer-readable medium may include at least: any entity or device capable of carrying computer program code to a business process management apparatus/terminal apparatus, recording medium, computer Memory, read-Only Memory (ROM), random Access Memory (RAM), electrical carrier wave signals, telecommunications signals, and software distribution medium. Such as a usb-disk, a removable hard disk, a magnetic or optical disk, etc. In some jurisdictions, computer-readable media may not be an electrical carrier signal or a telecommunications signal in accordance with legislative and proprietary practices.
In the above embodiments, the description of each embodiment has its own emphasis, and reference may be made to the related description of other embodiments for parts that are not described or recited in any embodiment.
Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
In the embodiments provided in the present application, it should be understood that the disclosed apparatus/network device and method may be implemented in other ways. For example, the above-described apparatus/network device embodiments are merely illustrative, and for example, the division of the modules or units is only one logical division, and there may be other divisions when actually implementing, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not implemented. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
The above-mentioned embodiments are only used for illustrating the technical solutions of the present application, and not for limiting the same; although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; such modifications and substitutions do not substantially depart from the spirit and scope of the embodiments of the present application and are intended to be included within the scope of the present application.
Claims (10)
1. A business process management method is characterized by comprising the following steps:
acquiring a service request input by a user to a service system;
routing the service request to a start state of a finite state machine; the finite state machine is configured in advance according to the service process of the service system;
repeatedly executing the following steps until the service request is transferred to the end state of the finite state machine: and determining the target state of the service request from the finite state machine according to the service data corresponding to the current state of the service request in the finite state machine in the service request, and transferring the service request to the target state.
2. The method of claim 1, wherein prior to said routing said service request to a start state of a finite state machine, said method further comprises:
analyzing the service process of the service system to obtain a service index of the service system;
taking each obtained service index as one state of the finite state machine;
setting transfer conditions among all states in the finite state machine to obtain a configured finite state machine;
the configured finite state machine includes the start state, the end state, and at least one intermediate state between the start state and the end state.
3. The method of claim 2, wherein after said setting a transition condition between states in the finite state machine to obtain a configured finite state machine, the method further comprises:
respectively aiming at each state except the end state in the finite-state machine, and converting the state into a state with a high precision
And the transfer conditions transferred from the state to other states are packaged into tasks, and the tasks are distributed to an operation node;
and the finite state machine is characterized in that the operation nodes corresponding to all the states except the ending state are different.
4. The method of claim 2, wherein after the service request is transferred to the end state of the finite state machine, the method further comprises:
outputting the state transition process information of the service request in the finite state machine;
the state transition process information includes the starting state, the target state reached by the service request, service data corresponding to the starting state, and service data corresponding to the target state reached by the service request.
5. The method of claim 4, wherein after said outputting the state transition process information of the service request in the finite state machine, the method further comprises:
performing fusion processing on the content of the state transition process information to obtain service alarm information;
and sending the service alarm information to the service system.
6. The method according to claim 5, wherein the fusing the content of the state transition process information to obtain service alarm information includes:
aiming at each state reached by the service request, respectively, the service index corresponding to the state,
Taking the service request as a data group, wherein the service request is transferred from the state to a transfer condition of a target state corresponding to the state, and the service data corresponding to the state;
sequencing the obtained data groups according to the sequence of the service requests transferred to each reached state;
and using the data group sequence obtained by sequencing as the service alarm information.
7. The method of claim 2, wherein the determining the target state of the service request from the finite state machine according to the service data corresponding to the current state of the service request in the finite state machine comprises:
matching the service data corresponding to the current state in the service request with at least one transfer condition corresponding to the current state in the finite state machine;
taking a transfer condition matched with the service data corresponding to the current state in the at least one transfer condition as a target transfer condition;
and taking the state pointed by the target transition condition in the finite state machine as the target state of the service request.
8. A business process management apparatus, comprising:
the acquisition module is used for acquiring a service request input by a user to the service system;
a first transfer module for routing the service request to a start state of a finite state machine; the finite state machine is configured in advance according to the service process of the service system;
a second transfer module, configured to repeatedly perform the following steps until the service request is transferred to the end state of the finite state machine: and determining the target state of the service request from the finite state machine according to the service data corresponding to the current state of the service request in the finite state machine in the service request, and transferring the service request to the target state.
9. A terminal device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, characterized in that the processor implements the method according to any of claims 1 to 7 when executing the computer program.
10. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out the method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310043322.3A CN115829521A (en) | 2023-01-29 | 2023-01-29 | Business process management method and device, terminal equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310043322.3A CN115829521A (en) | 2023-01-29 | 2023-01-29 | Business process management method and device, terminal equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115829521A true CN115829521A (en) | 2023-03-21 |
Family
ID=85520623
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310043322.3A Pending CN115829521A (en) | 2023-01-29 | 2023-01-29 | Business process management method and device, terminal equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115829521A (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140324497A1 (en) * | 2013-04-30 | 2014-10-30 | Nitin Kumar Verma | Tracking business processes and instances |
| CN112907198A (en) * | 2021-01-15 | 2021-06-04 | 浙江大搜车融资租赁有限公司 | Service state circulation maintenance method and device and electronic equipment |
| CN113590235A (en) * | 2021-07-27 | 2021-11-02 | 京东科技控股股份有限公司 | Business process execution method and device, electronic equipment and storage medium |
| CN114662960A (en) * | 2022-04-02 | 2022-06-24 | 深圳市神州云海智能科技有限公司 | Business process generation method, terminal device and computer readable storage medium |
-
2023
- 2023-01-29 CN CN202310043322.3A patent/CN115829521A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140324497A1 (en) * | 2013-04-30 | 2014-10-30 | Nitin Kumar Verma | Tracking business processes and instances |
| CN112907198A (en) * | 2021-01-15 | 2021-06-04 | 浙江大搜车融资租赁有限公司 | Service state circulation maintenance method and device and electronic equipment |
| CN113590235A (en) * | 2021-07-27 | 2021-11-02 | 京东科技控股股份有限公司 | Business process execution method and device, electronic equipment and storage medium |
| CN114662960A (en) * | 2022-04-02 | 2022-06-24 | 深圳市神州云海智能科技有限公司 | Business process generation method, terminal device and computer readable storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111291103B (en) | Interface data analysis method and device, electronic equipment and storage medium | |
| CN111258978B (en) | Data storage method | |
| CN112445626B (en) | Data processing method and device based on message middleware | |
| CN112905323B (en) | Data processing method, device, electronic equipment and storage medium | |
| CN109828830B (en) | Method and apparatus for managing containers | |
| CN110795741A (en) | Method and device for carrying out security processing on data | |
| CN114817146A (en) | Method and device for processing data | |
| CN105656643A (en) | Method and equipment for performing compatible management based on network configuration protocol | |
| CN111444148B (en) | Data transmission method and device based on MapReduce | |
| CN111309366B (en) | Method, device, medium and electronic equipment for managing registration core | |
| CN112433757A (en) | Method and device for determining interface calling relationship | |
| CN112948138A (en) | Method and device for processing message | |
| CN113409153A (en) | Business process management system, business process processing method, equipment and storage medium | |
| CN111045928A (en) | Interface data testing method, device, terminal and storage medium | |
| CN115829521A (en) | Business process management method and device, terminal equipment and storage medium | |
| CN109542841A (en) | The method and terminal device of data snapshot are created in cluster | |
| CN108805741B (en) | Fusion method, device and system of power quality data | |
| CN113726885A (en) | Method and device for adjusting flow quota | |
| CN110674082B (en) | Method and device for removing online document, electronic equipment and computer readable medium | |
| CN112416980A (en) | Data service processing method, device and equipment | |
| CN113760487A (en) | Service processing method and device | |
| CN111314457B (en) | Method and device for setting virtual private cloud | |
| CN115037729B (en) | Data aggregation method, device, electronic equipment and computer readable medium | |
| CN112788074B (en) | Data transmitting method, processing method, receiving method, apparatus thereof, and storage medium | |
| CN113722634A (en) | Data processing method and device, electronic equipment and computer readable 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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20230321 |
|
| RJ01 | Rejection of invention patent application after publication |