JP2008198103A - State transition diagram preparing device and state transition diagram preparing method - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a state transition diagram preparing device and a state transition diagram preparing method for automatically preparing a state machine diagram from source codes. <P>SOLUTION: A list preparing means 5 analyzes the source codes A, specifies a corresponding relationship between code lines, and prepares a transition list D in which a state before transition is associated with a state after transition based on the correspondence, state declaration annotation and condition declaration annotation. The state declaration annotation indicates the state after change and is applied to a state change code line. The condition declaration annotation indicates the state before change by control and is applied to a control code line. A state machine diagram plotting means 4 prepares a state machine diagram (a state transition diagram) E based on the transition list D. <P>COPYRIGHT: (C)2008,JPO&INPIT

Description

  The present invention relates to a state transition diagram creation device and a state transition diagram creation method, and more particularly to a state transition diagram creation device and a state transition diagram creation method for creating a state transition diagram (state machine diagram) from source code.

  Conventionally, much source code development is performed using state machine diagrams. The “state machine diagram” is synonymous with a state chart (FIG.) And a state transition diagram.

  When source code is created based on a state machine diagram that does not accurately reflect the developer's intention (design information), the processing based on the source code deviates from the design information, and the state transition is inconsistent. Arise. Developers do not know at a glance the inconsistency that occurs in state transitions.

  One way to solve this problem is to reverse the state machine diagram from the source code and check for specification errors based on the state machine diagram. “Reverse” means that, in the development process, the result of the previous process is created from the result of the subsequent process with respect to the normal work of creating the result of the subsequent process from the result of the previous process.

  Note that Patent Document 1 describes a procedure for reversing a state machine diagram from an event sequence.

