JP2661290B2 - Executability judgment method - Google Patents

Description

Description: TECHNICAL FIELD The present invention relates to an execution feasibility determination method, and in particular, to a plurality of mutually related processes (a plurality of processes whose execution order is determined).
The present invention relates to an execution availability determination method for determining whether or not a specific one of the processes can be executed.

[Conventional technology]

In general, in an information processing system, a large number of processes are sequentially executed while being related to each other, and when an execution of one process is interactively designated by an operator from among those processes, a designation mistake is avoided. An execution feasibility determination method for determining whether the processing (hereinafter referred to as “designation processing”) is feasible is required.

Conventionally, in this type of execution availability determination method, a binary flag indicating whether or not each process has been executed (executed / unexecuted) is provided in each process. The binary flag of (the process that is a condition for executing the designated process) is checked, and whether or not the designated process can be executed is determined based on the check.

FIG. 4 is a diagram illustrating an example of an execution order of a plurality of processes to be subjected to the above-described conventional execution availability determination method.
The processes 41 to 47 in the figure hold binary flags 41a to 47a, respectively. The execution order of each process is determined as shown by the arrow, but the operator can specify the execution of any process.

The conventional execution availability determination method for such a plurality of processes 41 to 47 performs the following processes.

The binary flags 41a to 47a are all set to indicate unexecuted in the initial state.

When the execution of any one of the processes is designated by the operator, the binary flags of all processes serving as conditions for executing the process (designated process) are checked, and whether or not those processes have been executed Is checked.

If there is any unexecuted process in this check,
No execution of the specified process is performed. That is, only when all of the checked binary flags indicate that execution has been completed,
The specified process is executed.

For example, even if the execution of the process 45 is specified in the initial state, the execution of the process 45, which is the specified process, is not performed because both of the binary flags 42a and 44a indicate the non-execution.

In this way, when the execution of the designated process is completed, the binary flag of the designated process is updated to indicate that the process has been executed, and all processes determined to be executed after the designated process are executed. The binary flag is updated to indicate unexecuted. That is, the execution states of all processes affected by the execution result of the designated process are initialized.

For example, when the process 42 is a designated process, when the execution of the process 42 is completed, the binary flag 42a is updated to indicate that the process has been performed, and the binary flags 45a and 46a
Is updated to indicate that it has not been executed.

[Problems to be solved by the invention]

In the above-described conventional execution availability determination method, when the execution of the designated process is completed, the binary flags of the designated process and all processes that are determined to be executed after the designated process must be updated. There is a drawback in that the operation related to the determination of execution is complicated.

In addition, when another process is added to the already completed (determined) sequence of a series of processes (the execution order of a series of processes including a plurality of processes), the determination of whether or not to perform the process is controlled. Since all the mechanisms (programs) to be executed must be changed, there is a disadvantage that it is difficult to cope with a change in the already completed series of processing flows.

In view of the above, it is an object of the present invention to replace each of a plurality of numerical values constituting an arithmetic progression having a sequence number (a constant tolerance (usually 1) instead of a binary flag as information indicating an execution state. , 0, 1, 2, 3,...), The operation related to the determination of the feasibility can be simplified, and the change of the flow of a series of completed processing can be easily dealt with. An object of the present invention is to provide an execution feasibility determination method that can be performed.

[Means for solving the problem]

In the information processing system including a plurality of processes in which the execution order is determined, the execution availability determination method according to the present invention uses an ordinal number indicating each execution state by “any one of a plurality of numerical values forming an arithmetic progression”. Determining whether to execute the specified process based on a comparison between the plurality of processes to be held and an order number of the specified process whose execution is specified from the plurality of processes and a sum total of the order numbers of immediately preceding processes with respect to the specified process; Execution possibility determination means, processing execution means for executing the designated processing when the execution processing is determined to be executable by the execution possibility determination means, and the order number of the designated processing after the execution of the designated processing by the processing execution means And a status instruction updating means for updating the program by reflecting the execution.

[Action]

According to the execution possibility determination method of the present invention, the plurality of processes hold an ordinal number indicating each execution state by “any one of a plurality of numerical values forming an arithmetic progression”, and the execution possibility determination unit performs Determines whether or not the specified process can be executed based on a comparison between the ordinal number of the specified process whose execution is specified from and the sum total of the ordinal number of the immediately preceding process with respect to the specified process. When it is determined that the process is permitted, the designated process is executed, and the state instruction updating unit updates the ordinal number of the designated process by reflecting the execution after the designated process is executed by the process executing unit.

