State transition diagram synthesizer and state transition diagram synthesizing method

Description: TECHNICAL FIELD [Detailed description of the invention]

【0001】

[Technical field to which the invention belongs]

The present invention relates to a state transition diagram synthesizer for synthesizing a state transition diagram created as a life cycle of each object when analyzing and designing a system, and a state transition diagram synthesizing method.

【0002】

[Conventional technology]

For example, in object-oriented design, when analyzing and designing a system, a plurality of event sequence diagrams are described, and then a state transition diagram of each object is created based on the information of the described multiple event sequence diagrams (. See Object-Oriented Methodology OMT (J, Rambo, Toppan), etc.). Conventionally, when one state transition diagram is created for each event sequence in this series of operations, all the state transition diagrams created for a certain object are combined. The work of creating one state transition diagram was done manually by human experience and perception.

【0003】

Also, when synthesizing multiple objects to create one task (program execution unit), each state transition diagram described for each object is combined to create one state transition diagram as a task. The work to create was also done manually by human experience and can.

【0004】

Regarding the method of creating a state transition diagram from an event sequence diagram, there is an "object-oriented analysis support device (Japanese Patent Laid-Open No. 6-175837)", which is one state transition diagram for one event sequence diagram. Can be automatically generated, but one state transition diagram cannot be automatically created by synthesizing a plurality of generated state transition diagrams.

【0005】

In addition, the "object-oriented division / design support system (Japanese Patent Laid-Open No. 6-348482)" describes a method of analyzing the information of the state transition diagram and converting it into a betalinet, but a plurality of state transition diagrams are combined. It does not create a new state transition diagram.

【0006】

Furthermore, in the "object-oriented division / design support device (Japanese Patent Laid-Open No. 6-1168109)", an algorithm that analyzes the information of the state transition diagram and reflects it in the object diagram is described, but a plurality of state transition diagrams are combined. It does not create a new state transition diagram.

【0007】

[Problems to be Solved by the Invention]

From this point of view, in each of the above conventional examples, for example, when one state transition diagram is created based on each event sequence, all the state transitions created for an object are created. 1 as a task by synthesizing each state transition diagram described for each object when synthesizing diagrams to create one state transition diagram or synthesizing multiple objects to create one task It took a lot of labor and time to create two state transition diagrams.

【0008】

In addition, since this work is performed manually, there is a risk of erroneous synthesis.

【0009】

In view of the above-mentioned conventional problems, the present invention is a state transition diagram synthesizer capable of automatically synthesizing all state transition diagrams created for a certain object to create one state transition diagram, and a state transition diagram. It is an object of the present invention to provide a synthesis method. Further, it is provided to provide a state transition diagram synthesizer capable of automatically synthesizing each state transition diagram described for each object to create one state transition diagram as a task, and a state transition diagram synthesizing method. The purpose.

【0010】

[Means for solving problems]

In order to achieve the above object, the first invention comprises a state transition diagram storage unit that stores a plurality of state transition diagrams described from several aspects for one object, and the state transition diagram storage unit. It is equipped with a state transition diagram automatic synthesis unit that takes out any two state transition diagrams from the state transition diagrams stored in and automatically synthesizes the two state transition diagrams into one state transition diagram. is there.

【0011】

In the second invention, in the first invention, the state transition diagram automatic synthesizing unit is a set of a current state, an input event, an action, and the next state, which are items constituting the two state transition diagrams. For each transition record consisting of, it is determined that the transition records having the same current state, the input event, and the action are the same transition.

【0012】

In the third invention, in the first invention, the state transition diagram automatic synthesizing unit is composed of the current state, the input event, the action, and the set of the following states, which are the items constituting the two state transition diagrams. For each transition record, a transition record in which the current state and the input event are the same but the actions are different is determined to be a consistency error.

【0013】

