CN114461691A - State machine control method, device, electronic device and storage medium - Google Patents

Abstract

The present disclosure provides a control method, device, electronic device and storage medium for a state machine, and relates to the technical field of computers. The method includes: receiving an event processing instruction, wherein the event processing instruction includes event information to be processed; parsing the event information to determine the identifier and context information of the to-be-processed event; The identification of the event to be processed, the target state transition function is determined; the current state of the state machine associated with the context information is obtained from the database; the start state corresponding to the current state of the state machine and the target state transition function In the case of no match, an event processing failure message is returned. Therefore, the state machine can be controlled only according to the correlation between events without adding a new state class, etc., thereby reducing the complexity of the state machine control and simplifying the process.

Description

State machine control method, device, electronic device and storage medium

technical field

The present disclosure relates to the field of computer technologies, and in particular, to a state machine control method, device, electronic device, and storage medium.

Background technique

With the development of computer technology, the popularity of state machines has become higher and higher, and the use of state machines has become more and more extensive. In the related art, in the process of controlling a state machine, each time a state is added, a new state class needs to be implemented, and a behavior method in it needs to be implemented. When there are too many events and the state transition is complicated, it is easy to cause confusion.

SUMMARY OF THE INVENTION

The present disclosure aims to solve one of the technical problems in the related art at least to a certain extent.

The embodiment of the first aspect of the present disclosure provides a method for controlling a state machine, including:

receiving an event processing instruction, wherein the event processing instruction includes event information to be processed;

Parsing the event information to determine the identifier and context information of the event to be processed;

Determine the target state transition function according to the identifier of the event to be processed;

Obtain the current state of the state machine associated with the context information from the database;

If the current state of the state machine does not match the starting state corresponding to the target state transition function, an event processing failure message is returned.

The embodiment of the second aspect of the present disclosure provides a control apparatus for a state machine, including:

a receiving module, configured to receive an event processing instruction, wherein the event processing instruction includes event information to be processed;

a parsing module, configured to parse the event information to determine the identifier and context information of the event to be processed;

A determination module for determining a target state transition function according to the identifier of the event to be processed;

an acquisition module for acquiring the current state of the state machine associated with the context information from the database;

The returning module is configured to return an event processing failure message when the current state of the state machine does not match the starting state corresponding to the target state transition function.

The embodiment of the third aspect of the present disclosure provides an electronic device, including: a memory, a processor, and a computer program stored in the memory and running on the processor, when the processor executes the program, the implementation of the present disclosure The control method of the state machine proposed by the embodiment of the first aspect.

Embodiments of the fourth aspect of the present disclosure provide a non-transitory computer-readable storage medium storing a computer program, and when the computer program is executed by a processor, implement the state machine control method provided by the embodiments of the first aspect of the present disclosure .

Embodiments of the fifth aspect of the present disclosure provide a computer program product. When an instruction processor in the computer program product is executed, the state machine control method provided by the embodiments of the first aspect of the present disclosure is executed.

The control method, device, electronic device, and storage medium for a state machine provided by the present disclosure may first receive an event processing instruction, wherein the event processing instruction includes event information to be processed, and then analyze the event information to be processed to determine the pending event information. The identification of the event to be processed and the context information, according to the identification of the event to be processed, determine the target state transition function, and then the current state of the state machine associated with the context information can be obtained from the database. If the corresponding start state of the state transition function does not match, an event processing failure message is returned. Therefore, by analyzing the received event information, the identifier of the to-be-processed event, the target state transition function and the context information can be determined, so that when controlling the state machine, there is no need to add a new state class, etc. The association relationship can realize the control of the state machine, thereby reducing the complexity of the state machine control and simplifying the process.

Additional aspects and advantages of the present disclosure will be set forth, in part, from the following description, and in part will be apparent from the following description, or may be learned by practice of the present disclosure.

Description of drawings

The above and/or additional aspects and advantages of the present disclosure will become apparent and readily understood from the following description of embodiments taken in conjunction with the accompanying drawings, wherein:

FIG. 1 is a flow chart of using a state machine provided by an embodiment of the present disclosure;

FIG. 2 is a schematic flowchart of a control method of a state machine provided by an embodiment of the present disclosure;

3 is a schematic flowchart of a method for controlling a state machine provided by an embodiment of the present disclosure;

4 is a schematic flowchart of a method for controlling a state machine provided by an embodiment of the present disclosure;

5 is a schematic structural diagram of a control device for a state machine provided by another embodiment of the present disclosure;

6 shows a block diagram of an exemplary electronic device suitable for use in implementing embodiments of the present disclosure.

Detailed ways

Embodiments of the present disclosure are described in detail below, examples of which are illustrated in the accompanying drawings, wherein the same or similar reference numerals refer to the same or similar elements or elements having the same or similar functions throughout. The embodiments described below with reference to the accompanying drawings are exemplary, and are intended to explain the present disclosure and should not be construed as a limitation of the present disclosure.

