JPH11134180A - State transition drawing conversion device - Google Patents

Abstract

PROBLEM TO BE SOLVED: To automatically generate a state transition drawing without overlapped transition information from plural message sequence drawings. SOLUTION: A message sequence drawing storage part A1 stores all message sequence drawings being the objects of conversion. A process designation means A2 designates the object of conversion on the message sequence drawing. A state transition information conversion means A3 extracts event sequences on all the message sequence drawings of a process designated by the process designation means A2, converts them into state transition information and stores them in a state transition drawing storage part A4. A state transition information reduction means A5 deletes overlapped transition information in state transition information stored in the state transition drawing storage part A4 and reduces state transition information.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a state transition diagram conversion device, and more particularly to a state transition diagram conversion device for generating a state transition diagram in which state transition information (information of a state transition diagram) is reduced from a plurality of message sequence diagrams.

[0002]

2. Description of the Related Art Conventionally, this type of state transition diagram conversion apparatus is:
It is used for automatically reducing the state transition information by eliminating the troublesomeness of manually reducing the state transition information.
An example of a conventional state transition diagram conversion apparatus is disclosed in Japanese Unexamined Patent Publication No. 5-627.
No. 2 discloses this. The state transition diagram conversion device described in this publication discloses transition information (information of transition (column) from a node (including a state) to another node) on a state transition diagram.
This device automatically deletes duplicates. Mainly, in a state transition diagram having overlapping transition information, an equivalent state determination unit that corresponds to a part that determines the equivalence of state transition information,
A transition information reduction unit that deletes transition information of a state determined to be equivalent when an equivalent part exists, and replaces the label of the state with a label of an equivalent state. The equivalent state determination unit sequentially compares transition information in each state to detect an equivalent state. Specifically, first, a transition information group of a certain state is sequentially compared with a transition information group of another state, and a determination is made based on whether or not another state having the same transition information group as the first state exists. ing.

[0003]

A first problem is that in the prior art, there is a case where it is not possible to delete duplicated transition information in the process of reducing the state transition information. The reason is that the label of the state is considered in determining the equivalence of the transition information. When the transition information from each state is the same, which state label is changed, the equivalence of the transition information changes depending on the state label when the equivalence of the transition information of another state is determined later. Because it will come. Note that the state transition diagram conversion device of the present invention merges transition information regardless of the label of the state, so that the equivalence of the transition information does not change.

[0004] The second problem is that the conventional technology cannot automatically convert a plurality of message sequence diagrams into a state transition diagram in which state transition information is reduced. The reason is that conversion processing from a plurality of message sequence diagrams to a state transition diagram in which the state transition information is reduced is not handled (conventionally, it is manually performed).

An object of the present invention is to provide a state transition diagram conversion apparatus capable of generating a state transition diagram without duplicate transition information from a plurality of message sequence diagrams.

[0006]

According to the present invention, there is provided a state transition diagram conversion apparatus for generating a state transition diagram from a message sequence diagram, wherein the state transition diagram converts a plurality of message sequence diagrams into state transition information. It is characterized by including an information conversion unit and a state transition information reduction unit that reduces the state transition information by deleting overlapping transition information in the state transition information converted by the state transition information conversion unit. In particular, the state transition information reducing unit includes a dependency determination process for determining whether there is overlapping transition information, and a node merging process for merging the overlapping transition information.

A state transition diagram conversion device according to the present invention includes a message sequence diagram storage unit for storing a message sequence diagram, a message sequence diagram input from the message sequence diagram storage unit, and an event sequence on the message sequence diagram. A state transition information conversion unit that extracts and converts the state transition information into state transition information, a state transition diagram storage unit that stores the state transition information converted by the state transition information conversion unit, and a state transition diagram storage unit that stores the state transition information. A state transition information reducing unit that reduces the state transition information by deleting the duplicated transition information in the state transition information.

Further, the state transition diagram conversion device of the present invention
A message sequence diagram storage unit for storing all message sequence diagrams to be converted, a process designating unit for specifying a process to be converted on the message sequence diagram, and a message stored in the message sequence diagram storage unit State transition information conversion means for extracting an event sequence on all the message sequence diagrams of the process specified by the process specification means from the sequence diagram and converting the sequence into state transition information, and a state converted by the state transition information conversion means A state transition diagram storage unit that stores the transition information, and a state transition information reduction unit that reduces the state transition information by deleting overlapping transition information in the state transition information stored in the state transition diagram storage unit. It is characterized by having.

On the other hand, the recording medium of the present invention is a computer-readable recording medium that converts a plurality of message sequence diagrams into state transition information and state transition information converted by the state transition information conversion means. A program for recording a program for functioning as state transition information reducing means for deleting the transition information and reducing the state transition information.

