JPH01287779A - State transition diagram display processing system - Google Patents

Abstract

PURPOSE:To eliminate the crossing of arrow marks indicating state transition and to make the state transition easy to see by providing a transition number determination part, a display position determination part, and a state arrangement determination part, and determining an arrangement position by the state arrangement determination part according to a state number. CONSTITUTION:The transition number determination part 2 finds transition numbers among respective states according to a state transition table on a memory part 6 to generate a table of the transition numbers, which is stored on a memory part 7. The display position determination part 4 determines plural display positions (as many as the state numbers) where the states are displayed on a displayed screen by specifying their coordinates, and the display positions are determined according to the state numbers from a state number counting part 5 and the size of the display screen from a display information part 9. The state arrangement determination part 3 make one display state correspond to respective display positions on the memory part 8 to determine the arrangement positions of the respective states. This determination is performed by referring to the memory part 7 by utilizing the transition number (size). Consequently, the crossing of arrow marks indicating state transition is reduced and the state transition is made easy to see.

Description

[Detailed description of the invention] 〔overview〕 Regarding the state transition diagram display processing method.

The purpose is to make state transitions easier to see by reducing the number of intersections between arrows indicating state transitions.

a transition number determination unit that determines the number of transitions for each state;
a display position determining unit that determines a display position on a circumference according to the number of states, and a state layout determining unit that determines a layout position of the state in correspondence with the display position; The configuration is such that the unit determines the placement position based on the number of transitions.

[Industrial application field]

The present invention relates to a state Li transition diagram display processing method.

A state transition diagram is a graph of a state transition function that clearly displays the relationships between states.

Widely used for designing and analyzing programs and sequential circuits.

[Conventional technology]

When graphing a LL transition function (state transition table) as shown in FIG. 9 to form a state transition diagram, the conventional method is as follows.

FIG. 10 is an explanatory diagram of the prior art, and shows an example of a conventional state transition diagram.

Conventionally, the shapes Lia to d, which should be displayed once, are arranged either randomly or in the order in which they appear on a straight line (FIG. 10(A)) or on a circumference (FIG. 10(B)). Thereafter, directed arrows and inputs are displayed between each state to indicate state transitions according to the state transition table. For example, when there is human power “0” in state Ma, when transitioning to state A, “a-1→b
” will be displayed.

[Problem to be solved by the invention]

According to the above-mentioned prior art, each state to be displayed is arranged randomly or in the order in which it appears.
As shown in (B), the arrows intersect, and as the number of states increases and the state transition becomes more complex, the number of arrows that intersect may increase.

When the number of intersections of arrows increases, even if a state transition diagram is created from a state transition table, the problem arises that the state transitions are difficult to see and understand.

SUMMARY OF THE INVENTION An object of the present invention is to provide a state transition diagram display processing method in which the number of intersections of arrows indicating state transitions is reduced to make state transitions easier to see.

Means for Solving Problem C] FIG. 1 is a diagram showing the basic configuration of the present invention, and shows a data processing device according to the present invention.

In FIG. 1, 1 is a processing unit including a central processing unit (CPU) and memory, and 2 is a transition number determining unit.

3 is a state arrangement determining section, 4 is a display position determining section, 5 is a state number counting section, 6 to 8 are memory sections, 9 is a display information section,
IO is an arrow adding section, 11 is a display control section, 12 is a graph ink library, and 13 is a display device having a display screen.

A state transition table, such as the one shown in FIG. 9, which is to be graphed and displayed, is held in the memory section 6.

The transition number determination section 2 determines the number of transitions between each state based on the state transition table in the memory section 6, creates a transition number table as shown in FIG. 2, and stores this in the memory section 7. Here, the number of transitions refers to the number of arrows added when a state transition diagram is created, for example 0.

Since we are currently using the state transition table in Figure 9, if we look at the state between states a and b, [a-→bJ].

The two arrows “a←b” are (transition number 2) in the states aa and b
is added to. Between state Ha and C, "a-
1→c'', ra ←--c J (the number of transitions is 2).Therefore, the total number of transitions Si for the shape Lia is 4, and the shapes Ha, 13ia, b, c, and The number of transitions between d and d is respectively.