In the fourth invention, in the first invention, the state transition diagram automatic synthesizing unit specifies a common state in the two state transition diagrams from the outside, or when there is no designation thereof, the second. It is judged that the initial states of the two state transition diagrams are common, and the synthesis work is started from that state as a starting point.

【0014】

In the fifth invention, in the state transition diagram storage unit that stores the state transition diagram described one by one for each of the plurality of objects, and in the state transition diagram stored in the state transition diagram storage unit. Take out any two state transition diagrams from the above as the first and second state transition diagrams, and automatically combine the first and second state transition diagrams into one state transition diagram. It is equipped with.

【0015】

In the sixth invention, in the fifth invention, the state transition diagram automatic synthesizing unit creates all combinations of the states in the first state transition diagram and the states in the second state transition diagram. Then, it is made into all the states of the state transition diagram after synthesis.

【0016】

In the seventh invention, in the fifth invention, the first and second state transition diagrams are composed of items of the current state, an input event, an action, and the following states.

【0017】

In the eighth invention, in the seventh invention, the state transition diagram automatic synthesizing unit is a logical combination of a set of events in the first state transition diagram and a set of events in the second state transition diagram. It is assumed that the sum is created and that it is all the events that appear in the state transition diagram after synthesis.

【0018】

In the ninth invention, in the seventh invention, the state transition diagram automatic synthesizing unit has the current state of each object as data, and keeps the state transition diagram data of each object individually. By dynamically searching the state transition diagram data of each object based on the input event and the current state data of each object, and having the only algorithm to calculate the action for the event and the next state. Instead of synthesizing the first and second state transition diagrams themselves, which are the objects to be synthesized, the state transition diagrams are apparently synthesized.

【0019】

In the tenth invention, a state transition diagram storage process for storing a plurality of state transition diagrams described from several aspects for one object and a state transition diagram stored by the state transition diagram storage process are described. It takes out any two state transition diagrams from the inside and automatically synthesizes the two state transition diagrams into one state transition diagram, and executes the state transition diagram automatic composition process.

【0020】

In the eleventh invention, in the tenth invention, the state transition diagram automatic synthesis process is a set of a current state, an input event, an action, and the next state, which are items constituting the two state transition diagrams. For each transition record consisting of, it is determined that the transition records having the same current state, the input event, and the action are the same transition.

【0021】

In the twelfth invention, in the tenth invention, the state transition diagram automatic synthesis process is based on a set of a current state, an input event, an action, and the next state, which are items constituting the two state transition diagrams. For each transition record, a transition record in which the current state and the input event are the same but the actions are different is determined to be a consistency error.

【0022】

In the thirteenth invention, in the tenth invention, the state transition diagram automatic synthesis process is performed when a common state is designated from the outside in the two state transition diagrams, or when there is no designation thereof, the second. It is judged that the initial states of the two state transition diagrams are common, and the synthesis work is started from that state as a starting point.

【0023】

In the fourteenth invention, in the state transition diagram storage process for storing one state transition diagram for each of the plurality of objects and the state transition diagram stored by the state transition diagram storage process. Take out any two state transition diagrams from the above as the first and second state transition diagrams, and automatically combine the first and second state transition diagrams into one state transition diagram. Is to execute.

【0024】

In the fifteenth invention, in the fourteenth invention, the state transition diagram automatic synthesis process creates all combinations of the states in the first state transition diagram and the states in the second state transition diagram. Then, it is made into all the states of the state transition diagram after synthesis.

【0025】

In the sixteenth invention, in the fourteenth invention, the first and second state transition diagrams are composed of items of a current state, an input event, an action, and the following states.

【0026】

In the seventeenth invention, in the sixteenth invention, the state transition diagram automatic synthesis process is a logical disjunction between a set of events in the first state transition diagram and a set of events in the second state transition diagram. It is assumed that the sum is created and that it is all the events that appear in the state transition diagram after synthesis.

【0027】

