JPH0319086A - State transition table converter - Google Patents

Abstract

PURPOSE:To reduce the trouble for generating a state transition table by collecting such a pre-transition state as an input, an output and a post-transition state are all the same, into the state transition table and entering it as one group into the state transition table. CONSTITUTION:The subject converter is provided with a simplified state transition table storage means 101 for storing a simplified state transition table, a pre-transition state number counting means 102 for counting the number of pre-transition states of each transition mentioned in the simplified state transition table, and a pre-transition state decomposing means 103 for referring to the simplified state transition table storage means 101 at the time when the number of pre-transition states outputted therefrom is >=2, decomposing plural pre-transition states into each state and generating a state transition table against each state. Also, it is constituted so that such a pre-transition state as an input, an output and a post-transition state are all the same can be described as one group. In such a way, the trouble of a man for generating the state transition table can be reduce.

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) The operation of a system can generally be described in the form of a certain state and the state to which it transitions when an input is received, and a state transition table is a table that describes this state. . FIG. 4 shows an example of a state transition table. FIG. 4 shows a pre-transition state, input, output, and post-transition state. A method of using a state transition table to describe the behavior of a system is described, for example, at the Information Processing Society of Japan's 38th (early 1989) national conference IL-6.

When using such a method, it is necessary for a human to create in advance a state transition table that describes the transition destination state corresponding to each state.

(Problem to be Solved by the Invention) However, it is very time-consuming for humans to memorize all such state transition tables. For example, in the state transition table shown in Figure 4, pre-transition states S2, S3, and S4 must be described separately even though the inputs, outputs, and post-transition states for these states are all the same. This is extremely troublesome for humans. In this way, the present invention aims to reduce human effort in creating a state transition table by making it possible to describe pre-transition states in which the input, output, and post-transition state are all the same as one group. It is something to do.

(Means for solving the problem) From a simple state transition table that describes state transitions by grouping multiple states with common properties, to a state transition table that describes state transitions for individual states that make up the multiple states. A state transition table conversion device that creates a simple state transition table, comprising: a simple state transition table storage means for storing the simple state transition table; a pre-transition state counting means for counting the number of pre-transition states; and when the number of pre-transition states outputted from the pre-transition state counting means is 2 or more, the simple state transition table storage means is referred to. , pre-transition state decomposition means for decomposing the plurality of pre-transition states into the individual states and creating a state transition table for each of the individual states.

(effect) The operation of the present invention will be explained using FIGS. 3 and 4 as examples.

Figure 3 shows a simplified state transition in which the input, output, and post-transition state are the same for each pre-transition state in the state transition table in Figure 4, and are entered in the pre-transition state column as one group. It is a table.

When there is a simple state transition table as shown in FIG. 3, the state transition table conversion device of the present invention first reads the state S1, which is the first item of the pre-transition state, and counts the number of states. In this case, there are only 81 states, and the number of states is 1. If the number of pre-transition states is 1, that row of the simple state transition table is copied as is to the top row of the new state transition table. Next, the next items of the pre-transition state, S2, S3, and S4, are read and the number of states is counted. In this case it is 3.

If the number of states is two or more, the state is broken down into individual states and each state is copied as a separate row to a new state transition table. In this example, a new row is created for each of states S2, S3, and S4, and the input, output, and post-transition state for those states are all the same.
．． 02, copy S5. In this way, the simple state transition table of FIG. 3 is converted to the state transition table of FIG. 4.

Further, the state transition table shown in FIG. 4 may be created by rewriting the second line of the simple state transition table shown in FIG. In this case, rather than copying to a new state transition table,
Only when there are two or more pre-transition states, each state is rewritten as a separate line.

(Example) FIG. 1 is a block diagram showing one embodiment of the present invention.

Reference numeral 101 denotes a simple state transition table storage means, which can utilize a semiconductor memory, a disk, or the like. 102 is a pre-transition state counting means; 103 is a pre-transition state decomposition means;
and 103 can both use a microprocessor or the like. 104 is a state transition table storage means, which includes a semiconductor memory,
You can use discs, etc.

The operation of converting a simple state transition table into a state transition table using the state transition table conversion device of the present invention will be explained using the block diagram of FIG. 1 and the flowchart of FIG. 2. First, the pre-transition state number counting means 102 sets a pointer to the top row of the simple state transition table stored in the simple state transition table storage means 101 (201) and counts the number of pre-transition states in that row ( 202). Next, if the number of pre-transition states counted in the process 202 is 2 or more (203), the pre-transition state decomposition means 10
3 decomposes those pre-transition states and copies each state to a separate row of the state transition table (204). At this time, the input, output, and post-transition state columns of the state transition table are all the same as the pointer row of the simple state transition table. In process 203, if the number of pre-transition states is 1, the pre-transition state decomposition means 10
Step 3 copies the pointer row as is to the state transition table without doing anything (20?), and ends if the pointer row is the bottom row of the state transition table (206). If it is not the bottom line, the pointer is advanced one line below and the process returns to step 202.

In the above embodiment, the converted state transition table is stored in a storage means separate from the simple state transition table storage means 101, but it is also possible to rewrite the stored contents of the original simple state transition table storage means 101. Applicable. In this case, in step 204, the pre-transition state decomposition unit 103 decomposes the plurality of pre-transition states and copies each state to a separate row of the simple state transition table,
Delete rows that contain multiple original pre-transition states. Also, 20
The step of copying pointer row 7 to the new state transition table is omitted.

(Effects of the Invention) By using the device of the present invention, there is no need to separately enter pre-transition states in which the input, output, and post-transition state are all the same in the state transition table; 1
Since data can be entered into the state transition table as one group, the effort required to create the state transition table is reduced.

[Brief explanation of the drawing]

Fig. 1 is a block diagram showing one embodiment of the present invention, Fig. 2 is a flowchart of a method for creating a state transition table from a simple state transition table, Fig. 3 is a simple state transition table, and Fig. 4 is a flow chart of a method of creating a state transition table from a simple state transition table. This is a state transition table created from the simple state transition table of FIG. 3 using a device. In the figure, 101: simple state transition table storage means, 1
02... Pre-transition state number counting stage, 103... Pre-transition state decomposition means for disassembling the state transition table when the number of pre-transition states is plural, 104... State transition table in complete format This is a state transition table storage means for storing.

Claims (1)

[Claims] A state transition table conversion device that creates a state transition table that describes state transitions for individual states constituting the plurality of states from a simple state transition table that groups a plurality of states with common characteristics and describes state transitions. a simple state transition table storage means for storing the simple state transition table; and a transition for counting the number of pre-transition states of each transition described in the simple state transition table by referring to the simple state transition table storage means. When the number of pre-transition states output from the pre-transition state number counting means is 2 or more, the simple state transition notation storage means is referred to, and the plurality of pre-transition states are stored in the respective pre-transition states. A state transition table conversion device comprising: pre-transition state decomposition means for decomposing states into states and creating a state transition table for each state.