KR20010106422A - Ladder circuit editing device - Google Patents

Abstract

The ladder circuit editing apparatus according to the present invention inputs and edits a sequence program of a program controller in the form of a ladder diagram, and inputs an input completion area in which at least one input circuit pattern is stored and a new circuit pattern. In a ladder type circuit editing apparatus having an area and inputting a sequential circuit pattern in an input area, the components of the circuit pattern input to the input area and the components of the circuit pattern stored in the input completion area are compared; Circuit pattern extraction means for extracting a circuit pattern including a corresponding component, display means for displaying the circuit pattern extracted by the circuit pattern extraction means on an input screen, and circuit pattern extracted by the circuit pattern extraction means in accordance with an operation input Copying means for copying the data to the inputted area.

Description

Ladder type circuit editing device {LADDER CIRCUIT EDITING DEVICE}

7 is a diagram showing an example of a general sequence program displayed on a ladder circuit. Conventionally, a programmable controller is used to perform sequence control of a mechanical facility. In addition, the programming method of this programmable controller generally uses a ladder circuit (ladder diagram) in FIG.

Such ladder circuits generally have many parts which are described by repetition of circuits having the same configuration, and in many cases, only variable names such as each contact name and coil name of the same circuit are different. Conventionally, in the construction and editing of a sequence program which is constituted by repetition of the same circuit, and only variable names have regularity and changeable repetitive parts, basics as disclosed in Japanese Patent Application Laid-Open No. Hei 4-286002 When the regularity of the structural unit and variable name is specified, the basic unit copy is automatically repeated, and the variable name is automatically given according to the regularity to automatically generate the repetitive part, and the automatic generation result is converted into a ladder circuit. There was a copy function.

In addition, the basic structural unit and the variable name regularity as disclosed in Japanese Patent Application Laid-Open No. Hei 2-5102 are stored in a memory or an external storage device in the form of a library and specified in a memory or an external storage device as necessary. Others have the function of selecting and reading circuit patterns and performing automatic generation.

However, in the prior art as described above, it is inconvenient for the operator to consciously perform extraction and storage of the basic structural unit. In addition, when the basic unit registered in advance is used for editing, for example, the operation of selecting the basic unit of interest from many basic units stored in a library form is performed by the operator. When the number of registrations increases, it becomes difficult to judge which circuits of the processing contents have been registered, and it is necessary to search the predetermined auxiliary storage device of the program apparatus throughout, which is inconvenient in operation.

Furthermore, even if several basic structural units are registered in advance, the registered ones are not always used. Therefore, it is difficult to maintain the efficiency of the design because there is a registration circuit that does not press or use the capacity of the auxiliary storage device.

The object of the present invention is to solve the above problems, and it is possible for the operator to automatically perform a search for similar ladder circuits without executing unnecessary operations, and to use the capacity of the auxiliary storage device unnecessarily. The present invention provides a ladder circuit editing apparatus capable of improving the efficiency of ladder circuit design.

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a programmable controller for controlling mechanical equipment, and more particularly, to a ladder circuit editing apparatus for programming a ladder circuit of a programmable controller.

1 is a block diagram showing the device configuration of the ladder-type circuit editing apparatus of the present invention;

2 is a view showing the names of each part of the ladder circuit,

FIG. 3 is a diagram showing the configuration of a memory, i.e., a character memory, when the ladder circuit is held in the memory;

4 is a diagram showing the configuration of one component of the character memory;

5 is a diagram illustrating an internal data structure of a symbol unit;

6 is a diagram showing an example of a code set in an instruction code section;

7 shows an example of a general sequence program represented by a ladder circuit;

FIG. 8 is a diagram showing the configuration of a memory having a ladder circuit in a memory, that is, a character memory;

9 is a view showing a state in which a part of the components of the ladder circuit is added to the ladder circuit shown in FIG.

FIG. 10 is a diagram showing the configuration of a memory, i.e., a character memory, when the ladder circuit is held in the memory;

Fig. 11 shows a comparison position table created in a memory when the apparatus processes a search operation;

FIG. 12 shows a comparison position table created in a memory when the apparatus processes a search operation; FIG.

FIG. 13 is a diagram showing the configuration of a search character memory for temporarily evacuating components of a ladder circuit for comparison; FIG.

14 is a flowchart of a main program for executing search processing;

15 is a flowchart of a subroutine that executes "search for starting condition part";

16 is a flowchart of a subroutine which executes "search for an interlock part";

17 is a flowchart of a subroutine that executes "search for an output unit";

18 is a flowchart of a subroutine for executing " next circuit block search "

19 is a flowchart of a subroutine for executing "pattern matching processing";

20 is a diagram showing an example of a message displayed on a CRT when a pattern matches;

Fig. 21 is a diagram showing a ladder circuit as a result of copying search character memory data to the character memory;

FIG. 22 shows a state on the character memory of the ladder circuit shown in FIG. 21;

23 shows an example of another ladder circuit;

Fig. 24 is a diagram showing the configuration when the ladder circuit is stored in the character memory;

FIG. 25 is a view illustrating a state in which a part of components of a ladder circuit added to the ladder circuit shown in FIG. 23 are added;

