JPH1124902A - State transition diagram synthesizer and state transition diagram synthesizing method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To generate one state transition diagram by synthesizing automatically all state transition diagrams that are produced to a certain object by storing plural state transition diagrams which are described from several sides to one object, fetching plural optional state transition diagrams among stored state transition diagrams and synthesizing automatically the state transition diagrams. SOLUTION: A state transition diagram producing part E4 generates a state transition diagram from an event sequence storing part E3. An automatic state transition diagram synthesizing part E6 which synthesizes plural state transition diagrams synthesizes a state transition diagram based on plural state transition diagrams in a state transition diagram storing part E5 and stores the state transition diagram after synthesization in the part E5. Thereby, when one respective state transition diagram is produced based on each event sequence, a state transition diagram can be automatically synthesized and therefore, labor is drastically reduced when all state transition diagrams that are generated to a certain object to produce one state transition diagram.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

TECHNICAL FIELD The present invention relates to a system analysis and analysis system.
The present invention relates to a state transition diagram synthesis apparatus and a state transition diagram synthesis method for synthesizing a state transition diagram created as a life cycle of each object when designing.

[0002]

2. Description of the Related Art For example, in an object-oriented design or the like, when analyzing and designing a system, a plurality of event sequence diagrams are described, and then state transition of each object is performed based on information of the plurality of the described event sequence diagrams. Create diagrams (object-oriented methodology OMT
(See J. Rambo, Toppan). Conventionally, when one state transition diagram is created based on each event sequence in this series of operations, all the state transition diagrams created for a certain object are synthesized. The task of creating one state transition diagram is
It was done manually by human experience and perception.

When one task (program execution unit) is created by combining a plurality of objects, each state transition diagram described for each object is combined to form one state as a task. The work of creating the transition diagram was also done manually by human experience and perception.

[0004] Regarding a method for 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).
Although one state transition diagram can be automatically generated for one event sequence diagram, one state transition diagram cannot be automatically created by combining a plurality of generated state transition diagrams.

[0005] Further, in the "Object Oriented Separation / Design Support System (Japanese Patent Laid-Open No. Hei 6-348482)", a method of analyzing information of a state transition diagram and converting it into a Petri net is described. Are not combined to create a new state transition diagram.

[0006] Further, in "Object Oriented Separation / Design Supporting Apparatus (JP-A-6-168109)", an algorithm for analyzing information of a state transition diagram and reflecting it on an object diagram is described. It does not create a new state transition diagram by combining the diagrams.

[0007]

In view of the above, in each of the above-mentioned conventional examples, for example, when one state transition diagram is created based on one event sequence at a time, an object is added to a certain object. To create one state transition diagram by combining all state transition diagrams created for
When combining a plurality of objects to create one task, a great deal of labor and time is required when combining the state transition diagrams described for each object to create one state transition diagram as a task. Was required.

[0008] Further, since this work is performed manually, there is a danger of erroneous synthesis.

In view of the above-mentioned conventional problems, the present invention automatically synthesizes all state transition diagrams created for a certain object to create one state transition diagram, and a state transition diagram synthesizing apparatus. An object of the present invention is to provide a state transition diagram synthesis method. It is another object of the present invention to provide a state transition diagram synthesizing apparatus and a state transition diagram synthesizing method capable of automatically synthesizing each state transition diagram described for each object to create one state transition diagram as a task. Aim.

[0010]

In order to achieve the above object, a first invention is a state transition diagram storing a plurality of state transition diagrams described from several aspects for one object. And any two state transition diagrams extracted from the state transition diagram stored in the state transition diagram storage unit.
And a state transition diagram automatic synthesizing unit for automatically synthesizing one state transition diagram into one state transition diagram.

[0011] In a second aspect based on the first aspect, the state transition diagram automatic synthesizing section includes a current state, an input event, and an item constituting the two state transition diagrams.
For each transition record including a set of an action and a next state, the transition record having the same current state, the input event, and the action is determined to be the same transition.

[0012] In a third aspect based on the first aspect, the state transition diagram automatic synthesizing section includes a current state, an input event, and an item constituting the two state transition diagrams.
Regarding each transition record composed of a set of an action and a next state, a transition record having a different action even though the current state and the input event are equal is determined to be a consistency error.