The following describes the state machine control method, apparatus, electronic device, and storage medium of the embodiments of the present disclosure with reference to the accompanying drawings.

The embodiment of the present disclosure is exemplified by the state machine control method being configured in the state machine control apparatus, the state machine control apparatus can be applied to any electronic device, so that the electronic device can execute the state machine control Function.

Optionally, the executive body in the present disclosure may also be a state machine configured with a control method of the state machine, which is not limited in the present disclosure.

The electronic device may be a personal computer (Personal Computer, PC), a cloud device, a mobile device, etc. The mobile device may be, for example, a mobile phone, a tablet computer, a personal digital assistant, a wearable device, a vehicle-mounted device, etc. with various operating systems, touch screen and/or display hardware.

First, a brief description of the state machine provided in the present disclosure is given.

In this disclosure, the object-oriented finite state machine M can be defined as a seven-tuple, C is additionally introduced as the state machine context information, and A is introduced as the state machine behavior, which can be expressed as follows: M=(S, C, E, δ,δ ₀ ,F,A).

Among them, the state (state), which can be abbreviated as S={s ₀ , s ₁ ,..., s _i }, can represent a set of finite states, usually there is a definite state at a definite moment, and this state can be combined or nested. The context information (context) of the current state machine can be abbreviated as C.

An event, which can be abbreviated as E={e ₀ , e ₁ ,..., e _i }, can represent a set of limited events, and state transitions can be triggered by events.

也即

其可以理解为事件e在上下文环境信息c下触发了状态s向s’的转移，同时状态机执行了行为a，上下文环境信息为c’。δ can represent the state transition function:

that is

It can be understood that the event e triggers the transition from the state s to s' under the context information c, and the state machine executes the behavior a, and the context information is c'.

S ₀ ∈ S can represent the initial state of the state machine, which is a subset of S; F ∈ S can represent the final state of the state machine, which is a subset of S.

The action of a state machine, which can be abbreviated as A, can be determined from the actions, properties, and links of the context object, as well as the parameters that trigger the event, or any other feature visible within its scope, to make an action on the event. React, maintain the robustness of the state machine or implement more complex logic. For example, it may be event state transition and event logging, or making changes to the current environment, etc., which is not limited in the present disclosure.

The following briefly describes the usage flow of the state machine provided by the present disclosure by taking FIG. 1 as an example.

As shown in Figure 1. First, you can define the state, define the event, define the behavior of the state machine, and then confirm whether the context information is required. If the context information is required, you can customize the context. If you do not need the context information, you can use the default context, and then you can create State machine transition instance, then you can design a state transition function, and build a state transition rule, and then you can use the state machine.

It should be noted that the above examples are only schematic descriptions, and cannot be used as limitations on the usage flow of the state machine in the embodiments of the present disclosure.

FIG. 2 is a schematic flowchart of a control method for a state machine provided by an embodiment of the present disclosure.

As shown in Figure 2, the control method of the state machine may include the following steps:

Step 201: Receive an event processing instruction, wherein the event processing instruction includes event information to be processed.

Among them, the event processing instruction can be the instruction information issued by the client where the user is located, which can be an instruction in the form of voice, or can also be an instruction in other forms; for example, when it is detected that the corresponding control is triggered, it is determined to receive the event processing instruction. . This disclosure does not limit this.

In addition, after receiving the event processing instruction, by analyzing and processing the event processing instruction, the to-be-processed event information contained therein can be determined, which is not limited in the present disclosure.

It can be understood that, in the embodiment of the present disclosure, the received event processing instruction may be analyzed and processed in any desirable manner, which is not limited in the present disclosure.

Step 202: Parse the event information to be processed to determine the identifier and context information of the event to be processed.

The style or presentation form of the identifier of the event to be processed may be set in advance, which is not limited in the present disclosure.

In addition, the context information may include a business scenario, a business identifier, and the like of the event to be processed. This disclosure does not limit this.

It can be understood that the style or presentation form of the service identification may be set in advance. For example, for "arbitration service", the corresponding service identifier may be "arbitration", or may also be "ZC", etc., which may uniquely characterize the service, which is not limited in the present disclosure.

For example, by analyzing the event information to be processed, if it is determined that it contains "auditor requires user to supplement information and arbitration", it can be determined that the identifier of the pending event is: auditor requires user to supplement information; The included business scenarios are: business arbitration.

It should be noted that the above examples are only schematic descriptions, and cannot be used as limitations on the identifiers, contextual environment information, and the like of the events to be processed in the embodiments of the present disclosure.

Step 203: Determine the target state transition function according to the identifier of the event to be processed.

It can be understood that, the target state transition functions corresponding to different events may be the same or may be different, which is not limited in the present disclosure.

Optionally, the correspondence between different events and state transition functions may be set in advance, and then the target state transition function corresponding to the event identifier may be selected from the correspondence between events and state transition functions according to the identifier of the event to be processed.