Fig. 26 is a diagram showing the configuration of a memory, i.e., a character memory, in the case of holding a ladder circuit in a memory;

27 is a diagram showing the configuration of a character memory for temporarily retracting a ladder circuit for comparison;

FIG. 28 shows the structure of a character memory for temporarily retracting a ladder circuit for comparison; FIG.

29 is a flowchart of a main program for executing search processing;

30 is a flowchart of a subroutine for executing "pattern matching processing";

31 is a diagram showing an example of a message to be displayed on a CRT when a pattern matches;

32 shows a table of a circuit pattern storage list;

33 is a view showing a circuit pattern storage area;

34 is a view showing a circuit pattern position table;

35 shows a circuit pattern position character memory table;

36 is a flowchart of a main program for executing search processing;

37 is a flowchart of a subroutine for executing "pattern matching processing";

Fig. 38 is a flowchart of a subroutine for executing " circuit pattern replacement processing "

Disclosure of the Invention

The ladder circuit editing apparatus according to the present invention inputs and edits a sequence program of a program controller in the form of a ladder diagram, and inputs an input completion area in which at least one input circuit pattern is stored and a new circuit pattern. In a ladder circuit editing apparatus having an area and inputting a sequential circuit pattern in an input area, the components of the circuit pattern input to the input area and the components of the circuit pattern stored in the input completion area are compared and matched. Circuit pattern extracting means for extracting a circuit pattern including the constituent elements, display means for displaying the circuit pattern extracted by the circuit pattern extracting means on an input screen, and circuit pattern extracted by the circuit pattern extracting means in accordance with an operation input. Copy means for copying to the input area is provided.

The display means sequentially displays a plurality of circuit patterns extracted by the circuit pattern extracting means, and the copying means copies arbitrary circuit patterns selected in accordance with the operation input from the plurality of circuit patterns sequentially displayed to the input region.

In addition, the display means preferentially displays the previously selected circuit pattern.

Further, there is further provided a selection circuit pattern address storage area for storing the address of the circuit pattern selected last time and replacement means for replacing the address of the selected circuit pattern with the top of the selection circuit pattern address storage area, and the display means further includes a selection circuit pattern address storage area. The previously selected circuit pattern is first displayed in accordance with the address order stored in the table.

Best Mode for Carrying Out the Invention

EMBODIMENT OF THE INVENTION Hereinafter, each Example of this invention is described according to drawing.

<Example 1>

1 is a block diagram showing the device configuration of the ladder type circuit editing apparatus of the present invention. In Fig. 1, reference numeral 0101 denotes a ladder circuit editing apparatus, reference numeral 0102 denotes a CRT, reference numeral 0103 denotes a keyboard, reference numeral 0104 denotes an auxiliary memory device, reference numeral 0105 denotes a processor, and reference numeral 0106 denotes a screen controller. ) Denotes a key input controller, 0108 denotes an auxiliary memory controller, 0109 denotes a memory, and 0110 denotes an action key.

2 is a diagram showing names of respective parts of the ladder circuit. In Fig. 2, reference numeral 0201 is a ladder circuit. As will be described later in detail, the ladder circuit 2021 has a left busbar 0020, a start conditional section 0203, an interlock section 0204, an output section 0205, and a right busbar 0206.

FIG. 3 is a diagram showing the configuration of a memory (hereinafter referred to as a character memory) in the case where the ladder circuit 0201 is held in the memory 0109. As shown in FIG. In FIG. 3, reference numeral 0301 denotes a character memory stored in a predetermined position of the memory 0109. In FIG.

4 is a diagram showing the configuration of one component of the character memory. In Fig. 4, reference numeral 0401 denotes a device number portion, and reference numeral 0402 denotes a symbol portion.

5 is a diagram showing an internal data structure of the symbol portion 0402. FIG. In Fig. 5, reference numeral 0403 denotes an instruction code portion, and 0404 denotes a branch designation portion.

FIG. 6 is a diagram showing an example of a code set in the instruction code section 0403. As shown in FIG.

7 is a diagram illustrating an example of a ladder circuit. In the figure, reference numeral 0501 is a ladder circuit.

FIG. 8 is a diagram showing the configuration of a memory, that is, a character memory, in the case where the ladder circuit 5051 is held in the memory 0109. FIG. In Fig. 8, reference numeral 0601 denotes a character memory stored in a predetermined position of the memory 0109.

FIG. 9 is a view illustrating a state in which some components of a ladder circuit added to the ladder circuit shown in FIG. 7 are added. In the figure, reference numeral 0701 denotes a ladder circuit, and 0702 denotes an additional part.

FIG. 10 is a diagram showing the configuration of a memory, that is, a character memory, when the ladder circuit 0701 is held in the memory 0109. FIG. In Fig. 10, reference numerals 0801 and 0802 denote character memories stored in predetermined positions of the memory 0109. In Figs. The character memory 0801 constitutes an input completion area in which at least one input circuit pattern is completed. On the other hand, the character memory 0802 is a character memory corresponding to the additional portion 0702 and constitutes an input area for inputting a new circuit pattern.