Also, UML (Unified Modeling Language) model description tools such as Borland's “Togetther” and ChangeVision's “JUDE” have a function of reversing the source code to the UML notation model. .
Japanese Patent Laid-Open No. 11-24900

  Patent Document 1 does not describe a method or apparatus for generating a state machine diagram by reversing from a source code.

  In addition, in the model description tools of UML notation such as “Togetther” of Borland and “JUDE” of Change Vision, the types of models that can be generated are class diagrams that represent the classes that make up the program and their relationships. It is limited to sequence diagrams and communication diagrams representing the flow of processing, and there is no tool for reversing state machine diagrams representing state transitions from source code.

  For this reason, the developer has to manually analyze the source code and the design document and draw the state machine diagram, and has a drawback that a mistake occurs and takes time.

  An object of the present invention is to provide a state transition diagram creating apparatus and a state transition diagram creating method capable of automatically creating a state machine diagram (state transition diagram) from source code.

  In order to achieve the above object, a state transition diagram creating apparatus of the present invention includes a plurality of code lines that define processing using a state as a variable, and a state change code line that represents a change in state among the plurality of code lines. And a state declaration annotation that represents the state after the change, and a condition declaration that represents the state before the change by the control, which is assigned to a control code line that represents control over the state among the plurality of code lines. A state transition diagram creation device for creating a state transition diagram from source code having annotations, wherein the source code is analyzed to identify a correspondence relationship between the code lines, and the correspondence relationship and the state A list creation means for creating a transition list in which a state before transition and a state after transition are associated with each other based on the declaration annotation and the condition declaration annotation; Based on the serial transition list, including a state transition diagram creating means for creating the state transition diagram.

  Further, the state transition diagram creating method of the present invention is provided with a plurality of code lines that define processing using a state as a variable, and a state change code line representing a change in state among the plurality of code lines, A source having a state declaration annotation representing a state after a change, and a condition declaration annotation representing a state before the change by the control, which is given to a control code line representing a control for the state among the plurality of code lines A state transition diagram creation method performed by a state transition diagram creation device that creates a state transition diagram from code, wherein the source code is analyzed to identify a correspondence between the code lines, and the correspondence Based on the state declaration annotation and the condition declaration annotation, a list creation step for creating a transition list that associates the state before transition with the state after transition. Including a flop, on the basis of the transition list, and the state transition diagram generating step of generating the state transition diagram, the.

  The state declaration annotation represents the state after the change, and is attached to the state change code line indicating the state change. The condition declaration annotation represents the state before the change by the control, and is given to the control code line representing the control for the state.

  From the correspondence between code lines, it is possible to specify the flow of processing when state change processing corresponding to multiple code lines is performed, and the state change at that time is determined by state declaration annotations and condition declarations It is possible to specify using annotation.

  For this reason, according to the above-described invention, based on the correspondence between the code lines, the state declaration annotation, and the condition declaration annotation, the transition of the state change when processing according to a plurality of code lines is performed. It becomes possible to specify. Therefore, it is possible to create a transition list that associates the state before transition with the state after transition, and it is possible to create a state transition diagram based on the transition list.

  Therefore, it is possible to create a state transition diagram from the source code to which the state declaration annotation and the condition declaration annotation are added.

  Therefore, the user can verify the correctness of the implementation of the source code by comparing the state transition diagram created from the source code with the design information.

  Further, since the state transition diagram can be automatically created from the source code, an artificial mistake can be prevented, and the state transition diagram can be created in a short time.

  The list creation means analyzes the source code to identify a code line nesting structure and the control code line in the source code, and from the source code based on the nesting structure and the control code line Extracting a plurality of control blocks and a condition for entering the control block, identifying a control block tree structure for the control block based on the nested structure, and specifying the condition in the control block tree structure Before the control block can be taken for each control block based on the control structure analysis means to be added to the control block corresponding to the condition, and the state declaration annotation, the condition declaration annotation, and the control block tree structure An in-state list representing the state and an out-state representing a later state that the control block can take. A state analysis, and adding a corresponding in-state list and out-state list to each control block in the control block tree structure to create a control block tree structure with in / out states And a transition analysis unit that creates the transition list based on the control block having the state declaration annotation based on the in-state list, the out-state list, and the condition declaration annotation of the control block. desirable.

  According to the above invention, it is possible to create a state transition diagram with high accuracy.

  According to the present invention, it is possible to automatically create a state transition diagram from source code.

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

  FIG. 1 is a block diagram showing a state machine diagram reverse device 100 according to an embodiment of the present invention.

  The state machine diagram reverse device 100 is an example of a state transition diagram creation device, and generates a state machine diagram E with the source code A with annotations as an input.

  The state machine diagram reverse device 100 includes a control structure analysis unit 1, a state analysis unit 2, a transition analysis unit 3, and a state machine diagram drawing unit 4. As an intermediate product, a control block tree structure B, an in / out state The attached control block tree structure C and the transition list D are generated. The control structure analyzing means 1, the state analyzing means 2, and the transition analyzing means 3 constitute a list creating means 5.

  FIG. 2 is an explanatory diagram showing an example of source code A with annotation.

  The source code A is an annotated program or a part of an annotated program.

  The source code A is composed of three elements, specifically, a state declaration annotation, a condition declaration annotation, and a code part in which business logic is described (a code part not corresponding to the above two types of annotations). .

  The code part is composed of a plurality of code lines that define processing using a state as a variable.

  A state declaration annotation “// @ state =...” Representing the state after the change is given to the state change code line “state =...” Representing the state change.

  Specifically, a state declaration annotation “// @ state = initial” is given to the state change code line “int state = 0”. In addition, the state change annotation “// @ state = prepare” is displayed in the state change code line “state = prepare ()”, and the state declaration annotation “// @ state =” is displayed in the state change code line “state = go ()”. go.first ”is the state declaration annotation“ //@state=go.second ”in the state change code line“ state = next () ”, and the state declaration annotation is in the state change code line“ state = end () ”. “// @ state = end” is assigned.

  The control code line “for example, if (state ==...)” Indicating the control for the state is given the condition declaration annotation “// @ condition =...” Indicating the state before the change by the control. .

  For example, the condition declaration annotation “// @ condition = prepare” is given to the control code line “if (state == 1)”.

  The control structure analysis means 1 analyzes the source code A, and specifies a control unit (specifically, conditional branch (if statement) and repetition (while statement, for statement)) and nested structure in the source code A To do. Note that the control unit includes a control code line representing control over the state.

  The control structure analyzing unit 1 extracts a plurality of control blocks from the source code A based on the control unit and the nested structure in the source code A. The control block is a program fragment divided from the source code A based on the control unit and the nested structure.

  Note that the notation of the else clause (a block that is executed when none of the conditions of the if statement are satisfied) may be omitted depending on the programming language, and therefore the control structure analyzing unit 1 also relates to the omitted else clause. Define a control block that does not involve any processing.

  FIG. 3 is an explanatory diagram showing an example of the source code A divided into a plurality of control blocks by the control structure analyzing means 1.

  The control structure analyzing unit 1 analyzes the nested structure of each control block, constructs a tree structure of the control block, and performs a process of setting the tree structure as a control block tree structure B.

  The control structure analyzing means 1 uses a line connecting the parent control block and the child control block as an edge, and the edge is classified into one of “exclusive”, “repetition”, or NULL, and the child control block. A label indicating a condition for moving is provided as an attribute.

  The control structure analyzing unit 1 extracts a condition for transferring control to the child control block from the source code A based on the nested structure and the control code line.

  FIG. 4 is an explanatory diagram showing an example of the control block tree structure B created by the control structure analyzing means 1 for each control block of the source code A shown in FIG.

  The state analysis means 2 searches the control block tree structure B in depth-first order by sequentially tracing the source code A, and for each control block, the position on the tree structure, the state declaration annotation, and the condition declaration annotation Based on the above, an in state list and an out state list are created.

  The state analysis means 2 performs processing for adding the in state list and the out state list to each control block corresponding to the lists and creating a control block tree structure C with in / out states.

  The in-state list is a list showing the states that can be taken when control enters the control block corresponding to the list, and the out-state list can be taken when control is output from the control block corresponding to the list. It is a list showing the state.

  FIG. 5 is an explanatory diagram showing an example of a control block tree structure C with in / out states created by the state analysis unit 2 for the control block tree structure B shown in FIG.

  For each control block having a state declaration annotation, the transition analysis means 3 determines the event, the condition, the state before the transition based on the code in the control block, the in-state list, the out-state list, and the condition declaration annotation. The state after the transition is specified, and the transition list D is created.

  FIG. 7 is an explanatory diagram showing an example of the transition list D created by the transition analysis means 3 for the control block tree structure C with in / out states shown in FIG.

  As shown in FIG. 7, the transition list D includes a transition number, an event, a condition, a state before transition, and a state after transition.

  The state machine diagram drawing unit 4 is an example of a state transition diagram creation unit, and creates a state machine diagram based on the transition list D. Specifically, the state machine diagram drawing unit 4 draws each state, start state, and end state in the transition list D on the state machine diagram, and for each transition in the transition list D, before the transition. The process of drawing the transition from the state to the state after the transition is performed.

  FIG. 8 is an explanatory diagram showing an example of a state machine diagram E created by the state machine diagram drawing means 4 for the transition list D shown in FIG.

  The list creation means 5 analyzes the source code A to identify the correspondence between code lines (for example, the parent-child relationship in the code line), and based on the correspondence, the state declaration annotation, and the condition declaration annotation Thus, a transition list D is created in which the state before transition and the state after transition are associated with each other.

  Next, the operation will be described.

  FIG. 9 is a flowchart for explaining the operation of the state machine diagram reverse apparatus 100. Hereinafter, the overall operation of this embodiment will be described in detail with reference to the flowchart of FIG.

  In the following description, an operation for creating a state machine diagram from the source code A shown in FIG. 2 will be described. However, the source code is not limited to that shown in FIG.

  The control structure analysis means 1 parses the source code A, first extracts a plurality of control blocks from the source code A based on the nested structure of the source code A, and then converts these control blocks into conditional branches (if Sentence) and repetition (while sentence, for sentence), etc.

  Specifically, the control structure analyzing means 1 first extracts the control block a and the control block in which the control blocks b1 to b3 are combined from the source code A based on the nested structure, and then the control unit Based on the control block, the control block including the control blocks b1 to b3 is divided into the control block b1, the control block b2 (control unit), and the control block b3, and the control blocks b1 to b3 are extracted.

  Subsequently, the control structure analyzing means 1 also includes a plurality of control blocks (control block b2-1, control block b2-2, control block c1, control block) based on the nested structure in the control unit (control block b2). c2, control block c3, control block c4, control block e1, control block e2, and control block e3) and extract them (step a).

  With the operation so far, the plurality of control blocks shown in FIG. 3 are extracted.

  Subsequently, the control structure analyzing unit 1 analyzes the nested structure of each control block to form a tree structure, and sets the tree structure as a control block tree structure B.

  At that time, when the control block starts at the control unit, the control structure analyzing means 1 sets the condition for the control to be transferred to the child control block as the relationship between the parent control block and the child control block. It is described in the edge label, and the edge type is also changed according to exclusion and repetition.

  If a condition declaration annotation is described in the condition, the control structure analyzing unit 1 also describes the contents of the condition declaration annotation by connecting “and” to the label (step b).

  With the operation so far, the control block tree structure B shown in FIG. 4 is created.

  Subsequently, the state analysis unit 2 sets the target block as the parent control block (control block a) and creates an empty previous out state list (step c).