For example, it has been set that the state transition function corresponding to event 1 is δ ₁ , the state transition function corresponding to event 2 is δ ₂ , and the state transition function corresponding to event 3 is δ ₃ . If the identification of the event to be processed is determined to be "3" through the analysis of the event information to be processed, it can be determined as event 3, and then the corresponding target state transition function can be determined by looking up the correspondence between the event and the state transition function. is δ ₃ .

It should be noted that the above examples are only schematic descriptions, and cannot be used as limitations on the identification of the event to be processed, the target state transition function, and the like in the embodiments of the present disclosure.

Step 204: Acquire the current state of the state machine associated with the context information from the database.

The state machine may be in a corresponding relationship with the event to be processed. This disclosure does not limit this.

It can be understood that a plurality of state machine records can be stored in the database, so that in order to improve the accuracy of event processing, the current state of the state machine associated with the context information can be obtained from the database.

For example, if the determined context information is: an arbitration service initiated by user A. Afterwards, the database can be searched to determine the current state of the state machine associated with the "arbitration service initiated by user A". If searched in the database, it is determined that the information associated with the "arbitration service initiated by user A" is: user A initiates appeal arbitration (February 10); the auditor accepts (February 11). Then it can be determined that the current state of the state machine associated with the "arbitration service initiated by user A" is: the auditor accepts.

It should be noted that the above examples are only schematic descriptions, and cannot be used as limitations on the current state of the context information and its associated state machines in the embodiments of the present disclosure.

Step 205 , if the current state of the state machine does not match the starting state corresponding to the target state transition function, return an event processing failure message.

It can be understood that if the current state of the state machine is inconsistent with the start state corresponding to the target state transition function, it can be considered that the current state of the state machine does not match the start state corresponding to the target state transition function, and an event processing failure message can be returned at this time. , that is, the state machine is not controlled.

In addition, the event processing failure message can be any information that can represent the event processing failure. For example, it can be set in advance: use "0" to represent the event processing failure. If it is determined that the current state of the state machine does not match the starting state corresponding to the target state transition function, "0" may be returned. Alternatively, an "event processing failure" prompt, etc. may also be returned, which is not limited in the present disclosure.

For example, if the current state of the state machine is "user completes supplementary information", and the corresponding start state of the target state transition function is "auditor requests user supplementary information", if the two are inconsistent, it can be considered that the current state of the state machine is the same as the target. The corresponding start state of the state transition function does not match, so an event processing failure message can be returned.

It should be noted that the above examples are only schematic descriptions, and cannot be used as limitations on the current state of the state machine, the starting state corresponding to the target state transition function, and the like in the embodiments of the present disclosure.

In this embodiment of the present disclosure, an event processing instruction may be received first, wherein the event processing instruction includes event information to be processed, and then the event information to be processed is parsed to determine the identifier and context information of the event to be processed. The identification of the event, determine the target state transition function, and then the current state of the state machine associated with the context information can be obtained from the database. Returns event processing failure message. Therefore, by analyzing the received event information, the identifier of the to-be-processed event, the target state transition function and the context information can be determined, so that when controlling the state machine, there is no need to add a new state class, etc. The association relationship can realize the control of the state machine, thereby reducing the complexity of the state machine control and simplifying the process.

FIG. 3 is a schematic flowchart of a method for controlling a state machine provided by an embodiment of the present disclosure. As shown in Figure 3, the control method of the state machine may include the following steps:

Step 301: Receive an event processing instruction, wherein the event processing instruction includes event information to be processed.

Step 302: Parse the event information to determine the identifier and context information of the event to be processed.

Step 303: Acquire attribute information of the to-be-processed event according to the identifier of the to-be-processed event.

The attribute information of the to-be-processed event may include a state transition function, an initial state, an end state, etc. corresponding to the to-be-processed event, which is not limited in the present disclosure.

It can be understood that the attribute information corresponding to each to-be-processed event may be set in advance, so that after the identifier of the to-be-processed event is determined, the corresponding attribute information may be determined according to the identifier.

Step 304: Determine the state transition function in the attribute information of the event to be processed as the target state transition function.

事件2对应的属性信息为：

若待处理事件的标识为“事件1”，根据该标识“事件1”，可以确定其对应的属性信息为：

初始状态为：s₁，结束状态为：s₁’，从而可以将属性信息中的状态转移函数δ₁，确定为目标状态转移函数。For example, the attribute information corresponding to event 1 is:

The attribute information corresponding to event 2 is:

If the identifier of the event to be processed is "event 1", according to the identifier "event 1", it can be determined that its corresponding attribute information is:

The initial state is: s ₁ , and the end state is: s ₁ ', so that the state transition function δ ₁ in the attribute information can be determined as the target state transition function.

It should be noted that the above examples are only schematic descriptions, and cannot be used as limitations on the identification of the to-be-processed event, the corresponding attribute information, and the state transition function in the embodiments of the present disclosure.