FIG. 11 is a diagram showing a comparison position table created in the memory 0109 when the apparatus processes a search operation. In Fig. 11, reference numeral 0901 denotes a comparison position table for indicating a position on the character memory 0801 currently being edited, reference numeral 0902 denotes a column number area of the comparison position table 0901, and reference numeral 0003 a comparison position. A row number area of the table 0901 is shown.

Fig. 12 is a diagram showing a comparison position table created in the memory 0109 when the apparatus processes a search operation. In Fig. 12, reference numeral 004 denotes a search position table for indicating a position on which the search process is executed on the character memory 0801, numeral 0009 denotes a column number area of the index position table 0904, numeral 0906 denotes a search. A row number area of the position table 0904 is shown.

FIG. 13 is a diagram showing the configuration of the search character memory for temporarily evacuating the components of the ladder circuit for comparison. In Fig. 13, reference numeral 1001 denotes a search character memory, and 1002 denotes a device number portion of the search character memory 1001.

14, 15, 16, 17, 18 and 19 are flowcharts of the processing unit 0105. 20 is a diagram illustrating an example of a message displayed on a CRT when a pattern matches. In Fig. 20, 1301 is a message.

Fig. 21 is a diagram showing a ladder circuit after the pattern matches. In Fig. 21, reference numeral 1310 denotes a ladder circuit after pattern matching.

Fig. 22 shows the character memory after the pattern matches. In Fig. 22, reference numeral 1311 denotes a character memory of the ladder circuit 1310.

Next, the operation will be described. In general, as shown in Fig. 2, the ladder circuit has a starting conditional section 0203 on the right side of the left bus bar 0202 and an output part 0205 on the left side of the right bus bar 0206. Moreover, the interlock part 0204 is combined between the starting condition part 0203 and the output part 0205, and the ladder circuit | 0201 is comprised.

In order to edit such a ladder circuit, it is executed by the ladder circuit editing apparatus 0101 shown in FIG. First, when a key is input by the keyboard 0103, a symbol of an instruction according to the key is displayed on the CRT 0102, and data is stored in the memory 0109. The memory area to be stored is referred to as a character memory as described above, and the character memory is configured as shown in FIG. 3, for example. The character memory 3031 is arranged in the same layout as the screen display, and can indicate the position in (rows and columns).

As shown in FIG. 4, each one component of the character memory 3031 is composed of a symbol portion 0402 to which a symbol of an instruction is set and a device number portion 0401 to which a device number is set. As shown in Fig. 5, the symbol portion 0402 has an internal structure composed of an instruction code 0403 and a branch designator (0404). As the data to be written in the command code 0403, for example, there is a value displayed in the code table 0405 of the command code section shown in FIG.

For example, the start conditioner 2003 of the ladder circuit 2021 of FIG. 2 has data at positions (1, 1) and (2, 1) on the character memory 3001 of FIG. As for the value of the data at the position of (1, 1), referring to Fig. 5, 4 feet of the instruction code section 0403 is the instruction code 0 and 4 feet of the branch designator 0404, so that there is a branch at the bottom, 00000100B to be. The data value of (2, 1) is 00001000B because the four bits of the instruction code section 0403 are the branch of the instruction code 0 and the four bits of the branch designator 0404.

Here, it is assumed that the ladder circuit 5051 shown in Fig. 7 has already been inputted, and the character memory 0601 corresponding to this is stored in the memory 0109 as shown in Fig. 8. The case where an additional portion 0702 is added to the ladder circuit 5051 will be described (Fig. 9). By adding the additional portion 0702, the character memory is as shown in FIG. As described above, the character memory at this time is composed of a character memory 0801 constituting the input completed area and a character memory 0802 constituting the input area.

In this state, the operation is performed by the keyboard 0103 to issue a search instruction. The search instruction is instructed, for example, by pressing a function key 0110 of the keyboard 0103 or the like. By pressing the function key 0110, line number 5 of the input area 0802 shown in FIG. It is set in the row number area 0903 of the comparison position table 0901 shown in FIG. Thereafter, the retrieval processing is started.

The search process is processed in accordance with the flowchart of FIG. 14, and roughly in the order of the matching test (check) of the pattern of the starting conditional section 2003, the matching test of the pattern of the interlock unit 0204, and the matching test of the pattern of the output unit 0205. Is executed. The processing will be described according to the flowchart in FIG. When the search processing is started, first, in step 11100, 0 is set in the row number area 0906 of the search position table 0904. In step 11101, "next circuit block search" is executed. The subroutine of "next circuit block search" will be described later in detail. Next, in step 11102, the "search for starting condition part" is executed. The subroutine of "search for starting condition part" will also be described in detail later.

In step 11103, it is determined whether or not the patterns match. If there is a match, the search for the interlock portion is executed in step 11104. The subroutine of "search for the interlock part" will also be described later in detail. In step 11105, it is determined whether the patterns match. If there is a match, &quot; search for output unit &quot; The subroutine of "search for output" is also described later. Next, in step 11107, it is determined whether the patterns match. If there is a match, the flow advances to step 11108 to execute the "pattern matching process" to end the process. The subroutine of "pattern matching processing" will also be described later.