[0013] In a fourth aspect based on the first aspect, the state transition diagram automatic synthesizing section specifies when a common state is externally designated in the two state transition diagrams or when the common state is not designated. Judge that the initial states of the two state transition diagrams are common, and start the synthesizing work starting from those states.

In a fifth aspect, a state transition diagram storage unit for storing a state transition diagram described one by one for each of a plurality of objects, and a state transition stored in the state transition diagram storage unit Any two state transition diagrams are extracted from the diagram as first and second state transition diagrams, and the first and second state transition diagrams are automatically synthesized to form one state transition diagram. And a combining unit.

[0015] In a sixth aspect based on the fifth aspect, the state transition diagram automatic synthesizing section includes all of the states in the first state transition diagram and the states in the second state transition diagram. A combination is created, and this is set as all the states in the state transition diagram after the combination.

In a seventh aspect based on the fifth aspect, the first and second state transition diagrams are constituted by items of a current state, an input event, an action, and a next state. is there.

In an eighth aspect based on the seventh aspect, the state transition diagram automatic synthesizing section comprises a set of events in the first state transition diagram and a set of events in the second state transition diagram. Is made, and this is regarded as all the events appearing in the state transition diagram after the composition.

In a ninth aspect based on the seventh aspect, the state transition diagram automatic synthesizing section has a current state of each object as data, and individually holds state transition diagram data of each object. As it is, based on the input event and the current state data of each object, the state transition diagram data of each object is dynamically searched, and there is only one algorithm that calculates the action for the event and the next state. By doing
Instead of synthesizing the first and second state transition diagrams themselves to be synthesized, the state transition diagrams are synthesized in appearance.

In the tenth aspect, a state transition diagram storing process for storing a plurality of state transition diagrams described from several aspects for one object, and a state stored by the state transition diagram storing process Any two state transition diagrams are extracted from the transition diagram, and the two state transition diagrams are automatically synthesized to form a state transition diagram automatic synthesis process.

In an eleventh aspect based on the tenth aspect, the state transition diagram automatic synthesis processing includes a current state, an input event, an action, and a next item, which constitute the two state transition diagrams. For each transition record composed of a set of states, the transition record having the same current state, the input event, and the action is determined to be the same transition.

In a twelfth aspect based on the tenth aspect, the state transition diagram automatic synthesizing process includes a current state, an input event, an action, and a next state, which are items constituting the two state transition diagrams. For each transition record consisting of a set of, a transition record having a different action even though the current state and the input event are equal is determined to be a consistency error.

In a thirteenth aspect based on the tenth aspect, the state transition diagram automatic synthesizing process is performed when a common state in the two state transition diagrams is designated from the outside or when the common state is not designated. Judge that the initial states of the two state transition diagrams are common, and start the synthesizing work starting from those states.

In a fourteenth aspect, a state transition diagram storing process for storing a state transition diagram described one by one for each of a plurality of objects, and a state transition stored by the state transition diagram storing process Any two state transition diagrams are extracted from the diagram as first and second state transition diagrams, and the first and second state transition diagrams are automatically synthesized to form one state transition diagram. And a synthesizing process.

In a fifteenth aspect based on the fourteenth aspect, the state transition diagram automatic synthesizing process is performed for all of the states in the first state transition diagram and the states in the second state transition diagram. A combination is created, and this is set as all the states in the state transition diagram after the combination.

In a sixteenth aspect based on the fourteenth aspect, the first and second state transition diagrams each include a current state,
It consists of items of an input event, an action, and a next state.

In a seventeenth aspect based on the sixteenth aspect, the state transition diagram automatic synthesis processing includes a set of events in the first state transition diagram and a set of events in the second state transition diagram. Is made, and this is regarded as all the events appearing in the state transition diagram after the composition.

In an eighteenth aspect based on the sixteenth aspect, the state transition diagram automatic synthesizing process has a current state of each object as data and individually holds state transition diagram data of each object. As it is, based on the input event and the current state data of each object, the state transition diagram data of each object is dynamically searched, and there is only one algorithm that calculates the action for the event and the next state. In this way, the first and second state transition diagrams to be combined are not combined, but the state transition diagrams are combined apparently.

[0028]

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

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

This state transition diagram synthesizing apparatus comprises a CPU 1, a bus 2, a ROM 3, a RAM 4, an input interface 5,
It comprises an input device 6, an output interface 7, an output device 8, an external storage device interface 9, and an external storage device 10.

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