〔Example〕

 Next, the present invention will be described with reference to the drawings.

FIG. 1 is a block diagram showing a configuration of an embodiment of an execution availability determination method according to the present invention. The execution availability determination method according to the present embodiment includes an execution availability determination unit 1 that determines whether execution of a process (designated process) designated to be executed by an operator from among processes 11 to 1n (n is a positive integer), State instruction updating means 2 for updating the specified order numbers 11a to 1na of the specified processing, processing execution means 10 for executing the specified processing determined to be executable by the execution feasibility determining means 1, and execution feasibility determination of the present embodiment It is configured to include a plurality of processes 11 to 1n to be processed.

The execution order of the processes 11 to 1n is determined in advance. At this time, for a certain process, there may not be a process serving as a condition for executing the process, and there may be a plurality of processes. However, it is not allowed that the execution order of the series of processes 11 to 1n loops (directly or indirectly one process becomes a condition for executing the process itself).

The processes 11 to 1n are performed by an ordinal number 11a indicating each execution state.
1 to 1na (the sequence numbers 11a to 1na are read by the execution possibility determination unit 1 and rewritten by the state instruction changing unit 2).

Note that the operator can specify the execution of any process regardless of the execution order of the processes 11 to 1n.

FIG. 2 is a flowchart showing the processing of the execution possibility determination method of the present embodiment (i, j and k in the figure indicate natural number parameters). The processing of the execution availability determination method of the present embodiment includes a designated processing order number reading step 21, a previous processing presence / absence determination step 22, a "j ← 0" step 23, a repetition end determination step 24 for the immediately preceding processing number, and Processing order number reading step 25, “k> 0” determination step 26, and “j”
← j + k ”step 27 and“ j ← i + 1 ”step 28
And "i <j" determination step 29, execution impossible notification step 30, designated processing execution step 31, and designated processing order number writing step 32.

FIG. 3 is a diagram showing an example of an execution order of the processes 11 to 1n. Here, the process 1n is a process 17 (n = 7), and the execution order of the processes is indicated by an arrow.

Next, the operation of the execution feasibility determination method of the present embodiment configured as described above will be described.

In the initial state of the processes 11 to 1n, all 0s are written in the ordinal numbers 11a to 1na.

The execution possibility determination means 1 performs the following processing (see steps 21 to 30 in FIG. 2).

First, the order number of the process (designated process) designated by the operator from the processes 11 to 1n is read out to i (step
twenty one).

Next, it is determined (checked) whether or not there is a process which is determined to be executed immediately before the execution of the designated process (a process premised on the designated process; hereinafter, referred to as immediately preceding process) (step 22). ).

If it is determined in step 22 that the immediately preceding process exists, j
0 is set to (parameter used when updating the order number of the designated process in step 32) (step 23).

Next, it is determined whether or not the processes and determinations of steps 25 to 27 have been repeated by the number of the immediately preceding processes checked in step 22 (step 24).

In this determination, when the processes and determinations of steps 25 to 27 are not repeated by the number of the immediately preceding processes, the order number of the immediately preceding processes is sequentially set to k (in order of several immediately preceding processes).
(Step 25), and for k, “k> 0”
Is determined (step 26).

If “k> 0” in this determination, k is added to j (step 27), and control returns to the determination in step 24.

If the determination in step 26 is not "k>0", the operator is notified that the designated process cannot be executed (the designated process cannot be executed) (step 30), and the process is terminated.

As described above, in the processes and determinations in steps 23 to 27, the process of calculating the sum total of the ordinal numbers of the immediately preceding process and setting the value to j is performed.

On the other hand, if the immediately preceding process does not exist in the determination of step 22, the value obtained by adding 1 to i is set to j (step 2).
8).

In the determination of step 24, the number of steps in the immediately preceding process is step 25
When steps 27 to 27 are repeated or determined
When the process of 28 is completed, i and j are compared, and “i <
j ”is determined (step 29).

If the determination is not "i <j", the operator is notified that the designated process is not executable (step 30).
The process ends.