If it is determined in step 11103 that the pattern does not match, the search for the interlock portion is executed in step 11109. If it is determined in step 11110 that the pattern matches, the flow advances to step 11108 to execute "pattern matching processing" to end the processing. On the other hand, if it is determined in step 11110 that the patterns do not match, the flow advances to step 11111 to execute "search for the output unit". When it is determined in step 11112 that the pattern matches, the flow advances to step 11108 to execute "pattern matching processing", and the processing ends. If it is determined in step 11112 that the patterns do not match, then the &quot; next circuit block search &quot; In step 11114, it is determined whether there is data, and if not, it ends. If there is data, the process proceeds to step 11102 and the process is repeated.

The "search for starting condition part" in the flowchart shown in FIG. 14 is processed in accordance with the flowchart of FIG. First, in step 11201, (1, 1) is set at the search start positions L and C. FIG. In step 11202, the value (1) of the row number area 0903 of the comparison position table 0901 is set to (Lc, Cc). Next, in step 11203, the symbol portion 0402 of the position data of the (L, C) of the search character memory 1001 and the position data of the (Lc, Cc) of the character memory 0801 is compared.

In step 11204, it is determined whether or not there is a match. If not, in step 11205, the value Lc and the value of the row number area 0903 of the comparison position table 0901 are compared. If it is the same, it is determined in step 11206 that the patterns do not match and the process ends. If it is not the same in step 11205, the flow advances to step 11211, it is determined that the pattern is matched, and the processing ends.

If it is determined in step 11204 that the pattern matches, the flow advances to step 11207, where L = L + 1. In step 11208, it is checked whether there is data in the position of (L, C) of the search character memory 1001. In step 11209, it is determined whether there is data, and if there is no data, the process proceeds to 11211 and determines that the pattern is matched, and the process ends. If it is determined in step 11209 that there is data, the process proceeds to step 1112, where Lc = Lc + 1, the process returns to step 11203, and the process is repeated.

The "search for the interlock part" in the flowchart shown in FIG. 14 is processed in accordance with the flowchart of FIG. First, in step 11301, (1, 2) is set at the search start positions L and C. FIG. In step 11302, the value (2) of the row number area 0903 of the comparison position table 0901 is set to (Lc, Cc). Next, in step 11303, the symbol portion 0402 of the position data of the (L, C) of the search character memory 1001 and the position data of the (Lc, Cc) of the character memory 0801 is compared.

In step 11304, it is determined whether or not there is a match, and in step 11305, Lc is compared with the value of the row number area 0903 of the comparison position table 0901. If it is the same, it is determined in step 11306 that the patterns do not match and the process ends. If it is not the same in step 11305, the flow advances to step 11307, where it is determined that the pattern matches and the process ends.

If it is determined in step 11304 that the pattern matches, the flow advances to step 11308, where L = L + 1. After that, in step 11309, it is checked whether there is data in the position of (L, C) of the search character memory 1001. In step 11310, it is determined whether there is data, and if there is no data, the process proceeds to 11311 where Cc = Cc + 1. In step 11312, it is determined whether Cc = 8. If 8, the process proceeds to step 11307, where it is determined that the pattern matches and the process ends. If it is determined in step 1112 that Cc is not 8, the value of the row number area 0903 of the comparison position table 0901 is set in Lc in step 1113, and the processing returns to step 11303 to repeat the process.

If it is determined in step 1113 that there is data, the process proceeds to step 111313, where Lc = Lc + 1, and the process returns to step 11303 to repeat the process.

The "search for the output unit" in the flowchart shown in FIG. 14 is processed in accordance with the flowchart of FIG. First, in step 11401, (1, 8) is set at the search start positions L and C. FIG. In step 11402, (Lc, Cc) (the value of the row number area 0903 of the comparison position table 0901, 8) is set. Next, in step 11403, the symbol portion 0402 of the position data of (L, C) of the search character memory 1001 and the position data of (Lc, Cc) of the character memory 0801 are compared.

In step 11404, it is determined whether or not there is a match. If not, in step 11405, the value Lc and the value of the row number area 0903 of the comparison position table 0901 are compared. If it is the same, it is determined in step 11406 that the patterns do not match and the process ends. If it is not the same in step 11405, the flow advances to step 1114 to determine that the pattern is matched, and the process ends.

If it is determined in step 11404 that the pattern matches, the flow advances to step 11407 to set L = L + 1. In step 11408, it is checked whether there is data in the position of (L, C) of the search character memory 1001. In step 11409, it is determined whether there is data, and if there is no data, the process proceeds to 11410 and determines that the pattern is matched, and the processing ends.

If it is determined in step 11409 that there is data, the process proceeds to step 11411, where Lc = Lc + 1, and the process returns to step 11403 to repeat the process.

"Next circuit block search" in the flowchart shown in FIG. 14 is processed by the flowchart of FIG. First, in step 11500, it is determined whether the value of the row number area 0906 of the search position table 0904 is zero. If not 0, (0, 1) is set in (L, C) in step 1152. Next, in step 11503, the position data of the line number area (0906) + L, C of the search position table 0904 on the character memory 0801 is checked. In step 11504, the branch designation (0404) of the symbol section 0402 determines whether the lower bit is on. If it is on, the process proceeds to step 11505 where L = L + 1. Next, the feedback process of step 11503 is repeated.