In the recording medium of the present invention, a computer is provided with a message sequence diagram storage unit for storing a message sequence diagram, a message sequence diagram input from the message sequence diagram storage unit, and an event sequence on all the message sequence diagrams. A state transition information conversion unit that extracts and converts the state transition information into state transition information, a state transition diagram storage unit that stores the state transition information converted by the state transition information conversion unit, and a state transition diagram storage unit that stores the state transition information. A program for recording a program for functioning as state transition information reducing means for deleting the duplicated transition information in the state transition information and reducing the state transition information is recorded.

Further, the recording medium of the present invention is a computer which stores a message sequence diagram storing section for storing all the message sequence diagrams to be converted, and a process specification for designating a process to be converted on the message sequence diagram. Means for extracting, from the message sequence diagram stored in the message sequence diagram storage unit, an event sequence on all the message sequence diagrams of the process designated by the process designating means and converting the sequence into state transition information; A state transition diagram storage unit for storing the state transition information converted by the state transition information conversion unit, and deleting the duplicated transition information in the state transition information stored in the state transition diagram storage unit. A program for functioning as state transition information reduction means for reducing state transition information The record.

A first feature of the present invention is that in order to merge overlapping transition information on a state transition diagram, it is necessary to determine whether there is overlapping transition information from a state instead of a state transition. Is performed for the transition sequence of. More specifically, a state transition information reduction unit (see FIG. 1) that includes a dependency determination process for determining whether there is duplicated transition information and a node merge process for merging the duplicated transition information. A5).

A second feature of the present invention is that, in order to convert the state transition information from the message sequence diagram into a reduced state transition diagram, the message sequence diagram is converted into the state transition information as it is and stored. is there. More specifically, state transition information conversion means (A3 in FIG. 1) for converting a message sequence diagram of a process designated by the process designation means (A2 in FIG. 1) from a plurality of message sequence diagrams into state transition information; It has a state transition diagram storage unit (A4 in FIG. 1) that stores the state transition information when converted, and also stores a state transition diagram in which the state transition information is reduced.

The state transition information conversion means converts the message sequence diagram of the process specified by the process specification means into state transition information. The state transition diagram storage unit stores state transition information converted from the message sequence diagram,
The state transition diagram after the reduction process is also stored. The state transition information reducing means determines whether or not there is any overlapping transition information in the stored state transition information for the transition sequence from the state. If there is any overlapping transition information, the transition information Merge.

[0015]

Embodiments of the present invention will be described below in detail with reference to the drawings.

FIG. 1 is a block diagram showing a configuration of a state transition diagram conversion device according to a first embodiment of the present invention. The state transition diagram conversion apparatus according to the present embodiment specifies a message sequence diagram storage unit Al that stores a plurality of message sequence diagrams, and specifies which process message sequence diagram is to be converted into a state transition diagram during conversion. A process designating unit A2, a state transition information converting unit A3 for converting a message sequence diagram of a designated process into state transition information, a state transition diagram storage unit A4 for storing the converted state transition information, and the state transition information And a state transition information reducing unit A5 that determines whether there is duplicated transition information, and if so, merges the transition information to reduce the state transition information.

The message sequence diagram storage unit Al stores all message sequence diagrams to be converted.

The process specifying means A2 specifies a process to be converted on the message sequence diagram.

The state transition information conversion means A3 receives the message sequence diagram as input, extracts an event sequence on all the message sequence diagrams of the process specified by the process specification means A2, and converts it into state transition information. The converted state transition information is stored in the state transition diagram storage unit A4.

The state transition diagram storage unit A4 stores state transition information converted from the message sequence diagram and not subjected to reduction processing.

The state transition information reducing means A5 determines whether there is any duplicated transition information in the converted state transition information, and if so, deletes the transition information and reduces the state transition information. The state transition diagram obtained by reducing the state transition information is stored in the state transition diagram storage unit A4.

FIGS. 2A and 2B show the data structure of the message sequence diagram stored in the message sequence diagram storage unit Al and the data structure of the state transition diagram stored in the state transition diagram storage unit A4. FIG.

Referring to FIG. 2A, the data structure of the message sequence diagram includes an mscid representing an identifier of the message sequence diagram, an entity name representing a process of the message sequence diagram, a type and a name of a symbol of the message sequence diagram. Ty representing
e representing a process indicating a message exchange destination as one information of pe · name and signal symbol
consists of an entity name. Referring to FIG. 2B, the data structure of the state transition diagram includes a set of nodes and a set of arcs.
A set of arcs is composed of an id representing an identifier of e, a type representing a type, and a name representing a name, and an id representing an identifier of the arc, a connection source node id, and a connection destination nodoid. The state transition information conversion means A3
The message sequence diagram is converted into state transition information based on this information structure.