Note that the total number of transitions St, which is assumed to be 0.2.2 and 0, is actually obtained as preprocessing when the state arrangement determination unit 3 determines the state arrangement.

The state number counting unit 5 calculates the number of states included (to be displayed) from the state transition table in the memory unit 6.

The display position determining unit 4 specifies the coordinates of a plurality of positions (display positions) where states should be displayed on one display screen.The zero display position is determined from the state number counting unit 5. Information about the 0 display position determined based on the number of states and the display screen size etc. from the 9 display information section 9 is stored in the memory section 8 as a layout table.

The state arrangement determining section 3 stores one state at each display position of the memory section 8.
By associating two states to be displayed, the placement position of each state is determined. this is.

This is performed by referring to the memory unit 7 and using (the size of) the number of transitions. As a result, a layout table is obtained in the memory section 8 in which the coordinates of one display position are associated with the state.

The arrow adding section 10 includes the arrangement table of the memory section 8 and the memory section 6.
With reference to the state transition table, information is created in which arrows and inputs indicating state transitions between each state are added to the layout table.

The display control section 11 refers to the graphics library 12, which is a one-screen creation tool, creates screen information based on the information from the arrow addition section 10, and sends it to the two display devices 13. Note that the graphic library 12 is connected to each display device 13.
It is set up correspondingly.

[Effect]

FIG. 3 is an explanatory diagram of the operation of the present invention.

The state transition table shown in FIG. 9 is stored in the memory section 6. Based on this, the transition number determining section 2 creates a table of transition numbers shown in FIG. 2, and stores it in the memory section 7. On the other hand, the state number counting section 5 knows that the number of states is "4".

Next, the 1 display position determining section 4 moves the 1 display position determining section 4 to
A display position 131 of the state on the display screen 130 is determined. That is, first, information about the size of the display screen 130, etc. is given from the display information section 9. Based on this, a circle with radius R1 and center 0 is determined, and four display areas 131 are located on the circumference of this one circle. In this case, the distance between each display area 131 is made equal. (When the number of states is n,
Each vertex of an n-gon inscribed in a circle with radius R is a display position. ) Information regarding the display position (coordinates) is stored in the memory section 8.

Next, the state arrangement determining unit 3 (FIG. 3(B) or D)
Perform the arrangement process as shown in .

First, the state arrangement determination unit 3 refers to the transition number table in the memory unit 7, calculates the total number of transitions Si for each state, and selects the state with the maximum number of transitions.In this case, all numbers are 4. However, it is assumed that condition Ba is selected. Then, the shape Lia is stored in the memory unit 8 so as to be associated with an arbitrary (or predetermined) one of the four display positions 131. If this is shown as a screen, it will look like FIG. 3(B).

Next, referring again to the transition number table, the remaining states ab,
From c and d, select the state with the largest number of transitions between state a and the next largest state. In this case, select the state with the largest number of transitions between states a and b, and the state with the next largest number of transitions between states a and b. The number of transitions between and is both "2", but the state l1llb is the maximum state,
Assume that state Lie is selected as the next largest state. Then, the shapes 6b and C are associated with the adjacent display positions 131 in the clockwise and counterclockwise directions (the reverse is also possible) of the state a. Similar to the above, this correspondence relationship is based on the memory section 8.
The nine screens are stored in 9 screens as shown in FIG. 3(C).

Next, the remaining state Lid and the display position 131 are shown in FIG. 3 (D
), the state arrangement is completed.

Note that if the number of states is large, processing continues as in the first order. That is, first, the state with the maximum number of transitions between states (
One state It/) is selected, and this is made to correspond to the display position adjacent to the state It.

In this selection, the states a and C, which have already been selected once, are removed from the objects (the same applies hereafter), and the state LiC' is similarly made to correspond to the display position adjacent to the state C.

After this, similar arrangement processing is performed in the order of the state Bw side and the state C' side, and is repeated until there are no more states.

Thereafter, the arrow adding section 10 refers to the state transition table in the memory section 6 and adds an arrow and an input. and.

