JPH03204722A - Specification review supporting method - Google Patents

Abstract

PURPOSE:To dynamically display the graphic such as a data flow chart written in a stage that details of the specifications are not determined yet by moving the graphic in accordance therewith in the case it is decided that how to move can be determined by only information of the graphic by a rule, and moving it by an operator's instruction in the case it is judged that the how to move cannot be determined. CONSTITUTION:In the case of displaying dynamically a data flow chart, how to move it is determined as automatically as possible in accordance with a specific rule, and only the part whose automatic determination is difficult is determined by an operator's instructed, by which the definition of the sequence and the dynamic display are executed, while reducing the trouble of an operator's input. In such a way, it becomes unnecessary to define a flow of data on the data flow chart extending over all, and by only the minimum input, the data flow chart can be displayed dynamically.

Description

[Detailed Description of the Invention] [Field of Industrial Application] The present invention relates to a method for dynamically displaying diagrams for the purpose of reviewing specifications, and is particularly suitable for determining and displaying data routes in data flow diagrams. Contains methods for defining and displaying data sequences.

[Conventional technology]

Conventionally, as a dynamic display method of diagrams, Japanese Patent Application Laid-Open No. 62-2
In some diagrams that describe specifications at a program level, such as No. 31344, the display is performed according to the rules defined in the diagram as well as more detailed definitions of the specifications.

[Problem to be solved by the invention] The above-mentioned prior art assumes that the details of the specifications have already been defined, and therefore cannot be applied to diagrams that are written before the details of the specifications are determined, such as data flow diagrams. There was a problem.

In addition, in the above-mentioned conventional technology, the diagram to be moved has clear rules for the direction in which it moves, and at branching points, all branching directions usually have meaning, so, for example, a data flow diagram describing the specifications of office processing However, there is a problem in that it is not suitable when trying to move a diagram in which only a specific route among all possible routes from the diagram is meaningful.

In addition, the above-mentioned conventional technology assumes that the shape that means a conditional branch is fixed and that the branch condition is described as a detailed specification. is used, and there is a problem that it is not suitable for cases where branch conditions are not written.

Furthermore, since the above-mentioned prior art is based on the premise that operations are performed sequentially, there is a problem that it cannot be applied to diagrams in which operations can occur in parallel.

Furthermore, since the above-mentioned conventional technology is assumed to be applied to detailed specifications at the program level, there is a problem in that it does not provide a method for referring to more detailed information corresponding to a specific figure in one diagram. Ta.

The first object of the present invention is to provide a method for dynamically displaying diagrams such as data flow diagrams, which are written before the details of specifications have been determined, without defining the operation method in advance. .

A second object of the present invention is to provide a method for dynamically displaying a specific route intended by an operator among all possible routes in a diagram.

A third object of the present invention is to enable definition of one conditional branch and dynamic display accompanied by the conditional branch in a diagram in which the conditional branch is not clearly described.

A fourth object of the present invention is to enable dynamic display even in diagrams that describe specifications in which operations can occur in parallel.

A fifth object of the present invention is to provide a method for dynamically displaying a diagram while displaying detailed information about the portion of the diagram that is being displayed.

(Means for solving the problem) The first objective is to establish a rule for determining whether or not the movement method can be determined only from the information on the diagram, and to use this rule to determine the movement method using only the information on the diagram. If it is determined that it is possible to do so, it is moved accordingly, and if it is determined that it is not possible to do so, it is achieved by moving it according to the operator's instructions.

The second purpose is to store multiple determined movement orders (sequences) for one drawing with arbitrary identifiers assigned to them, and to move them according to the sequence with the identifier specified by the operator. This can be achieved by displaying

Further, the third object is achieved by making it possible to insert a branch condition and a branch destination according to the value of the condition into the sequence, and also by making it possible to change the value of the condition at any time.