In the eighteenth invention, in the sixteenth invention, the state transition diagram automatic synthesis process has the current state of each object as data, and keeps the state transition diagram data of each object individually. By dynamically searching the state transition diagram data of each object based on the input event and the current state data of each object, and having the only algorithm to calculate the action for the event and the next state. Instead of synthesizing the first and second state transition diagrams themselves, which are the objects to be synthesized, the state transition diagrams are apparently synthesized.

【0028】

BEST MODE FOR CARRYING OUT THE INVENTION

Hereinafter, embodiments of the present invention will be described with reference to the drawings.

【0029】

FIG. 1 is a block diagram showing a schematic configuration of a state transition diagram synthesizer according to the first embodiment of the present invention.

【0030】

This state transition diagram synthesizer is composed of CPU 1, bus 2, ROM 3, RAM 4, input interface 5, input device 6, output interface 7, output device 8, external storage device interface 9, and external storage device 10.

【0031】

FIG. 2 is a functional block diagram of an information processing system for realizing the state transition diagram automatic composition function of the state transition diagram synthesizer of the present invention.

【0032】

E1 is a computer terminal. E2 is an input / output unit for drawing information, etc., and creates information to be stored in the event sequence storage unit E3. The event sequence input by the user through the input / output unit E2 is stored in the event sequence storage unit E3. E4 is a state transition diagram creation unit, and creates a state transition diagram from the event sequence storage unit E3. E5 is a state transition diagram storage unit that stores the created state transition diagram. E6 is a state transition diagram automatic composition unit that synthesizes a plurality of state transition diagrams, and synthesizes a state transition diagram based on a plurality of state transition diagrams in the state transition diagram storage unit E5, and is a state transition diagram after synthesis. Is stored in the state transition diagram storage unit E5.

【0033】

FIG. 3 is a flowchart showing the state transition diagram automatic synthesis process in the information processing system of FIG.

【0034】

In step S1, the event sequence and its repetition information are created by using the function of the user interface. In step S2, a state transition diagram is created based on the information input in step S1. In step S3, the state transition diagram is synthesized based on the plurality of state transition diagrams in the state transition diagram storage unit E5. The detailed algorithm is described in FIGS. 4 to 7.

【0035】

4 to 7 are the detailed algorithms in step S3 of FIG. 3, and synthesize a state transition diagram based on a plurality of state transition diagrams in the state transition diagram storage unit E5. Before explaining the algorithms of FIGS. 4 to 7, the data structure that is the input of the algorithm of FIG. 4 will be described.

【0036】

8 (a) and 8 (b) are diagrams showing an example of the state transitions to be synthesized, in which FIG. 8 (a) is a state transition table and FIG. 8 (b) is a state transition diagram. In addition, FIGS. 9 (a) and 9 (b) are also diagrams showing other examples of state transitions to be synthesized in the same manner. Here, these state transition tables have information equivalent to the state transition diagram. Hereinafter, in the text, "state transition diagram" and "state transition table" will be used as terms having the same meaning. Items in the table include "current state", "input event", "action", and "next state" items.

【0037】

10 (a) and 10 (b) are diagrams showing the state transitions after being synthesized by using the algorithms of FIGS. 4 to 7 based on the state transition diagrams of FIGS. 8 and 9. a) is a state transition table, and Fig. (B) is a state transition diagram.

【0038】

The state transition table of FIG. 10 (a) has information equivalent to the state transition diagram of FIG. 10 (b). Items in the table include "current state", "input event", "action", and "next state" items.

【0039】

Returning to the description of the algorithm of FIGS. 4 to 7. First, the outline of the algorithm will be described. 4 to 7 are the detailed algorithms in step S3 of FIG. 3, and a plurality of state transition tables are logically and consistently combined into one state transition table. Here, X and Y are used as the state transition tables to be synthesized. The state transition table as a result of synthesis is called Z. "Current state", "input event", "action" for each transition record consisting of a set of "current state", "input event", "action", and "next state" that composes two state transition diagrams. Records with the same "" are judged to be the same transition and registered in Z, and records with the same "current state" and "input event" but different "actions" are judged to be consistency errors. To do.