When this is displayed on the screen, it will look like FIG. 3(E).

According to the above processing, states with a large number of transitions (many arrows) are arranged adjacent to each other.

As a result, as can be understood from a comparison between FIG. 3(E) and FIG. 10, the number of intersections between arrows indicating state transitions can be reduced, making the state transitions easier to see. especially.

When the number of states is small, intersections of arrows can be eliminated. Further, the arrangement of these states can be determined automatically, and there is no burden on the user.

Note that the dotted line in FIG. 3, the arrow 1 character R and 0 indicating the radius R are not displayed on the display screen 130.

〔Example〕

As an embodiment of the present invention, the data processing apparatus shown in FIG. 1 will be described in detail.

First, the determination of the number of transitions will be explained using FIGS. 4 and 5.

FIG. 4 is an explanatory diagram of the embodiment, in which the memory section 6. The configuration of the transition number determining section 2 and the memory section 7 is shown.

In FIG. 4, 14 and 16 are address control units.

15 and 17 are read control units, 18 are write control units, 1
9 is an adder, and 20 to 28 are registers.

FIG. 5 is an explanatory diagram of the memory section, and in particular, FIG. 5(A) shows an example of a state transition table stored in the memory section 6.
FIG. 3B shows an example of a table of the number of transitions stored in the memory unit 7. In addition, the state transition table is as shown in FIG. 5(A).
(k) inputs (input alphabets).

The transition number determination unit 2 learns the number of states n and the number of inputs k from the state transition table in the memory unit 6, and stores these in the registers 20 and 21.

The address control unit 14 stores in the memory unit 7 a table of the number of transitions, sets the binary states B1 to n as X and Y addresses based on the number of states n, and assigns “0” to each address as the number of transitions (initial value).
Create a file with .

Further, the address control unit 14 generates a two-dimensional (X and Y) address for reading the contents of the state transition table from the memory unit 6. This address generation is sequentially incremented in the X and Y directions to read out the entire contents of the state transition table.

Now, the address control unit 14 inputs the alphabet "1j" as an "l+Y" address as an X address (hereinafter such an address will be referred to as (X, Y)" (at.

Suppose that j) occurs. Address com and j are stored in registers 22 and 23. The read control unit 15 accesses the state transition table in the memory unit 6 according to the contents of the registers 22 and 23.

The contents of the address (at, j) are read out. This contents indicate the state to which the next transition is to be made when input alphabet aI is input to state Ij, and in this case, it is state m. The read contents (state am) are stored in the register 24.

Next, the address control section 16 accesses the memory section 7 using the contents of the registers 23 and 24.

State M(j) used to access the state transition table of memory unit 6
The read state [(m) is used to generate a two-dimensional address in the memory section 7. The address control unit 16 is
From two states (X, Y) = (m, j) and (j, m)
sequentially generate two addresses of registers 25 and 26.
Store in.

That is, first, the state in as the X address and the state j as the Y address are stored in the registers 25 and 26. The read control unit 17 accesses the transition number table in the memory unit 7 based on this.

Read the content So of address (m,j). This content So
indicates the number of transitions between states m and j, and in this case is set to the initial value rOJ. The successively outputted contents So are stored in the register 27. In response to this, the adder 19 adds the contents of the register 27 (So) to the register 2.
Add the content “1” of 8. The write control unit 18 that receives this addition result (So+1) writes the addition result to the original address (m, J) that is the contents of the registers 25 and 26.

Next, registers 25 and 26 contain the state as the X address! aj and state m as Y address are stored. After this, in the same way as above, the contents S of the address (j, m),
(in this case, the initial value "0") is read out, and S++1
and is rewritten to the same address.

By repeating the above steps, a table of the number of transitions is created.

Next, the determination of one display position will be explained using FIGS. 6 and 7.

FIG. 6 shows the display position determination flow.

FIG. 7 is an explanatory diagram of the display position, in particular, FIG. 7(A) shows the display position on the screen, and FIG. 7(B) shows an example of the layout table stored in the memory section 8. .

■ Mainly based on the size of the display screen 130.

The coordinates (C,,C,) of the center 0 of the circle on the screen and the radius R are determined. At this time, the X and Y coordinates are.

For example, it is determined as shown in FIG. 7(A).

(2) Next, in order to display the states at equal intervals on the circumference according to the number of states n, calculate Rad-2π/n.

Let it be j-0.

■ Using Rad and l, calculate S and C according to the given formula.
seek.

■ Center coordinates of the circle (C-, Cy), radius R2 above S
and C, the coordinates (Xt.1.Yt++) of one point on the circumference of the circle are determined according to a predetermined formula.

For example, when l-0, s=Q and c=l, so
(XI, y+) −(C,,C,−R).

(2) Next, after setting it to i-t+t, the above processes (2) and (2) are repeated as long as i is smaller than n, and when 1 becomes greater than or equal to n, the process is terminated. Due to this.

The coordinates of n points arranged at equal intervals on the circumference of the circle (
X,,Yl) or X,,Y,) is found.