The fourth purpose is to enable parallel branches and synchronous confluences to be inserted into the sequence, and when performing parallel branches, only one of the branch destinations is dynamically displayed, and the remaining branch destinations are displayed at the first branch destination.
This is achieved by dynamically displaying the branch destination after reaching the terminal or confluence point.

The fifth object is achieved by simultaneously displaying detailed information about a figure in a diagram that is to be dynamically displayed.

[Effect]

When displaying a data flow diagram dynamically, the way it moves is automatically determined as much as possible according to specific rules, and only parts that are difficult to determine automatically are determined by the operator's instructions. Sequence definition and dynamic display can be performed while reducing input effort.

In addition, by assigning and storing multiple arbitrary identifiers to one data flow diagram and dynamically displaying them according to the sequence with the identifier specified by the operator,
When reviewing a data flow diagram, the sequence intended by the operator can be displayed quickly and at any time.

In addition, it is possible to insert branch conditions and branch destinations based on the value of the condition in the sequence, and the value of the condition can be changed at any time, so that the value of each condition can be changed during review and the data for each case can be changed. You can check changes in the route.

In addition, it is possible to insert parallel branches and synchronous merges into a sequence, and when branching in parallel, only one of the branch destinations is dynamically displayed, and for the remaining branch destinations, the first branch destination is the terminal or the confluence point. By displaying the data dynamically after the data is reached, it becomes easier for review participants to understand data dependencies or the relationship between data and processing.

In addition, by displaying detailed information about a figure in a diagram that should be dynamically displayed at the same time as the display,
This makes it easier for review participants to understand and confirm the system specifications.

〔Example〕

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

FIG. 1 is a flowchart showing the procedure of an embodiment of the present invention. In preparation for the explanation, FIG. 2 shows a diagram of the hardware environment of this embodiment, and FIG. 3 shows a functional configuration diagram. Hereinafter, an embodiment will be described according to the procedure shown in FIG.

In step 101, the stored data flow diagram is displayed on the display device 25.

In step 102, the current data flow is set as the "starting end". The current data flow here refers to the identifier of the data flow that serves as a search key for the sequence table 310. In addition to the data flow identifier, the "starting end" is also allowed as a search key. Regarding these, please refer to the 4th section.
This will be explained in detail with the drawings.

In step 103, the sequence table 310 is searched using the current data flow as a key, and the corresponding sequence is read out.

In step 104, a process is selected as follows depending on whether or not there is a corresponding sequence as a result of step 103. Step 1 only if there is no corresponding sequence
Steps 05 to 109 are executed.

In steps 105 and 106, the data flow diagram 303 and sequence generation determination rule 307 are read to determine whether sequence manual generation 305 or sequence automatic generation 306 is to be performed.

The determination rule for sequence generation will be explained in detail with reference to FIG.

In step 107, a sequence is generated based on input such as data flow designation by the operator.

In step 108, a sequence is generated with reference to the automatic generation rule 308 and data flow diagram 303. The automatic generation rule 308 will be explained in detail with reference to FIG.

In step 109, step 107 or step 1
The sequence generated in 08 is stored in the sequence table 31.
Add within 0.

In step 110, the display of the data flow diagram displayed on the display device 25 in step 101 is changed with reference to the sequence read out in step 103, the sequence stored in step 109, or the sequence updated in step 113.

In step 111, it is determined whether or not to modify the sequence in which the display was changed in step 110, depending on whether or not there is a request from the operator.Steps 112 and 113 are executed only if modification is necessary as a result of the 6 determination. .

In step 112, a sequence is generated based on input such as data flow designation by the operator.

In step 113, the sequence table 310 is updated with the modified sequence generated in step 112. That is, the sequence before modification is replaced with the sequence after modification. After step 113, the process returns to step 110.

In step 114, it is determined whether or not the process should be terminated depending on whether the next data flow of the sequence referred to in step 110 is "65 end".

That is, if the next data flow is the "terminal", the process is terminated, and in other cases, step 115 is executed.The zero-order data flow and the meaning of "terminal" will be explained with reference to FIG.