Step 305: Acquire the state transition record associated with the context information from the database.

The state transition record may refer to the current business, that is, the historical state change information of the event to be processed. This disclosure does not limit this.

It is understandable that, every time any business or event is processed, the processing process will be recorded, that is, the initial state and target state corresponding to the processing process will be stored in the database. If the event continues to be processed subsequently, the state transition record corresponding to the event in the database can be updated and saved.

Step 306: Determine the target state in the state transition record as the current state of the state machine.

The target state in the state transition record can be understood as the latest state or the state at the latest moment in the state transition record. For example, if the state transition record is: the user initiates an appeal arbitration - the auditor accepts it - the auditor requests the user to supplement the data - the user completes the data supplement, it can be determined that the target state in the state transition record is: the user completes the data supplement. This disclosure does not limit this.

For example, the context information is: appeal arbitration initiated by user B. The state transition record associated with "appeal arbitration initiated by user B" can then be searched in the database. If the found state transition record is: User B initiates appeal arbitration - Auditor C accepts - Auditor C requests User B to supplement information, the target state can be determined to be "Auditor C requires User B to supplement information", and then it can be determined The current state of the state machine is: Auditor C requires User B to supplement information.

It should be noted that the above examples are only schematic descriptions, and cannot be used as limitations on the contextual environment information, its associated state transition records, and target states in the state transition records in the embodiments of the present disclosure.

Step 307 , if the current state of the state machine does not match the starting state corresponding to the target state transition function, return an event processing failure message.

Step 308 , when the current state of the state machine matches the starting state corresponding to the target state transition function, determine the transition condition corresponding to the event to be processed.

It can be understood that if the current state of the state machine is consistent with the start state corresponding to the target state transition function, it can be considered that the current state of the state machine matches the start state corresponding to the target state transition function.

For example, if the current state of the state machine is "user completes supplementary data", and the start state corresponding to the target state transition function is "user completes data supplementation", if the two are consistent, it can be considered that the current state of the state machine corresponds to the target state transition function. The starting state is matched, and then the transition condition corresponding to the pending event can be determined. This disclosure does not limit this.

In addition, the transition condition corresponding to the to-be-processed event may be set by yourself when the event is defined, or may be set according to a rule, or may be a default condition, etc., which is not limited in the present disclosure.

For example, the transition condition a ₁ required for event 1 to transition from the start state A corresponding to the target state transition function to the end state B can be set in advance; the event 2 transitions from the start state C corresponding to the target state transition function to the end state D. The required transition condition a ₂ ; the transition condition a ₃ required for event 3 to transition from the start state E corresponding to the target state transition function to the end state F. If it is determined that the current state of the event 1 to be processed matches the starting state A corresponding to the target transition function, it can be determined that the transition condition corresponding to the event 1 to be processed is: a ₁ .

It should be noted that the above examples are only schematic descriptions, and cannot be used as limitations on the transition conditions and the like corresponding to the events to be processed in the embodiments of the present disclosure.

Step 309 , when the current condition of the state machine satisfies the transition condition, transition the state machine from the current state to the end state corresponding to the target transition function.

For example, if the current state of event 1 to be processed matches the start state "auditor requires user A to supplement data" corresponding to the target transition function, the determined transition condition is: data has been supplemented. If the current user A has supplemented relevant data, it can be determined that the current conditions of the state machine satisfy the corresponding transition conditions, and then the state machine can be transferred from the current state "auditor requires user A to supplement data" to the end state "user A" corresponding to the target transition function. Complete Supplementary Information" transfer.

It should be noted that the above examples are only schematic descriptions, and cannot be used as limitations on the current conditions, transition conditions, and end states corresponding to the target transition function of the state machine in the implementation of the present disclosure.

In this embodiment of the present disclosure, an event processing instruction may be received first, wherein the event processing instruction includes event information to be processed, and then the event information is parsed to determine the identifier and context information of the to-be-processed event, and then according to the to-be-processed event , obtain the attribute information of the event to be processed, and then determine the state transition function in the attribute information of the event to be processed as the target state transition function, and obtain the state transition record associated with the context information from the database. The target state in the state transition record is determined as the current state of the state machine. If the current state of the state machine does not match the start state corresponding to the target state transition function, an event processing failure message is returned, and the current state of the state machine is returned. When the start state corresponding to the target state transition function matches, determine the transition condition corresponding to the event to be processed, and when the current condition of the state machine satisfies the transition condition, transfer the state machine from the current state to the end state corresponding to the target transition function . Therefore, after analyzing the received event information, the target state transition function can be determined according to the identifier of the event to be processed, and the current state of the associated state machine can be obtained according to the context information, and then the current state of the state machine and the target state can be obtained according to the current state of the state machine. The matching of the starting state corresponding to the state transition function can realize the control of the state machine. This process does not need to add new state classes, etc., which avoids problems such as class expansion, thereby reducing the complexity of the state machine control and simplifying the process. process.