FIG. 3 is a flowchart showing an outline of the processing procedure of the state transition information conversion means A3. Referring to FIG. 3, the processing procedure of the state transition information converting means A3 includes a symbol set extracting step B1, a first symbol extracting step B2, a name and type adding step B3 to node information, a node type input event determining step. B4 and state determination step B5 immediately before the input event
A step B6 for judging the presence of the immediately preceding node, a step B7 for adding a temporary name and type to the node information, a step B8 for connecting the node, a step B9 for connecting the node, a step B10 for storing the immediately preceding node, and a step B11 for determining the presence or absence of the next symbol. , Last state determination step B12, state node addition / connection step B13, and event sequence presence / absence determination step B14.

FIG. 4 is a flowchart showing a processing procedure of the state transition information reducing means A5. The processing procedure of the state transition information reducing unit A5 is performed in a direction opposite to the transition (backward).
d) and the transition in the same direction (forward) as the transition.
(rd direction) and the reduction process C2.

FIG. 5 is a flowchart showing a more detailed processing procedure of the reduction process C1 in the backward direction by the state transition information reduction means A5. Referring to FIG.
The procedure of the reduction process C1 in the backward direction by the state transition information reduction means A5 includes a node set acquisition step D1, a first node setting step D2, a next node presence / absence determination step D3, a first node setting step D4,
Next node presence / absence determination step D5, backward direction dependency determination processing D6, Next node setting step D7
, A result determination step D8, a backward direction node merge process D9, and a next node setting step D10.

FIG. 6 is a flowchart showing a more detailed processing procedure of the forward direction reduction processing C2 by the state transition information reduction means A5. Referring to FIG. 6, the processing procedure of the forward direction reduction processing C2 by the state transition information reduction unit A5 includes a node set acquisition step E1.
A first node setting step E2, a next node presence / absence determination step E3, a first node setup step E4, a next node presence / absence determination step E5, a forward direction dependency relationship determination processing E6, a next node setup step E7, and a result determination It comprises step E8, forward node merge processing E9, and next node setting step E10.

FIG. 7 is a flowchart showing a more detailed processing procedure of the forward direction dependency determination processing E6 in FIG. The dependency relationship indicates a relationship between nodes, and when all transition sequences from the node are included in a transition sequence from another node, the node is said to be subordinate to another node. Referring to FIG.
The processing procedure of the d-direction dependency relationship determination processing E6 includes a two-node extraction step F1 and a node identity determination step F2.
, Node type extraction step F3, true return step F4, type identity determination step F5, state type determination step F6, false return step F7, name identity determination step F8, false return step F9, arc count It comprises an extraction step F10, an arc output determination step F11, a state type determination step F12, an arc output determination step F13, an arc determination process F14, a false return step F15, and a true return step F16.

FIG. 8 is a flowchart showing a more detailed processing procedure of the arc determination processing F14 in FIG. FIG.
, The processing procedure of the arc determination processing F14 includes an arc set extraction step G1, a flag false setting step G2, a first arc setting step G3, a first arc setting step G4, and a node extraction step G5.
, A node extraction step G6, a node identity determination step G7, and a forward direction dependency determination processing G
8, a flag true setting step G9, a result determination step G10, a flag true setting step G11, and a flag
g false setting step G12, next arc presence / absence determination step G13, next arc setting step G14, flag false determination step G15, next arc presence / absence determination step G1
6, a next arc setting step G17, a flag false determination step G18, a true return step G19, and a false return step G20.

FIG. 9 is a flowchart showing a more detailed processing procedure of the node merge processing D9 and E9 in FIGS. 5 and 6. Referring to FIG. 9, the processing procedure of the node merging processes D9 and E9 includes a node extracting step H1, an arc set extracting step H2, an arc merging process H3 coming into the node, and a merging arc coming out of the node. Processing H4 and node erasing step H
5

FIG. 10 is a flowchart showing a more detailed processing procedure of the merging process H3 of the arc entering the node in FIG. Referring to FIG. 10, the processing procedure of the merging process H3 of the arc entering the node includes an incoming node presence / absence determination step I1, a first arc setting step I2, a first arc setting step I3, and a flag.
True initial setting step I4, connection source node identity determination step I5, flag false setting step I6, next arc presence / absence determination step I7, next arc setting step I8
, A flag determination step I9, an arc connection step I10, an arc elimination step I11, a next arc presence / absence determination step I12, and a next arc setting step I13.

