JP6197667B2 - Source code creation device, source code creation program - Google Patents

Description

  The present invention relates to a source code creation device and a source code creation program.

  When it is determined as a first determination process for determining whether it is a single process or other process (composite process), a third determination process for determining whether there is a composite process for notifying completion, or a composite process In addition, when it is determined as the second determination process or sub process for determining whether the process is a fork join process or a sub process, any process is performed when it is determined as the first recognition process or sub process for recognizing the process to be executed first Second recognition process for recognizing whether it is being executed, fourth determination process for determining whether there is a process to be executed next to the process being executed, and subsequent to the process being executed when the sub-process is executed A plurality of processes to be executed, a fifth determination process for determining which process to execute next, a third recognition process for recognizing a plurality of processes forked in the fork join process, and each forked End of processing Source code generation instrumentation which adds the join process to Yoin the source code has been known (Patent Document 1).

JP 2010-198457 A

In the prior art, in order to realize the fork and join in the activity diagram, a process (synchronization process) is used in which the process branched by the fork is waited for completion by the join. As a result, there is a restriction that a process forked with one fork must be joined with one join.
It is an object of the present invention to provide a source code creation device and a source code creation program that eliminate this restriction.

In order to solve the above problem, a source code creation device according to claim 1 is provided.
An acquisition means for acquiring an arbitrary element in an activity diagram including a wait / branch process, a selection process, an execution process, and an end process;
First determination means for determining (R1) whether the element acquired by the acquisition means is a wait / branch process, a selection process, an execution process, or an end process;
First appending means for appending a source code corresponding to the result determined by the first determining means to a predetermined file;
When the first determination means determines that the process is a wait / branch process, the element adds a source code corresponding to a fork selector for identifying (R2) an element that branches after completion of the wait to a predetermined file. A second appending means,
If the first determination means determines that the process is a wait / branch process, the element adds a source code corresponding to a join selector for identifying (R3) the element to be waited to be added to a predetermined file. With additional writing means,
A fourth additional write in which a source code corresponding to a decision selector for identifying (R4) an element that is determined to be selected by the first determination means is added to a predetermined file. Means,
A second determination unit that determines (R5) whether the activity is a single activity or a sub-activity when the first determination unit determines that the activity is an activity;
When the second determination means determines that the activity is a sub-activity, the element additionally adds a source code for identifying an activity to be performed first (R7) to a predetermined file;
A fifth appending means for appending a source code for identifying (R6) an element to be executed next to a predetermined file when the element is determined to be an activity by the first determining means;
A source code for identifying a sub-activity for which the element notifies the end (R8) when the first determining means determines that the end is detected; and for identifying the sub-activity as a notification destination when there is the identified sub-activity And, if not, an eighth appending means that does not append.
It is characterized by that.

In order to solve the above problem, a source code creating program according to claim 2 is provided:
Computer
An acquisition means for acquiring an arbitrary element in an activity diagram including a wait / branch process, a selection process, an execution process, and an end process;
First determination means for determining (R1) whether the element acquired by the acquisition means is a wait / branch process, a selection process, an execution process, or an end process;
First appending means for appending a source code corresponding to the result determined by the first determining means to a predetermined file;
When the first determination means determines that the process is a wait / branch process, the element adds a source code corresponding to a fork selector for identifying (R2) an element that branches after completion of the wait to a predetermined file. A second appending means,
If the first determination means determines that the process is a wait / branch process, the element adds a source code corresponding to a join selector for identifying (R3) the element to be waited to be added to a predetermined file. With additional writing means,
A fourth additional write in which a source code corresponding to a decision selector for identifying (R4) an element that is determined to be selected by the first determination means is added to a predetermined file. Means,
A second determination unit that determines (R5) whether the activity is a single activity or a sub-activity when the first determination unit determines that the activity is an activity;
When the second determination means determines that the activity is a sub-activity, the element additionally adds a source code for identifying an activity to be performed first (R7) to a predetermined file;
A fifth appending means for appending a source code for identifying (R6) an element to be executed next to a predetermined file when the element is determined to be an activity by the first determining means;
A source code for identifying a sub-activity for which the element notifies the end (R8) when the first determining means determines that the end is detected; and for identifying the sub-activity as a notification destination when there is the identified sub-activity Is added, and if not, it is made to function as an eighth additional writing means not to add,
It is characterized by that.

