JPH05210401A - Sequence program collation method - Google Patents

Abstract

PURPOSE:To provide the sequence program collation method capable of discriminating the coincidence of the control content even though the order on a logic circuit is different. CONSTITUTION:A sequence controller 11 controls a device 13 to be controlled according to the sequence program in a sequence storage section 17, and compares the program with the sequence program kept in a magnetic tape 12. A control section 19 loads the program to be compared on the magnetic tape 12 in a buffer memory 18. Based on the program and the program to be compared in the sequence program storage section 17, the matrix data is prepared according to the rules. In each prepared matrix data, the change of column or row and the data arrangement is performed, comparing the both sequence programs. Thus, even though the order of describing the logical content is different between the programs, the exact collation result can be obtained.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a sequence program collating method for collating a sequence program stored in a sequence controller with a sequence program stored in an external storage medium or the like.

[0002]

2. Description of the Related Art In recent years, technological advances have been remarkable in the field of so-called sequence controllers (hereinafter abbreviated as PC). As is well known, this PC temporarily converts / stores a sequence program described in a ladder circuit format into a machine language program, and sequentially executes the machine language program to perform predetermined processing. Since it is difficult for a general user to create and edit this sequence program at the machine language level, a tool (hereinafter, referred to as a programmer) that facilitates this is usually prepared.

This programmer has various functions and contributes to the convenience of the user. One of the functions is a program collating function. This function allows the programmer himself to execute the sequence program stored in the PC.
Alternatively, the program is compared and collated with a sequence program stored in an external storage medium such as a magnetic tape or a floppy disk. This kind of matching is required
For example, if the program stored on the PC side is once stored on a magnetic tape and then the PC is connected to a mechanical device,
This is because the PC program itself may be modified for adjustment on the site side.

FIG. 21 shows a conventional sequence program collating method by a programmer. As shown in this figure, the programmer sequentially checks the machine language program in the PC and the machine language program stored in the programmer or the storage medium one word at a time according to the registered memory address (step S601, S60
2) When all the words match (step S603;
Y), it is determined to be normal and the collation ends (step S60).
4).

On the other hand, if even one machine language is different (step S601; N), it is judged as a collation error, an abnormality is displayed, and the process ends (step S605).

[0006]

As described above, the conventional collation method has the following problems because an error immediately occurs if even one word differs in the machine language level of the programs to be compared. It was For example, it is assumed that the sequence program as shown in FIG. 22 is stored in each of the PC side and the storage medium side. In this figure, X01, M0
2, M03 indicates an A contact (normally open) of the relay, and M01 indicates a B contact (normally closed). Further, M05 indicates an output coil of the relay.

As shown in FIG. 1A, although these two programs logically represent the same contents,
As shown in FIG. 7B, the description order of the ladder symbols is different, so that they are different at the machine language level. Therefore, the conventional matching method has a problem in that the two programs are determined to be inconsistent even though the two programs are substantially the same.

Therefore, there is a problem that the above problems must be solved.

The present invention has been made in order to solve the above problems, and even if the order in the logic circuit is different, if the control contents are the same, it is possible to determine a sequence. The purpose is to obtain a program matching method.

[0010]

A sequence program collating method according to the present invention controls a machine device in accordance with a stored sequence program, and compares and collates the sequence program with a sequence program stored in an external storage medium or the like. In the sequence controller that has the function to perform, the matrix data is created from both sequence programs to be compared according to a predetermined rule, and both sequences are performed while performing operations such as swapping rows or columns in each matrix data and organizing data. This is to compare and collate programs.

[0011]

In the sequence program collating method according to the present invention, since the sequence program is expressed in a matrix and the rows or columns of each matrix are exchanged, the description order of the logical contents is different between the two sequence programs. Even in this case, an accurate matching result can be obtained.

[0012]

EXAMPLES The present invention will be described in detail below with reference to examples.

First Embodiment FIG. 1 shows a system to which a sequence program collating method according to a first embodiment of the present invention is applied. In this system, the PC 11 is provided with a main memory 15 for storing various editing programs such as the collation program 16 or programs for creating sequence programs.

