JPH02206861A - State transition table preparing device - Google Patents

Abstract

PURPOSE:To easily generate a state transition table by taking out all states described in a state transition series classified by function, and generating the state transition table by totaling the transition destination state of the state for each taken out state. CONSTITUTION:The state transition series classified by the function is stored in a state transition series classified by function storing means 101. A state totaling means 102 takes out all the states described in the state transition series classified by the function. A transition destination state totaling means 103 totals the transition destination of the state for each taken out state, and generates the state transition table. The state transition table generated in such a way is stored in a state transition table storing means 104.

Description

DETAILED DESCRIPTION OF THE INVENTION (Field of Industrial Application) The present invention relates to an apparatus for creating a state transition table for a system that performs control based on the state transition table.

(Prior Art) Conventionally, in a system that performs control based on user input, a state transition table is created that describes the association between user input and state transition for each state of the system. The method used was to create a plan in advance and perform control based on it. An example of such a control device is
For example, it is described in Japanese Patent Application Laid-Open No. 63-158630, "Screen Control Method Based on Screen Transition Rules," and in this example, one screen is associated with each state to control screen transitions. The configuration of this device is shown in FIG. In FIG. 6, 601 is a state transition table storage means for each state that stores a transition destination state for each state, and 602 is a state transition table storage means 602 that displays a screen based on the user's input and the state transition table storage means 601. A screen control means 603 is a display means. At this time, the state transition table was written by a human using, for example, a programming language.

(Problems to be Solved by the Invention) When using such a method, a state transition table that describes transition destination states corresponding to each state must be written in advance in 601. However, although it is relatively easy to describe a sequence of state transitions to achieve a certain function, it is extremely difficult for humans to describe all possible transition states for each state and is prone to mistakes. This is a task that can easily occur. The present invention is aimed at solving these difficulties and making it possible to easily create a state transition table.

(Means for Solving the Problems) A state transition table creation device of the present invention is a state transition table creation device that creates a state transition table for each state from a state transition series for each function. a function-specific state transition series storage means for storing, a state aggregation means for extracting all the states described in the function-specific state transition series, and a state aggregation means for aggregating the transition destination state of the state for each of the retrieved states. It is characterized by comprising a transition destination state aggregation means for creating a state transition table, and a state transition table storage means for storing the state transition table.

(Operation) The operation of the present invention will be explained using FIGS. 3, 4, and 5 as examples. It is assumed that FIG. 3 is a state transition diagram showing state transitions of part of the operation of the word processor. It is assumed that words in a sentence are copied when transitioning from state S1 shown in 301 to state S4 shown in 304, and deleted when transitioning to state S5 shown in 305.

FIG. 4 shows a functional state transition series for expressing the state transition diagram shown in FIG. 3. In FIG. 4, for two functions, 'copying' and 'deletion', states to be transitioned to realize the functions and user inputs to realize the state transitions are described. This figure shows that, for example, when 1 is manually performed in state S1, the state changes to state S2.

When there is a functional state transition series as shown in FIG. 4, the state transition table creation device of the present invention first extracts all states listed in the state transition table. In the example in Figure 4, S
1, S2, s3, s4, and s5. Next, for each state, the inputs that can be accepted and the transition destination state at that time are determined. In the example of FIG. 4, it is possible to accept 1 and 2 for Sl, and when K1 is accepted, the transition goes to s2, and when K2 is accepted, the transition is to S3.
Transition to. Further, 3 can be accepted for S2, and in that case, the process moves to S4. 4 can be accepted for S3, and in that case the process moves to S5. There is no input that can be accepted for s4 and 85. Acceptable inputs for each state thus determined and the transition destination state at that time are stored in the form of a state transition table as shown in FIG.

The state control device of the present invention automatically creates a state transition table for each state as shown in FIG. 5 from a state transition series for each function as shown in FIG.

(Embodiment) FIG. 1 is a block diagram showing an embodiment of the present invention. 1
Reference numeral 01 denotes a state transition series storage means for each function, and a semiconductor memory, a floppy disk, etc. can be used. 102 is a state aggregation means, 103 is a transition destination state aggregation means, and 1
Both 02 and 103 can use a microprocessor or the like. Reference numeral 104 denotes a state transition table storage means, for which a semiconductor memory, a floppy disk, etc. can be used.

The state control device of the present invention first creates a state transition table using the state aggregation means 102 and the transition destination state aggregation means 103 from the functional state transition series stored in 101, and records it in 104. FIG. 2 shows a flowchart of processing when creating a state transition table from a state transition series classified by function.

First, in 201, all states listed in the state transition table are extracted. Next, at 202, one element in the set is taken, and the inputs that that state can accept and the transition destination state at that time are tallied. Generally, there are multiple transition destination states, so for one state, there are multiple acceptable inputs and multiple transition destination states. When the input and transition destination states have been aggregated for one state, it is checked in 203 whether the aggregation has been performed for all states, and if there is a state that has not been aggregated, the process returns to 202 and the aggregation is performed. continue. When the aggregation for all states is completed, a combination of each state, inputs that the state can accept, and transition destination states is stored in the state transition table 104.

In the above embodiment, all states are first retrieved in step 201, but one state is retrieved, the transition destination states are totaled for that state, then another state is retrieved, and the transition destination states are totaled in the same manner. You may also create a state transition table using

(Effects of the Invention) By using the device of the present invention, instead of writing a state transition table for each state as in the past, it is sufficient to write a state transition series for each function. For humans, it is much easier to create a state transition series for each function than to describe all the states that can be transitioned from a certain state, and it is much easier than directly creating a state transition table. By using the state transition table creation device, state transition tables can be easily created.

[Brief explanation of the drawing]

FIG. 1 is a block diagram showing an embodiment of the present invention, FIG. 2 is a flowchart of a method for creating a state transition table from a functional state transition series, FIG. 3 is an example of a state transition diagram, and FIG. 3
5 is an example of a state transition table showing the state transition diagram of FIG. 3. FIG. 6 is a block diagram showing the configuration of a conventional state control device. be. In the figure, 101...Functional state transition series storage means, 102...State aggregation means for extracting all the states described in the state transition series, 103...Inputs that can be accepted for each state 104... state transition table storage means, which totals the transition destination state and the transition destination state at that time.

Claims (1)

[Claims] A state transition table creation device that creates a state transition table for each state from a state transition series for each function that describes the state transition series for each function, comprising a state transition series storage unit for each function that stores the state transition series for each function; A state aggregation means for extracting all the states described in the functional state transition series, and a transition destination state aggregation means for aggregating the transition destination states of each of the extracted states to create a state transition table. and state transition table storage means for storing the state transition table.