JP2005084725A - Process flow generation device and process flow generation method - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To easily and efficiently generate a process flow, even if the process order in a series of processes is not clear, and to prevent mistakes at correction. <P>SOLUTION: When each process name in a series of process flows or a process name and a precedent process name, just before this process name are inputted, the context of each process name is automatically analyzed, and the arrangement position/connection line of each process name is determined and displayed, in the order from the part the relation of which has become clear. <P>COPYRIGHT: (C)2005,JPO&NCIPI

Description

  The present invention relates to a process flow generation apparatus and a process flow generation method, and more particularly to a process flow generation technique when the order of steps in a series of processes is not clear.

  A conventional process flow generation method will be described with reference to the drawings.

  FIG. 34 is a block diagram of a conventional process flow generation apparatus. In FIG. 34, 3401 is a process name holding unit, 3402 is a process flow holding unit, 3403 is a database, and 3404 is a central processing unit.

  That is, the database 3403 includes a process name holding unit 3401 that stores and holds the name of the executed process and the contents of the process, a previous process name (START process name) and a subsequent process name between a pair of adjacent processes. A process flow holding unit 3402 that stores and holds (END process name) in association with each other.

  Based on the input information, the central processing unit 3404 reads / writes the process name and the contents of the process related to the process name to / from the process name holding unit 3401 of the database 3403, or in the process order (processing order, execution order, process flow). Can be read from and written to the process flow holding unit 3402 of the database 3403.

  FIGS. 35 and 36 are diagrams for explaining an example of a conventional process flow generation procedure. First, a process name D of processes constituting a series of process flows is input and arranged at a desired position (FIG. 35). (A)). Next, the process name of the next process is input and arranged along the process order. In the example of FIG. 35, the process name B of the process executed next to the process represented by the process name D is input and arranged after the process name D (FIG. 35B).

  Then, the process name A of the next process which comprises this series of process flows is input and arrange | positioned. If it is known that the process represented by the process name A is executed after the process represented by the process name B, the process name A is input so as to be positioned after the process name B (FIG. 36). (C)). Note that the process names representing the respective processes are not only arranged in the order in which the processes indicated by the processes are executed, but are connected with threads (lines) so that the execution order becomes clear.

  The process represented by the process name F constituting this series of process flows is executed after the process represented by the process name D and executed before the process represented by the process name A, and the process If the process represented by the name B and the process represented by the process name F are known to be executed in parallel, the process name F is the same as the process name D and the process name D. It arrange | positions in the position between process name A, and connects with process name D and process name A with a thread, respectively. Further, the process name H of the process executed after the process represented by the process name A is arranged by being connected with a thread after the process name A (FIG. 36D).

In this way, in the prior art, the process name of the part of the process flow in the series of process flows that is previously known is input and connected in order from the top to generate the overall process flow. (See, for example, Patent Document 1, Patent Document 2, and Patent Document 3).
JP 2001-134653 A JP-A-5-307555 Japanese Patent Laid-Open No. 08-264405

  However, in the conventional process flow generation method, when various process flows are generated, the order of the processing order of each process that is a component of the process flow is determined, and the creator of the process flow performs a series of processes. It has been very difficult to produce the desired process flow without a certain understanding in whole or in part.

  In addition, even when all the steps included in a series of processes are known and the context of each step has been determined at the time of generating the process flow, as a result of reviewing the generated process flow, If it is necessary to change the process flow for a reason, it is cumbersome to rearrange process names by adding process names of new processes, deleting process names of existing processes, changing the context, etc. It was necessary to perform work that was prone to mistakes.

  Therefore, it is very difficult to create a process flow whose processing order is ambiguous, or for a person who does not fully understand the contents of the process to create a process flow, and a large amount of work is required to complete the process flow. Is needed.

  On the other hand, there is another problem when an expert who is familiar with the process generates a process flow. That is, in general, knowledge is classified into knowledge that is described (recognized) in a document called formal knowledge and can be recognized and knowledge that is not described in a document called tacit knowledge. Tacit knowledge can be formalized, but it can be formalized because it is knowledge that only an expert knows (implicit knowledge) or the expert does not recognize it as knowledge. Not tacit knowledge. In addition, there are many processes executed by skilled persons that are determined as processes and are executed, but are not even aware of their existence.

  Therefore, the process flow created by a skilled person who has acquired a lot of tacit knowledge often lacks or omits the steps that should be necessary for the unskilled person. There are cases where items and knowledge that are originally expressed in the process flow and should be written are not described. For this reason, the process flow created by an expert is often difficult to be used by the general public as it is, and moreover, it requires a lot of work and time to modify and improve it. I could not do it.

  In addition, if an unnecessary or inappropriate process is included in the generated process flow depending on the processing conditions (preconditions) when executing the process, the processing conditions (preconditions) ), The content of the determined process flow was changed, and an appropriate process flow could not be generated arbitrarily. Hereinafter, in the present invention, the process thus changed is referred to as a “task”.

  In addition, when one process has an attribute that includes a plurality of processes, the processes cannot be held together (hereinafter referred to as “folding” in this specification), or operations and procedures therefor are as follows. It was complicated and hindered workers' thinking.

  Therefore, the present invention provides a process flow generation apparatus and a process flow generation method capable of generating a process flow easily and efficiently even when the order of steps in a series of processes is not clear, and preventing occurrence of errors during correction. For the purpose.

  In order to solve the above problems, the process flow generation device according to the present invention is a display for inputting a process name in a series of process flows and an adjacent process name that is a process name of an adjacent process before or after the process. Based on the storage means for storing the information input on the screen and the process name and the adjacent process name stored in the storage means, the arrangement position of each process name and the connection line connecting each process name are determined. Determining means; and display control means for displaying each process name whose arrangement position is determined by the determination means at the arrangement position in a state where the process names are connected by a connection line related to the determination.

  The process flow generation method according to the present invention displays a screen for inputting a process name in a series of process flows and an adjacent process name that is a process name of an adjacent process before or after the process, Based on the input process name and adjacent process name, the layout position of each process name and the connection line connecting each process name are determined, and each process name that has determined the layout position is connected by the connection line related to the determination. It is characterized in that a process of displaying at the arrangement position in a state is executed.

  As described above, according to the present invention, a process flow generation apparatus and process that can generate a process flow easily and efficiently even when the order of steps in a series of processes is not clear, and can prevent occurrence of errors during correction. A flow generation method can be provided.

  Hereinafter, embodiments of the present invention will be described in detail with reference to the drawings. However, the technical scope of the present invention is not limited by the following description, and it goes without saying that the present invention can be appropriately modified and combined within the scope of the gist of the present invention. Here, the process of creating an unclear process flow into a clear process flow will be described in detail.