According to the first aspect of the present invention, activity information indicating an activity diagram composed of elements including a waiting / branch process, a selection process, and an execution process, and a process indicated by the activity diagram from the source code corresponding to the element It is possible to provide a source code creation device that creates source code for performing the above without any restrictions.
According to the second aspect of the present invention, activity information indicating an activity diagram including elements including a wait / branch process, a selection process, and an execution process, and a process indicated by the activity diagram from the source code corresponding to the element It is possible to provide a source code creation program for creating a source code for performing the above without restriction.

2 is a block diagram illustrating an example of a functional configuration of a source code creation device 1. FIG. (A) is an example of a waiting / branching process, (b) is a figure which shows an example of a selection process. It is a class diagram which shows the model which concerns on embodiment. 4 is a flowchart showing a flow of source code creation by the source code creation device 1. It is a figure which shows an example of the activity diagram of the process which cannot produce a source code from the operation | movement described by the activity diagram. It is a class diagram which shows a model of a prior art.

Next, the present invention will be described in more detail with reference to the drawings with reference to embodiments and specific examples. However, the present invention is not limited to these embodiments and specific examples.
Moreover, in the description using the following drawings, the drawings are schematic, and illustrations other than elements necessary for the description are appropriately omitted for easy understanding.

(1) Overall Configuration of Source Code Creation Device FIG. 1 is a block diagram showing an example of a functional configuration of a source code creation device 1 according to this embodiment.
The source code creation device 1 includes a CPU (Central Processing Unit) 10, a ROM (Read Only Memory) 11, a RAM (Random Access Memory) 12, a HDD (Hard Disk Drive) 13, a network I / F unit 20, and an operation information unit 30. The bus 40 is included.

The CPU 10 governs the overall operation of the source code creation device 1, and a flowchart showing processing of the source code creation device 1 described later is executed by the CPU 10.
The ROM 11 is a non-volatile storage device that stores a boot program that operates when the source code creation device 1 is activated.
The RAM 12 is a volatile storage device in which an OS (Operating System), programs, and various data are expanded.
The HDD 13 is a non-volatile storage device that stores each database, a program such as a source creation program, an OS, and the like.

  The network I / F unit 20 is for connecting to a network and includes a NIC (Network Interface Card) and a driver. The operation information unit 30 is configured by combining a liquid crystal display panel, various operation buttons, a touch panel, and the like, and is used when a user (operator) inputs operations and information of the source code creation device 1. Further, information regarding the source code creation device 1 is displayed to the user (operator). The bus 40 is used when information is exchanged.

(2) Description of operation by activity diagram FIG. 2 (a) is an example of waiting / branching processing, (b) is a diagram showing an example of selection processing, and FIG. It is a figure which shows an example of the activity diagram of the process which cannot produce a source code.
In the following, description of operations and creation of source codes by activity diagrams will be described with reference to the drawings.

(2.1) Activity Diagram A Unified Modeling Language (UML) can be used to describe the system, and UML provides a series of methods for describing the system. One such method is the use of activity diagrams.
The activity diagram describes the system from the viewpoint of activities (processing) and the control flow between activities.

FIG. 2A shows an element of an activity diagram called a wait / branch (join / fork) node. In this example, the join / fork node 110 describes the relationship among the Activity 11 in Step S101, the Activity 14 in Step S104, the Activity 12 in Step S102, and the Activity 13 in Step S103.
In other words, the fork node 110 indicates a branch process in which Activity 12 and Activity 13 are started simultaneously after waiting for completion of Activity 11 and Activity 14.

FIG. 2B shows an element of an activity diagram called a decision (decision) node. Here, the decision node 130 describes the relationship among the activity 31 in step S131, the activity 32 in step S132, and the activity 33 in step S133.
That is, the decision node 130 indicates that only one of the activities 32 and 32 is started when the activity 31 is completed. Which of the Activity 32 and the Activity 33 is started is determined by a logic condition associated with the decision node 130. For example, whether certain parameters of the system are above or below some predetermined value.

In the UML activity diagram, although the forked activity element and the waiting (join) can be described independently, in the prior art, the activity element branched (forked) from one parallel execution (fork / join) However, there is a restriction in the case of joining (join) by another parallel execution (fork / join).
For this reason, there is a part where source code cannot be created from the operations described in the activity diagram shown in FIG.

Specifically, in the activity diagram of FIG. 5, Activity A and Activity B forked from fork node 210 must join to the same fork / join node 220, and Activity B is joined to fork / join node 250. I couldn't.
Similarly, Activity C, Activity D, and Activity E forked from fork / join node 220 must join to the same fork / join node 240, and Activity E could not be joined to fork / join node 230. .