Step 115 replaces the current data flow with the next data flow. After step 115, the process returns to step 103.

By the above procedure, it is possible to define a sequence with minimal input while watching the flow of data.

Furthermore, according to this procedure, if a sequence has already been defined, display can be performed according to the sequence without any new input.

FIG. 2 is a diagram representing the hardware environment of the present invention.

Inputs commands etc. from the operator. Input device 21 consisting of a keyboard and mouse. Memory 22 for processing inside the computer. CPU23. External storage device 24. It consists of a display screen 25 that displays command execution results, contents of stored data, messages to the operator, and the like.

FIG. 3 is a functional configuration diagram of one embodiment. Execution control 30
1 accepts commands from the operator and executes each function. The data flow diagram display 302 reads the stored data flow diagram 303 and displays it on the display device 25. Sequence generation method determination 304 is performed according to data flow diagram 3
03 and the sequence generation determination rule 307 to determine whether to execute the sequence manual generation 305 or the sequence automatic generation 306. Sequence manual generation 3
05 generates a sequence based on the information in the data flow diagram 303 and information specifying the sequence from the operator. This function is used both when creating a new sequence and when modifying a sequence.

The sequence automatic generation 306 automatically generates a sequence using the information of the data flow diagram 303 and the sequence automatic generation rule 308. The sequence search/storage 309 searches, adds, and updates sequences in the sequence table 310. The display content change 311 changes the display of the data flow diagram on the screen in accordance with the sequence.

Next, the sequence will be explained using FIG. 4. In this example, a sequence is defined as an arbitrary data flow and a data flow (next data flow) in which data flows after data flows in that data flow (current data flow).
It is treated as a group with A series of sequences is then stored in a format such as an example sequence table 401. In order to store the first data flow in the data flow diagram in the sequence table like other data flows, the current data flow can include a "start end" in addition to any data flow for convenience. on the other hand,
When the current data flow is the end of a series of sequences, the next data flow is defined as the "end". In this way, by including the "starting end TI, II end" in the sequence,
Is the entire sequence defined, or is it partially defined?
You can easily determine whether it is undefined.

The sequence table 402 is an example in which a conditional branch is included in the sequence. In this case, the conditional branch includes a branch condition during the next data flow, as in sequence 403.
It is represented by including the data flow corresponding to the evaluation value of the condition.

The sequence table 404 is an example in which a sequence includes branching to parallel processing and synchronous merging. In this case, branching to parallel processing is represented by including multiple data flows in the next data flow. Furthermore, synchronous merging is expressed by including a data flow to be synchronized in the next data flow.

Next, the sequence generation determination rule and sequence automatic generation rule will be explained using FIG.

The sequence generation determination rule 501 is a rule used in this embodiment. Based on this rule and the information in the data flow diagram, it can be determined whether sequence generation should be automatic or manual.

The sequence automatic generation rule 502 is a rule used in this embodiment. A sequence can be automatically generated using this rule and information on the data flow diagram.

Note that although these two rules are separate in this embodiment, they can also be combined into one.

Further, in this embodiment, it is assumed that the rules are stored in advance, but the rules may be changed at any time.

Next, the operation and display of this embodiment will be explained using FIG. As a prerequisite, all sequences are undefined,
The judgment rules are as shown in Figure 5.

First, in step 101, a data flow diagram 601 is displayed on the display screen 25. It is determined in step 104 that there is no corresponding sequence, and the sequence generation determination rule 501
Accordingly, in step 107, sequence manual generation 305 is executed. When the operator specifies the data flow 602 using a mouse or the like.

A sequence 603 is generated. In step 109, the sequence table 31 is searched/stored 309.
Sequence 603 is stored in 0.

At step 110, data flow 602 is redisplayed. It is determined in step 114 that the process does not end.

Returning to step 103, the second round begins. Since the process 604 has multiple inputs and multiple outputs, the sequence manual generation 305 is executed in step 107 according to the sequence generation determination rule 501. When an operator specifies a data flow 605, a sequence 606 is generated.