FIG. 4 is a schematic flowchart of a method for controlling a state machine provided by an embodiment of the present disclosure. As shown in Figure 4, the control method of the state machine may include the following steps:

Step 401: Receive an event processing instruction, wherein the event processing instruction includes event information to be processed.

Step 402: Parse the event information to determine the identifier and context information of the event to be processed.

Step 403: Determine the target state transition function according to the identifier of the event to be processed.

Step 404: Acquire the current state of the state machine associated with the context information from the database.

Step 405 , when the current state of the state machine matches the starting state corresponding to the target state transition function, determine the transition condition corresponding to the event to be processed.

Step 406 , when the current condition of the state machine satisfies the transition condition, transition the state machine from the current state to the end state corresponding to the target transition function.

It should be noted that, for the specific content and implementation manner of steps 401 to 406, reference may be made to the descriptions of other embodiments of the present disclosure, and details are not described herein again.

Step 407 , according to the current state and the ending state, generate and temporarily store the current state transition record.

For example, if the current state is "User completed result confirmation" and the end state is "Administrator operation completed", the current state transition record generated can be: User completed result confirmation-Administrator operation completed; then This state transition record can be temporarily stored.

Or, if the state transition record obtained from the database is “User initiates appeal arbitration—auditor accepts—auditor requests user supplementary information”; the current state of the state machine is “auditor requests user supplementary information”, and the end state is “ User completes supplementary information”, the current state transfer record generated can be: “User initiates appeal arbitration—auditor accepts—auditor requests user supplementary information—user completes data supplementation”, and then this state transfer record can be processed. Staging.

It should be noted that the above examples are only schematic descriptions, and cannot be used as limitations on the current state, the ending state, the current state transition record, and the like in the embodiments of the present disclosure.

Step 408: Determine the value of the version number of the state transition record associated with the to-be-processed event information in the database.

The version number of the state transition record can uniquely represent the version information of the state transition record, and the value of the version number can be any value, which is not limited in the present disclosure.

It can be understood that the value of the version number of the state transition record can be determined by reading the state transition record associated with the to-be-processed event information.

For example, if the name of the state transition record associated with the to-be-processed event information contains "NO.1", it can be determined that the value of the version number of the state transition record is 1. This disclosure does not limit this.

Step 409, when the value of the version number is less than the threshold, update the state transition record associated with the pending event information in the database according to the temporarily stored state transition record, and add one to the value of the version number.

The threshold value may be a value set in advance, which is not limited in the present disclosure.

For example, if the set threshold is 1, the current version number is 0, and the temporarily stored state transition record is "Auditor requests user supplementary information—User completes supplementary information", the database is associated with the pending event information. The state transition record is "User initiates appeal arbitration -- auditor accepts -- auditor requests user supplementary information", if the current version number is less than the set threshold, the state transition record associated with the pending event information in the database can be recorded. After updating, the updated state transfer record can be "User initiates appeal arbitration -- Auditor accepts -- Auditor requests user supplementary information -- User completes supplementary information", and then the value of the version number can be increased by one, then after the update The version number can be 1.

It should be noted that the above examples are only schematic descriptions, and cannot be used as limitations on the values, thresholds, state transition records, etc. of the version numbers in the embodiments of the present disclosure.

Optionally, when the value of the version number is equal to the threshold, delete the current state transition record.

For example, if the set threshold is 1, the current version number is 1, and the currently temporarily stored state transition record is "Auditor requires user to supplement information - user completes supplementary information", the current state transition record can be deleted. This disclosure does not limit this.

It can be understood that if the value of the version number is equal to the threshold, it can indicate that the event has been processed. In order to avoid repeated processing of the event, the temporarily stored state transition record can be deleted, thus ensuring the accuracy of event processing and state machine control. sturdiness and reliability.

For example, if the same event processing instruction is received multiple times in a short period of time, if state machine 1 executes the pending event first, stores the associated state transition record in the database, and stores the corresponding state transition record in the database. The version number is updated to: 1. If the state machine 2 is also executing the pending event, after generating the current state transition record, the version number of the state transition record of the event in the database can be determined first. If the version number is determined to be 1, the set threshold is also 1, the two are equal, then state machine 2 can delete its corresponding temporary state transition record.

It should be noted that the above examples are only schematic descriptions, and cannot be used as limitations on the version numbers, thresholds, etc. of the state transition records in the embodiments of the present disclosure.

In the embodiment of the present disclosure, when the current condition of the state machine satisfies the transition condition, the state machine can be transferred from the current state to the end state corresponding to the target transition function, and then the current state and the end state can be generated and temporarily stored. State transition record, and determine the value of the version number of the state transition record associated with the event information to be processed in the database. The state transition record associated with the to-be-processed event information, and the value of the version number is incremented by one. In this way, the current state transition record can be generated and temporarily stored according to the current state and end state of the state machine, and then when the value of the version number of the associated state transition function in the database is less than the threshold, the current state transition record can be temporarily stored according to the state The transition record updates the associated state transition record in the database. This process does not need to add new state classes, etc., and can control the state machine only according to the correlation between events, thereby reducing the complexity of state machine control. , which simplifies the process