[First Embodiment]
FIG. 1 is a system configuration diagram showing a schematic configuration of an information processing system incorporating a process flow generation apparatus according to an embodiment of the present invention.

  This information processing system has a display device 11, an input device 12, a main storage device 13, a central processing unit 14, an external storage device 15, and a communication device 16, and these devices are connected so as to be able to exchange signals with each other. Yes.

  The external storage device 15 stores in advance a control program for performing a process probe generation process described below. This control program is stored in the main storage device when a process flow generation process is instructed by an operation of the input device 12. 13 is executed by the central processing unit 14. The process program generation process control program is not stored in the external storage device 15 in advance, but is downloaded from the outside via the communication device 16 and a network (not shown) and stored in the external storage device 15. It is also possible to do.

  FIG. 2 is a block diagram showing a schematic configuration of the process flow generation apparatus according to the embodiment of the present invention. The central processing unit 14 has substantially the same configuration as that of FIG. 34 used for the description of the conventional example, and generates a process flow by executing a flowchart described later. In FIG. 2, 21 is a process name holding unit, 22 is a process flow holding unit, 23 is a process information database, and 14 is a central processing unit.

  The process information database 23 is held in the external storage device 15 shown in FIG. 1. The process information database 23 includes a process name holding unit 21 that stores and holds the name of the process to be executed and the contents of the process. A process flow holding unit 22 is formed which stores and holds a previous process name (START process name) and a subsequent process name (END process name) between a pair of adjacent processes.

  Based on the information input from the input device 12, the central processing unit 14 displays a process name (a name that identifies the processing content) and the content of the process represented by the process name in the process name holding unit 21 of the process information database 23. The process flow generation process is advanced while reading / writing the process order (processing order, execution order, synonymous with process flow) to / from the process flow holding unit 22 of the process information database 23.

  It should be noted that the data in the process information database 23 and the process flow generation control program in the external storage device 15 can also be used by other information processing apparatuses via the communication device 26.

  FIG. 3 shows an example of a UI screen for inputting a process name. This UI screen is displayed on the display device 11, and data is input from the input device 12 (the UI screen in FIG. 29 is also the same).

  In FIG. 3, 31 is an input box for inputting the process name, 32 is an input box for inputting the name of the previous process, 33 is an input box for inputting the contents of the process related to the process name input in the input box 31, and 34 is once determined. It is an input box for inputting an extraction condition for extracting a process (process name) in the process flow.

  In order to finally complete the process flow in the process flow generation apparatus, the information to be input includes at least the process name of the process and the process before and after the process adjacent to the process. The process name is required. In the example of FIG. 3, at least a process name and a previous process name preceding (previous) the process name are input. However, for the first step in a series of processes, as shown in FIG. 2, by inputting the specified value “−1” as the corresponding previous step name, the step name input in the input box 31 is changed. It is made to show that the process concerned is the first process. The contents of the process, the extraction conditions, and others are input as necessary, and are not essential items for generating a process flow.

  It should be noted that at least a process name and a subsequent process name subsequent (to be described later) to the process name may be input. In this case, for the last step in the series of processes, for example, by inputting a specified value “−1” as the corresponding subsequent step name, the step related to the step name input in the input box 31 is the last step. What is necessary is just to show that it is a process of a tail.

  As an extraction condition, if it is determined that the process whose process name is input in the input box 31 is a necessary process in a series of processes, for example, the condition “required” is input as an initial value and specified. If it is found that the process is necessary only under the above conditions, the specific conditions are input. Of course, if these extraction conditions are not known at the present time, they may be inputted at a later time.

  The process name, contents, and extraction conditions input by the input device 12 on this process name input screen are stored in the process name holding unit 21 shown in FIG. The input process name is stored in the process flow holding unit 22 as the END process name, and the previous process name is stored as the START process name. That is, the process names of a pair of adjacent processes are stored in each record of the process flow holding unit 22 in a form indicating the context.

  In this way, each process name itself does not have context information, and each process name is recorded in association with the previous process name to indicate the context, so there is no inconsistent context. In addition, even if the context of all processes is not known in advance, the process flow generation process can be started from the known part.

  That is, in the process of generating a process flow, the process that precedes the process is often unclear, so in this embodiment, the process in such a situation does not need to be input with the previous process name. The process flow generation process can be advanced.

  As shown in FIGS. 5 to 9, in the process flow generation screen, in principle, the process name and the previous process name are enclosed in a square and displayed in a rectangular pair, and if the previous process name is not input, The name display area is displayed blank for the time being. Then, the central processing unit 14 sequentially performs the above rectangular display processing based on the input information, and the user determines the connection position of the process in which the previous process name is blank while observing these rectangular displays, and again determines the previous process name. A series of process flow is completed by repeating the operation of inputting.

  FIG. 4 is a flowchart showing an outline of the process flow generation process. Details of the process flow generation process will be described later with reference to FIGS.

  The central processing unit 14 first activates the control program for process flow generation processing, and then inputs the process name to determine whether the process name is new or an existing process already existing in the process information database 23. If it is an existing process name, the process name is selected (step S402). If it is a new process name, the process name can be acquired. Generation processing (step S403) is performed.

  Next, the central processing unit 14 inputs a process name (step S404), holds the input process name in the process name holding unit 21 (step S405), and inputs the processed process name to the process flow holding unit 22. By searching above, connection information related to the process name is generated (step S406), and a process flow is generated based on the previous process name of the process name (step S407). Next, the central processing unit 14 holds the process flow generated in step S406 or step S414 in the process flow holding unit 22 and displays it on the display device 11 (steps S408 and S409).

  Next, the user confirms the process flow displayed in step S409, and continues to input the process name or tests whether a desired process flow has been generated (extracted from the process flow). Delete the process name that does not satisfy the condition, and generate a process flow related to the change in which the remaining process name is rearranged) or the process flow generation work is terminated. The instruction content is determined (step S410).

  Next, when instructed to generate a task flow, the central processing unit 14 acquires a process name extraction condition (step S411), extracts a process name that matches the extraction condition (step S412), Connection information is generated again based on the extracted process name and the context information of the process name (step S413), and a task flow (test process flow) is generated based on the regenerated connection information (step S414). ), The process returns to step S408.

  The central processing unit 14 returns to step S401 when instructed to continue the input, and ends the process flow generation process when instructed to end.

  5 to 9 are diagrams for explaining the process flow generation processing of FIG. 4 in detail. Here, the process name input screen shown in FIG. 5A and the process flow screen shown in FIG. 5B and the like are simultaneously displayed as separate windows on the same screen of the display device 11. It is assumed that

  As shown in FIG. 5A, when a process name is input via the process name input screen shown in FIG. 3, the process name is arranged on the process flow as shown in FIG. 5B. At this time, it is not necessary to pay attention to the context of the process, and the process name can be input in random order (see FIG. 5C).

  If the previous process is clearly known, as shown in FIG. 5 (d), if the previous process name of the previous process is entered, as shown in FIG. A partially connected process flow is generated. This means that, on the process name input screen, the process name required to complete the process flow and the process name located before the process name do not necessarily need to be entered. doing. In other words, in the process generation process, it is often impossible to determine the name of a process located before or after a certain process, which means that the process flow generation process can be started from such an ambiguous state. Yes.

  Next, a procedure for completing a process flow (flow connection) by inputting a process name as a whole and then performing processes such as adding and deleting process names and inputting context information (previous process name) will be described. This flow connection process means that a process flow can be generated from a part whose context is known even if the entire series of processes is not known.

  First, a procedure for inputting a previous process name with respect to a process name (one lacking the previous process name) arranged on the flow will be described.

  When a process name having no previous process name is selected as a process name to be corrected among process names arranged on the flow, as shown in FIG. 6F, the process to be corrected is displayed on the flow. The display state of the name changes so that it can be easily identified. In the present embodiment, the line of the outer frame of the process name D changes thickly. For example, the process name to be corrected (focused) is arranged at a specific position (center, upper right, etc.) on the display screen. As described above, the name of the process to be corrected may be conspicuous by another method such as moving the entire process flow.

  In FIG. 6G, when the previous process name B is input to the process name D currently focused on, the input previous process name B and the focused process name D are connected by a thread. The process flow shown in (h) is generated.

  FIG. 7 (i) shows that, from the state of FIG. 7 (h), the process name A is input as the previous process name of the process name B and the condition 2 is input as the extraction condition for the process name B on the process name input screen. FIG. 7J shows the process flow generated by this input. Since the process name A is input as the previous process name of the process name B, as shown in FIG. 7 (j), the connection of the previous process name BD is connected as the process name A-BD. The state has changed. The process name G shown in FIG. 7J is additionally input from the state shown in FIG.

  FIG. 8K shows a process flow generated by inputting the previous process name B for the process name E and the previous process name for the process name G from the state of FIG. FIG. 8 (l) shows a process flow generated by inputting a new process name C (previous process name is B) from the state of FIG. 8 (k) (at this stage, the process name The outer frame of E is not yet thick).

  When the process name E is selected after inputting the new process name C (previous process name is B) as described above, the outer frame of the process name E is changed to a thick line as shown in FIG. As shown in FIG. 8 (m), the process name E and the previous process name B are automatically displayed on the process name input screen. Therefore, when the “Delete” button is selected on this screen, the specified process name E is deleted from the flow on the flow screen, and from the context of the deleted process name (depending on the processing method of connection information described later) ) The system generates connection information between process names again, and the process flow shown in FIG. 9 (n) is generated.

  When testing the process flow generated in this way, the user instructs the test. This test instruction can be performed by, for example, a task bar displayed on the upper part of a screen on which a process name input screen or a flow screen is displayed. When the test is instructed, the central processing unit 14 reads out the extraction conditions and process names related to all the processes related to the series of processes displayed on the flow screen from the process name holding unit 21 and displays them (FIG. 9 ( o)).

  Therefore, the user selects an arbitrary extraction condition. In response to this selection, the central processing unit 14 extracts process names that match the selected extraction conditions, generates connection information, and generates a test task flow (test process flow) from the process flows generated so far. And the test task flow is displayed (see FIG. 9 (p)). In this example, as shown in FIG. 9 (o), the condition 2 as the extraction condition for the process name B is not selected. The process name B is deleted from the process flow without being extracted, and a task flow is generated from the remaining process name and its context information.

  As described above, input of extraction conditions assumed as prerequisites in task execution and generation / display of the task flow are repeated. If the generated task flow has problems or improvements, the process returns to step S401 in FIG. Then, create a process flow again.

  10 and 11 are flowcharts showing details of the connection information generation processing in steps S406 and S413 in FIG. A specific example of the connection information generation process will be described in detail later with reference to FIGS.

  The central processing unit 14 acquires information on the designated process (step S1001), obtains a process name extraction condition from the designated process (step S1002), and selects a process name that matches the extraction condition from the process name holding unit 21. Extraction (step S1003), a flow whose START process name and END process name match the extracted process name is extracted from the process probe holding unit 22 (step S1004), and the extracted process name and flow are stacked (step S1003) S1005).

  Next, the central processing unit 14 extracts a part of the flow whose END process name is a process name not to be extracted from the process flow holding unit 22 (step S1006), and among the flows extracted in step S1006, START. The START process name of the flow whose process name is the extraction target is stacked (step S1007). Next, the central processing unit 14 extracts a part of the flow in which only the START process name is a process name not to be extracted from the process flow holding unit 22 (step S1008), and the END process of the flow extracted in step S1007. The names are stacked (step S1009), and the START process name stacked in step S1007 and the END process name stacked in step S1009 are connected to create a flow (step S1010).

  Next, the central processing unit 14 determines whether or not there remains a flow of a part whose process name is not the extraction target only for the START process name, and if it remains, determination for repeatedly executing from step S1008. The process (step S1011) and the determination process (step S1012) for repeatedly executing from step S1006 are discriminated whether or not the flow of the part whose END process name is not extracted remains. Do.

  Next, the central processing unit 14 deletes a flow having the same START / END process name from the process flow holding unit 22 (step S1013), and a flow (record) having the same START process name in the process flow holding unit 22 ), And if there are a plurality of processes, the flow that reaches the same END process name is deleted from the process flow holding unit 22 (steps S1014 and S1015), and the flow holding unit A process of deleting a flow not to be extracted from the process 22 (step S1016) is performed.

  Next, a specific example of the connection information generation process will be described with reference to FIGS.

  It is assumed that the process flow holding unit 22 holds connection information as illustrated in FIG. Note that the flow display shown in the process flow PA is shown for explanation, and the process flow generation apparatus does not store the image data itself corresponding to this flow display. The flow display data is generated based on the storage information of the process flow holding unit 22 by the process flow display process in step S409 of FIG.

  Here, as shown in FIG. 12B, it is assumed that the process names A, C, and D are extracted from the process name holding unit 21 as process names that match the extraction conditions by the process of step S1003. . Next, as a flow in which the START process name and the END process name are both matched with the process name (A, C, D in this case) extracted according to the extraction condition by the process in step S1004, the flow of -1-A Then, the A-D flow is extracted.

  Next, a process for creating a connection of the extracted process names (a process for connecting lines) will be described.

  As shown in FIG. 13C, it is assumed that process names A, C, D, F, and G are extracted from the flow in the process flow PB according to the process name extraction conditions. In this case, the flow extracted by the process of step S1004 is only the flow of -1-A (see FIG. 13D).

  Here, by the process of step S1006, the flows AB, BE, and BH are extracted from the process flow holding unit 22 as the flows whose END process names are not extracted. The In the process of the next step S1007, the flow whose START process name is the extraction target among the flows AB, BE, and B-H extracted in step S1006 is only AB, so that the START process Name A is stacked (see FIG. 13D).

  Next, as a flow in which only the START process name is a process name that is not extracted by the process in step S1008, the flows of BC, BD, EF, and EG are retained as process flows. Extracted from the unit 22. Then, the END process names C, D, F, and G are stacked by the process of step S1009 (see FIG. 13D).

  Next, the flow of A-C, A-D, A-F, and A-G is generated by the processing of the above-described step S1010 that connects the stacked START process name and END process name to generate a flow (see FIG. 13 (d) and (e)).

  In the process of step S1003 described above, which extracts the process name that matches the extraction condition from the process name holding unit 21, the process name given with "-1" (this process indicates the actual head process) The assumed process, which does not exist, is always handled as an extraction target, as shown in FIGS. 14 (f), (g), and (h).

  Next, the duplicate connection deletion process will be described in detail with reference to FIG.

  It is assumed that process names A, C, F, I, and H are extracted from the process flow PD shown in FIG. 15 (i) according to the extraction conditions as shown in FIG. 15 (j). When a connection as described with reference to FIGS. 13D and 13E is created for this process flow PD, an extra connection line as shown by a thick black line in FIG. 15K is generated. End up.

  In order to delete this extra connection line, an extra connection line between process name A and process name C is deleted by deleting a flow having the same START / END process name by the process of step S1013 in FIG. Is deleted (see FIG. 15L). Further, the processing of steps S1014 and S1015 of FIG. 11, that is, whether or not there are a plurality of flows (records) having the same START process name in the process flow holding unit 22 is determined. By deleting the flow arriving at the same END process name from the process flow holding unit 22, an extra connection line between the process name F and the process name H is deleted (see FIG. 15L).

  Next, the connection information creation process described above will be supplementarily described with reference to FIGS.

  The connection information of a series of processes held in the process flow holding unit 22 in the external storage device 15 is actually expanded in a data table formed in the main storage device 13 (see FIG. 16A). Note that the extracted process names are A, C, D, F, and G.

  As shown in FIG. 16 (b), in order to create connection information, in this data table, an extraction flag for indicating whether or not it is an extraction target corresponds to a START process name and an END process name. Grant individually. At this time, a flag value “1” indicating an extraction target is unconditionally assigned to the START process name “−1” representing the head of the flow.

  Next, the processing of steps S1003 to S1010 of FIGS. 10 and 11 is performed, and as shown in FIG. 17C, new connection information of AC, AD, AF, and AG is obtained. Assume that each flow is added. Since all the START process names and END process names of these additional flows are to be extracted, all flag values of the corresponding extraction flags are also assigned “1”.

  In the process flow according to the data table shown in FIG. 18D, as the route from the process name A to the process name C, in addition to the normal route A-B-C, the process name C directly from the process name A. Since there is another route (excessive redundant route that conflicts), it is necessary to delete this other route. For the START process name and END process name of the record related to the route to be deleted, the flag value is changed to “2” in the extraction flag as shown in FIG. Is deleted.

  As described above, in this embodiment, by simply inputting each process name in a series of process flows and a previous process name immediately before the process name, a connection line for connecting each process name is automatically generated appropriately. As a result, the burden on the user when generating the process throw is greatly reduced.

  FIG. 19 is a flowchart showing a task process flow generation process in which a process flow once generated is modified. A specific example of the task process flow generation process will be described later.

  The central processing unit 14 acquires the designated process flow (step S1901), and displays the extraction conditions related to the process names constituting the acquired designated process flow (step S1902). Since the user selects an extraction condition from the extraction conditions related to the displayed process name, the central processing unit 14 inputs the selected extraction condition (step S1903), and selects a process name that matches the extraction condition. Extraction is performed from the designated process (step S1904).

  Next, the central processing unit 14 regenerates connection information based on the extracted process name (step S1905), and generates and displays a process flow (task process flow) based on the generated connection information (step S1906). , S1907). The user views the displayed task process flow and inputs information indicating whether or not the task process flow is appropriate (step S1908), so that the central processing unit 14 has received information indicating that the task process flow is not appropriate. In this case, the process returns to step S1902, and when the information indicating appropriateness is input, the task process flow generation process is terminated.

  Next, a specific example of the task process flow generation process will be described with reference to FIGS.

  Assume that extraction conditions XX and XZ are selected and designated as shown in FIG. Then, as shown in FIG. 20B, process names A, C, D, F, and G that match the selected / designated extraction conditions XX and XZ are extracted.

  Connection information is regenerated based on these extracted process names, and a task process flow is generated based on the connection information, and is displayed as shown in FIG.

  Since this task process flow is not appropriate, if the extraction condition is changed to XX, XZ, YZ, process names that match the extraction conditions XX, XZ, YZ after the change are shown in FIG. The connection information is extracted from the specified process flow, the connection information is regenerated based on the extracted process name, the task process flow is generated based on the connection information, and is displayed as shown in FIG. .

  22 and 23 are flowcharts showing a position determination process for determining the position where the process name is arranged. A specific example of this position determination process will be described later.

  The central processing unit 14 acquires designation information for designating a process flow (step S2201), and the START process name has a value “−1” from the process flow related to the designation held in the process flow holding unit 22. The head flow is extracted (step S2202), the END process name (actual head process name) of the extracted head flow is stacked, the placement position of the head process name is determined (step S2203), and the stacked END process names Is extracted from the process flow holding unit 22 (step S2204).

  In this embodiment, the arrangement position (X, Y coordinate value) of the actual first process name in the first designated process flow is automatically set to (1, 1) and designated from the second onward. As for the arrangement position (X, Y coordinate value) of the actual head process name in the process flow, automatically, X coordinate value = 1, Y coordinate value = [(maximum Y coordinate value at that time) +1] By deciding, the burden of the user's input operation is reduced. However, it is possible to automatically determine another arrangement position as the arrangement position of the actual head process name, or the user can input and specify arbitrary position information.

  Next, the central processing unit 14 calculates the coordinates (x, y) of the arrangement position of the END process name of the extracted flow. In this case, x = [(X coordinate value of START process name corresponding to the END process name) +1], y = (Y coordinate value of START process name corresponding to the END process name) (step S2205). Then, it is determined whether or not the calculated arrangement position overlaps with an arrangement position of another process name (step S2206). If there is an overlap, the Y coordinate values of all process names of the system to which the duplicated process name belongs are determined. Is incremented by "1" (step S2207), the process returns to step S2206, and it is determined whether or not the process name having its Y coordinate value incremented by "1" overlaps with other process names, thereby avoiding a duplicate state. Until this is done, the Y coordinate value of all process names of the system to which the process name of the duplicate partner belongs is incremented by “1”.

  On the other hand, if there is no overlap, the central processing unit 14 stacks the END process name for which the arrangement position (x, y coordinate value) is calculated this time (step S2208), and there is a direct subsequent flow of the END process name. In step S2209, if there is a direct subsequent flow, the process returns to step S2204, and the same processing is repeated for the direct subsequent flow.

  If there is no direct succession flow, the central processing unit 14 determines whether or not there is a secondary flow for the system for which the process name placement position has been calculated so far (step S2210). If it exists, one unprocessed side system flow is extracted from the process flow holding unit 22 in order from the head direction (step S2211), and it is determined whether or not the END process name of the extracted side system flow is already arranged. (Step S2212). As a result, if it is already arranged, the process returns to step S2210 without calculating the arrangement position of the END process name and searches for another side flow.

  On the other hand, if the extracted END process name of the neighboring flow is not yet arranged, the central processing unit 14 calculates the coordinates (x, y) of the arrangement position of the END process name. In this case, x = [(X coordinate value of START process name corresponding to the END process name) +1], y = [(Y coordinate value of START process name corresponding to the END process name) +1] (step S2213). Next, the central processing unit 14 returns to step S2206, and performs the above-described duplication search, duplication avoidance processing, and the like.

  If the central processing unit 14 determines in step S2210 that no side flow exists, the central processing unit 14 further determines whether or not there remains a process flow related to an unprocessed designation having a START process name value of -1. If it remains, the process returns to step S2202, and the same arrangement process is performed.

  On the other hand, if there is no process flow relating to the unprocessed designation, the central processing unit 14 determines the total number of arranged process names, the maximum X and Y coordinate values in the arrangement coordinates of the process names, and the display screen of the display device 11. Based on the size, the arrangement position of each process name is optimized (step S2215). In this optimization process, not only correction of the arrangement position but also enlargement / reduction of the character size and the rectangle surrounding the character are performed.

  Next, the process name arrangement process will be described in detail with reference to FIGS.

  Now, it is assumed that the process throw in the process flow holding unit 22 shown in FIG. 24A is designated as the process flow of the process name arrangement process. In this case, as shown in FIG. 24A, -1-A is extracted as the flow of the head part, and the process name A which is the END process name (actual head process name) is stacked, The arrangement position of the process name A is determined as (1, 1) (steps S2201 to S2203).

  Next, as shown in FIG. 24B, the flow AB is extracted as a flow having the process name A as the START process name (step S2204), and the arrangement coordinates (END process name B of the flow ( x = X coordinate value (1) + 1 = 2 of the START process name A related to the END process name B is calculated as x = y), and y = Y coordinate value of the START process name A related to the END process name B (1) = 1 is calculated (step S2205).

  Since the arrangement position (2, 1) of this process name B does not overlap with the arrangement position of other process names (step S2206), the process name B whose arrangement position has been calculated this time is stacked (step S2208). Whether or not there is a direct subsequent flow of the process name B (stack S2209), but since there is a direct subsequent flow BC, the process returns to step S2204 to extract the flow BC and repeat the same processing. Thus, the arrangement positions of the subsequent process names C, G, and H in the direct system are sequentially calculated (see FIG. 25C).

  Then, in the process of step S2209 after calculating the arrangement position of the process name H, it is determined that there is no direct flow subsequent to the process name H, and the process proceeds to step S2210, where a side system for the system of the process name H is displayed. The presence or absence of a flow is determined. In this case, since there are a plurality of side-by-side flows, first, AE that is the top side-by-side flow is extracted (see step S2211, FIG. 25D). Since the END process name E of the flow AE has not yet been arranged (step S2212), x = the END process name E as the arrangement coordinates (x, y) of the END process name E in step S2213. The X coordinate value (1) + 1 = 2 of the START process name A relating to END is calculated, and the Y coordinate value (1) + 1 = 2 of the START process name A relating to the END process name E is calculated.

  Next, returning to step S2206, it is determined whether or not there is a duplicate process name with respect to the calculated arrangement position of the process name E, but since there is no duplicate process name, this process name E is stacked and the process name E It is determined whether or not there is a direct subsequent flow (steps S2208 and S2209). In this case, since there is EF as a direct subsequent flow, by returning to step S2204, the flow EF is extracted as shown in FIG. 26E, and in step S2205, the flow of the flow is extracted. As the arrangement coordinates (x, y) of the END process name F, x = X coordinate value (2) + 1 = 3 of the START process name E related to the END process name F is calculated, and y = related to the END process name F The Y coordinate value (2) = 2 of the START process name E is calculated.

  The arrangement position (3, 2) of this process name F does not overlap with the arrangement position of other process names (step S2206), the process name F is stacked in step S2208, and in step S2209, the process name F It is determined whether or not there is a direct subsequent flow. In this case, since there is no direct subsequent flow of the process name F, the process proceeds to step S2210, and it is determined whether there is a side flow for the process name F. In this case, since an F-H flow exists as a side-by-side flow for the process name F, the flow F-H is extracted (step S2211), and the END process name H of the flow F-H has already been arranged. Is determined (step S2212).

  In this case, since the process name H has already been arranged, the process returns to step S2210 without searching for the arrangement position, and another side system flow is searched. By this return processing, as shown in FIG. 26 (e), the flow of the EF system in the neighboring system is converged to the original system of AB.

  When returning to step S2210, BD is extracted as the next side flow (step S2211), and the END process name D of this side flow BD is not yet arranged (step S2212). In step S2213, x = X coordinate value (2) + 1 = 3 of the START process name B related to the END process name D is calculated as the arrangement coordinates (x, y) of the END process name D, and y = the END The Y coordinate value (1) + 1 = 2 of the START process name B related to the process name D is calculated, and the process returns to step S2206 to determine whether or not there is an overlap.

  However, as shown in FIG. 26 (f), since the process name F is already arranged at the calculated arrangement position (3, 2) of the process name D, as shown in FIG. 27 (g). In addition, the Y coordinate value of all process names (E and F in this example) of the system to which the process name F of the overlapping partner belongs is incremented by “1” (step S2207). Since this increment process avoids an overlapping state, the process proceeds to step S2208 via step S2206, and the process name D is stacked. Then, there is no direct flow following this process name D, and DG exists as a side flow (steps S2209 and S2210), and therefore a side flow DG is extracted in step S2211.

  Since the END process name G of this side flow DG has already been placed (step S2212), the placement position is not calculated, and the process returns to step S2210 to search for an unprocessed side flow. By this return processing, the process name D converges to the original system as shown in FIG.

  In this example, since there is no unprocessed side-by-side flow, the process advances to step S2214 to determine whether there is another process flow instructed to arrange the process name. In this example, since there is no other process flow instructed to arrange the process name, the process position is optimized in step S2215.

  Thus, in this embodiment, the position of each process name is arranged so that each process name does not overlap just by inputting each process name in the series of process flows and the previous process name immediately before the process name. Since it is automatically determined and displayed, the burden on the user when generating the process throw is greatly reduced.

  As described above, in the first embodiment, when each process name in a series of process flows, or when a process name and the previous process name immediately before the process name are input, the context of each process name is automatically entered. Are analyzed and the position and connection line of each process name are determined and displayed in order from the part where the context has been found.

  Therefore, a series of process flows can be roughly generated from the beginning, and gradually completed into detailed process flows. Alternatively, a partial flow can be generated from a part of the process flow where the context is known. It is possible to freely complete the process flow while expanding the front and back, or create a plurality of fragmented process flows and connect them to complete the process flow.

  In addition, when a process flow that has been completed once is corrected, it is automatically arranged and connected by simply correcting the process name of the erroneous part or the name of the previous process, so that the correction work becomes easy.

  In addition, when testing the correctness of a completed process flow, the extraction conditions related to the process name in the process flow to be tested are automatically displayed. In addition, since only process names that satisfy the extraction conditions are appropriately arranged and connected, the process flow can be reviewed easily.

  As described above, in the first embodiment, it is possible to easily and efficiently generate a process flow even when the order of steps in a series of processes is not clear, and to prevent an error from occurring during correction.

[Second Embodiment]
In the first embodiment, in order to complete the process flow, the process names of all the processes in the series of process flows and the process names (adjacent process names) of the processes immediately before or after the process are input. However, in the second embodiment, the process names of all the processes in the series of process flows are input, and the content information of the processes is input as necessary.

  FIG. 29 shows an example UI screen for information input according to the second embodiment. In FIG. 29, reference numeral 2901 denotes an input box for inputting a process name, and 2902 denotes an input box for inputting the contents of the process relating to the process name input in the input box 2901.

  Via this UI screen, for example, as shown in FIG. 28A, the work content and procedure of the day are input together with the process name on the X day. This input process is repeated for the X day + 1 day, the X day + 2 day, and the X day + 3 day until a series of work is completed. In FIGS. 28A and 28B, process names are omitted, and actually, process names are also input, held, and displayed.

  The process name and process content information input in this way are stored in the process name holding unit 21 by the central processing unit 14 in association with time information relating to the time when the input is performed. In this case, the central processing unit 14 acquires time information from a clock circuit (not shown) and automatically associates the time information with the process name and process content information, thereby saving the user from inputting time information.

  Further, the central processing unit 14 analyzes the context of each process name stored in the process name holding unit 21 based on the time information, and as shown in FIG. 2, the two information of the START process name and the END process name. Are stored in one record in the process flow holding unit 22.

  This process will be described based on the flowchart of FIG. First, the central processing unit 14 extracts and stacks one period information and process name from the process name holding unit 21 (step S3001). Next, the central processing unit 14 extracts and stacks process names having time information immediately before the time information stacked in step S3001 from the process name holding unit 21 (step S3002). In this case, if there is no process name having time information immediately before the time information stacked in step S3001, the process is stacked assuming that the process name is “−1”.

  Next, the central processing unit 14 creates a partial flow (record) having the process name stacked in step S3002 as the START process name and the process name stacked in step S3001 as the END process name, and stores the partial flow (record) in the process flow holding unit 22. (Step S3003). The above process is performed for all process names held in the process name holding unit 21.

  Then, the central processing unit 14 performs a process as described in the first embodiment on the basis of each record information related to the partial flow stored in the process flow holding unit 22 to connect each process name. The information and the arrangement position information of each process name are generated and displayed as a process flow so as to be visible as shown in FIG. In this case, the content information of each process is acquired from the process name holding unit 21 and displayed.

  As described above, in the second embodiment, the process flow is generated and visualized simply by inputting the process name and information indicating the contents of the process. It is possible to easily generate a process flow including steps that are not performed.

  Note that a part of a series of process flows is generated by, for example, an expert using the process flow generation process according to the second embodiment, and the other part of the flow is a process flow generation process according to the first embodiment by a beginner. If it is properly used, such as generating using the process, the efficiency of the process flow generation process as a whole can be improved.

[Third Embodiment]
In the third embodiment, a process flow having a hierarchical structure is displayed in a simple form so as to be easily seen.

  For example, the process related to the process name D shown in FIG. 31 (a) includes the processes related to the process names D1 to D6 as shown in FIG. 31 (b), and the process related to the process name D5 is In the case where the process related to the process names D51 to D54 shown in FIG. 31C is included, the process is displayed as shown in FIG. 32D in the first and second embodiments. In the display state as shown in FIG. 32D, the connection relation of process names is complicated, and it is easy to cause mistakes when verifying the correctness of the context between processes, which is inconvenient.

  Therefore, in the third embodiment, for example, a plurality of process names (D1, D2, D3, D4, D51, D52, D53, D54, D6) shown in FIG. In this case, as shown in FIG. 31 (a), the process names according to these designations are replaced with the generic name D and displayed.

  This replacement display process will be described based on the flowchart of FIG. The central processing unit 14 acquires process names designated to be foldered (step S3301), stacks (step S3302), and assigns a folder attribute to the designated process name (step S3303).

  Next, the central processing unit 14 assigns a new process name (folder name, generic name) to the process name group to which the folder attribute is assigned (step S3304), and replaces the process name group with the folder attribute. The generic name is displayed (step S3305).

  When the generic name being displayed is designated, the central processing unit 14 displays a plurality of process names corresponding to the generic name instead of the generic name. In this case, a plurality of corresponding process names may be displayed in a series of process flows as shown in FIG. 32, or a series of process flows as shown in FIGS. 31 (b) and 31 (c). It is also possible to display only a plurality of corresponding process names separately from each other.

  The present invention is not limited to the above-described embodiment, and can be appropriately modified and combined within the scope of the gist of the present invention.

  Another object of the present invention is to supply a storage medium (or recording medium) on which a program code of software that realizes the functions of the above-described embodiments is recorded to a system or apparatus, and to perform computer (or CPU or MPU) of the system or apparatus. Needless to say, this is also achieved by reading and executing the program code stored in the storage medium.

  In this case, the program code itself read from the storage medium realizes the functions of the above-described embodiments, and the storage medium storing the program code constitutes the present invention. Further, by executing the program code read by the computer, not only the functions of the above-described embodiments are realized, but also an operating system (OS) running on the computer based on the instruction of the program code. It goes without saying that a case where the function of the above-described embodiment is realized by performing part or all of the actual processing and the processing is included.

  Further, after the program code read from the storage medium is written in a memory provided in a function expansion card inserted into the computer or a function expansion unit connected to the computer, the function expansion is performed based on the instruction of the program code. It goes without saying that the CPU or the like provided in the card or the function expansion unit performs part or all of the actual processing, and the functions of the above-described embodiments are realized by the processing. When the present invention is applied to the storage medium, the storage medium stores program codes corresponding to the flowcharts described above.

1 is a system configuration diagram showing a schematic configuration of an information processing system including a process flow generation device according to an embodiment of the present invention. It is a block diagram showing a schematic structure of a process flow generation device concerning an embodiment of the present invention. It is a figure which shows the example of a UI screen for process name input (1st Embodiment). It is a flowchart which shows the outline | summary of a process flow production | generation process. It is a figure for demonstrating the specific example of a process flow production | generation process. It is a figure for demonstrating the specific example of a process flow production | generation process (continuation of FIG. 5). It is a figure for demonstrating the specific example of a process flow production | generation process (continuation of FIG. 6). It is a figure for demonstrating the specific example of a process flow production | generation process (continuation of FIG. 7). It is a figure for demonstrating the specific example of a process flow production | generation process (continuation of FIG. 8). It is a flowchart which shows the detail of a connection information creation process. 11 is a flowchart showing details of a connection information creation process (continuation of FIG. 10). It is a figure for demonstrating the specific example of a connection information creation process. It is a figure for demonstrating the specific example of a connection information creation process (continuation of FIG. 12). It is a figure for demonstrating the specific example of a connection information creation process (continuation of FIG. 13). It is a figure for demonstrating the specific example of a connection information creation process (duplicate connection deletion). It is a figure for supplementarily explaining connection information creation processing (extraction flag). It is a figure for supplementary explanation of connection information creation processing (connection creation). It is a figure for supplementary explanation of connection information creation processing (duplicate connection deletion). It is a flowchart which shows the production | generation process of the task process flow comprised only by the desired process name in the process flow once created. It is a figure for demonstrating the specific example of a task process flow production | generation process. FIG. 21 is a diagram for describing a specific example of task process flow generation processing (continuation of FIG. 20). It is a flowchart which shows the arrangement | positioning process of a process name. It is a flowchart which shows the arrangement | positioning process of a process name (continuation of FIG. 22). It is a figure for demonstrating the specific example of the arrangement | positioning process of a process name. FIG. 25 is a diagram for describing a specific example of process name arrangement processing (continuation of FIG. 24). It is a figure for demonstrating the specific example of the arrangement | positioning process of a process name (continuation of FIG. 25). It is a figure for demonstrating the specific example of the arrangement | positioning process of a process name (continuation of FIG. 26). It is a conceptual diagram which shows the process flow production | generation process which concerns on the 2nd Embodiment of this invention. It is a figure which shows the example UI screen for process name input (2nd Embodiment). It is a flowchart which shows the process flow production | generation process which concerns on the 2nd Embodiment of this invention. It is a figure for demonstrating the 3rd Embodiment of this invention (hierarchical structure). It is a figure for demonstrating the 3rd Embodiment of this invention (state which is not made into a folder). It is a flowchart which shows the foldered display process which concerns on the 3rd Embodiment of this invention. It is a block diagram which shows schematic structure of the conventional process flow production | generation apparatus. It is a figure for demonstrating the process flow production | generation procedure of the conventional invention. It is a figure for demonstrating the process flow production | generation procedure of the conventional invention (continuation of FIG. 35).

Explanation of symbols

DESCRIPTION OF SYMBOLS 11 ... Display apparatus 12 ... Input device 13 ... Main storage device 14 ... Central processing unit 15 ... External storage device 21 ... Process name holding part 22 ... Process flow holding part 23 ... Process information database 31 ... Input box 32 of process name ... Process name input box 33 ... Process content input box
34 ... Input box for process extraction conditions

Claims (10)

Storage means for storing information input on a display screen for inputting a process name in a series of process flows and an adjacent process name that is a process name of an adjacent process before or after the process;
Based on the process name and the adjacent process name stored in the storage means, a determination means for determining the arrangement position of each process name and a connection line connecting each process name;
And a display control means for displaying each process name whose placement position has been determined by the determination means at the placement position in a state of being connected by a connection line related to the determination.   The process flow generation apparatus according to claim 1, wherein the display control unit displays a process name and an adjacent process name associated with the process name in association with each other.   3. The display control means, when a process name being displayed is designated as a process name of interest, displays the process name related to the designation in a form different from other process names. A process flow generation device according to any one of the above.   The process flow generation apparatus according to claim 1, wherein the determination unit determines an arrangement position of each process name so that the process names do not overlap each other. An extraction means for extracting from the storage means a process name that satisfies a pre-specified extraction condition;
The process flow generation apparatus according to claim 1, wherein the determination unit determines an arrangement position of each process name extracted by the extraction unit and a connection line.   6. The process flow generation apparatus according to claim 5, wherein the display control unit deletes a process name being displayed that does not satisfy the specified extraction condition. An acquisition means for acquiring time information from the time measurement means when the input of the process name is executed;
2. The process flow generation apparatus according to claim 1, wherein the determination unit analyzes a context of each process name based on the time information and determines an arrangement position and a connection line of each process name. Displays a screen for entering the process name in a series of process flows and the adjacent process name that is the process name of the process that is adjacent before or after the process,
Based on the input process name and the adjacent process name, the arrangement position of each process name and the connection line connecting each process name are determined, and each process name for which the arrangement position is determined is determined by the connection line related to the determination. A process flow generation method characterized by displaying a connection state in the arrangement position.   A program for executing the process flow method according to claim 8.   A storage medium storing the program according to claim 9.

Images