The state analysis means 2 searches the target block and creates an in state list and an out state list. The state analysis means 2 searches all the control block tree structure B, and assigns the in state list and the out state list to all the control blocks in the control block tree structure B. Tree structure C (step d)
FIG. 10 is a flowchart for explaining processing for creating an in state list and an out state list.

  Hereinafter, the method of the in state list and the out state list will be described with reference to FIG.

  First, if there is no in state list and out state list of the control block that is the target block, the state analyzing unit 2 creates an empty in state list and out state list (step d1).

  Subsequently, the state analysis unit 2 additionally registers the value of the previous out state list in the in state list of the control block that is the target block (step d3).

  Subsequently, the state analysis means 2 sets the variables i and j corresponding to the target block to 0 (step d101), and sequentially scans the fragments of the source code A corresponding to the control block that is the target block from the beginning to the end. (Steps d102A to d102B) and the following processing is performed during the scanning.

  When the state declaration annotation is reached (step d103) (for example, the control block e1 in FIG. 5), the state analysis unit 2 determines that the state transition is made and registers one value of the state declaration annotation in the out state list. When there are a plurality of state declaration annotations, the state analysis unit 2 replaces the value of the out state list with the value of a new state declaration annotation each time (step d4). Thereafter, the state analysis means 2 adds 1 to the variable i corresponding to the target block (step d104).

  When the child control block is reached without reaching the state declaration annotation (steps d103 and d105) (for example, the control block c4 in FIG. 5), the state analysis unit 2 adds 1 to the variable j corresponding to the target block. (Step d106), then, the child control block is set as the target block (Step d107), and the process of Step d is performed. When the relationship between the searched control block and the child control block is repeated, the state analyzing means 2 sequentially repeats the search for the child control block until the out state list of the last child does not change (step d ′). ).

  On the other hand, when the state declaration annotation is not found (step d103), the state analysis unit 2 performs the following process while holding the variable i = 0.

  If the control block has no child control block (step d105) (for example, control block e3 in FIG. 5), j = 0 is also held, and the state analysis means 2 passes through steps d108 and d109, The value is registered as it is in the out state list (step d5).

  When having a child control block (in this case, j ≠ 0) and the type of edge with the child control block is exclusive (for example, control block c4 in FIG. 5), the state analysis means 2 performs step Through d108, d109 and d110, each state (value) in the out state list of the child control block is added to the out state list of the control block one at a time (step d6).

  If there is a child control block (in this case, j ≠ 0), and the type of edge with the child control block is repetitive (for example, control block c2 in FIG. 5), the state analysis means 2 Through d108, d109, d110, and d111, each state of the in-state list of the control block and each state of the out-state list of the child control block are combined one by one and registered in the out-state list of the control block (step d10).

  If there is a child control block (in this case, j.noteq.0) and the edge type between them is neither exclusive nor repeated (for example, control block a in FIG. 5), the state analysis means 2 performs steps d108 and d109. , D110 and d111, the value of the out state list of the last child control block is registered in the out state list of the control block (step d7).

  When the type of edge between the searched control block and its parent control block is exclusive (step d112) (for example, control block e3 in FIG. 5), the state analysis means 2 displays the in-state list of the control block. Is copied to the previous out state list (step d8).

  If the type of edge between the searched control block and its parent control block is not exclusive (step d112) (for example, control block c3 in FIG. 5), the state analysis means 2 determines the value of the out state list of the control block. Is copied to the previous out state list (step d9).

  The control block tree structure C with in / out states shown in FIG. 5 is created by the operations so far.

  FIG. 11 is an explanatory diagram showing a flow in which the process of the flowchart shown in FIG. 10 is applied to each control block.

  The transition analysis means 3 initializes the transition list D and keeps it as an empty list.

  The transition analysis unit 3 assigns serial numbers as transition numbers in the order in which transitions are added to the transition list D.

  When the transition analysis means 3 scans the corresponding source code A fragment for each control block and finds the state declaration annotation, the transition analysis means 3 sets each state in the in-state list of the control block as the state before transition, A transition having the state described by the declaration annotation as the state after the transition is added to the transition list D, and the in-state list is updated to the state described by the state declaration annotation.

  The transition analysis means 3 continues scanning until the corresponding fragment of the source code A ends.

  The transition analysis unit 3 describes the operation name (function name: specifically, prepare, go, next, end) described in the line in which the state declaration annotation is described in the transition event.

  Further, when adding the transition of the first state of the control block to the transition list D, the transition analysis unit 3 traces all the parents of the tree structure and sets all the labels described in the edges as “and” as a transition condition. Describe what is connected.

  Next, the transition analysis unit 3 is a situation where a state is described in the condition in the transition list D, and the state does not match the condition before the transition (the state shown in the condition declaration annotation) (for example, FIG. 7), the transition is deleted from the transition list D (step e).

  FIG. 6 is a diagram illustrating the control block tree structure C with in / out state after the transition analysis unit 3 executes step e on the control block tree structure C with in / out state of FIG. FIG.

  The state machine diagram drawing means 4 sequentially orders the start state, the state described in the state before the transition of each transition in the transition list D, the state described in the state after the transition, and the end state in order. For example, they are arranged in one vertical row or one horizontal row.

  However, if the state is divided by periods, the state machine diagram drawing means 4 determines that the state is a composite state and describes the state in a nested manner.

  The state machine diagram drawing means 4 arranges the start state and the end state one by one in the composite state (step f).

  Next, the state machine diagram drawing unit 4 performs connection from the state before the transition to the state after the transition, with the event and the condition as a label in a format determined by UML, for each transition in the transition list.

  When the transition before the state is NULL, the state machine diagram drawing unit 4 sets the transition from the start state.

  When the transition after the state is NULL, the state machine diagram drawing unit 4 sets the transition to the end state.

  In the case of transition from the outside to the inside of the composite state, the state machine diagram drawing means 4 describes the transition to the composite state, and also describes the transition from the start state to the state after the transition in the composite state.

  The state machine diagram drawing means 4 draws the condition as a label of the former transition.

  In the case of the transition from the inside of the composite state to the outside, the state machine diagram drawing means 4 describes the transition from the state before the transition to the end state within the composite state, and also the transition from the composite state to the state after the transition. Describe.

  The state machine diagram drawing means 4 draws the condition as a label for the latter transition (step g).

  According to the present embodiment, based on the correspondence between code lines, the state declaration annotation, and the condition declaration annotation, the transition of the state change when processing corresponding to a plurality of code lines is specified. It becomes possible. Therefore, it is possible to create a transition list that associates the state before transition with the state after transition, and it is possible to create a state transition diagram based on the transition list.

  According to the present embodiment, the following effects can be obtained.

  The first effect is that it is possible to verify whether the source code is implemented as designed.

  The reason is that it is difficult for humans to easily grasp the state transition on the source code, but humans can judge the correctness of implementation by comparing design information with the state machine diagram reversed by this embodiment. Because.

  The second effect is that the accuracy and development productivity relating to the creation of the state machine diagram are improved.

  The reason is that manually writing the state transition diagram from the source code caused mistakes and took time, but the present invention can automatically create a state machine diagram from the source code, reducing man-hours. Because.

  In the embodiment described above, the illustrated configuration is merely an example, and the present invention is not limited to the configuration.