(2.2) Class Diagram FIG. 3 is a class diagram showing a model according to the present embodiment, FIG. 4 is a flowchart showing a source code creation flow according to the present embodiment, and FIG. 6 is a class diagram showing a prior art model. is there.
Before describing the design pattern according to the present embodiment, a source code creating apparatus described in the prior art will be described as a comparative example with reference to FIG.

R9 shown in FIG. 6 indicates that there are two types of Activity objects 50: a single Activity object 52 and a composite Activity object 54 that is other than that.
Also, R10 shown in FIG. 5 indicates that there are two types of composite activity objects 54: fork join activity objects 56 and sub-activity objects 58.

  The source code creation device of the comparative example first adds the source code corresponding to the temporary sub-activity to a predetermined file regardless of the description of the activity diagram.

  Next, the source code of the sequence object 68 for making the activity element acquired first the activity (R2) to be executed at the beginning of the temporary subactivity is added, and the temporary subactivity is set as the end notification destination (R7). Add source code.

If the next acquired Activity element exists, the source code of the order object 68 for making it the Activity (R8) to be executed next is added, and the provisional sub-Activity is set as the end notification destination (R7). Add source code.
If it does not exist, the source code of the order object 68 indicating that there is no activity (R8) to be executed next is added, and the processing is terminated.

  Next, it is determined whether the acquired Activity element is a single activity or a composite activity. If it is a single activity, a source code corresponding to the single activity is added to a predetermined file.

  In the case of compound activity, it is determined whether it is fork join activity or sub activity. If it is sub activity, a source code corresponding to sub activity is added, and if it is fork join activity, source code corresponding to fork join activity Is added.

  When the acquired Activity element is sub-Activity, the source code corresponding to the Activity element executed first in the sub-Activity is added. Then, the same processing as the first sub-activity is repeated.

When the acquired Activity element is a folk join activity, a source code corresponding to the activity element to be joined after forking is added, and a source code having the fork join activity as an end notification destination (R7) is added.
Then, the source code of the fork join object 66 for adding Activity (R6) that forks and joins the obtained Activity element is added.

  When the acquired Activity element is a decision, a source code corresponding to the decision object 62 that performs the determination to be selected is added.

  As a result, the source code capable of executing the processing shown in the activity diagram can be created in the class diagram shown in FIG. 6, but the Activity element forked by the folk join activity is joined by the same folk join activity. There was a restriction that had to be done.

(2.3) Operation of Source Code Creation Device 1 The source code creation device 1 according to the present embodiment additionally writes another source code for each activity to be joined.
Hereinafter, the operation of the source code creation device 1 will be described with reference to a class diagram (FIG. 3) showing a model according to the present embodiment and a flowchart (FIG. 4) showing a flow of source code creation according to the present embodiment.

  First, the source code creation device 1 includes an arbitrary element 300 in an activity diagram including a wait / branch process (fork / join), a selection process (decision), an execution process (activity), and an end process (end). Is acquired (S301).

  Next, a first determination process (R1) is performed to determine whether the acquired element 300 is a fork / join object 310, a decision object 320, an activity object 330, or an end object 340 (S302).

  When the acquired element 300 is determined to be the fork / join object 310 (S302: A), the source code corresponding to the fork / join object 310 is added (S302A), and the fork / join object 310 is determined. The source code corresponding to the fork selector object 370 for identifying (R2) the element that branches (forks) after completion of waiting is added to a predetermined file (S303).

  Then, the source code corresponding to the join selector object 380 for identifying (R3) the element 300 to be waited for (joined) is added to a predetermined file (S304).

  When the acquired element 300 is determined to be the decision object 320 (S302: B), the source code corresponding to the decision object 320 is added (S302B), and the element 300 determined to be the decision object 320 is determined according to the conditions. The source code corresponding to the decision selector object 390 for identifying the branching element (R4) is added to a predetermined file (S305).

When the acquired element 300 is determined to be the activity object 330, the second determination process (R5) for determining whether the element 300 determined to be the activity object 330 is the single activity object 350 or the sub-activity object 360 is performed. It performs (S306).
When the element 300 is determined to be the single activity object 350 by the second determination processing (S306) (S306: E), the source code corresponding to the single activity object 350 is added (S306E), and then executed. A source code for identifying the element (R6) is added to a predetermined file (S307).