【0040】

If there is no other record with the same "current state", "input event", and "action" for a certain transition record, that transition record is registered in Z. An example of the procedure is shown below. As for the procedure, if the above contents can be executed, the order may be slightly changed with respect to those in FIGS. 4 to 7.

【0041】

Specifically, in step S10 shown in FIG. 4, the initial state of Z is determined. In step S10, as shown in FIG. 5, in step S11, the user is asked to specify a state having the same meaning from X and Y, and in step S12, if specified, go to step S13 and X. Sets the state name specified for to the current state of Z. Then, in the "current state" and "next state" items of the other Y state transition table, all the state names having the same label as the state name specified for Y are specified for X. Replace with the state name. If not specified, go to step S14 and set the initial state name of one X to the current state of Z. Then, in the "current state" and "next state" items of the other Y state transition table, all the state names having the same label as the initial state name in Y are the initial state names of X. replace. In the above operation, X and Y may be reversed.

【0042】

Returning to FIG. 4, the algorithm between steps S21 and S61 describes the state of one state that is the final search for the event, action, and next state ahead of one state in the state transition diagram of Z. The algorithm that calculates and registers the state transition record when is set to the current state is written.

【0043】

In step S21, all records in X and Y whose current state is equal to the current state of Z are fetched. In step S23, for a certain record X1 fetched in step S21, it is checked whether another record having the same event exists in the record group just fetched. If so, check if the actions are equal in step S24.

【0044】

If the actions are also equal, it is judged that they are the same transition, and only the record X1 is registered in the state transition table Z. There are several ways to register record X1 in the state transition table Z, but the point is to register a set of "current state", "input event", "action", and "next state". Do not stick to the steps from step S31 to step S35 shown in FIG. For example, the specific contents of this registration will be described in steps S31 to S35.

【0045】

In step S31, the next status number in Z is acquired. Regarding the acquisition method, for example, when the next state name of X1 does not exist in Z, a number different from the state numbers in X, Y, and Z is acquired and assigned to the Next-state. This will later be the new status number in Z.

【0046】

Then, in step S32, the record (REC) is registered in Z. That is, (1) REC. Current state Z. Current state, (2) REC. Input event X1. Input event, (3) REC. Action X1. Action, (4) REC. Next state Substitute Next-state.

【0047】

In step S33, Next-state is added to the next state list of Z. The timing of executing step S33 may be any time between step S31 and step S61.

【0048】

In step S34, the status numbers are made consistent. That is, in the state transition table to which X1 belongs, all states having a value equal to [X1. Next state] are set to [Next-state]. The process of step S34 may be performed anywhere after the process of step S31. In step S35, in the state transition table to which the unregistered record belongs, all the states having a value equal to the value of the next state item of the unregistered record are set to [Next-state]. ..

【0049】

When transitioning to step S40 in FIG. 4, each transition record consisting of a set of "current state", "input event", "action", and "next state" constituting the two state transition diagrams is "currently". Records with different "actions" even though the "state" and "input event" are equal are judged to be consistency errors and a warning is issued.

【0050】

In step S23, for a certain record X1 fetched in step S21, X1 is registered in Z if the same record of the event does not exist in the record group just fetched. There are several ways to register record Z in the state transition table Z, but the point is to register a set of "current state", "input event", "action", and "next state". Do not stick to the steps from step S51 to step S54. For example, the registration work from step S51 to step S54 shown in FIG. 7 is the same as the work from step S31 to step S34. For example, the specific contents of this registration will be described below.

【0051】