FIG. 11 is a flowchart showing a more detailed processing procedure of the merging process H4 of the arc coming out of the node in FIG. Referring to FIG. 11, the processing procedure of the merging process H4 of the arcs coming out of the nodes includes the outgoing node existence determining step J1, the first arc setting step J2, the first arc setting step J3, and the flag true initial setting step. J4, a connection destination node identity determination step J5, a flag false determination step J6, a next arc presence / absence determination step J7, a next arc setting step J8,
Flag determination step J9 and arc connection step J1
0, an arc elimination step J11, a next arc presence / absence determination step J12, and a next arc setting step J13.

Next, the operation of the state transition diagram converting apparatus according to the first embodiment thus configured will be described in detail with reference to FIGS.

First, the state transition information conversion means A3 is provided with the process designation means A2 on the message sequence diagram given as an input from the message sequence diagram storage section A1.
A set of symbols of the process specified by is extracted (step Bl).

Next, the state transition information conversion means A3 extracts the first symbol from the set of symbols for conversion into a state transition diagram (step B2).

Subsequently, the state transition information conversion means A3 extracts the name and type from the symbol and adds them as the names and types of the nodes in the state transition diagram (step B3).

Next, the state transition information conversion means A3 checks whether the type of the node is an input event (step B4), and if it is an input event, determines whether the node immediately before the input event is in a state. Check (Step B
5). If the node immediately before the input event is not in the state,
The state transition information conversion means A3 adds a new state node immediately before the input event, adds a name and a type to the node information (step B7), connects the immediately preceding node to the state node, and Is connected to the input event node (step B8), and the control shifts to step B10. If the node immediately before the input event is in the state at step B5, the state transition information conversion means A3 connects the immediately preceding node to the state node, connects the state node to the input event node (step B8), and B10
Transfer control to.

If the type of the node is not an input event at step B4, the state transition information conversion means A3 checks whether or not there is a node immediately before (step B6). Connect to the state node (step B9), and transfer control to step B10.
If not, control is transferred to step B10.

In step B10, the state transition information conversion means A3 stores the converted node as the immediately preceding node.

Next, the state transition information conversion means A3 checks whether or not the next symbol is present in the set of symbols (step B11). If so, the control returns to step B2; otherwise, the control returns to step B12. Move.

In step B12, the state transition information conversion means A3 checks whether or not the last symbol in the message sequence diagram is a state, and if not, adds a new state node at the end and connects to the immediately preceding node. And add a name and a type to the node (step B1).
3) Transfer control to step B14. If the state is the state, the state transition information conversion means A3 shifts the control to step B14 without doing anything.

At step B14, the state transition information conversion means A3 checks whether or not there is another event sequence in the same process, and if so, returns the control to step B1, otherwise ends the process.

Next, the state transition information reducing means A5 sets ba
The ckward direction reduction processing C1 and the forward direction reduction processing C2 are performed, and it is determined whether or not there is overlapping transition information in the converted state transition information.
The transition information is deleted to reduce the state transition information. The state transition diagram in which the state transition information is reduced is represented by a state transition diagram storage unit A
4 is stored.

More specifically, the state transition information reducing means A5
First, in the backward direction reduction process C1, a set of nodes of the state transition diagram before the reduction of the designated process is extracted from the state transition diagram storage unit A4 (step D1).

Next, the state transition information reducing means A5 extracts one first node (node) from the set of nodes (step D2) and checks whether there is a next node (step D3). If there are no more nodes to be taken out, the state transition information reducing means A5 ends the processing, otherwise, it takes out one first node (node2) from the set of nodes (step D4).

Next, the state transition information reducing means A5 determines whether there is a next node 2 (step D5).
When there is no more node2 to be taken out, the state transition information reducing means A5 takes out the next node (Step D7) and returns the control to Step D3. Otherwise, the state transition information reducing means A5 calls the backward direction dependency determination processing D6, and shifts the control to step D8.

In step D8, as a result of the determination in the backward direction dependency determination processing D6,
2, the state transition information reducing means A5
Invokes the backward direction node merge process D9, and shifts the control to step D10. Otherwise, shifts the control to step D10 without doing anything. And
The state transition information reducing means A5 takes out the next node2 and returns the control to step D5 (step D10).

Next, the state transition information reducing means A5 outputs the fo
In the backward direction reduction process C2, a set of nodes of the state transition diagram before the reduction of the designated process is extracted from the state transition diagram storage unit A4 (step El).

Subsequently, the state transition information reducing means A5 extracts one first node (node) from the set of nodes (step E2), and checks whether there is a next node (step E3). If there are no more nodes to be taken out, the state transition information reducing means A5 ends the process, otherwise, takes out one first node (node2) from the set of nodes (step E4).

Next, the state transition information reducing means A5 determines whether there is a next node 2 (step E5).
When there is no more node2 to be taken out, the state transition information reducing means A5 takes out the next node (step E7) and returns the control to step E3. Otherwise, the state transition information reducing unit A5 calls forward direction dependency determination processing E6, and shifts the control to step E8.