E1 is a computer terminal. E2 is an input / output unit for drawing information and the like, and creates information to be stored in the event sequence storage unit E3. The event sequence stored 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 that 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 synthesis unit that synthesizes a plurality of state transition diagrams. The state transition diagram is synthesized based on the plurality of state transition diagrams in the state transition diagram storage unit E5, and the state transition diagram after synthesis. Is stored in the state transition diagram storage unit E5.

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

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

FIGS. 4 to 7 are 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 E5. Before describing the algorithm of FIGS. 4 to 7, a data structure that is an input of the algorithm of FIG. 4 will be described.

FIGS. 8A and 8B show examples of state transitions to be combined. FIG. 8A is a state transition table, and FIG. 8B is a state transition diagram. FIG.
(A), (b) is a figure which shows the other example of the state transition similarly combined. Here, these state transition tables have information equivalent to a state transition diagram. Hereinafter, in the text, “state transition diagram” and “state transition table” are used as words having the same meaning. Items in the table include “current state”, “input event”, “action”, and “next state”.

FIGS. 10A and 10B are diagrams showing state transitions after being synthesized using the algorithms of FIGS. 4 to 7 based on the state transition diagrams of FIGS. 8 and 9. FIG.
Is a state transition table, and FIG. 4B is a state transition diagram.

The state transition table shown in FIG.
It has information equivalent to the state transition diagram of FIG.
Items in the table include “current state”, “input event”, “action”, and “next state”.

Returning to the description of the algorithm in FIGS. First, an outline of the algorithm will be described. FIGS. 4 to 7 show the detailed algorithm of step S3 in FIG. 3, in which a plurality of state transition tables are logically and consistently combined into one state transition table. Here, X and Y are used as state transition tables to be combined. The state transition table resulting from the combination is referred to as Z. "Current state", "input event", "action" for each transition record that comprises two sets of "current state", "input event", "action", and "next state" Are determined to be the same transition and registered in Z. Records that have different "actions" even though "current state" and "input event" are equal are determined to be consistency errors. I do.

If there is no other record having the same “current state”, “input event”, and “action” for a certain transition record, the transition record is registered in Z. An example of the procedure is shown below. As long as the above procedure can be executed, the order may be slightly changed from that of FIGS. 4 to 7.

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 designates a state having the same meaning from X and Y. In step S12, if there is a designation, the process goes to step S13 and proceeds to step S13. Is 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 state name. If there is no designation, the procedure goes to step S14, and the initial state name of one X is set 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 represented by X initial state names. replace. In the above operation, X and Y may be reversed.

Referring back to FIG. 4, the algorithm between step S21 and step S61 is based on the Z state transition diagram.
For an event, an action, and a next state before a certain state, an algorithm for calculating and registering a state transition record when the state is set as the current state for one state that is the last search is described.

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

If the actions are the same, it is determined that the transitions are the same, and only the record X1 is registered in the state transition table Z. There are several methods for registering the record X1 in the state transition table Z.
This is to register a set of “input event”, “action”, and “next state”, and does not stick to the procedure 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.

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

Thereafter, in step S32, a 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 ← X
1. Action, (4) REC. Next state ← Next-
state.

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

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

When transitioning to step S40 in FIG. 4, two state transition diagrams are formed, namely, "current state",
For each transition record consisting of a set of “input event”, “action”, and “next state”, records with different “action” even though “current state” and “input event” are the same Judge as an error and issue a warning.

In step S23, with respect to a certain record X1 extracted in step S21, if there is no other record with the same event in the record group just extracted, X1 is registered in Z. There are several methods for registering the record Z in the state transition table Z.
"Current state", "input event", "action",
This is to register a set of “next state”, and step S5
It does not stick to the procedure from 1 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.

In step S51, the next state number in Z is obtained. Regarding the acquisition method, for example, when the state name next to X1 does not exist in Z, a number different from the state number in X, Y, Z is acquired, and Next-state is acquired.
Substitute for This will later be the new state number in Z.
Then, in step S52, a 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 ← Next-state,
Is substituted.