The display position determining unit 4 performs the above processing as well as.

The coordinates obtained in process (2) are sequentially stored in the memory unit 8.

Then, an area is provided to store the state corresponding to each coordinate, and the layout table shown in FIG. 7(B) is created.

In this embodiment, as shown in FIG. 7(A).

n loci 41 (x+, y, ) or X,,Y
, ) are used to draw small circles around each of them. This small circle is used as an area 131 for showing the state shown in FIG. 3 on the screen. The size of this small circle is determined by the display information section 9, for example.

Next, the determination of the state arrangement will be explained using FIG. 8.

FIG. 8 shows a state arrangement determination flow. ■ The state arrangement determination unit 3 determines n
When the flag is rQJ, all flag areas are secured and all flags are set to "0" (cleared).

This indicates that the layout of the state corresponding to the flag has not yet been determined, that is, the coordinates have not been input into the layout table of the memory unit 8 in correspondence with the coordinates.

(2) The state allocation determining unit 3 calculates the total number of transitions Si for each state using the transition number table in the memory unit 7, and stores it in an appropriate storage area (for example, as shown in FIG. hold within).

After this, the state arrangement determination unit 3 determines the total number of flags and transitions S
A table of the number of transitions in the memory section 7 using i, etc. (Fig. 5 (B))
Access and perform the following processing.

(2) The state a whose corresponding flag is rOJ (since this is the initial state, select the state (for example, state aa) in which the total number of transitions Si is the largest among all states (for example, state aa).

■ Assign state a to initial position (x+, Yl). That is, the coordinates (XI, Yl
) is input in association with state a. In response, flag a corresponding to state aa is set to rlJ. When the flag is "1", it indicates that the placement of the corresponding state has been completed.

(2) Select the state with the largest and second largest number of transitions to state Ba from among the states whose corresponding flag is rOJ. For this purpose, a table of the number of transitions in the memory section 7 is created at the address (
Access is performed as X, Y)=(YJ, a) (where j-1 to n). That is, fix the Y address to shape Ba,
Change the X address in order from state 1 to state n, read the contents (i.e. the number of transitions between state a and each state), and then access the state corresponding to the maximum and second largest number of transitions. (For example, state and form 1111c)
Select each.

■ Conditions Bb and C are respectively located at the clockwise neighboring position (Xi, Y*) and the counterclockwise neighboring position (X, ,Y) of state a.
, ). Depending on this.

Flag b and flag C are set to "l".

■ It is determined whether all flags are "1" or not. When all flags are "1", it is assumed that all state assignments have been completed and the process ends.

(2) Select the state with the maximum number of transitions between states from among the states whose corresponding flags are "0".

For this purpose, similarly to the above, a table of the number of transitions in the memory section 7 is created using address (X, Y) = (XJ, b) (where j =
1 to n) and read its contents, and then state B (for example, state Bw) corresponding to the maximum number of transitions.
Select.