In the third round, the process 607 has one input and one output, so
Step 10 according to the sequence generation determination rule 501
8, sequence automatic generation 306 is executed. A sequence 608 is generated by the sequence automatic generation rule 502. In the fourth round, since the process 609 has one input and no output, automatic scene generation 306 is executed in step 108 according to the sequence generation determination rule 501. A sequence 610 is generated by the sequence automatic generation rule 502. It is determined in step 114 that the process has ended, and the process ends.

In the end, in this embodiment, two operations (data flow 602
, and the data flow 605), the definition of a series of sequences is completed. Once a sequence is defined as described above, the data flow and data path can then be displayed according to this sequence.

Note that if you want to modify the sequence defined by the above method, you can specify any position in the sequence and call the sequence manual generation 305.

Next, define and store multiple sequences for one data flow diagram, and select any one of these multiple sequences.
FIG. 7 shows an embodiment in which sequences are extracted and data paths are collectively displayed.

This will be explained using FIGS. 8 and 9.

FIG. 7 is a functional configuration diagram showing the relationship between a sequence table and a plurality of sequences. After the sequences are defined according to the first embodiment, the defined sequences are stored in the sequence table 310. Sequence storage 701
In response to a storage instruction from the operator, the defined sequence is given an identifier specified by the operator in advance or at the time of the storage instruction, and is stored in the sequence external storage 702.

Sequence reading 703 reads a sequence having an identifier specified by the operator from sequence external storage 702 and copies it to sequence table 310 .

FIG. 8 is a flowchart showing a procedure for collectively displaying data paths for sequences selected from a plurality of sequences using the above method.

Step 801 redisplays the data flow diagram.

Step 802 sets a "starting end" for the current data flow. Step 803 searches the sequence table using the current data flow as a key. Step 804 checks whether the next data flow is the "end", and if it is the "end", the process goes to step 808. Step 805 changes the display of the box outputting the next data flow. step 80
6 changes the display of the next data flow. Step 807
replaces the current data flow with the next data flow.

Step 808 changes the display of the box in which the current data flow is entered.

FIG. 9 is a display example in which the above procedure is applied to two sequences for one data flow diagram. A display example 903 corresponds to the sequence 901, and a display example 904 corresponds to the sequence 902. In this embodiment, not only the data flow but also the box display is changed to make the data path easier to understand. Note that in this embodiment, the display method is a broken line and a solid line, but this may be represented by a difference in display color, display shading, etc.

Next, an example in which a conditional branch is included in a sequence will be described.

FIG. 10 is a functional configuration diagram of an embodiment using branch conditions. However, this configuration diagram shows only the parts related to the branch conditions. The branching condition definition 1001 displays a branching condition definition screen on the display device 25 in response to a request for defining a branching condition from the input device 21, and after the input to the screen is completed, the defined branching condition is stored in the branching condition table. 10
The 6-branch condition change 1002 registered in 03 changes the condition value of the branch condition in the branch condition table 1003 in response to the input to the branch condition displayed by the branch condition display 1004. The branch condition table 1003 includes the execution control 301. Sequence manual generation 3059 is referenced at any time by display content change 311.

FIG. 11 shows a definition screen 1101 for six branch conditions, which is an example of the definition of branch conditions referenced in a sequence, and a branch condition name 1102. Number of branches 1103° Branch condition definition 1104
The definition is performed by inputting the following in sequence.

FIG. 12 is an example of defining a sequence including conditional branching. In sequence manual generation 305, command 120 that specifies that the sequence to be generated is a conditional branch.
If you input 1 and then input branch conditioner 1202, 5
Branching conditions 1203 defined by screen 1201 are displayed. By specifying a condition value base 1204 and a corresponding data flow 1205 for this display.

A sequence 1206 is generated.

In this embodiment, the branch conditions are defined before the sequence is defined, but the branch conditions may be defined during the sequence definition.