In step S51, the next status number in Z is acquired. Regarding the acquisition method, for example, when the next state name of X1 does not exist in Z, a number different from the state numbers in X, Y, and Z is acquired and assigned to the Next-state. This will later be the new status number in Z. Then, in step S52, the record (REC) is registered in Z. That is, (1) REC. Current state Z. Current state, (2) REC. Input event X1. Input event, (3) REC. Action X1. Action, (4) REC. Next state Substitute Next-state.

【0052】

In step S53, Next-state is added to the next state list of Z. The timing of executing step S53 may be any time between step S51 and step S61. In step S54, the status numbers are made consistent. That is, in the state transition table to which X1 belongs, all states having a value equal to [X1. Next state] are set to [Next-state]. The process of step S54 may be performed anywhere after the process of step S51.

【0053】

In step S61, it is determined whether or not all the records fetched in step S23 have been processed. At this time, if the next state list of Z is empty, the synthesis process for the current state of Z ends. .. If there is a record that has not been processed yet, the process returns to step S23.

【0054】

When there are no more unprocessed records, one unsearched state is fetched from the next state list of Z in step S62, the current state of Z is set, and the process returns to step S21. In step S62, there are several methods for retrieving the unsearched state, such as retrieving from the beginning of the list, retrieving from the rear end of the list, and retrieving any one element. In addition, the next state list of Z is dynamically calculated in steps S31 and S51, but there is also a method of creating a state list of Z by considering all combinations of X and Y states in advance. ..

【0055】

When the next state list in Z is empty (step S63), step S64 sorts the entire table in order of state number, prefixed with the empty state numbers to make it look good. In some cases, step S64 may not be necessary.

【0056】

Next, a second embodiment of the present invention will be described.

【0057】

This embodiment shows another example of the algorithm of FIGS. 4 to 7 as the detailed algorithm of step S3 shown in FIG.

【0058】

Based on the results of object-oriented analysis, when implementing in a Marte task program using a real-time OS (see the November 1987 issue of Technical Review Co., Ltd. "Processor"), the work of combining multiple objects into one task. However, the present invention can also be applied when automating this work.

【0059】

Specifically, in the first embodiment above, it was assumed that the state transition diagrams of FIGS. 8 and 9 belong to the same object, but by viewing this as a state transition diagram of different objects. , It is also possible to automatically synthesize the state transition diagram as one task that combines the state transition diagrams of multiple objects.

【0060】

Alternatively, when creating a state transition diagram by synthesizing two state transition diagrams, consider other means for realizing the method of synthesizing the state transition diagram in consideration of the combination of all the states of the state transition diagram of each object to be synthesized. Be done. It will be described below.

【0061】

11 and 12 are flowcharts showing the detailed algorithm of step S3 of FIG. 3 according to the second embodiment of the present invention. In this, the case where the state transition diagrams P1 and P2 are combined to create the state transition diagram Z is described.

【0062】

In step S81, the current event, action list, remaining event list, all event list, and all composite state list are initialized to empty. In step S82, a list of all the state combinations appearing in P1 and P2 is created, and the list is made into a total composite state list. In step S83, a list consisting of the logical sums of all the events appearing in P1 and P2 is created and used as the all event list. In step S84, the full composite state list is assigned to the remaining composite state list (initialization).

【0063】

For the steps from step S81 to step S84, the order is not important and can be any order. Alternatively, although steps S82 and S83 are created at once before starting the work, they may be dynamically extracted one by one in the process of performing the synthesis work. In step S85, it is determined whether the remaining composite state list is empty. If it is empty, it ends. If it is not empty, go to step S86. The part for determining whether the remaining composite state list is empty may be somewhere in the algorithm, for example, at the end of the algorithm.

【0064】

In step S86, the current compound state, the current state of P1, and the current state of P2 are initialized. In step S87, the entire event list is assigned to the remaining event list. In step S88, it is determined whether or not the remaining event list is empty, and if it is empty, the process proceeds to step S85, and if it is not empty, the process proceeds to step S90.

【0065】