In step E8, as a result of the determination in the forward direction dependency relationship determination processing E6, node is node2.
If the state transition information reduction means A5 is dependent on
The forward direction node merge processing E9 is called, and the control is moved to the step E10. Otherwise, nothing is performed and the control is moved to the step E10. Then, the state transition information reducing means A5 takes out the next node2 and returns the control to step E5 (step E10).

Forward direction dependency determination processing E6
Then, the state transition information reducing means A5 first extracts two nodes given as arguments (step F5).
1) If the two nodes are the same (step F
2) Return true (step F4) and end the process.
If they are not the same, the state transition information reducing means A5 extracts the types of the two nodes (step F3) and checks whether the types of the two nodes are the same (step F3).
5) If not identical, return false (step F7),
The process ends. If the types are the same (step F5
Yes), the state transition information reducing means A5 performs step F
Transfer control to 6.

In step F6, the state transition information reducing means A5 determines whether the type of the node is the state. If the type of the node is not the state, it checks whether the names are the same (step F8). If not, it returns false (step F9) and ends the process. If the names are the same, the state transition information reducing means A5 proceeds to step F10
Transfer control to. If the type of the node is the state in step F6, the state transition information reducing means A5 shifts the control to step F10 without checking the name.

In step F10, the state transition information reducing means A5 extracts the value of the number of arcs going out of the node (step F10) and checks whether or not arcs are coming out of both of the two nodes (step F11). ).
If an arc is coming out of both nodes,
The state transition information reducing means A5 calls the arc determination processing F14 (step F14). If not, the state transition information reducing means A5 checks whether the node type is the state (step F12), and returns true if the node type is not the state (step F16), and terminates the processing. I do. If the type of the node is the state, the state transition information reducing means A5 checks whether or not an arc has been emitted from either node (step F13), and if no arc has been emitted from either node, true. Is returned (step F16), and the processing is terminated.
If false is returned (step F15), the process ends.

In the backward direction dependency determination processing D6, the forward direction dependency determination processing E is also performed.
The same processing as in step 6 is performed.

In the arc determination process F14, the state transition information reducing means A5 first extracts a set of arcs coming out of two nodes (step G1). Next, the state transition information reducing means A5 sets the initial value of the flag for storing whether the flag is true or false to false (step G2).

Next, the state transition information reducing means A5 calculates the first arc (a) from the set of arcs coming out of the two nodes.
rc1 and arc2) are taken out one by one (steps G3 and G4).

Further, the state transition information reducing means A5 has two
The nodes (node1 and node2) connected to arc1 and arc2 are extracted one by one from one arc set (steps G5 and G6).

Next, the state transition information reducing means A5 checks whether or not the nodes into which the two extracted arcs enter are the same (step G7).
Substitute true for g (step G9) and transfer control to step G13.

In step G7, if the nodes to which the two arcs enter are not the same, the state transition information reducing means A5
Is a forward direction dependency determination process G8 (for
(similar to the ward direction dependency relationship determination process E6) to perform a recursive process.

Forward direction dependency determination processing G8
(Step G10), if they are dependent, the state transition information reducing means A5 substitutes true for flag (step G11), and if not, substitutes false for flag (step G12). Then, control is transferred to step G13.

At step G13, the state transition information reducing means A5 checks whether there is the next arc2, and if there is any arc2 to be taken out, takes out the next arc2 (step G14) and returns the control to step G5. If there is no arc2 to be taken out, the state transition information reducing means A5
Checks the value of flag (step G15). If false, returns false (step G20) and ends the process.

If the value of flag is not false in step G15, the state transition information reducing means A5 checks whether there is the next arcl (step G16), and takes out the arc.
If l is still present, the next arcl is taken out (step G17), and the control returns to step G4. Arc to take out
If there is no l, the state transition information reducing means A5 outputs the flag
Is checked (step G18). If false, false is returned (step G20); otherwise, true is returned (step G19), and the process ends.

In the node merge process D9 in the backward direction, the state transition information reducing means A5 first extracts a node to be merged and a node to be merged (step H1). Next, the state transition information reducing unit A5 extracts a set of arcs connected to the two nodes (step H2). Then, the state transition information reducing means A5 calls the merging process H3 of the arc coming into the node, calls the merging process H4 of the arc going out of the next node, and removes the node to be merged last (step H
5), end the processing.

In the forward direction node merge process E9, the same process as the backward direction node merge process D9 is performed.

Merging of arcs entering a node H
In 3, the state transition information reducing means A5 first checks whether there is an arc entering the node to be merged (step I1), and if not, terminates the process, and if there is, enters the node to be merged. One first arc (arcl) is extracted from the arc set (step I2). Next, the state transition information reducing means A5 extracts one first arc (arc2) from the set of arcs entering the node to be merged (step I3). Further, the state transition information reducing means A5 sets an initial value TRUE of a flag for storing whether to replace or remove the arc (step I4).

Next, the state transition information reducing means A5 checks whether or not the arcs that are the connection sources of the two arcs are the same (step I5).
SE is substituted (step I6), and control is transferred to step I9. If they are not the same, the state transition information reducing means A5
Check if there is arc2 to be taken out (step I
7) If there is, fetch the next arc2 (step I)
8) Return control to step I5. If there is no arc2 to be taken out, the state transition information reducing means A5 proceeds to step I9
Transfer control to.