The PC 11 is provided with a sequence program storage unit 17 for storing a sequence program for controlling the controlled device 13. The collation program 16 and the sequence program are controlled by the control unit 1.
9 is executed. In addition, PC11
Is provided with a buffer memory 18, and the collation program 1
It is designed to be used when executing 6.

Further, a magnetic tape device (M
Devices such as a T) 12 and a display device (CRT) 21 are connected. The former is used to save the contents of the sequence program storage unit 17 as needed, and the latter is used to create the sequence program and display the program during various edits.

The sequence program collation performed in the system having the above configuration will be described.

FIG. 2 shows the main routine of the sequence program collating method in this embodiment.
Prior to the sequence program collation, the control unit 19 (FIG. 1) of the PC 11 loads the compared program stored in the magnetic tape device 12 into the buffer memory 18. Then, the control unit 19 compares the comparison target program stored in the sequence program storage unit 17 with the compared target program stored in the buffer memory 18. Specifically, first, the machine language programs as shown in FIG. 22B are compared word by word (step S101 in FIG. 2). As a result, if both match (step S101; Y), the next machine language is collated (step S102). When the results of the collation for all the machine words match (step S103; Y), it is determined to be normal and the collation ends (step S105).

On the other hand, if the machine words do not match (step S101; N), the process moves to the pre-check routine (step S104).

For example, as shown in FIG. 7, the PC side and MT
Assuming that the sequence ladder programs 31 and 32 are stored on the respective sides, the order of the relay contacts X01 and M01 that are OR-connected between them is reversed, and the AND-connected M02 and M03 are also reversed. The order of is reversed. These two programs logically show the same content, but when comparing machine words one by one, X in the program 31 on the PC side is compared.
01 and the M01 portion of the MT side program 32 do not match. In such a case, the precheck is performed by the precheck routine shown in FIG.

That is, first, with respect to the block in which the mismatch occurs, it is first determined whether the output coils are the same (FIG.
Step S201). In this case, since both output coils are M06 and coincide, this block is extracted (step S202). Then, the lists 33 and 34 of the number of contacts and the names included in this block are created respectively (step S205). And these list 3
3 and 34 are compared with each other, and when these constituent elements are all identical except for the order (step S206;
N), it is determined that there is a possibility of matching (step S20).
8) and shifts to this check routine (step S2)
09). If there is any difference between the constituent elements of the lists 33 and 34 (step S20).
6; Y), and it is determined that there is no match, and a collation error is determined (step S207).

On the other hand, if the output coils are not the same in the block where the data mismatch occurs (step S
201; N), it is searched whether or not there is an output coil that matches a nearby block (step S203). As a result, if the same coil is present in the vicinity (step S
204; Y), and the block is extracted (step S20).
2) If the same coil does not exist in the vicinity (step S204; N), it is determined that there is no match and a collation error is determined (step S207).

Next, the contents of this check routine will be described with reference to FIG. First, the control unit 19 creates a matrix data group A from the compared target program stored in the buffer memory 18 (step S301), and then creates a matrix data group B from the comparison target program stored in the sequence program storage unit 17. Create (step S30
2). Here, with the matrix data, as shown in FIG. 8, each contact included in the block 31 in which the data does not match is extracted, the AND connection contacts are arranged in the column direction, and the OR connection contacts are arranged in the row direction. It is arranged. As a result, the matrix data 36 is generated.

Details of this matrix data creation will be described with reference to FIG. When creating matrix data, follow the following three principle rules.

(1) After registering certain contact data at an appropriate position in the matrix, the contact AND-connected to the contact is registered as matrix data of plus one increment in the column direction.

(2) In the case of the OR-connected contacts, the data is registered as data of a matrix of +1 increment in the row direction.

(3) In the case of a complicated connection circuit such as branching or merging of a plurality of connection series, these plurality of contacts are replaced with one pseudo contact (hereinafter referred to as a block contact). Make a simplification.

