Method and device for realizing state machine

Abstract

The invention discloses a method and a device for realizing a state machine. The main technical scheme of the method comprises the following steps of: determining the currently generated event and the current state of the state machine; searching a corresponding relationship between a predetermined state and a predetermined event with a response relationship and judging whether the response relationship exists between the currently generated event and the current state of the state machine or not; if the response relationship exists between the currently generated event and the current state of the state machine, determining a processing function identifier and a switched next state corresponding to the current state of the state machine and the currently generated event according to a processing function identifier and a switched next state corresponding to the predetermined state and the predetermined event with the response relationship, and controlling the state machine to jump tothe determined next state after a processing function corresponding to the determined processing function identifier is successfully executed; and if the response relationship does not exist between the currently generated event and the current state of the state machine, controlling the state machine to keep the current state. The state machine is realized by the technical scheme; state switching efficiency is improved; and easy maintenance is achieved.

Description

technical field [0001] The invention relates to the technical field of state machines, in particular to a method and device for realizing a state machine. Background technique [0002] A finite state machine (Finite State Machine, FSM) is also called a finite state automaton or simply a state machine, which represents a mathematical model of a finite number of states and transitions and actions between these states. In general, a finite state machine controls state transitions through the relationship between states, events, transitions, and actions, where: [0003] State (State) refers to a state of an object in its life cycle. An object in a certain state must meet certain conditions, perform certain actions, or wait for certain events; [0004] Event (Event) refers to those things that occupy a certain position in time and space and are meaningful to the state machine, that is, events usually cause state changes, prompting the state machine to switch from one state to an...

AI Technical Summary

Problems solved by technology

This method can implement the state machine more intuitively, but when using this method to implement the state machine, since the action is designed for a specific state and event, an action may be mixed with different logic processing, so the efficiency of the state machine conversion is very low. In addition, the number of events (events) must be numbered consecutively starting from 0. Therefore, if an event is added in a certain state, even if other states do not need to consider this event, corresponding processing needs to be added to ensure the integrity of the matrix. Therefore , the maintenance process of the state machine is very complicated, especially when the system is very complex, the state machine is not even maintainable

[0011] In summary, the state machine implemented by the existing technology has low efficiency in controlling each state of the state machine, and the maintenance process is complicated

Images