In step S53, Next-state is added to the state list next to Z. The timing at which step S53 is executed may be any time between step S51 and step S61. Step S54
Then, the consistency of the state numbers is taken. That is, in the state transition table to which X1 belongs, [X1. All states having a value equal to [next state] are set to [Next-state]. Note that the process of step S54 may be performed anywhere after the process of step S51.

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

If there are no more unprocessed records, one unsearched state is fetched from the next state list of Z in step S62, set as the current state of Z, and the process returns to step S21. In step S62,
There are several methods for retrieving an unsearched state, such as retrieving from the head of the list, retrieving from the end of the list, and retrieving an arbitrary element. Although the next state list of Z is dynamically calculated in steps S31 and S51, there is a method in which a state list of Z is created in advance by considering all combinations of X and Y states. .

If the state list next to Z is empty (step S63), in step S64, the empty state numbers are padded by minutes to improve the appearance, and the entire table is sorted in order of the state numbers. I do. Step S64 may not be necessary in some cases.

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

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

Based on the result of the object-oriented analysis, a real-time OS (Technical Reviewer, “Processor”, November 1987)
When implementing a multi-task program by using a month task or the like, a task of combining a plurality of objects into one task is performed. The present invention can also be applied when automating this task.

Specifically, in the first embodiment, it is assumed that the state transition diagrams of FIGS. 8 and 9 belong to the same object. By looking at the state transition diagram, it is possible to automatically compose a state transition diagram as one task obtained by combining the state transition diagrams of a plurality of objects.

Alternatively, in creating a state transition diagram by combining two state transition diagrams, another realization of a method of synthesizing a state transition diagram in consideration of a combination of all states of the state transition diagram of each object to be synthesized. Means are also conceivable.
It is described below.

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

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 combinations of all the states appearing in P1 and P2 is created, and this is set as an all composite state list. In step S83, a list composed of the logical sum of all the events appearing in P1 and P2 is created, and is set as an all event list. In step S84, the entire composite state list is assigned to the remaining composite state list (initialization).

The order of steps S81 to S84 is not important, and may be any order. Alternatively, steps S82 and S83 are made at once before starting the work, but may be dynamically extracted one by one in the course of performing the synthesis work. In step S85, it is determined whether the remaining composite state list is empty.
If empty, end. If not empty, go to step S86. The portion for determining whether the remaining composite state list is empty may be located anywhere in the algorithm, for example, at the end of the algorithm.

In step S86, the current composite state, P
1 and the current state of P2. In step S87, the entire event list is substituted for the remaining event lists. In step S88, it is determined whether the remaining event list is empty. If it is empty, the process proceeds to step S85, and if not, the process proceeds to step S90.

In step S90, the task is to create and register a state transition record when a certain event occurs while in a certain (composite) state in Z. If the work is possible, Step S91 shown in FIG.
However, the control procedure may be slightly changed instead of following the procedure from step S96 to step S96.

In step S91, one is taken out 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.

In steps S92 and S93,
A search process is performed on the table P1. In this search processing, first, in step S92, the state following P1 is substituted (initialized) into the current state of P1. In a succeeding 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. To the next state of p. In addition,
About the process of the above-mentioned step S92, step S9
3 may be executed at any timing before execution.

Steps S94 and S95 are a search process for the table P2. This search process
First, in step S94, the state following P2 is substituted (initialized) into the current state of P2. In the following step S95,
The state transition table P2 is searched by 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.
The next state of p is substituted for the next state of 2. Note that the process of step S94 may be executed at any timing before the execution of step S95. Further, the order of the processes of steps S92 and S93 and steps S94 and S95 may be reversed.

In step S95, the current composite state, the current input event, the action list, and the "composite state corresponding to the combination of the state next to P1 and the state next to P2"
Are registered in the state transition table Z as one record, and the process returns to step S88. Basically, it suffices if there is a process of obtaining all composite states and event lists and calculating state transition records for all combinations thereof. For example, steps S86 and S87 are required.
May also be present before step S85, and during the transition from step S88 to step S85.

FIGS. 13 (a) and 13 (b) and FIGS.
(B) is a diagram showing an example of state transition before combining according to the second embodiment, and (a) shows a state transition table P
1 (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”.

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

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

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

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

Similar to the above-described second embodiment, when implementing a multi-task program using a real-time OS based on the results of object-oriented analysis, a task of combining a plurality of objects into one task is performed. The present invention can also be applied when automating this operation.

That is, the apparatus of the present embodiment does not synthesize the state transition diagram itself, but has the current state of each object as data, and stores the state transition diagram data of each object individually while inputting the data. Based on the event and the current state data of each object, the state transition diagram data of each object is dynamically searched, and the action for the event and the next state are calculated,
Process as if the state transition diagrams were combined.

More specifically, the state transition diagram of FIG. 17 is used for all the synthesized objects. The state transition diagram of each object is stored as data as it is, and in addition, it has a table as shown in FIG.

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

When the processes from step S103 to step S106 have been performed on all the records in FIG. 18, the process returns to the event waiting state in step S101. The execution order of step S102 does not necessarily have to be at this position.
It may be after 106. In step S103, one record is extracted from the table including the pair of the object name and the current state as shown in FIG. 18, and the current state of the object is obtained. This is set as state.

In step S104, the current state (state) is obtained from the state transition table as shown in FIG. 8 corresponding to the object identifier (Object Name).
The action and the next state corresponding to the currently sent event are retrieved and obtained. Put the action in action and the next state in next-state. Step S1
At 05, an action is performed.

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

[0082]

As described above in detail, according to the state transition diagram synthesizing apparatus of the first invention, for example, one state transition diagram is created based on each event sequence. Sometimes, when one state transition diagram is created by automatically synthesizing all the state transition diagrams created for a certain object, it becomes possible to automatically combine the state transition diagrams. Can be significantly reduced. Further, as compared with the case where this operation is manually performed, erroneous combining is not performed, so that the reliability of the combining algorithm is improved.

According to the state transition diagram synthesizing device of the second invention, in the first invention, the state transition diagram automatic synthesizing section is an item constituting the two state transition diagrams.
For each transition record consisting of a set of a current state, an input event, an action, and a next state, a transition record having the same current state, the input event, and the action is determined to be the same transition. This makes it possible to easily and accurately perform automatic synthesis of the state transition diagram.

According to the state transition diagram synthesizing device of the third invention, in the first invention, the state transition diagram automatic synthesizing unit is an item constituting the two state transition diagrams.
For each transition record consisting of a set of a current state, an input event, an action, and a next state, a transition record having a different action even though the current state and the input event are equal is regarded as a consistency error. Since the judgment is made, it is possible to easily and accurately perform the automatic synthesis of the state transition diagram.

According to the state transition diagram synthesizing apparatus of the fourth invention, in the first invention, the state transition diagram automatic synthesizing section designates a common state in the two state transition diagrams from outside. When the state transition diagram is not specified or when there is no designation, the initial state of the two state transition diagrams is determined to be common, and the composition work is started from that state as a starting point. Compositing can be performed.

According to the state transition diagram synthesizing apparatus of the fifth invention, for example, when a plurality of objects are synthesized to form one task (program execution unit), each of the objects described for each object is described. Automatically synthesizes the state transition diagram of
For example, when one state transition diagram is created as a task, the state transition diagram can be automatically synthesized, and the labor for that can be greatly reduced. Further, as compared with the case where this operation is manually performed, erroneous combining is not performed, so that the reliability of the combining algorithm is improved.

According to the state transition diagram synthesizing apparatus of the sixth invention, in the fifth invention, the state transition diagram automatic synthesizing unit comprises a state in the first state transition diagram and a state in the second state transition diagram. Since all the combinations with the states in the transition diagram are created and are made to be all the states in the state transition diagram after the combination, in the fifth invention, the automatic composition of the state transition diagram is simply and accurately performed. Can be performed.

According to the state transition diagram synthesizing apparatus of the seventh invention, in the fifth invention, the first and second state transition diagrams include a current state, an input event, an action,
And each item of the next state, it is possible to accurately perform the automatic synthesis of the state transition diagram for each of these items.

In an eighth aspect based on the seventh aspect, the state transition diagram automatic synthesis section comprises a set of events in the first state transition diagram and a set of events in the second state transition diagram. And it is assumed that these are all events appearing in the state transition diagram after synthesis. Therefore, in the seventh invention, it is possible to simply and accurately perform automatic synthesis of the state transition diagram. Will be possible.

In a ninth aspect based on the seventh aspect, the state transition diagram automatic synthesizing section has a current state of each object as data and individually holds state transition diagram data of each object. As it is, based on the input event and the current state data of each object, the state transition diagram data of each object is dynamically searched, and there is only one algorithm that calculates the action for the event and the next state. By doing
Instead of synthesizing the first and second state transition diagrams themselves, which are the objects to be synthesized, the state transition diagrams are synthesized apparently. Automatic synthesis of transition diagrams can be performed.

According to the state transition diagram synthesizing method of the tenth aspect, the same effects as those of the first aspect can be obtained.

According to the state transition diagram synthesizing method of the eleventh aspect, the same effects as those of the second aspect can be obtained in the tenth aspect.

According to the state transition diagram synthesizing method of the twelfth aspect, the tenth aspect has the same effect as the third aspect.

According to the state transition diagram synthesizing method of the thirteenth invention, the same effects as those of the fourth invention can be obtained in the tenth invention.

According to the state transition diagram synthesizing method of the fourteenth invention, the same effects as in the fifth invention can be obtained.

According to the state transition diagram synthesizing method of the fifteenth aspect, the same effects as those of the sixth aspect can be obtained in the fourteenth aspect.

According to the state transition diagram synthesizing method of the sixteenth aspect, the fourteenth aspect has the same effect as the seventh aspect.

According to the state transition diagram synthesizing method of the seventeenth aspect, the sixteenth aspect has the same effect as the eighth aspect.

According to the state transition diagram synthesizing method of the eighteenth aspect, the same effects as those of the ninth aspect can be obtained in the sixteenth aspect.

[Brief description of the drawings]

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

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

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

FIG. 4 is a flowchart showing a detailed algorithm of step S3 in FIG. 3;

FIG. 5 is a flowchart illustrating a process of determining an initial state of a state transition table Z;

FIG. 6 is a flowchart illustrating a process of registering only a record X1 in a state transition table Z.

FIG. 7 is a flowchart showing a process for registering a record X1 in a state transition table Z.

FIG. 8 is a diagram illustrating an example of state transitions to be combined;

FIG. 9 is a diagram illustrating another example of state transitions to be combined.

FIG. 10 is a diagram showing a state transition after being synthesized using the algorithms of FIGS. 4 to 7 based on the state transition diagrams of FIGS. 8 and 9;

FIG. 11 is a flowchart showing a detailed algorithm of step S3 in FIG. 3 according to the second embodiment of the present invention.

FIG. 12 is a flowchart showing a detailed process of step S90 in FIG. 11;

FIG. 13 is a diagram illustrating an example of state transition before combining according to the second embodiment.

FIG. 14 is a diagram illustrating another example of the state transition before combining according to the second embodiment.

FIG. 15 is a diagram illustrating an example of an all-composite state list and an all-event list in the second embodiment.

FIG. 16 is a diagram illustrating an example of state transition after being synthesized based on the state transition diagrams of FIGS. 13 and 14;

FIG. 17 is a state transition diagram for all synthesized objects according to the third embodiment of the present invention.

FIG. 18 is a diagram showing a table of an object name and a current state.

[Explanation of symbols]

 DESCRIPTION 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 device interface 10 external storage device E1 computer terminal E2 input / output unit E3 event sequence storage unit E4 state transition diagram creation unit E5 state transition Diagram storage unit E6 State transition diagram automatic synthesis unit

Continuing from the front page (72) Inventor Masahiro Ogawara 3-30-2 Shimomaruko, Ota-ku, Tokyo Inside Canon Inc.

Claims (18)

[Claims] 1. A state transition diagram storage unit that stores a plurality of state transition diagrams described from several aspects for one object, and a state transition diagram stored in the state transition diagram storage unit. An automatic state transition diagram synthesizing unit, which extracts two arbitrary state transition diagrams from a plurality of state transition diagrams and automatically combines the two state transition diagrams into one state transition diagram. 2. The state transition diagram automatic synthesizing unit, for each transition record including a set of a current state, an input event, an action, and a next state, which are items constituting the two state transition diagrams, 2. The state transition diagram synthesizing apparatus according to claim 1, wherein the transition records having the same current state, the input event, and the action are determined to be the same transition. 3. The state transition diagram automatic synthesizing unit, for each transition record including a set of a current state, an input event, an action, and a next state, which are items constituting the two state transition diagrams, 2. The state transition diagram synthesizing apparatus according to claim 1, wherein a transition record having a different action even though the state of the input event is equal to the input event is determined to be a consistency error. 4. The state transition diagram automatic synthesizing unit, when a common state in the two state transition diagrams is designated from the outside or when there is no designation, an initial state of the two state transition diagrams is 2. The state transition diagram synthesizing apparatus according to claim 1, wherein it is determined that the state is common, and the synthesizing operation is started from the state. 5. One for each of the plurality of objects
A state transition diagram storage unit for storing state transition diagrams described one by one, and first and second state transitions of any two state transition diagrams from among the state transition diagrams stored in the state transition diagram storage unit A state transition diagram synthesizing apparatus, comprising: a state transition diagram automatic synthesizing unit which takes out a diagram and automatically synthesizes the first and second state transition diagrams into one state transition diagram. 6. The state transition diagram automatic synthesizing unit according to claim 1,
6. Create all combinations of the states in the state transition diagram and the states in the second state transition diagram, and make them all the states in the state transition diagram after synthesis. State transition diagram synthesizer. 7. The state transition diagram according to claim 5, wherein the first and second state transition diagrams include items of a current state, an input event, an action, and a next state. Synthesizer. 8. The state transition diagram automatic synthesizing unit according to claim 1,
A logical sum of the set of events in the state transition diagram and the set of events in the second state transition diagram, and regards them as all events appearing in the combined state transition diagram. The state transition diagram synthesizing apparatus according to claim 7, characterized in that: 9. The state transition diagram automatic synthesizing unit has a current state of each object as data, and holds an input event and a current state of each object while holding state transition diagram data of each object individually. Based on the state data, the state transition diagram data of each object is dynamically searched, and the first and second objects to be combined are provided by having only one algorithm for calculating an action for an event and a next state. 8. The state transition diagram synthesizing apparatus according to claim 7, wherein the state transition diagram is synthesized apparently instead of synthesizing the second state transition diagram itself. 10. A state transition diagram storing process for storing a plurality of state transition diagrams described from several aspects for one object, and in the state transition diagram stored by the state transition diagram storing process. A state transition diagram synthesizing method, wherein two arbitrary state transition diagrams are extracted from the group, and the two state transition diagrams are automatically synthesized to form a single state transition diagram. 11. The state transition diagram automatic synthesizing process includes a current state, an item constituting the two state transition diagrams,
11. For each transition record including a set of an input event, an action, and a next state, a transition record having the same current state, the input event, and the action is determined to be the same transition. The described state transition diagram synthesis method. 12. The state transition diagram automatic synthesizing process includes a current state, an item constituting the two state transition diagrams,
For each transition record consisting of a set of an input event, an action, and a next state, a transition record having a different action even though the current state and the input event are equal is determined to be an integrity error. The method for synthesizing a state transition diagram according to claim 10, characterized in that: 13. The automatic state transition diagram synthesis process according to claim 1, wherein when a common state is externally designated in said two state transition diagrams or when no common state is designated, an initial state of said two state transition diagrams is 11. The state transition diagram synthesizing method according to claim 10, wherein it is determined that they are common, and the synthesizing operation is started with the state as a starting point. 14. A state transition diagram storing process for storing a state transition diagram described one by one for each of a plurality of objects, and a state transition diagram stored in the state transition diagram storing process. An arbitrary two state transition diagrams are extracted as first and second state transition diagrams, and the first and second state transition diagrams are automatically synthesized to form a single state transition diagram. A method for synthesizing a state transition diagram, which is performed. 15. The state transition diagram automatic synthesizing process creates all combinations of the states in the first state transition diagram and the states in the second state transition diagram, and combines them in the state after synthesis. 2. The method according to claim 1, wherein all states of the transition diagram are set.
4. The method for synthesizing a state transition diagram according to 4. 16. The state transition diagram according to claim 14, wherein the first and second state transition diagrams are composed of items of a current state, an input event, an action, and a next state. Synthesis method. 17. The state transition diagram automatic synthesizing process forms a logical sum of a set of events in the first state transition diagram and a set of events in the second state transition diagram. 17. The state transition diagram synthesizing method according to claim 16, wherein all of the events appearing in the state transition diagram are determined. 18. The state transition diagram automatic synthesizing process includes the steps of holding an input event and the current state of each object while holding the state transition diagram data of each object individually as data. Based on the state data, the state transition diagram data of each object is dynamically searched, and the first and second objects to be combined are provided by having only one algorithm for calculating an action for an event and a next state. 17. The state transition diagram synthesizing method according to claim 16, wherein the state transition diagram is synthesized in appearance rather than synthesizing the second state transition diagram itself.