In step S90, the point is that when you are in a certain (composite) state in Z, you are creating and registering a state transition record when a certain event comes, and if you can do that, Figure 12 The control procedure may be slightly interchanged even if the procedure from step S91 to step S96 shown in the above is not followed.

【0066】

In step S91, one is taken from the remaining event list, put into the current input event, and the current event is deleted from the remaining event list. Also, the action list is initialized to empty.

【0067】

In step S92 and step S93, the search process for the table P1 is performed. In this search process, first, in step S92, the next state of P1 is assigned (initialized) to the current state of P1. In the following step S93, the state transition table P1 is searched using the current state of P1 and the current input event as keys, and if the record p exists, the action of p is registered in the action list, and the next state of P1 is registered. Substitute the next state of p into. The process of the first step S92 may be executed at any timing before the execution of the step S93.

【0068】

Step S94 and step S95 are search processes for table P2. In this search process, first, in step S94, the next state of P2 is assigned (initialized) to the current state of P2. In the following step S95, the state transition table P2 is searched using the current state of P2 and the current input event as keys, and if the record p exists, the action of P is registered in the action list, and the next state of P2. Substitute the next state of p into. The process of step S94 may be executed at any timing before the execution of step S95. Further, the order of the processes of step S92 and step S93 and the processes of step S94 and step S95 may be changed.

【0069】

In step S95, the set of the current compound state, the current input event, the action list, and the "composite state corresponding to the combination of the next state of P1 and the next state of P2" is registered in the state transition table Z as one record. Then, return to step S88. Basically, it suffices if there is a process of first obtaining all complex states and event lists and calculating state transition records for all the combinations. For example, steps S86 and S87 are steps S85. It may have been before, and it may have been during the transition from step S88 to step S85.

【0070】

13 (a) and 13 (b) and 14 (a) and 14 (b) are diagrams showing an example of the state transition before synthesis according to the second embodiment, and FIG. 13 (a) is a diagram showing the state transition. Table P1 and the figure (b) is a state transition diagram. The state transition table has information equivalent to the state transition diagram. Items in the table include "current state", "event", "action", and "next state" items.

【0071】

FIG. 15 is a diagram showing an example of a total composite state list and a total event list in the second embodiment.

【0072】

FIG. 16 is an example of the state transition after being synthesized based on the state transition diagrams of FIGS. 13 and 14, FIG. 16A is a state transition table Z, and FIG. 16B is a state transition diagram. Is. The state transition table has information equivalent to the state transition diagram. Items in the table include "current state", "event", "action", and "next state" items.

【0073】

Next, a third embodiment of the present invention will be described.

【0074】

In the present embodiment, another example of the algorithm of FIGS. 4 to 7 is shown as the detailed algorithm of step S3 shown in FIG.

【0075】

Similar to the second embodiment, when implementing with a program of Marte task using a real-time OS based on the result of object-oriented analysis, the work of combining a plurality of objects into one task is performed. Can also be applied when automating this task.

【0076】

That is, the device of the present embodiment does not synthesize the state transition diagram itself, but has the current state of each object as data, and keeps the state transition diagram data of each object individually, and inputs events and each. By dynamically searching the state transition diagram data of each object based on the current state data of the object and calculating the action for the event and the next state, it looks as if the state transition diagram was synthesized. To process.

【0077】

Specifically, the state transition diagram of FIG. 17 is used for all the synthesized objects. The state transition diagram of each object is saved as data as it is, and in addition to this, it has a table as shown in Fig. 18 consisting of a pair of object name and current state.

【0078】

In FIG. 17, step S101 waits for an event sent to the synthesized object. In step S102, it is determined whether or not all the records in FIG. 18 have been processed from step S103 to step S106, and if there is a record that has not been processed yet, the process proceeds to step S103.

【0079】

When the processes of steps S103 to S106 are performed for all the records in FIG. 18, the state returns to the event waiting state of step S101. The execution order of this step S102 does not have to be in this position in particular, and may be, for example, after step S106. In step S103, one record is fetched from the table consisting of the set of the object name and the current state as shown in FIG. 18, and the current state of the object is obtained. Let this be the state.