If “i <j” is determined in step 29, the control is passed to the processing execution unit 10.

The processing execution means 10 executes the designated processing (step 3
1) The control is passed to the status instruction updating means 2.

The state instruction updating means 2 updates the ordinal number by writing j to the ordinal number of the designated processing executed by the processing executing means 10 (the ordinal number before execution is i) (step 32), and ends the processing. I do.

Next, with reference to an example shown in FIG. 3, a more specific operation of the execution availability determination method of the present embodiment will be described.

In the initial state, 0 is written in each of the ordinal numbers 11a to 17a in FIG.

When a series of designations as described below are sequentially performed by the operator from such an initial state, the following processing is performed.

First, when the execution of the processing 11 is designated by the operator, j is set to 1 in step 28 in the processing procedure shown in FIG.
Since it is determined in step 29 that "i (= 0) <j", the process 11 which is the designation process is executed (step 31), and 1 is written in the sequence number 11a (step 3).
2).

Secondly, when the execution of the process 12 is specified by the operator, j is the sequence number 11a because the immediately preceding process is only the process 11.
(= 1), which is the same value as 1 (steps 23 to 27), and i and j, which are ordinal numbers 12a (= 0), are compared (step 29). In this comparison, i (the order number 12a) is smaller than j (“i <j”), so the process 12 as the designated process is executed (step 31), and 1 is written in the order number 12a (step 32). ).

Third, when the execution of the process 15 is designated by the operator, the order number 14a of the process 14 which is one of the processes immediately before the process 15 is 0, and therefore the process 15 which is the designated process is performed based on the determination in the step 26. The operator is notified that execution is not possible (step 30).

Fourth, when the execution of the processes 13 and 14 is sequentially specified by the operator, the same process as that when the execution of the processes 11 and 12 is specified is performed, and the processes 13 and 14 are sequentially performed (step 31), 1 is written to the ordinal numbers 13a and 14a (step 32).

Fifth, when the execution of the process 15 is specified by the operator, the sum of the ordinal numbers 12a and 14a is 2 and this value is j
(Steps 23 to 27), and j is the ordinal number 15a (=
0) (i.e., 0) (step 29), the process 15 which is the designated process is executed (step 31), and the sequence number 15a
Is written to (step 32).

As described above, the execution permission / inhibition determination method of the present embodiment can appropriately determine whether or not the execution can be performed in response to the designation given arbitrarily by the operator.

Further, when another process is added to the flow of a series of processes that have already been completed, the execution availability determination unit 1 and the status instruction updating unit 2 are modified or newly added to deal with the other process. You do not need to take the trouble of creating.

〔The invention's effect〕

As described above, the present invention employs an ordinal number instead of a binary flag as information indicating an execution state, and compares the ordinal number of the designated process with the sum total of the ordinal number of the immediately preceding process to determine whether or not execution is possible. By performing the determination, only the order number of the designated process needs to be updated in updating the information indicating the execution state immediately after the execution of the designated process. Thus, there is an effect that it is possible to easily cope with the change in the processing flow.

[Brief description of the drawings]

FIG. 1 is a block diagram showing the configuration of an embodiment of the present invention, FIG. 2 is a flowchart showing the processing of the execution possibility determination method shown in FIG. 1, and FIG. 3 is the flow chart of the execution possibility judgment method shown in FIG. FIG. 4 is a diagram illustrating an example of an execution order of a plurality of target processes, and FIG. 4 is a diagram illustrating an example of an execution order of a plurality of target processes in a conventional execution availability determination method. In the figure, 1... Execution availability determination means 2... Status instruction updating means 10
... Processing execution means, 11-1n... Processing, 11a-1na.

Claims (1)

(57) [Claims] 1. An information processing system including a plurality of processes whose execution order is determined, wherein the plurality of execution statuses are each held by an ordinal number indicated by “any one of a plurality of numerical values forming an arithmetic progression”. Execution determination means for determining whether or not the specified processing can be executed based on a comparison between the ordinal number of the specified processing designated to be executed from among the plurality of processings and the sum total of the ordinal numbers of the immediately preceding processing for the specified processing And a process executing means for executing the designated process when the designated process is determined to be executable by the executable / non-executable determining device; and executing the designated process after the designated process is executed by the process executing device. And a status instruction updating means for updating the reflected information.