In order to realize the above embodiments, the present disclosure also proposes a control apparatus for a state machine.

FIG. 5 is a schematic structural diagram of a control apparatus for a state machine provided by an embodiment of the present disclosure.

As shown in FIG. 5 , the control apparatus 100 of the state machine may include: a receiving module 110 , a parsing module 120 , a determining module 130 , an obtaining module 140 and a returning module 150 .

The receiving module 110 is configured to receive an event processing instruction, wherein the event processing instruction includes event information to be processed.

The parsing module 120 is configured to parse the event information to determine the identifier and context information of the to-be-processed event.

The determining module 130 is configured to determine the target state transition function according to the identifier of the to-be-processed event.

The obtaining module 140 is configured to obtain the current state of the state machine associated with the context information from the database.

The returning module 150 is configured to return an event processing failure message when the current state of the state machine does not match the starting state corresponding to the target state transition function.

Optionally, the determining module 130 is specifically configured to:

Obtain attribute information of the to-be-processed event according to the identifier of the to-be-processed event;

The state transition function in the attribute information of the to-be-processed event is determined as the target state transition function.

Optionally, the obtaining module 140 is specifically used for:

obtaining a state transition record associated with the context information from the database;

The target state in the state transition record is determined as the current state of the state machine.

Optionally, the determining module 130 is further configured to:

Under the condition that the current state of the state machine matches the starting state corresponding to the target state transition function, determining the transition condition corresponding to the event to be processed;

When the current condition of the state machine satisfies the transition condition, the state machine is transitioned from the current state to the end state corresponding to the target transition function.

Optionally, the determining module 130 is further configured to:

According to the current state and the end state, generate and temporarily store the current state transition record;

determining the value of the version number of the state transition record associated with the to-be-processed event information in the database;

When the value of the version number is less than the threshold, update the state transition record associated with the pending event information in the database according to the temporarily stored state transition record, and convert the version number to the state transition record. The value is incremented by one.

Optionally, the determining module 130 is further configured to:

When the value of the version number is equal to the threshold, the current state transition record is deleted.

For the functions and specific implementation principles of the foregoing modules in the embodiments of the present disclosure, reference may be made to the foregoing method embodiments, and details are not described herein again.

The control device of the state machine in the embodiment of the present disclosure may first receive an event processing instruction, wherein the event processing instruction includes the event information to be processed, and then parse the event information to be processed to determine the identifier and context of the to-be-processed event Environment information, determine the target state transition function according to the identifier of the event to be processed, and then obtain the current state of the state machine associated with the contextual environment information from the database, and the start state corresponding to the current state of the state machine and the target state transition function In the case of no match, an event processing failure message is returned. Therefore, by analyzing the received event information, the identifier of the to-be-processed event, the target state transition function and the context information can be determined, so that when controlling the state machine, there is no need to add a new state class, etc. The association relationship can realize the control of the state machine, thereby reducing the complexity of the state machine control and simplifying the process.

In order to implement the above-mentioned embodiments, the present disclosure also proposes an electronic device, including: a memory, a processor, and a computer program stored in the memory and running on the processor. When the processor executes the program, the above-mentioned embodiments of the present disclosure are implemented. The proposed state machine control method.

In order to implement the above embodiments, the present disclosure also provides a non-transitory computer-readable storage medium storing a computer program, and when the computer program is executed by a processor, implements the state machine control method provided by the foregoing embodiments of the present disclosure.

In order to realize the above embodiments, the present disclosure also provides a computer program product, when the instruction processor in the computer program product executes, executes the state machine control method proposed by the foregoing embodiments of the present disclosure.

6 shows a block diagram of an exemplary electronic device suitable for use in implementing embodiments of the present disclosure. The electronic device 12 shown in FIG. 6 is only an example, and should not impose any limitation on the function and scope of use of the embodiments of the present disclosure.

As shown in FIG. 6, the electronic device 12 takes the form of a general-purpose computing device. Components of electronic device 12 may include, but are not limited to, one or more processors or processing units 16 , system memory 28 , and a bus 18 connecting various system components including system memory 28 and processing unit 16 .

Bus 18 represents one or more of several types of bus structures, including a memory bus or memory controller, a peripheral bus, a graphics acceleration port, a processor, or a local bus using any of a variety of bus structures. For example, these architectures include, but are not limited to, Industry Standard Architecture (ISA) bus, Micro Channel Architecture (MAC) bus, enhanced ISA bus, Video Electronics Standards Association (Video Electronics Standards Association) , VESA) local bus and peripheral component interconnect (Peripheral Component Interconnection, PCI) bus.

Electronic device 12 typically includes a variety of computer system readable media. These media can be any available media that can be accessed by electronic device 12, including both volatile and non-volatile media, removable and non-removable media.