【0080】

In step S104, the current state (state), the action corresponding to the currently sent event, and the next state are searched and obtained from the state transition table as shown in FIG. 8 corresponding to the object identifier (Object Name). .. Put the action in action and the next state in next-state. In step S105, an action is executed.

【0081】

In step S106, the next state is recorded in the table consisting of the set of the object name and the current state in FIG. 18, and the process returns to step S102. The procedure may be reversed in step S105 and step S106.

【0082】

[Effect of the invention]

As described in detail above, according to the state transition diagram synthesizer according to the first invention, for example, when one state transition diagram is created based on each event sequence, a certain object is created. When creating one state transition diagram by automatically synthesizing all the state transition diagrams created for the above, the state transition diagram can be automatically synthesized, and the labor for that can be greatly reduced. In addition, the reliability of the synthesis algorithm is improved because erroneous synthesis is not performed as compared with the case where this work is performed manually.

【0083】

According to the state transition diagram synthesizer according to the second invention, in the first invention, the state transition diagram automatic synthesizer is an item constituting the two state transition diagrams, that is, the current state and the input event. For each transition record consisting of a set of, action, and next state, it is determined that the current state, the input event, and the transition record having the same action are the same transition, so that the state is simple and accurate. It becomes possible to automatically synthesize transition diagrams.

【0084】

According to the state transition diagram synthesizer according to the third invention, in the first invention, the state transition diagram automatic synthesizer is an item constituting the two state transition diagrams, that is, the current state and the input event. For each transition record consisting of a set of, action, and next state, a transition record having the same current state and the same input event but different actions is judged to be a consistency error. , It becomes possible to easily and accurately automatically synthesize the state transition diagram.

【0085】

According to the state transition diagram synthesizer according to the fourth invention, in the first invention, when the state transition diagram automatic synthesizer specifies a common state in the two state transition diagrams from the outside, Or, if there is no specification, it is judged that the initial states of the two state transition diagrams are common, and the synthesis work is started from that state as the starting point. Therefore, the state transition diagrams are automatically synthesized easily and accurately. Will be possible.

【0086】

According to the state transition diagram synthesizer according to the fifth invention, for example, when synthesizing a plurality of objects to create one task (execution unit of a program), each state transition described for each object is created. When automatically synthesizing a diagram to create one state transition diagram as a task, the state transition diagram can be automatically synthesized, and the labor for that can be greatly reduced. In addition, the reliability of the synthesis algorithm is improved because erroneous synthesis is not performed as compared with the case where this work is performed manually.

【0087】

According to the state transition diagram synthesizer according to the sixth invention, in the fifth invention, the state transition diagram automatic synthesizing unit is in the state in the first state transition diagram and in the second state transition diagram. Since all the combinations with the states of are created and made into all the states of the state transition diagram after synthesis, in the above-mentioned fifth invention, the automatic synthesis of the state transition diagram is performed easily and accurately. Becomes possible.

【0088】

According to the state transition diagram synthesizer according to the seventh invention, in the fifth invention, the first and second state transition diagrams are items of the current state, the input event, the action, and the next state. Since it is composed of, it is possible to accurately synthesize the state transition diagram for each of these items.

【0089】

In the eighth invention, in the seventh invention, the state transition diagram automatic synthesizing unit is a logical combination of a set of events in the first state transition diagram and a set of events in the second state transition diagram. Since the sum is created and it is assumed that all the events appear in the state transition diagram after synthesis, it is possible to easily and accurately automatically synthesize the state transition diagram in the above-mentioned seventh invention. ..

【0090】