As shown in (3) above, the reason why a plurality of contacts having a complicated connection relationship are replaced with one block contact which is a pseudo contact is as follows. That is, when the matrix data as shown in FIG. 9A is considered,
It is uncertain whether this shows the sequence ladder circuit shown in FIG. 7B or the sequence ladder circuit shown in FIG. Therefore, even if data is forcibly created, each ladder circuit cannot be identified from the created data.

As an example corresponding to such a case, FIG. 10 shows four examples. (A) of this figure shows a case where N: 1 merges. In this figure, three AND-connected relay contacts and one relay contact are O
It joins with R connection. In this case, the process of replacing the three AND connection contact groups 41 with one block contact 42 is performed.

Further, FIG. 7B shows a case where the flow is merged in a ratio of 1: N. In this case, similarly to the above, the three AND connection contact groups 43 are replaced with one block contact 44.

FIG. 3C shows a case where the M and N merge. In the case of this figure, two AND connection contact groups 45 are replaced with one block contact 47 and three AND connection contact groups 46 are replaced with one block contact 48.

FIG. 3D shows an example of a block having a branch. In this case, the two AND connection contact groups 49 are replaced with one block contact 51, and the contact group 52 composed of the block contact 51 and the contact 53 connected to the OR is connected to one block contact 5.
The process of replacing with 4 is performed.

In this way, by repeating the process of blocking for combining a plurality of contacts into one, it is possible to convert into a simple description. When the block contact is used for description, the block contact registered as the matrix data further includes the matrix data therein.

Now, in FIG. 5, the control unit 19 checks whether or not there is data that cannot be directly converted into matrix data in the ladder circuit diagram (step S401). Here, the data that cannot be directly converted refers to the four examples described in FIG. If there is unconvertible data in the block as a result of this determination, a process of replacing this unconvertible portion with a block contact is performed (step S403), and the next unconvertible data is searched. .. Then, when there is no unconvertible data (step S401:
N), matrix data is created (step S402).
The creation of matrix data specifically means registration of the above-mentioned contact and block contact.

Subsequently, the control unit 19 judges whether or not there is a block contact inside the created matrix data, and if a block contact is included (step S404; Y), the contents of the block contact are extracted. (Step S405),
Matrix data is created based on the extracted contents (step S406). Then, the matrix data is continuously created (step S402).

An example of creating the above matrix data will be described with reference to FIG. First, consider a case where matrix data is created based on a sequence ladder circuit diagram as shown in FIG. In this case, as shown in the figure, relay contact M03
And the junction point of the contact point X01 exists between X03 and X03. Therefore, the two contacts M01 and M03 are first registered as the matrix data a ₁ , and the two contacts M01 and M03 are replaced with one block contact Bk1 and converted into the sequence ladder circuit diagram as shown in FIG. To do.

Here, further, relay contacts X03 and M04
When it is found that the relay contact M02 is merged and connected between the two, the three contacts of the block contact Bk1 and the contacts X03, X01 are registered as one matrix data a ₂ , and these contacts are regarded as one block contact Bk2. It is replaced and converted into a sequence ladder circuit diagram as shown in FIG. For the first time, there is no portion that cannot be converted into matrix data, such as a plurality of merges or branches, and three block contacts Bk2, M04, M02 are registered as matrix data a ₃ .

The data structure of the matrix data created as described above is as shown in FIG. That is, the matrix data a as shown in FIG. 2B is used as matrix data representing the entire original sequence ladder circuit diagram (a).
₃ is created, and further, matrix data a ₂ shown in FIG. 7C is created as matrix data representing the inside of the block contact Bk2. Block contact B of these
Matrix data a ₁ shown in FIG. 9D is created as matrix data representing the inside of k1.

Each matrix data group created as described above is stored in a predetermined work area on the main memory 15 (FIG. 1).