If the bit is not on in step 11504, i.e., there is no downward branch, the process proceeds to step 11506, where C = C + 1. In step 11507, the position data of the line number area (0906) + L, C of the search position table (0904) on the character memory 0801 is checked. In step 11508, the branch designation (0404) of the symbol portion 0402 determines whether the lower bit is on. If it is on, the process advances to step 11505 to repeat the process. If it is not turned on in step 11508, it is determined in step 11509 whether C = 8. If C = 8, the process returns to step 11506 and the process is repeated. If C = 8, the flow proceeds to step 11510.

In step 11510, L + 1 is added to the value of the row number area 0906 of the search position table 0904. In step 11511, the position data of the row number area (0906) + L, C of the search position table 0904 on the character memory 0801 is checked. In step 11112, it is determined whether there is data, and in step 1113, C = 1. In step 11514, L = 0, and in step 1115, the position data of (line number area 0906 + L, C in search position table 0904) on the character memory 0801 is checked. In step 1516, the branch designation (0404) of the symbol unit 0402 determines whether the lower bit is on. If it is on, L = L + 1 is set in step 11517, and the process returns to step 11515 to repeat the process.

If the value of the row number area 0906 of the search position table 0904 is 0 in step 11500, the value of the row number area 0906 of the search position table 0904 is set to 1, and the flow proceeds to step 11511. . If it is determined in step 11512 that there is no data, it is determined in step 11518 that there is no data and the processing ends.

If it is determined in step 11516 that the bit is not on, then C = C + 1 in step 1115. Next, in step 1520, the position data of the line number area (0906) + L, C of the search position table 0904 on the character memory 0801 is checked. In step 11911, the branch designation (0404) of the symbol unit 0402 determines whether the lower bit is on. If the bit is on, the flow advances to step 11517 to repeat the process. If the bit is not on, it is determined in step 11922 whether C = 8. If C = 8, the flow proceeds to step 11523, and the data of L rows is copied to the search character memory 1001 in the row of the line number area 0906 of the search position table 0904 on the character memory 0801, and ends. If C = 8 in step 11522, the flow returns to step 11519 to repeat the process.

When the processing so far has been completed, the row of the portion where the components on the character memory 0801 match in step 11523 has been copied to the search character memory 1001. That is, in the present embodiment, the third to fourth lines on the character memory 0801 are copied to the search character memory 1001.

14, 15, 16, 17, and 18, therefore, the flow chart shown in Figs. 14, 15, 16, 17, and 18 shows the components of the circuit pattern being input into the character memory 0802, which is the input area, and the character memory, which is the input completion area. Circuit pattern extracting means for comparing the components of the circuit pattern stored in (0801) and extracting the circuit pattern including the corresponding components is constituted.

"Pattern matching process" called in step 11108 in the flowchart shown in FIG. 14 executes the processing according to the flowchart of FIG. First, in step 1206, the data of the device numbering section 1002 of the search character memory 1001 is deleted. In step 1207, the data of the search character memory 1001 is displayed on the CRT (0102). In step 1208, it is inquired whether this is OK. This is indicated, for example, by the message 1301 shown in FIG. Steps 1207 and 1208 constitute display means for displaying the circuit pattern extracted by the circuit pattern extraction means on the CRT (0102) which is an input screen.

Thereafter, the operator's operation input is executed by, for example, the keyboard 0103. If it is determined in step 1209 that " OK &quot; is not selected, the search result is discarded in step 1211 and the processing ends.

On the other hand, if it is determined in step 1209 that " OK " is selected, the flow advances to step 1210 in which the data of the search character memory 1001 is stored in the row of the row number area 0903 of the comparison position table 0901 of the character memory 0801. Set it. In other words, the data of the search character memory 1001 is copied to the character memory 8801. That is, step 1210 constitutes copying means for copying the circuit pattern extracted by the circuit pattern extracting means to the character memory 0801 which is an input region.

When the data of the search character memory 1001 is copied to the character memory 0801, the ladder circuit becomes like the ladder circuit 1310 shown in FIG. The character memory corresponding to this is the same as the character memory 1311 shown in FIG. At this time, the ladder circuit becomes like the ladder circuit 1310. In this way, after the matching pattern is automatically added to the ladder circuit, the device number is input and the ladder circuit is completed.

In the ladder circuit editing apparatus configured as described above, when an operator presses a function key (0110) in the middle of inputting into the inputted area, a circuit pattern matching the component in the middle of the input is automatically extracted from the input completed area where the input is completed. Mark at the input position. Therefore, similar ladder circuits can be automatically executed without the operator performing unnecessary operations, and the design of the ladder circuits can be made efficient without unnecessary use of memory.

Further, if the operator does not adopt the search result, and then adds further components to the character memory 0801 which is the input area and presses the function key 0110 at this point, another condition (more components are increased) It is of course possible to search for a circuit pattern in which this element is included.

Example 2