In step I9, the state transition information reducing means A5 checks the flag, and if TRUE, arc
An arc is connected to the node to be merged with the connection source node of No. 1 (step I10), arc1 connected to the merged node is removed (step I11), and FALS
If E, arc1 is removed as it is (step I
11). Next, the state transition information reducing means A5 checks whether there is an arc1 to be taken out (step I12), and if so, takes out the next next arc1 (step I1).
3) Return control to step I3. If there is no arc1 to be extracted in step I12, the state transition information reducing means A5
Ends the processing.

Merge process H for arcs exiting from nodes
In step 4, the state transition information reducing unit A5 first checks whether there is an outgoing arc at the node to be merged (step J1), and if not, ends the processing, and if so, exits from the merged node. One first arc (arcl) is extracted from the arc set (step J2). next,
The state transition information reducing unit A5 extracts one first arc (arc2) from the set of arcs coming out of the node to be merged (step J3). Further, the state transition information reducing means A5 sets an initial value TRUE of the flag for storing whether to replace or remove the arc (step J).
4).

Next, the state transition information reducing means A5 checks whether or not the arcs that are the connection sources of the two arcs are the same (step J5).
SE is substituted (step J6), and control is transferred to step J9. If they are not the same, the state transition information reducing means A5
Check if there is arc2 to be taken out (Step J
7) If there is, take out the next arc2 (step J)
8) Return control to step I5. If there is no arc2 to be taken out, the state transition information reducing means A5 proceeds to step J9
Transfer control to.

At step J9, the state transition information reducing means A5 checks the flag, and if TRUE, sets arc
An arc is connected to the node to be merged with the connection source node 1 (step J10), and arc1 connected to the node to be merged is removed (step J11), and FALS
If E, arc1 is removed as it is (step J
11). Next, the state transition information reducing unit A5 checks whether there is an arc1 to be extracted (step J12), and if so, extracts the next arc1 next (step J1).
3) Return control to step J3. If there is no arc1 to be extracted in step J12, the state transition information reducing means A5
Ends the processing.

As described above, a state transition diagram in which the state transition information is reduced from a plurality of message sequence diagrams is generated.

Next, a second embodiment of the present invention will be described in detail with reference to the drawings.

Referring to FIG. 22, according to a second embodiment of the present invention, an input device 1 such as a keyboard and a mouse, a data processing device 2, a storage device 3, and an output device 4 such as a display and a printer are provided. And a recording medium 5 on which a state transition diagram conversion program is recorded. The recording medium 5
It may be a magnetic disk, a semiconductor memory, or another recording medium.

The state transition diagram conversion program is stored in the storage medium 5
To the data processing device 2, and controls the operation of the data processing device 2 as a process designating unit A2, a state transition information converting unit A3, and a state transition information reducing unit A5, and stores the message sequence diagram storage unit A1 and the state in the storage unit 3. A transition diagram storage unit A4 is created. The operation of the data processing device 2 under the control of the state transition diagram conversion program is exactly the same as that in the first embodiment, and therefore a detailed description thereof will be omitted.

[0076]

Next, an embodiment of the state transition diagram conversion apparatus according to the first embodiment will be described in detail with reference to the drawings.

FIGS. 12 to 14 show message sequence diagrams, respectively.

FIG. 15 shows a state transition diagram before reduction of the state transition information obtained by converting the message sequence diagrams of FIGS. 12 to 14.

FIG. 16 and FIG.
A state transition diagram in which the transition sequence is merged in the direction and a state transition diagram in which one transition sequence is merged in the forward direction are shown.

FIG. 18 is a state transition diagram after reduction of the state transition information.

FIG. 19 shows the data structure of the message sequence diagrams of FIGS.

FIG. 20 shows the data structure of the state transition diagram before reduction of the state transition information converted from the message sequence diagram.

FIG. 21 shows a data structure of a state transition diagram after reduction of the state transition information.