FIG. 13 shows an example in which a data path is displayed using a sequence including conditional branching. Data flow diagram 1
If sequence 1302 is defined for 301, display example 1305゜1306, 1307, 1308 can be obtained by changing branch conditions 1303 and 1304 appropriately.
The data path can be displayed in four ways without changing the sequence 1302, as shown in FIG.

Next, an example in which a sequence includes parallel processing will be described.

FIG. 14 is a flowchart showing a procedure for defining a sequence including parallel processing and changing the display. Step 1401 determines whether there is a synchronous merge in the next data flow, and if not, proceeds to step 1407, step 14
02.1403 checks whether there is a data flow to be synchronized in the waiting data flow list, and if not, goes to step 1412, steps 1404, 1405.140
Step 6 deletes the synchronous data flow from the waiting-to-arrive data flow list, cancels the waiting-to-arrive display, and sets the next data flow as the next data flow at the time of synchronization. Step 1407 determines whether there is a parallel branch in the next data flow, and if not, the process proceeds to step 1411. Steps 1408, 1409
, 1410 sets one of the branched data flows as the next data flow, and registers the other data flows in a departure waiting data flow list and displays them as departure waiting data flows. Step 1411 cancels the display change of the current data flow.

Steps 1412 and 1413 register the current data flow in the waiting data flow list and display it as waiting for arrival. Steps 1414 and 1415 check whether the departure waiting data flow list is empty, and if it is empty, the process ends. Steps 1416 and 1417 delete the last data flow registered in the departure waiting data flow list from the list, and make this data flow the next data flow. Step 1418 changes the display of the next data flow.

Step 1419 waits until a predetermined input (for example, an execution key) is received. Step 1420 checks whether the next data flow is the "end", and if it is the "end", the process goes to step 1414. Step 1421 replaces the current data flow with the next data flow. The above method allows parallel data flows to be displayed sequentially.

FIG. 15 is an example of defining a sequence including parallel processing.

First, an example of defining a parallel branch will be explained. In sequence manual generation 305, when a command 1501 specifying that the sequence to be generated is a parallel branch is input, and data flows 1502 and 1503 are subsequently specified, a sequence 1504 is generated. In the subsequent display, data flow 15 except for one of the branched data flows.
A message such as 05 indicating that the vehicle is waiting for departure will be displayed.

Next, a definition example of synchronous merging will be explained. In sequence manual generation 305, if a data flow 1506 to be synchronized with the current data flow is specified prior to the next data flow 1507, a sequence 1508 is generated.

In the subsequent display, as in data flow 1509, a message waiting for arrival is displayed.

FIG. 16 is an example in which the order in which data flows is sequentially displayed by a sequence including parallel processing. When a sequence 1601 is defined in the data flow diagram 1602, a data flow waiting for departure due to parallel branching appears in the data flow diagram 1603, replaced with a data flow waiting for arrival due to synchronous merging at 1604, and merging at 1605. In this way, by sequentially displaying the data flow of parallel processing while maintaining data dependencies, it becomes easier to understand the relationship between processing and data.

Next, an embodiment will be described in which detailed information regarding data and processing is displayed at the same time as the display is changed.

FIG. 17 is a flowchart showing the procedure for displaying the detailed information described above. Steps 1701 and 1702 are
Check whether the current data flow is the "starting end", and only if it is not the "starting end", change the display of the current data flow back to its original state and erase the display of detailed information. Step 1704 checks whether the next data flow is the "terminal", and if it is the "terminal", step 1710
go to Step 1705 changes the display of the box outputting the next data flow and displays detailed information. Step 1706 waits until a predetermined input (eg, an execution key) is received. Step 1707 undoes the display change of the box outputting the next data flow and erases the display of detailed information.

Step 1708 changes the display of the primary data flow and displays detailed information. Step 1709 waits until a predetermined input (for example, an execution key) is received.