(2) If state 6b has no transition relationship with any state other than state a, any one of the states with zero transitions is selected (as state Bb'). In such a case, it is prohibited to assign state Bv to a position adjacent to state Bv.

A table of the number of transitions in the memory section 7 is stored at address (X.

Y) - (t/, b>) and read its contents (ie, the number of transitions between state IILib and d).

When the read content is O, the following processing is 0 due to the above reason.
Prohibits assignment of state Lid by omitting .

Process 0 is also omitted because at least one state Li(t/) remains unallocated.

(2) When the read content is not O, the shape Bb' is assigned to the position (Xs, Ys) next to the shape Bb in the clockwise direction. The flag d is set to "1".

■ Processing The same process as ■ is performed.

0-state LiC was subjected to the same process as process (2).

The state with the maximum number of transitions between state aC (for example, state d
).

For the relationship between states Bc and d, the same process as in process (2) is performed for the same reason, and the value of the number of transitions between states C and d is found.

When this value is 0, the following process [phase] is omitted.

[Phase] When the value is not O, state C' is assigned to the counterclockwise adjacent position (Xfi'-+, Y-+) of state MC. The flag d is set to "1".

(2) Processes (1) through (2) are repeated for states it/and d, so the processing targets are d and d.

[Phase] Perform processing ■ and ◎ again (store the previous processing results and refer to them again).

When either of the transition numbers read by processes ■ and ■ is not 0, either state d or C' is assigned, so the process ■ or ■ or ■ or [
phase] is performed.

When the number of transitions read by processes ■ and ■ are both O,
Processing (2) and subsequent steps are repeated for states that have no transition relationship with states S and C.

■ Processing Perform the same process as ■.

If the state of the flag "0" remains, the process (2) and subsequent steps are repeated for that state. States d and d are also left as targets.

With the above steps, the determination of the state arrangement is completed.

As understood from the process [phase], if there is no transition relationship between the unplaced state and the two most recently placed states, the number of transitions is calculated from among the unplaced states. The one with the largest Si is selected. Then, this state is placed at both ends or the center of the remaining placement positions. After this, processing ① and subsequent steps are performed.

The arrow adding section 10 adds arrows between each state.

Add inputs to this to complete the state transition diagram.

Note that if a certain state has an arrow that returns to itself due to a certain input, the number of transitions due to this arrow may not be included when calculating from the total number of transitions Si, and the arrow is displayed outside the circle with radius R. Ru.

〔Effect of the invention〕

As described above, according to the present invention, there is provided a state transition diagram display processing method that graphs and displays relationships between states based on a state transition table (or function).

By calculating and using the number of transitions, states with a large number of transitions are adjacent to each other and states with a small number of transitions are not adjacent, making the state transitions easier to see by reducing the intersection of state transition arrows. Diagrams can be obtained, and the efficiency of designing and analyzing programs and sequential circuits can be improved.

[Brief explanation of the drawing]

FIG. 1 is a diagram showing the principle configuration of the present invention. FIG. 2 is a diagram showing a table of transition numbers. FIG. 3 is an explanatory diagram of the operation of the present invention. FIG. 4 is an explanatory diagram of the embodiment. FIG. 5 is an explanatory diagram of the memory section. FIG. 6 is a diagram showing a display position determination flow. FIG. 7 is an explanatory diagram of the display position. FIG. 8 is a diagram showing a flow of determining the placement position. FIG. 9 is a diagram showing a state transition table. FIG. 10 is an explanatory diagram of the prior art. 1 is a processing device including a central processing unit and memory. 2 is a transition number determining section, 3 is a state arrangement determining section, 4 is a display position determining section, 5 is a state number counting section, 6 to 8 is a memory section 29 is a display information section, IO is an arrow adding section, and 11 is a display control section. 12 is a graphic library, and 13 is a display device. Patent applicant Juzo Iizuka, director of the Agency of Industrial Science and Technology Flow Figure 6 Input Letter 1 Table of Contents Figure 9 Figure 10

Claims (1)

[Claims] A transition number determining unit (2) that determines the number of transitions for each state.
), a display position determining unit (4) that determines a display position on the circumference according to the number of states, and a state layout determining unit (3) that determines a position of the display position by making the state correspond to the display position. ), wherein the state arrangement determining unit (3) determines the arrangement position based on the number of transitions.