Referring to FIG. 12 to FIG. 21, in the message sequence diagram to be input (FIG. 12 to FIG. 14),
Pl and P2 represent processes, and the arrows indicate that an event comes in the direction of the arrow. For example, in FIG. 12, Pl means that the event El has been received as an input event. Conversely, P2 means that the event El is being sent as an output event.

In the data structure of the message sequence diagram in FIG. 19, which summarizes FIGS. 12 to 14, the symbol type state indicates a state, input indicates an input event, and output indicates an output event.

When converting these message sequence diagrams into state transition diagrams by designating them as processes Pl by the process designating means A2, first, in the data structure of the message sequence diagram, the msc id is the first (corresponding to FIG. 12). ) Of the process Pl in the message sequence diagram
When the data of the event sequence from tel to E4 is converted into the data of the node of the state transition diagram, the data structure of the state transition diagram is converted into the nodes of id1 to id9 of the set of nodes in FIG. It is converted into a transition sequence on the left side of the state transition diagram of FIG.

In the state transition diagram of FIG.
Nodes marked with represent an input event node, and nodes marked with S represent state nodes. Also, the state transition is semantically a state immediately before the input event,
If there is no state symbol immediately before the input event symbol in the message sequence diagram, the state node is inserted immediately before the input event node when converted to state transition information.

When the event sequence of the same process (Pl) is similarly converted for the second and subsequent msc ids, the data structure of the state transition diagram becomes nod in FIG.
It is converted into ids 10 to 27 of the set of e, and is converted into the transition sequence on the center and right side of the state transition diagram in FIG.

Next, in the state transition diagram of FIG.
When performing state transition information reduction processing in the ard direction (that is, from the bottom to the top), none of the state nodes having the name “Statel” have arcs in the backward direction, and therefore each node is included in each node. Thus, it is determined that the nodes are in a dependent relationship. First, any two State nodes of the State are merged into one, and the merged state node and the remaining State nodes of the State are merged into one. As shown in the 16 state transition diagram, 1
They are put together.

Next, in the process of reducing the state transition information in the forward direction, focusing on the state nodes State2 and S5 on the state transition diagram of FIG. 16, the transition sequence from S5 (S5, E3, State3) , E4, S6)
Are all transition sequences from State2 (State2, E
3, S2, E4, S3), S5 is Sta
It is determined that they are dependent on te2 (in this case, the reverse is also true). Therefore, S5 is merged into State2 and S5 is deleted.

Further, the same processing is performed for the transition sequence below E3, and all the one transition sequence is merged.
The state transition diagram of FIG. 17 is obtained.

Looking further at the state nodes S2 and S9, a transition sequence from S9 (S9, E4, State4)
Are all included in the transition sequence from S2 (S2, E4, S3), so that it is determined that S9 is dependent on S2, and S9 is merged with S2. The same determination processing and merging processing are performed on nodes such as E4 and State4, and when there is no longer a node that can be subordinated, the reduction processing of the state transition information ends, and the state shown in FIG. Get the transition diagram.

[0093]

The first effect is that a state transition diagram in which duplicate transition information is excluded from a message sequence diagram can be efficiently created. This makes it possible to efficiently design a high-quality state transition program. The reason is that the state transition diagram conversion means for converting the message sequence diagram into the state transition diagram including the overlapping transition information, and the state transition diagram excluding the duplicated transition information from the state transition diagram converted thereby. This is because the state transition information reducing means for converting to state transition can automatically convert the state information into a state transition diagram in which duplicated transition information is eliminated without manual intervention.

[Brief description of the drawings]

FIG. 1 is a block diagram illustrating a configuration of a state transition diagram conversion device according to a first embodiment of the present invention.

2A is a diagram showing a data structure of a message sequence diagram stored in a message sequence diagram storage unit in FIG. 1, and FIG. 2B is stored in a state transition diagram storage unit in FIG. It is a figure showing the data structure of a state transition diagram.

FIG. 3 is a flowchart illustrating an outline of a processing procedure of a state transition information conversion unit in FIG. 1;

FIG. 4 is a flowchart showing an outline of a processing procedure of a state transition information reducing unit in FIG. 1;

FIG. 5 is a flowchart showing a detailed processing procedure of a backward direction reduction process in FIG. 4;

FIG. 6 is a flowchart showing a detailed processing procedure of a forward direction reduction process in FIG. 4;

FIG. 7 is a flowchart illustrating a detailed processing procedure of a forward direction dependency relationship determination process in FIG. 6;

FIG. 8 is a flowchart showing a detailed processing procedure of an arc determination process in FIG. 7;

FIG. 9 is a flowchart illustrating a detailed processing procedure of a node merge process in FIG. 5;

FIG. 10 is a flowchart showing a detailed processing procedure of a merging process of an arc entering a node in FIG. 9;

FIG. 11 is a flowchart showing a detailed processing procedure of a merging process of an arc coming out of a node in FIG. 9;