Fig. 23 is a diagram showing an example of another ladder circuit. In Fig. 23, 1401 is a ladder circuit.

FIG. 24 is a diagram showing the configuration when the ladder circuit 1401 is stored in the character memory. In Fig. 24, 1501 is a character memory.

FIG. 25 is a diagram illustrating a state in which a component of a ladder circuit is further added to the ladder circuit 1401 illustrated in FIG. 23. In Fig. 25, 1601 denotes a ladder circuit, and 1602 denotes an additional portion.

Fig. 26 shows a structure of a memory, namely a character memory, which is provided when the ladder circuit 1601 is held in the memory 0109. Figs. In Fig. 26, 1701 and 1702 denote character memories stored in predetermined positions of the memory 0109. In Figs. The character memory 1701 constitutes an input completion area in which at least one input circuit pattern is completed. On the other hand, the character memory 1702 is a character memory corresponding to the additional portion 1602, and constitutes an input area for inputting a new circuit pattern.

27 and 28 show the structure of a character memory for temporarily retracting a ladder circuit for comparison. 27 and 28, reference numerals 1703 and 1705 denote a search character memory, and 1704 and 1706 denote device numbers of the search character memory 1703 and 1705. In FIG.

29 and 30 are flowcharts of the processing of the processing unit 0105. FIG. 31 is a diagram illustrating an example of a message displayed on a CRT when a pattern matches. In Fig. 31, 2001 is a message.

It is assumed that the ladder circuit 1401 shown in FIG. 23 has already been created and the character memory 1501 corresponding to this has already been stored as shown in FIG. Consider the case of adding additional portion 1602 to this program (FIG. 25). By adding the additional portion 1602, the character memory becomes as shown in FIG.

In this state, the search instruction is issued by the keyboard (0103). The search instruction is instructed, for example, by pressing a function key 0110 of the keyboard 0103 or the like. By pressing the function key 0110, the row number 7 of the additional instruction 1602 is set in the row number area 0903 of the comparison position table 0901. Thereafter, the retrieval processing is started. The search is executed in the order of the pattern matching test of the starting condition part 0203, the pattern matching test of the interlock part 0204, and the pattern matching test of the pattern of the output part 0205. The searching process is processed according to the flowchart in FIG.

The procedure of the process will be described according to the flowchart in FIG. When the retrieval processing starts, first, in step 1800, 0 is set in the row number area 0906 of the retrieval position table 0904. In step 1801, "next circuit block search" is executed. Next, in step 1802, the "search for starting condition part" is executed. In step 1803, it is determined whether the pattern matches. If there is a match, the flow advances to step 1811 to execute "pattern matching processing".

If it is determined in step 1803 that the pattern does not match, the search for the interlock portion is executed in step 1804. If it is determined in step 1805 that the patterns of the interlock portions match, the flow advances to step 1811 to execute "pattern matching processing".

If it is determined in step 1805 that the patterns do not match, the flow advances to step 1806 to search for "output unit". If it is determined in step 1807 that the pattern of the output unit matches, the flow advances to step 1811 to execute "pattern matching processing". If it is determined in step 1807 that the patterns do not match, then the next circuit block search is executed in step 1808. In step 1810, it is determined whether there is a next circuit block, and if the next circuit block does not exist, the search process ends. When the next circuit block exists, the process returns to step 1802 to continue processing. In step 1812, it is determined whether &quot; Next &quot; is selected by &quot; pattern matching processing &quot;, and when &quot; Next &quot; is selected, the process returns to step 1801. If other (others) is selected next in step 1812, it is determined that the search is complete and the processing ends.

In addition, search for "Next circuit block search" in step 1801, "Search for starting condition part" in step 1802, "Search for interlock part" in step 1804, "Search for output section" in step 1806, and "Search for next circuit block" in step 1808 Each subroutine called by is the same as in Example 1.

When "pattern matching process" is called in step 1811 of the flowchart of FIG. 29, a process is performed according to the flowchart of FIG. First, in step 1900, all device number units 1704 of the search character memory 1703 are deleted. In step 1901, the data of the search character memory 1703 is displayed on the CRT 0102. In step 1902, the message 2001 of Fig. 31 is displayed, and it is queried whether the displayed circuit block is useful. Steps 1901 and 1902 constitute display means for displaying the circuit pattern extracted by the circuit pattern extraction means on the CRT 0102 which is an input screen.

Thereafter, the operator's operation input is executed by the keyboard 0103, for example, and when it is determined in step 1903 that "OK" is selected, the flow advances to step 1904 to compare the data in the search character memory 1703 with the character memory comparison position. It is set in the row of the row number area 0903 of the table 0901. That is, the data of the search character memory 1703 is copied to the character memory. That is, step 1904 constitutes copying means for copying the circuit pattern extracted by the circuit pattern extracting means to the character memory 0801 which is an input region.

If it is determined in step 1903 that "Next" has been selected, the pattern matching process is terminated without doing anything thereafter. If "Do not (not OK)" is selected in step 1903, the search results are discarded in step 1905. The process ends.