When the element 300 is determined to be the sub-activity object 360 by the second determination processing (S306) (S306: F), the source code corresponding to the sub-activity object 360 is added (S306F1).
Then, a source code for identifying (R6) an element to be executed next is added to a predetermined file (S307F2), and a source code for identifying the activity object 330 to be implemented first by the element 300 (R7) Is added to a predetermined file (S308).

  When the element 300 is determined to be ended (S302: D) by the first determination process (S302), a source code for identifying (R8) the sub-activity object 360 that notifies the end of the element 300 is determined in advance. Is added to the file (S309).

  Finally, it is determined whether acquisition of all elements is completed (S310).

(3) Operation / Effect According to the source code creation device 1 according to the present embodiment, the Activity element forked by the fork join activity is not subject to the restriction that the fork join activity must be joined by the same fork join activity. As an example in which the source code creation apparatus of the comparative example could not create the source code, the source code can be created even for the “impossible” portion shown in FIG.

1 ... Source code creation device 10 ... CPU
11 ... ROM
12 ... RAM
13 ... HDD
20 ... Network I / F unit 30 ... Operation information unit 40 ... Bus 300 ... Element 310 ... Folk join object 320 ... Decision object 330 ... Activity object 340 ... End Object 350 ... Single activity object 360 ... Sub-activity object 370 ... Fork selector object 380 ... Join selector object 390 ... Decision selector object

Claims (2)

An acquisition means for acquiring an arbitrary element in an activity diagram including a wait / branch process, a selection process, an execution process, and an end process;
First determination means for determining (R1) whether the element acquired by the acquisition means is a wait / branch process, a selection process, an execution process, or an end process;
First appending means for appending a source code corresponding to the result determined by the first determining means to a predetermined file;
When the first determination means determines that the process is a wait / branch process, the element adds a source code corresponding to a fork selector for identifying (R2) an element that branches after completion of the wait to a predetermined file. A second appending means,
If the first determination means determines that the process is a wait / branch process, the element adds a source code corresponding to a join selector for identifying (R3) the element to be waited to be added to a predetermined file. With additional writing means,
A fourth additional write in which a source code corresponding to a decision selector for identifying (R4) an element that is determined to be selected by the first determination means is added to a predetermined file. Means,
A second determination unit that determines (R5) whether the activity is a single activity or a sub-activity when the first determination unit determines that the activity is an activity;
When the second determination means determines that the activity is a sub-activity, the element additionally adds a source code for identifying an activity to be performed first (R7) to a predetermined file;
A fifth appending means for appending a source code for identifying (R6) an element to be executed next to a predetermined file when the element is determined to be an activity by the first determining means;
A source code for identifying a sub-activity for which the element notifies the end (R8) when the first determining means determines that the end is to be completed; And, if not, an eighth appending means that does not append.
A source code creation device characterized by that. Computer
An acquisition means for acquiring an arbitrary element in an activity diagram including a wait / branch process, a selection process, an execution process, and an end process;
First determination means for determining (R1) whether the element acquired by the acquisition means is a wait / branch process, a selection process, an execution process, or an end process;
First appending means for appending a source code corresponding to the result determined by the first determining means to a predetermined file;
When the first determination means determines that the process is a wait / branch process, the element adds a source code corresponding to a fork selector for identifying (R2) an element that branches after completion of the wait to a predetermined file. A second appending means,
If the first determination means determines that the process is a wait / branch process, the element adds a source code corresponding to a join selector for identifying (R3) the element to be waited to be added to a predetermined file. With additional writing means,
A fourth additional write in which a source code corresponding to a decision selector for identifying (R4) an element that is determined to be selected by the first determination means is added to a predetermined file. Means,
A second determination unit that determines (R5) whether the activity is a single activity or a sub-activity when the first determination unit determines that the activity is an activity;
When the second determination means determines that the activity is a sub-activity, the element additionally adds a source code for identifying an activity to be performed first (R7) to a predetermined file;
A fifth appending means for appending a source code for identifying (R6) an element to be executed next to a predetermined file when the element is determined to be an activity by the first determining means;
A source code for identifying a sub-activity for which the element notifies the end (R8) when the first determining means determines that the end is detected; and for identifying the sub-activity as a notification destination when there is the identified sub-activity Is added, and if not, it is made to function as an eighth additional writing means not to add,
A source code creation program characterized by this.

Images