FIG. 12 is a message sequence diagram used in an example of the state transition diagram conversion device according to the first embodiment.

FIG. 13 is a message sequence diagram used in one example of the state transition diagram conversion device according to the first embodiment.

FIG. 14 is a message sequence diagram used in an example of the state transition diagram conversion device according to the first embodiment.

FIG. 15 is a diagram showing a state transition diagram before reduction of the state transition information obtained by converting the message sequence diagrams of FIGS. 12 to 14;

FIG. 16 is a diagram showing a state transition diagram in a process of reducing the state transition information obtained by converting the message sequence diagrams of FIGS. 12 to 14;

FIG. 17 is a diagram showing a state transition diagram in a process of reducing the state transition information obtained by converting the message sequence diagrams of FIGS. 12 to 14;

FIG. 18 is a diagram illustrating a state transition diagram after the state transition information obtained by converting the message sequence diagrams of FIGS. 12 to 14 is reduced.

FIG. 19 is a diagram illustrating a data structure of the message sequence diagrams of FIGS. 12 to 14;

FIG. 20 is a diagram illustrating a data structure of a state transition diagram before reduction of the state transition information obtained by converting the message sequence diagrams of FIGS. 12 to 14;

FIG. 21 shows a data structure of a state transition diagram after the state transition information obtained by converting the message sequence diagrams of FIGS. 12 to 14 is reduced.

FIG. 22 is a block diagram illustrating a configuration of a state transition diagram conversion device according to a second embodiment of the present invention.

[Brief description of reference numerals]

 DESCRIPTION OF REFERENCE NUMERALS 1 input device 2 data processing device 3 storage device 4 output device 5 recording medium A1 message sequence diagram storage unit A2 process designating unit A3 state transition information conversion unit A4 state transition diagram storage unit A5 state transition information reduction unit

Claims (7)

[Claims] 1. A state transition diagram conversion apparatus for generating a state transition diagram from a message sequence diagram, comprising: a state transition information conversion unit for converting a plurality of message sequence diagrams into state transition information; A state transition information reducing unit that reduces the state transition information by deleting the duplicated transition information in the state transition information. 2. A message sequence diagram storage unit for storing a message sequence diagram, and a state transition for inputting a message sequence diagram from the message sequence diagram storage unit, extracting an event sequence on the message sequence diagram, and converting it into state transition information. Information conversion means, a state transition diagram storage unit for storing the state transition information converted by the state transition information conversion unit, and overlapping transition information in the state transition information stored in the state transition diagram storage unit And a state transition information reducing unit for reducing state transition information by deleting the state transition information. 3. A message sequence diagram storage unit for storing all message sequence diagrams to be converted, a process designating unit for designating a process to be converted on the message sequence diagram, and the message sequence diagram storage unit State transition information converting means for extracting an event sequence on all the message sequence diagrams of the process designated by the process designating means from the message sequence diagram stored in the system and converting the sequence into state transition information; A state transition diagram storage unit that stores the state transition information converted by the above, and a state in which the duplicated transition information in the state transition information stored in the state transition diagram storage unit is deleted to reduce the state transition information A state transition diagram conversion device comprising: a transition information reduction unit. 4. The state transition information reducing unit includes a dependency determination process for determining whether there is duplicated transition information, and a node merge process for merging the duplicated transition information. The state transition diagram conversion device according to 1, 2, or 3. 5. A computer which converts a plurality of message sequence diagrams into state transition information, and deletes duplicated transition information in the state transition information converted by the state transition information conversion means. A recording medium having recorded thereon a program for functioning as state transition information reducing means for reducing state transition information. 6. A computer stores a message sequence diagram storage unit for storing a message sequence diagram, inputs a message sequence diagram from the message sequence diagram storage unit, extracts an event sequence on the message sequence diagram, and converts it into state transition information. State transition information conversion means, a state transition diagram storage unit for storing the state transition information converted by the state transition information conversion unit, and overlapping transitions in the state transition information stored in the state transition diagram storage unit A recording medium having recorded thereon a program for functioning as state transition information reduction means for deleting information and reducing state transition information. 7. A message sequence diagram storage unit for storing all message sequence diagrams to be converted, a process specifying means for specifying a process to be converted on the message sequence diagram, and storing the message sequence diagram. State transition information conversion means for extracting an event sequence on all message sequence diagrams of the process designated by the process designation means from the message sequence diagram stored in the section and converting the sequence into state transition information;
A state transition diagram storage unit that stores the state transition information converted by the state transition information conversion unit, and a state in which the duplicated transition information in the state transition information stored in the state transition diagram storage unit is deleted. A recording medium on which a program for functioning as state transition information reducing means for reducing transition information is recorded.