Step 1710 changes the display of the box into which the current data flow is input and displays detailed information. Step 1711 waits until a predetermined input (for example, an execution key) is received. Step 1707 undoes the change in the display of the box into which the current data flow is input, and erases the display of detailed information.

FIG. 18 is a display example of the detailed information axis. Information such as a data form image 1802 and a box processing outline 1803 is displayed on a data flow diagram 1801 in accordance with the data flow.

By displaying detailed information on data and processing at the same time as displaying the flow of data in this way, review participants can more easily understand and confirm the system specifications.

〔Effect of the invention〕

According to the present invention, it is no longer necessary to define all the data flows on the data flow diagram, and the data flow diagram can be displayed dynamically with only minimal input. The same display can be repeated or one of a plurality of sequences can be selected and displayed.

[Brief explanation of drawings]

FIG. 1 is a flowchart showing a first embodiment of the present invention;
FIG. 2 is a block diagram of the hardware environment of the above embodiment,
FIG. 3 is a block diagram of the functional configuration of the above embodiment, FIG. 4 is an illustrative diagram of a sequence, FIG. 5 is an explanatory diagram of sequence generation rules, and FIG. 6 is an illustration of the operation of the first embodiment of the present invention. An explanatory diagram of the display, FIG. 7 is a block diagram of the functional configuration of the main part of the embodiment of the present invention, FIG. 8 is a flowchart of the second embodiment of the present invention, and FIG. 9 is a flowchart of the second embodiment of the present invention. A diagram showing a display example of the embodiment, FIG. 10 is a block diagram of a functional configuration diagram of the third embodiment of the present invention, FIG. 11 is an explanatory diagram showing an example of branch condition definition, and FIG. 12 is a sequence definition. An explanatory diagram of an example, FIG. 13 is a diagram showing a display example of the third embodiment of the present invention, FIG. 14 is a flowchart of the fourth embodiment of the present invention, and FIG. 15 is an explanatory diagram of an example of sequence definition. , FIG. 16 is a diagram showing a display example of the fourth embodiment of the present invention, FIG. 17 is a flowchart of the fifth embodiment of the present invention, and FIG. 18 is a display example of the fifth embodiment of the present invention. FIG. 302...Data flow diagram display, 304...Sequence generation method determination, 305...Sequence manual generation,
306... Automatic sequence generation, 307... Judgment rule for sequence generation, 308... Automatic sequence generation rule, 309... Sequence search/storage, 310
...Sequence table, 311...Display contents changed. (2) r force/7th drawing/3rd drawing d)

Claims (1)

[Scope of Claims] 1. On an information processing device having a computer and an interaction terminal, a data flow diagram display step of displaying a data flow diagram stored in the computer on the interaction terminal; A sequence automatic generation step that automatically determines the data flow order (sequence) according to the information of the data flow diagram and specific rules, and a sequence that cannot be determined by the sequence automatic generation step is determined by instructions from the operator. a sequence storage step for storing the sequence determined by the sequence automatic generation step and the sequence manual generation step, and a display content change step for changing the display of the data flow diagram according to the determined sequence. A specification review support method characterized by: 2. By assigning an arbitrary identifier to the sequence and storing it, multiple sequences can be stored for one data flow diagram, and a sequence with an identifier specified by the operator from among the stored multiple sequences can be stored. characterized by changing the display on the data flow diagram according to the sequence,
A specification review support method according to claim 1. 3. By including a branch of the data flow and a condition for the branch in the sequence, and changing the value of the condition as appropriate, the order of changing the display contents on the data flow diagram can be changed without changing the stored sequence. characterized by
A specification review support method according to claim 1 or 2. 4. The sequence includes parallel branching of the data flow in multiple directions, and the display content changing step sequentially changes the display corresponding to the data flow in the multiple directions. A specification review support method according to claim 1 or 2. 5. In the display content changing step, detailed information corresponding to the display element on the diagram whose display is changed is displayed at the same time as the display is changed. Specification review support method described in section.