Memory 28 may include computer system readable media in the form of volatile memory, such as random access memory (RAM) 30 and/or cache memory 32 . Electronic device 12 may further include other removable/non-removable, volatile/non-volatile computer system storage media. For example only, storage system 34 may be used to read and write to non-removable, non-volatile magnetic media (not shown in FIG. 6, commonly referred to as a "hard drive"). Although not shown in FIG. 6, a magnetic disk drive for reading and writing to removable non-volatile magnetic disks (eg "floppy disks") and removable non-volatile optical disks (eg compact disk read only memory) may be provided Disc Read Only Memory, CD-ROM), Digital Versatile Disc Read Only Memory (Digital Video Disc Read Only Memory, DVD-ROM) or other optical media) read and write optical disc drives. In these cases, each drive may be connected to bus 18 through one or more data media interfaces. Memory 28 may include at least one program product having a set (eg, at least one) of program modules configured to perform the functions of various embodiments of the present disclosure.

A program/utility 40 having a set (at least one) of program modules 42, which may be stored, for example, in memory 28, such program modules 42 including, but not limited to, an operating system, one or more application programs, other program modules, and program data , each or some combination of these examples may include an implementation of a network environment. Program modules 42 generally perform the functions and/or methods of the embodiments described in this disclosure.

The electronic device 12 may also communicate with one or more external devices 14 (eg, a keyboard, pointing device, display 24, etc.), with one or more devices that enable a user to interact with the electronic device 12, and/or with Any device (eg, network card, modem, etc.) that enables the electronic device 12 to communicate with one or more other computing devices. Such communication may take place through input/output (I/O) interface 22 . Also, the electronic device 12 may communicate with one or more networks (eg, Local Area Network (LAN), Wide Area Network (WAN), and/or public networks such as the Internet) through the network adapter 20 . As shown, network adapter 20 communicates with other modules of electronic device 12 via bus 18 . It should be understood that, although not shown, other hardware and/or software modules may be used in conjunction with electronic device 12, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives and data backup storage systems.

The processing unit 16 executes various functional applications and data processing by running the programs stored in the system memory 28 , for example, implements the methods mentioned in the foregoing embodiments.

In the technical solution of the present disclosure, an event processing instruction may be received first, wherein the event processing instruction includes event information to be processed, and then the event information to be processed is parsed to determine the identifier and context information of the event to be processed. The identification of the processed event, the target state transition function is determined, and then the current state of the state machine associated with the context information can be obtained from the database. In the case where the current state of the state machine does not match the starting state corresponding to the target state transition function , which returns the event processing failure message. Therefore, by analyzing the received event information, the identifier of the to-be-processed event, the target state transition function and the context information can be determined, so that when controlling the state machine, there is no need to add a new state class, etc. The association relationship can realize the control of the state machine, thereby reducing the complexity of the state machine control and simplifying the process.

In the description of this specification, description with reference to the terms "one embodiment," "some embodiments," "example," "specific example," or "some examples", etc., mean specific features described in connection with the embodiment or example , structures, materials, or features are included in at least one embodiment or example of the present disclosure. In this specification, schematic representations of the above terms are not necessarily directed to the same embodiment or example. Furthermore, the particular features, structures, materials or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, those skilled in the art may combine and combine the different embodiments or examples described in this specification, as well as the features of the different embodiments or examples, without conflicting each other.

In addition, the terms "first" and "second" are only used for descriptive purposes, and should not be construed as indicating or implying relative importance or implying the number of indicated technical features. Thus, a feature delimited with "first", "second" may expressly or implicitly include at least one of that feature. In the description of the present disclosure, "plurality" means at least two, such as two, three, etc., unless expressly and specifically defined otherwise.

Any process or method description in the flowcharts or otherwise described herein may be understood to represent a module, segment or portion of code comprising one or more executable instructions for implementing custom logical functions or steps of the process , and the scope of the preferred embodiments of the present disclosure includes alternative implementations in which the functions may be performed out of the order shown or discussed, including performing the functions substantially concurrently or in the reverse order depending upon the functions involved, which should It is understood by those skilled in the art to which the embodiments of the present disclosure pertain.

The logic and/or steps represented in flowcharts or otherwise described herein, for example, may be considered an ordered listing of executable instructions for implementing the logical functions, may be embodied in any computer-readable medium, For use with, or in conjunction with, an instruction execution system, apparatus, or device (such as a computer-based system, a system including a processor, or other system that can fetch instructions from and execute instructions from an instruction execution system, apparatus, or apparatus) or equipment. For the purposes of this specification, a "computer-readable medium" can be any device that can contain, store, communicate, propagate, or transport the program for use by or in connection with an instruction execution system, apparatus, or apparatus. More specific examples (non-exhaustive list) of computer readable media include the following: electrical connections with one or more wiring (electronic devices), portable computer disk cartridges (magnetic devices), random access memory (RAM), Read Only Memory (ROM), Erasable Editable Read Only Memory (EPROM or Flash Memory), Fiber Optic Devices, and Portable Compact Disc Read Only Memory (CDROM). In addition, the computer readable medium may even be paper or other suitable medium on which the program may be printed, as the paper or other medium may be optically scanned, for example, followed by editing, interpretation, or other suitable medium as necessary process to obtain the program electronically and then store it in computer memory.