FIG. 13 shows a matrix data group A and a matrix data group B stored in a predetermined work area on the main memory 15. Here, the matrix data group A is composed of matrix data a _{1 to} a ₃ created from the compared program stored in the buffer memory 18. Similarly, the matrix data group B is composed of matrix data b _{1 to} b ₃ created from the comparison target program stored in the sequence program storage unit 17.

The matrix data group A,
When the creation of B is completed (steps S301 and S30 in FIG. 4).
2) Next, the control unit 19 performs a comparison and collation routine process (step S303). The details of this comparison and collation routine will be described below with reference to FIG.

The control section 19 first sets "1" in the variable i (step S501), and extracts the matrix data a _i , b _i from the matrix data groups A, B shown in FIG. 13 (step S502). Since i = 1 here, the matrix data a
₁ and b ₁ are extracted and compared with each other (step S503). If these match (step S
504; Y), an end flag is set to the matrix data for which this comparison and collation has been completed (step S505). On the other hand, if these do not match (step S504; N),
The matching element data in the matrix is searched, and it is checked whether this can be rearranged (step S506). If there is sortable data (step S50)
7; Y), the contents of the matrix data a ₁ are rearranged (step S508). On the other hand, when rearrangement is no longer possible (step S507; N), an error flag is set (step S509).

Here, rearrangement of matrix data is performed according to the following principle.

(I) Sorting is performed in units of rows.

(Ii) When the row data is blank, the data is organized by moving up to the upper row.

(Iii) Rearrange in units of columns.

An example of rearranging data based on the above principle will be described with reference to FIG. Here, the matrix data a _{i to} be compared is as shown in FIG.
It is assumed that the matrix data b _{i to be} compared is as shown in FIG. In this case, matrix data a _i and matrix data b _i
Therefore, in principle, the first row and the second row are rearranged so that they are rearranged as shown in FIG. As a result, the second and third columns of the first row are blank, and therefore, in accordance with the principle (ii), as shown in FIG. 7D, the two data "B" and "C" of the second row are used. To move to the line above. Further, according to the principle (iii), as shown in (e) of the figure, data rearrangement is performed so that the second column and the third column are completely interchanged. As a result, the matrix data a _i and the matrix data b _i become the same matrix data.

After such rearrangement, the contents of the matrix data a ₁ and b ₁ are compared again (step S50 in FIG. 6).
3) If they match (step S504;
Y), and the process proceeds to step S505. The above processing is
Until the final matrix data is obtained (step S510;
Y), the value of the variable i is sequentially incremented (step S511) and is repeatedly performed. As a result,
In this case, the contents of the matrix data group A and the contents of the matrix data group B in 3 are all collated.

As a result of the above collation, if all the matrix data match each other, it is determined that there is no collation error (step S305 in FIG. 4), and the process is terminated. On the other hand, as a result of the comparison and collation, if there is a mismatched portion (step S304; Y), it is determined that there is a collation error (step S306), and the process ends.

As described above, in this embodiment, when a mismatched portion is found as a result of comparing and collating one word at a machine language level, matrix data groups are created for both sequence ladder circuit diagrams, respectively. In collating the created individual matrix data, by rearranging the data according to a predetermined rule, it is possible to determine that the programs are the same as long as they are logically the same.

Second Embodiment By the way, in the above-described embodiment, in step S206 of the pre-check routine (FIG. 3), the constituent elements of the tables 33 and 34 (FIG. 7) on the PC side and the MT side are partially different. In such a case, a collation error is generated because there is no possibility of coincidence, but it is possible to add a process for searching for a possibility of coincidence as described below.

For example, as shown in FIG. 16, the PC side and M
The sequence ladder programs 61 and 62 respectively stored on the T side are compared. In this figure, the output coil Y01 matches in the block 63 on the PC side and the block 64 on the MT side, but the other contacts do not match. However, these two programs logically show the same content. That is, in the block 63 of the program 61, only the contacts M05 and Y02 are AND-connected to the output coil Y01.
For No. 5, the corresponding output coil M5 exists in the adjacent block 65 and replaces the contact group (X01, X02, X03, X04, M03) arranged in this block 65. Therefore, considering the block 65, it can be seen that the block 63 represents the same logical content as the block 64 of the program 62 on the MT side.