When " Next " is selected in step 1903, " next circuit block search " is executed by the processing described above in the flowchart of FIG. When &quot; Next &quot; is selected based on the ladder circuit of FIG. 25, a search character memory 1704 is created and the processing of the flowchart of FIG. 29 described above is executed.

In the ladder circuit editing apparatus configured as described above, the effect of the first embodiment can be obtained, and at the same time, several similar ladder circuits are automatically searched for, and the design of the ladder circuit can be further improved.

Example 3

32 shows a table of a circuit pattern storage list. In Fig. 32, reference numeral 2101 denotes a circuit pattern storage list which is a selection circuit pattern address storage area, 2102 denotes a pattern 1 storage address, 2103 denotes a pattern M-1 storage address, and 2104 denotes a pattern M. The storage address, 2105, is the end of the list, while 2106, the list order M.

33 is a diagram showing a circuit pattern storage area. In Fig. 33, reference numeral 2107 denotes a circuit pattern storage area.

34 shows a circuit pattern position table. Reference numeral 2201 denotes a circuit pattern position table, 2202 denotes a column number, and 2203 denotes a row number.

35 shows a circuit pattern position character memory table. 2204 denotes a circuit pattern position character memory table, 2205 denotes a device number portion, and 2206 denotes a symbol portion.

36, 37, and 38 are flowcharts of the processing of the processing unit 0105.

Here, it is assumed that the ladder circuit 5051 shown in FIG. 7 has already been created, and the character memory 0601 corresponding to this is in the memory 0109 as shown in FIG.

Further, the instruction 0702 is added to this ladder circuit (Fig. 9). By the addition of the command 0702, the character memory 0601 is as shown in FIG.

In this state, the search instruction is issued by the keyboard (0103). The search instruction is instructed, for example, by pressing a function key 0110 of the keyboard 0103 or the like. By pressing the function key 0110, the row number 5 of the additional portion 0802 is stored in the row number 0903 of the comparison position table 0901. Thereafter, the retrieval processing is started. The search is executed in the order of the pattern matching test of the starting condition part 0203, the pattern matching test of the interlock part 0204, and the pattern matching test of the pattern of the output part 0205. The searching process is processed in accordance with the flowchart of FIG.

The procedure of the process will be described according to the flowchart in FIG. When the retrieval processing is started, first, in step 2301, M = 1. Next, in step 2302, the first row number of the circuit pattern storage area 2107 indicated by the pattern M storage address 2104 of the circuit pattern storage list 2101 is copied to the search character memory 1001, and the circuit pattern The first row number of the storage area 2107 is set in the row number 0906 of the search position table 0904.

In step 2303, the "search for starting condition part" is executed by the processing according to the flowchart of FIG. In step 2304, it is determined whether the pattern matches. If there is a match, in step 2305, the "search for the interlock part" is executed by the process according to the flowchart of FIG. In step 2306, it is determined whether the pattern matches. If there is a match, in step 2305, &quot; search for output unit &quot; is executed by the process according to the flowchart of FIG. In step 2308, it is determined whether the pattern has worked. If there is a match, the flow advances to step 2309, where the first row number of the circuit pattern storage area 2107 indicated by the pattern M storage address 2104 of the circuit pattern storage list 2101 is the row number of the circuit pattern position table 2201. (2203). In step 2310, the "pattern matching process" is executed, and the process ends.

If it is determined in step 2304 that the pattern does not match, the search processing of the interlock portion is executed in step 2311. If it is determined in step 2312 that the pattern matches, the process proceeds to steps 2309 and 2310, where "pattern matching processing" is executed, and the processing ends. If it is determined in step 2312 that the patterns do not match, the flow proceeds to step 2313 again to execute "search for the output unit". If it is determined in step 2314 that the pattern matches, the flow advances to step 2309 and 2310 to execute the "pattern matching process" and the process ends.

If it is determined in step 2314 that the pattern does not match, then M = M + 1 is set in step 2315. In step 2316, it is checked whether there is data in the Mth of the circuit pattern storage list. If it is determined in step 2317 that there is data, the flow returns to step 2302.

If it is determined in step 2317 that there is no data, the flow advances to step 2318 to execute "new circuit pattern search processing". In step 2319, it is determined whether or not there is newly matched data. If it is determined that there is data, the process proceeds to step 2320, where the row number of the row number area 0906 of the search position table 0904 is set to the row number 2203 of the circuit pattern position table 2201, and the "pattern" Matching processing ”and the processing ends. If it is determined in step 2319 that there is no data, the process ends as it is.

"Pattern matching process" in step 2310 operates in accordance with the flowchart of FIG. First, in step 2401, N = 0. Next, in step 2402, in the row indicated by the row number 2203 + N of the circuit pattern position table 2201 of the character memory 0801, it is checked whether the data of the symbol has a downward branch data. If it is determined in step 2403 that there is a lower branch, the process proceeds to 2404 and N = N + 1 in step 2404. If it is determined in step 2403 that there is no lower branch, the flow proceeds to step 2405.