It should be understood that portions of the present disclosure may be implemented in hardware, software, firmware, or a combination thereof. In the above-described embodiments, various steps or methods may be implemented in software or firmware stored in memory and executed by a suitable instruction execution system. For example, if implemented in hardware as in another embodiment, it can be implemented by any one of the following techniques known in the art, or a combination thereof: discrete with logic gates for implementing logic functions on data signals Logic circuits, application specific integrated circuits with suitable combinational logic gates, Programmable Gate Arrays (PGA), Field Programmable Gate Arrays (FPGA), etc.

Those skilled in the art can understand that all or part of the steps carried by the methods of the above embodiments can be completed by instructing the relevant hardware through a program, and the program can be stored in a computer-readable storage medium, and the program can be stored in a computer-readable storage medium. When executed, one or a combination of the steps of the method embodiment is included.

In addition, each functional unit in each embodiment of the present disclosure may be integrated into one processing module, or each unit may exist physically alone, or two or more units may be integrated into one module. The above-mentioned integrated modules can be implemented in the form of hardware, and can also be implemented in the form of software function modules. If the integrated modules are implemented in the form of software functional modules and sold or used as independent products, they may also be stored in a computer-readable storage medium.

The above-mentioned storage medium may be a read-only memory, a magnetic disk or an optical disk, and the like. Although the embodiments of the present disclosure have been shown and described above, it should be understood that the above-described embodiments are exemplary and should not be construed as limitations of the present disclosure, and those of ordinary skill in the art may interpret the above-described embodiments within the scope of the present disclosure. Embodiments are subject to variations, modifications, substitutions and variations.

Claims (10)

1. a control method of a state machine, is characterized in that, comprises: receiving an event processing instruction, wherein the event processing instruction includes event information to be processed; Parsing the event information to determine the identifier and context information of the event to be processed; Determine the target state transition function according to the identifier of the event to be processed; Obtain the current state of the state machine associated with the context information from the database; If the current state of the state machine does not match the starting state corresponding to the target state transition function, an event processing failure message is returned. 2. The method according to claim 1, wherein, determining the target state transition function according to the identifier of the event to be processed, comprising: Obtain attribute information of the to-be-processed event according to the identifier of the to-be-processed event; The state transition function in the attribute information of the to-be-processed event is determined as the target state transition function. 3. The method according to claim 1, wherein the acquiring the current state of the state machine associated with the context information from a database comprises: obtaining a state transition record associated with the context information from the database; The target state in the state transition record is determined as the current state of the state machine. 4. The method according to claim 1, characterized in that after acquiring the current state of the state machine associated with the context information from the database, the method further comprises: Under the condition that the current state of the state machine matches the starting state corresponding to the target state transition function, determining the transition condition corresponding to the event to be processed; When the current condition of the state machine satisfies the transition condition, the state machine is transitioned from the current state to the end state corresponding to the target transition function. 5. The method according to claim 4, wherein after the state machine is transferred from the current state to the end state corresponding to the target transfer function, the method further comprises: According to the current state and the end state, generate and temporarily store the current state transition record; determining the value of the version number of the state transition record associated with the to-be-processed event information in the database; When the value of the version number is less than the threshold, update the state transition record associated with the pending event information in the database according to the temporarily stored state transition record, and convert the version number to the state transition record. The value is incremented by one. 6. The method according to claim 5, wherein after determining the value of the version number of the state transition record associated with the to-be-processed event information in the database, the method further comprises: When the value of the version number is equal to the threshold, the current state transition record is deleted. 7. A control device for a state machine, comprising: a receiving module, configured to receive an event processing instruction, wherein the event processing instruction includes event information to be processed; a parsing module, configured to parse the event information to determine the identifier and context information of the event to be processed; A determination module for determining a target state transition function according to the identifier of the event to be processed; an acquisition module for acquiring the current state of the state machine associated with the context information from the database; The returning module is configured to return an event processing failure message when the current state of the state machine does not match the starting state corresponding to the target state transition function. 8. An electronic device, characterized in that, comprising a memory, a processor and a computer program stored on the memory and running on the processor, and when the processor executes the program, realizes as in claims 1-6 Any one of the control methods of the state machine. 9 . A computer-readable storage medium storing a computer program, wherein when the computer program is executed by a processor, the control method for a state machine according to any one of claims 1-6 is implemented. 10 . 10. A computer program product, characterized by comprising a computer program that, when executed by a processor, implements the control method of the state machine according to any one of claims 1-6.

Images