For example, according to the programming language specifications,
(1) When there is a possibility that the loop does not enter repeatedly as shown in FIG. 3 (while statement, etc.)
(2) Be sure to enter the loop once (such as do-while statement)
(3) When the number of repetitions is fixed (for example, when the number of repetitions is a constant in a for statement)
Therefore, the list creating unit 5 analyzes the annotation.

  For example, in the case of (2), the list creation unit 5 (state analysis unit 2) executes a processing flow that passes through step d7 instead of step d10, and in the case of (3), determines the number of repetitions of step d ′. By repeating step d ′ by that number, an accurate state machine diagram can be obtained.

  Moreover, the state machine diagram reverse device 100 may be realized by a computer that operates according to a program.

In this case, the control structure analysis unit 1, the state analysis unit 2, the transition analysis unit 3, and the state machine diagram drawing unit 4 are realized by a computer that reads and executes a program that defines the operation of the state machine diagram reverse device 100. .
(Fields where the invention can be used)
If the present invention is used, the state machine diagram is automatically generated and used for verification of the state transition as long as the annotation about the state is described in the source code of the software developed until implementation. It is possible to apply to usages such as.

1 is a block diagram showing a state machine diagram reverse apparatus 100 according to an embodiment of the present invention. It is explanatory drawing which showed an example of the source code A with an annotation. It is explanatory drawing which showed the example of the source code A divided | segmented into the some control block. It is explanatory drawing which showed the example of the control block tree structure B. FIG. It is explanatory drawing which showed the example of the control block tree structure C with an in / out state. It is explanatory drawing which showed the example of the control block tree structure C with the corrected in / out state. 6 is an explanatory diagram showing an example of a transition list D. FIG. It is explanatory drawing which showed the example of state machine figure E. FIG. FIG. 10 is a flowchart for explaining the operation of the state machine diagram reverse apparatus 100. FIG. FIG. 10 is a flowchart for explaining the operation of the state machine diagram reverse apparatus 100. FIG. FIG. 7 is an explanatory diagram for explaining the operation of the state machine diagram reverse device 100.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 Control structure analysis means 2 State analysis means 3 Transition analysis means 4 State machine diagram drawing means 5 List creation means 100 State machine diagram reverse apparatus