The present embodiment makes it possible to determine the coincidence between the two in such a case, and this is shown in FIG.
This will be described with reference to FIG.

First, as a result of comparison between the PC side program 61 and the MT side program 62 (step S101 in FIG. 2, FIG. 16), if the machine language programs in the blocks 63 and 64 do not match (see FIG. 2, FIG. 16 steps S1
01; N), and shifts to the pre-check routine (FIG. 15) (step S104).

In the pre-check routine, it is first determined whether or not the output coils of the blocks 63 and 64 in which the mismatches occur are the same (step S601 in FIG. 15).
If the output coils are the same (step S601; Y),
The blocks are extracted, and if they are not the same (step S6)
01; N), and it is searched whether or not there is an output coil that matches a nearby block (step S603). As a result, if the same coil is present in the vicinity (step S6)
04; Y), the block is extracted (step S60).
2) If it does not exist in the vicinity (step S604; N), it is determined that there is no match and a collation error is determined (step S619).

In this case, the output coils are both Y01 and coincide with each other (step S601 in FIGS. 15 and 16;
Y), these blocks 63 and 64 are extracted (step S602).

Next, lists 65 and 66 of the numbers and names of contacts included in each block are created (step S605), and the two are compared with each other. As a result, when all of these constituent elements match each other except for the order (step S606; N), it is determined that there is a possibility of matching (step S607), and the process proceeds to this check routine (FIG. 4). (Step S608).

On the other hand, if there is any difference between the constituent elements of the lists 65 and 66 (step S606;
Y), the table is corrected by deleting only the matching portion from both lists (step S609). In this case, the contact Y2 is the same and is deleted, and the list is 67, 68 (see FIG.
It becomes like 6).

In general, when the contact is replaced as described above, the number of members included in the list on the side where the replacement is made is smaller. Therefore, here P
Since the number of members in the list 67 on the C side is smaller, it is estimated that the replacement is performed on the PC side. Here, since the list 67 includes only the contact M5, it is determined that the output coil M5 corresponding to this is replaced. Then, from the PC side program 61 to the output coil M5
Is searched (step S610). When the corresponding coil is found (step S611), the block including the coil is extracted and the contact configuration list is created (step S612). In this case, the block 6 including the coil M5
5 (FIG. 17) is extracted, and the list 71 (FIG. 17) is created. Next, this list 71 and the list 68 on the MT side
Is compared (step S613), and if they do not match (step S613; Y), the process returns to step S609 to repeat the process of step S613. If the lists do not match even after repeating such a predetermined number of times (n times), it is determined that there is no match and a matching error is generated (step S619).

On the other hand, if the lists 71 and 68 match (step S613; N), it is determined that there is a possibility of matching (step S615), and the contact group 72 is extracted from the block 65 including the coil M5 on the PC side. (Step S61
6) This is set instead of the corresponding contact M5 of the original comparison target block 63 (step S617). In this way, as a result, the block 63 and the block 65 are combined to obtain a combined block 73, and the process proceeds to the next main check routine (FIG. 4) (step S608).

In this check routine, the combined block 73 on the PC side and the block 64 on the MT side are compared in detail by the same processing as in the first embodiment. Specifically, the matrix data a _{1 to} a ₁ are used by using the block contacts according to the procedure shown in FIGS.
Create ₃ . The data structure of the matrix data thus obtained is as shown in FIGS.

In the second embodiment, what is originally represented as one block 73 is intentionally divided into two blocks 63 and 65, and the following cases apply.

For example, in FIG. 20, the coils DIP of the original position control block 75 of all the units on the production line are AND-connected to them, and all the contacts X1 to X3 indicating the original positions of the first to third units are all in the make state. Only when it is excited, the contact DI of the jig tightening block 76
Make P This indicates that the jig cannot be tightened unless all units are in place. Therefore, originally, if the contacts X1 to X3 of the block 75 are arranged in place of the contact DIP of the block 76, the same operation can be ensured, and it is not necessary to divide the blocks 75 and 76 into two.