In the ninth invention, in the seventh invention, the state transition diagram automatic synthesizing unit has the current state of each object as data, and keeps the state transition diagram data of each object individually. By dynamically searching the state transition diagram data of each object based on the input event and the current state data of each object, and having the only algorithm to calculate the action for the event and the next state. Instead of synthesizing the first and second state transition diagrams themselves, which are the objects to be synthesized, the state transition diagrams are apparently synthesized. Therefore, in the seventh invention, the states are simpler and more accurate. It becomes possible to automatically synthesize transition diagrams.

【0091】

According to the state transition diagram synthesis method of the tenth invention, the same effect as that of the first invention is obtained.

【0092】

According to the state transition diagram synthesis method of the eleventh invention, the same effect as that of the second invention is obtained in the tenth invention.

【0093】

According to the state transition diagram synthesis method according to the twelfth invention, the tenth invention has the same effect as the third invention.

【0094】

According to the state transition diagram synthesis method according to the thirteenth invention, the tenth invention has the same effect as the fourth invention.

【0095】

According to the state transition diagram synthesis method of the 14th invention, the same effect as that of the 5th invention is obtained.

【0096】

According to the state transition diagram synthesis method of the fifteenth invention, the same effect as that of the sixth invention is obtained in the fourteenth invention.

【0097】

According to the state transition diagram synthesis method of the 16th invention, the same effect as that of the 7th invention is obtained in the 14th invention.

【0098】

According to the state transition diagram synthesis method of the 17th invention, the same effect as that of the 8th invention is obtained in the 16th invention.

【0099】

According to the state transition diagram synthesis method according to the eighteenth invention, the same effect as that of the ninth invention is obtained in the sixteenth invention.

[Simple explanation of drawings]

[Figure 1]

It is a block diagram which shows the schematic structure of the state transition diagram synthesis apparatus which concerns on 1st Embodiment of this invention.

[Figure 2]

State transition diagram of the present invention State transition diagram of the synthesizer It is a functional block diagram of an information processing system for realizing an automatic synthesis function.

[Fig. 3]

It is a flowchart which shows the state transition diagram automatic synthesis processing in the information processing system of FIG.

[Fig. 4]

It is a flowchart which shows the detailed algorithm of step S3 of FIG.

[Fig. 5]

It is a flowchart which shows the determination process of the initial state of the state transition table Z.

[Fig. 6]

It is a flowchart which shows the process of registering only record X1 in the state transition table Z.

[Fig. 7]

It is a flowchart which shows the process of registering a record X1 in a state transition table Z.

[Fig. 8]

It is a figure which shows an example of the state transition to synthesize.

[Fig. 9]

It is a figure which shows another example of the state transition to synthesize.

[Fig. 10]

It is a figure which shows the state transition after being synthesized by using the algorithm of FIG. 4 to 7 based on the state transition diagram of FIG. 8 and FIG.

[Fig. 11]

It is a flowchart which shows the detailed algorithm of step S3 of FIG. 3 which concerns on 2nd Embodiment of this invention.

[Fig. 12]

It is a flowchart which shows the detailed process of step S90 in FIG.

[Fig. 13]

It is a figure which shows the example of the state transition before synthesis which concerns on 2nd Embodiment.

[Fig. 14]

It is a figure which shows another example of the state transition before synthesis which concerns on 2nd Embodiment.

[Fig. 15]

It is a figure which shows the example of all compound state list and all event list in 2nd Embodiment.

[Fig. 16]

It is a figure which shows the example of the state transition after being synthesized based on the state transition diagram of FIG. 13 and FIG.

[Fig. 17]

It is a state transition diagram for all the objects after synthesis in the third embodiment of the present invention.

[Fig. 18]

It is a figure which shows the object name and the table of the present state.

[Explanation of symbols]

1 CPU 2 bus 3 ROM 4 RAM 5 Input interface 6 Input device 7 Output interface 8 output device 9 External storage interface 10 External storage device E1 computer terminal E2 input / output section E3 event sequence storage E4 State transition diagram creation unit E5 State transition diagram storage E6 State transition diagram automatic synthesizer