Claims (4)

A plurality of code lines that define processing using a state as a variable, and a state declaration annotation that represents a state after the change, given to a state change code line that represents a change in the state among the plurality of code lines; A state transition diagram for creating a state transition diagram from a source code having a condition declaration annotation representing a state before the change by the control, which is given to a control code line representing a control for a state among the plurality of code lines. A creation device,
Analyzing the source code to identify the correspondence between the code lines, and based on the correspondence, the state declaration annotation, and the condition declaration annotation, the state before transition and the state after transition A list creation means for creating a transition list corresponding to
A state transition diagram creating device including state transition diagram creating means for creating the state transition diagram based on the transition list. In the state transition diagram creation device according to claim 1,
The list creation means includes:
Analyzing the source code to identify a code line nesting structure and the control code line in the source code, and based on the nesting structure and the control code line, from the source code, a plurality of control blocks; and And a condition for entering the control block is extracted, a control block tree structure related to the control block is specified based on the nested structure, and the condition is a control block corresponding to the condition in the control block tree structure. Control structure analysis means to be added to,
Based on the state declaration annotation, the condition declaration annotation, and the control block tree structure, for each control block, an in-state list representing a state before the control block can take, and a state after the control block can take And a control block tree structure with an in / out state is created by adding the corresponding in state list and the out state list to each control block in the control block tree structure. State analysis means to perform,
A state transition diagram creation for the control block having the state declaration annotation, including transition analysis means for creating the transition list based on the in-state list, the out-state list, and the condition declaration annotation of the control block apparatus. A plurality of code lines that define processing using a state as a variable, and a state declaration annotation that represents a state after the change, given to a state change code line that represents a change in the state among the plurality of code lines; A state transition diagram for creating a state transition diagram from a source code having a condition declaration annotation representing a state before the change by the control, which is given to a control code line representing a control for a state among the plurality of code lines. A state transition diagram creation method performed by a creation device,
Analyzing the source code to identify the correspondence between the code lines, and based on the correspondence, the state declaration annotation, and the condition declaration annotation, the state before transition and the state after transition A list creation step for creating a transition list corresponding to
A state transition diagram creating step for creating the state transition diagram based on the transition list; In the state transition diagram creation method according to claim 3,
The list creation step includes:
Analyzing the source code to identify a code line nesting structure and the control code line in the source code, and based on the nesting structure and the control code line, from the source code, a plurality of control blocks; and And a condition for entering the control block is extracted, a control block tree structure related to the control block is specified based on the nested structure, and the condition is a control block corresponding to the condition in the control block tree structure. Control structure analysis step to be added to,
Based on the state declaration annotation, the condition declaration annotation, and the control block tree structure, for each control block, an in-state list representing a state before the control block can take, and a state after the control block can take And a control block tree structure with an in / out state is created by adding the corresponding in state list and the out state list to each control block in the control block tree structure. A state analysis step to perform,
Creating a state transition diagram for a control block having the state declaration annotation, including a transition analysis step for creating the transition list based on an in-state list, an out-state list, and a condition declaration annotation of the control block Method.

Images