The "circuit pattern replacement process" in step 2405 operates in accordance with the flowchart in FIG. First, in step 2501, the list order M2106 and the list tail 2105 of the circuit pattern storage list 2101 are compared. If it is determined as large in step 2502, the flow proceeds to step 2506. In step 2506, data from the row numbers 2203 to N of the circuit pattern position table 2201 is set in the circuit pattern storage area 2107, and the address of the circuit pattern storage area 2107 is set in the circuit pattern storage list 2101. ) Is set at the tail 2105. The circuit replacement process ends in step 2506, and returns to step 2406.

On the other hand, if it is determined in step 2502 that it is not large, the process proceeds to step 2503. In step 2503, the pattern M storage address 2104 of the matched circuit pattern is deleted from the circuit pattern storage list 2101. In step 2504, the pattern 1 storage address 2102 of the circuit pattern storage list 2101 to the pattern M-1 storage address 2103 are shifted one row downward. In step 2505, data from row numbers 2203 to N of the circuit pattern position table 2201 is set in the circuit pattern storage area 2107, and the leading address of the circuit pattern storage area 2107 is set to the circuit pattern storage list ( The pattern 1 storage address 2102 of 2101 is set. That is, the address of the selected circuit pattern is stored at the head of the circuit pattern storage list 2101. That is, the "circuit pattern replacement process" constitutes replacement means for replacing the address of the selected circuit pattern with the uppermost part of the circuit pattern storage list 2101. When the circuit pattern replacement process ends in step 2505, the process returns to step 2406.

In step 2406, data from the line number 2203 to N of the circuit pattern position table 2201 is set in the search character memory 1001. In step 2407, all the device numbering units 1002 of the search character memory 1001 are deleted. In step 2408, data of the character memory 1001 is displayed on the screen. In step 2409, inquire whether or not "OK". If it is determined in step 2410 that "OK" is selected, the process proceeds to step 2411. When step 2411 ends, the pattern matching process ends and the search process ends. If it is determined in step 2410 that "OK" is not selected, the flow proceeds to step 2412. In step 2412, the search result is discarded. When step 2412 ends, the pattern matching process ends and the search process ends.

In the ladder circuit editing apparatus configured as described above, the effects of the first and second embodiments can be obtained, and the circuit pattern selected last time is automatically searched first, and the retrieved circuit pattern can be simply selected, which can be useful. Furthermore, the efficiency of the ladder circuit design can be improved.

The ladder circuit editing apparatus according to the present invention inputs and edits a sequence program of a program controller in the form of a ladder diagram, and inputs an input completion area in which at least one input circuit pattern is stored and a new circuit pattern. In a ladder type circuit editing apparatus having an area and inputting a sequential circuit pattern in an input area, the components of the circuit pattern input to the input area and the components of the circuit pattern stored in the input completion area are compared; Circuit pattern extraction means for extracting a circuit pattern including a corresponding component, display means for displaying the circuit pattern extracted by the circuit pattern extraction means on an input screen, and circuit pattern extracted by the circuit pattern extraction means in accordance with an operation input Copying means for copying the data to the inputted area. Therefore, when the operator presses the function key 0110 in the middle of inputting into the input area, a circuit pattern matching the component in the input is extracted from the input completion area where input is already completed and automatically displayed at the input position. . Therefore, similar ladder circuits can be executed automatically without any unnecessary operation by the operator, and the efficiency of the ladder circuit design can be improved without unnecessary memory use.

Further, the display means sequentially displays the plurality of circuit patterns extracted by the circuit pattern extraction means, and the copying means copies arbitrary circuit patterns selected in accordance with the operation input from the plurality of circuit patterns sequentially displayed to the input region. Therefore, a plurality of similar ladder circuits are automatically searched for, and the operator selects an arbitrary circuit pattern among them, so that the design of the ladder circuit can be further improved.

In addition, the display means preferentially displays the previously selected circuit pattern. Therefore, the design of the ladder circuit can be further improved.

Further, there is further provided a selection circuit pattern address storage area for storing the address of the circuit pattern selected last time, and replacement means for replacing the address of the selected circuit pattern with the uppermost part of the selection circuit pattern address storage area, and the display means further comprises: The previously selected circuit pattern is displayed first in accordance with the order of the addresses stored in. Therefore, it is possible to further improve the efficiency of the ladder circuit design without using the capacity of the auxiliary storage device unnecessarily.

Claims (3)

The program controller inputs and edits a sequence program in the form of a ladder drawing, has an input completion area in which at least one input circuit pattern is stored, and an input area for inputting a new circuit pattern, and sequentially in the input area. In the ladder circuit editing apparatus for inputting a circuit pattern, Circuit pattern extracting means for comparing the components of the circuit pattern input to the input region with the components of the circuit pattern stored in the input completion region and extracting a circuit pattern including matching components; Display means for displaying the circuit pattern extracted by the circuit pattern extraction means on an input screen; And copying means for copying the circuit pattern extracted by said circuit pattern extracting means to said input area in accordance with an operation input. The method of claim 1, The display means sequentially displays a plurality of circuit patterns extracted by the circuit pattern extraction means, And said copying means copies an arbitrary circuit pattern selected in accordance with the operation input from the plurality of circuit patterns sequentially displayed to the inputted region. The method of claim 2, And said display means preferentially displays the previously selected circuit pattern.