However, for example, when adding the fourth unit, it is sufficient to add an in-position display contact for the fourth unit to the position A of the block 75 of the two blocks 75 and 76. No modification is required for 76.

As described above, the expression by dividing into a plurality of blocks has an advantage that only a necessary portion can be modified without impairing the standardized circuit pattern as much as possible. Therefore, according to the second embodiment described above, it is possible to perform the collation accurately while maintaining such advantages.

[0065]

As described above, according to the present invention,
Since the sequence programs are expressed as a matrix and then the rows and columns of each matrix are exchanged for matching, even if the sequence order of the logical contents is different between the sequence programs, the logic itself does not differ. As long as they are doing so, it is possible to obtain the matching result that they are the same. Therefore, there is an effect that the accuracy of comparison and collation can be improved.

Further, generally, a method of registering a standard circuit example in advance is used as a method of diverting and designing design elements at the time of control design. However, if the present invention is applied to this, the designed circuit contents And the standard circuit can be compared and checked to check the logical identity, which has an effect of contributing to the standardization of the design.

[Brief description of drawings]

FIG. 1 is a block diagram showing a sequence controller system to which a sequence program matching method according to an embodiment of the present invention is applied.

FIG. 2 is a flowchart showing a main routine of the present sequence program matching method.

FIG. 3 is a flow chart for explaining the contents of a pre-check routine in FIG.

FIG. 4 is a flow chart for explaining the contents of a main check routine in FIG.

5 is a flow chart for explaining the contents of a matrix data group creation routine in FIG.

FIG. 6 is a flowchart for explaining the contents of the comparison / collation routine in FIG.

FIG. 7 is an explanatory diagram showing a specific example of precheck.

FIG. 8 is an explanatory diagram showing a specific example of creating matrix data.

FIG. 9 is an explanatory diagram for explaining the reason why blocking of relay contacts is necessary.

FIG. 10 is an explanatory diagram showing a case where blocking of relay contacts is required.

FIG. 11 is an explanatory diagram showing an example of creating matrix data including block contacts.

FIG. 12 is an explanatory diagram showing a structure of matrix data including block contacts.

FIG. 13 is an explanatory diagram showing a matrix data group registered in a work area of the main memory.

FIG. 14 is an explanatory diagram showing a specific example of a matching process that involves row and column replacement of matrix data and data reduction.

FIG. 15 is a flowchart for explaining a pre-check routine of a sequence program matching method according to the second embodiment of the present invention.

FIG. 16 is an explanatory diagram showing a specific example of precheck in the second embodiment.

FIG. 17 is an explanatory diagram connected to FIG.

FIG. 18 is an explanatory diagram showing an example of creating matrix data including block contacts in the second embodiment.

FIG. 19 is an explanatory diagram showing a structure of matrix data including block contacts in the second embodiment.

FIG. 20 is a circuit diagram showing a sequence circuit suitable for application of the sequence program matching method according to the second embodiment.

FIG. 21 is a flowchart showing a conventional sequence program matching method.

FIG. 22 is an explanatory diagram showing a specific example of a conventional sequence program matching method.

[Explanation of symbols]

 11 Sequence Controller 12 Magnetic Tape Device 13 Controlled Device 15 Main Memory 17 Sequence Program Storage 18 Buffer Memory 19 Control

 ─────────────────────────────────────────────────── ─── Continuation of the front page (72) Inventor Toru Motojima 1-7 Kitajizoyama, Noda-cho, Kariya City, Aichi Toyota Koki Co., Ltd. Mechatronics Division

Claims (1)

[Claims] 1. A sequence controller having a function of controlling a mechanical device according to a stored sequence program and comparing and collating the sequence program with a sequence program stored in an external storage medium or the like. The sequence program collation is characterized in that matrix data is created in accordance with a predetermined rule from the above, and both sequence programs are compared and collated while performing operations such as transposing rows or columns in each matrix data and organizing data. Method.