WO2000007081A1

WO2000007081A1 - Ladder circuit editing device

Info

Publication number: WO2000007081A1
Application number: PCT/JP1998/003402
Authority: WO
Inventors: Yasunobu Iwata; Taku Watanabe; Shigeki Yamada; Hiroyasu Kimura; Teruyuki Harada; Tomoko Nakamura
Original assignee: Mitsubishi Denki Kabushiki Kaisha
Priority date: 1998-07-30
Filing date: 1998-07-30
Publication date: 2000-02-10
Also published as: JP4245811B2; KR100432407B1; KR20010106422A; DE19882995T1

Abstract

A ladder circuit editing device provided with an inputted region which receives and edits a sequence program of a program controller in the form of a ladder diagram and is stored with at least one circuit pattern that has been received, and an uninputted region where a new circuit pattern is to be inputted and which successively receives circuit patterns from the inputted region, the inputted region comprising a circuit pattern extracting means which compares constituent elements of a circuit pattern that is being inputted into the uninputted region with constituent elements of a circuit pattern stored in the inputted region and extracts circuit patterns including constituent elements that are in agreement, a means for displaying the extracted circuit patterns on an input screen, and a means for copying the extracted circuit patterns on the uninputted region according to the input of operation.

Description

Description Ladder circuit editing device Technical field

The present invention relates to a programmable controller for controlling mechanical equipment, and more particularly to a ladder one-circuit editing device for programming a ladder one circuit of a programmable controller. Landscape technology

FIG. 7 is a diagram illustrating an example of a general sequence program displayed by a ladder circuit. Conventionally, programmable controllers have been used to control the sequence of machinery and equipment. The programming method of this programmable controller generally uses a ladder circuit (ladder diagram) shown in FIG.

Such a ladder circuit generally has many portions described by repetition of a circuit having a similar configuration, and in many cases, only variable names such as contact names and coil names of similar circuits are different. Conventionally, when constructing and editing a sequence program having a repetitive portion in which only variable names are changed with regularity by repeating a similar circuit, Japanese Patent Laid-Open No. 4-280602 discloses When the regularity of the basic unit and variable name is specified as shown, the copy of the basic unit is automatically repeated, and the variable name is automatically assigned according to the regularity to automatically generate the repeated part. Some have a copy function that converts the automatically generated result into a ladder circuit and displays it. Furthermore, as shown in Japanese Patent Application Laid-Open No. 2-510102, the regularity of the basic constituent units and variable names is stored in a memory or an external storage device in the form of a library. Some have a function of selecting a specific circuit pattern from a library on a memory or an external storage device and automatically generating the readout.

However, in the above-described related art, the operator must consciously perform extraction and storage of the basic constituent units, which is inconvenient. In addition, when editing basic configuration units that have been registered in advance, for example, many The operator is responsible for selecting the desired basic structural unit from the basic structural units, but when the number of basic structural units registered increases, it is possible to determine what kind of processing circuit has been registered. This is not easy, and furthermore, it is necessary to search a predetermined auxiliary storage device of the program device over the whole, which is inconvenient in operation.

Furthermore, even if a plurality of basic constituent units are registered in advance, the registered ones are not always used, and the capacity of the auxiliary storage device may be reduced, and a registration circuit that is not used may remain. It was difficult to improve efficiency.

SUMMARY OF THE INVENTION The present invention has been made to solve the above-described problems. An operator can automatically search for a similar ladder circuit without performing extra operations, and furthermore, the capacity of an auxiliary storage device. It is an object of the present invention to obtain a ladder circuit editing device that can efficiently design a ladder circuit without wasting the ladder circuit. Disclosure of the invention

A ladder circuit editing apparatus according to the present invention includes: a sequence program of a program controller, which is input and edited in the form of a ladder diagram; an input area in which at least one input completed circuit pattern is stored; and a new circuit pattern. A ladder circuit editing apparatus for inputting a circuit pattern sequentially from the input area, comprising: a circuit pattern component being input to the input area; and a circuit stored in the input area. Circuit pattern extracting means for comparing circuit pattern components and extracting a circuit pattern including a matching component; display means for displaying the circuit pattern extracted by the circuit pattern extracting means on an input screen; On the basis of

And copying means for copying the circuit pattern extracted by the circuit pattern extracting means into the input area.

The display means sequentially displays the plurality of circuit patterns extracted by the circuit pattern extraction means, and the copying means displays an arbitrary one selected from the plurality of sequentially displayed circuit patterns based on an operation input. The circuit pattern is copied to the input area.

The display means displays the circuit pattern selected last time with priority.

In addition, a selected circuit pattern address storage area for storing the address of the previously selected circuit pattern and an address of the selected circuit pattern are stored in the selected circuit pattern. There is further provided a switching means for switching to the top of the address storage area, and the display means preferentially displays the previously selected circuit pattern in accordance with the order of the addresses stored in the selected circuit pattern address storage area. BRIEF DESCRIPTION OF THE FIGURES

FIG. 1 is a block diagram showing a device configuration of a ladder circuit editing device of the present invention, FIG. 2 is a diagram showing names of respective parts of the ladder circuit,

Figure 3 is a diagram showing the configuration of the memory that holds the ladder circuit in the memory, that is, the configuration of the character memory.

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

Figure 5 shows the internal data structure of the symbol part.

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

FIG. 7 is a diagram showing an example of a general sequence program displayed by a ladder circuit, FIG. 8 is a diagram showing a memory configuration when a ladder circuit is held in a memory, that is, a diagram showing a character memory,

FIG. 9 is a diagram showing a state in which some of the components of the added ladder circuit are added to the ladder circuit shown in FIG. 7,

FIG. 10 is a diagram showing a configuration of a memory having a case where a ladder circuit is held in a memory, that is, a character memory;

Figure 11 is a diagram showing the comparison position table created in the memory when the device processes the search operation.

FIG. 12 is a diagram showing a comparison position table created in the memory when the present apparatus processes a search operation.

FIG. 13 is a diagram showing a configuration of a search character memory for temporarily saving components of a ladder circuit for comparison,

Figure 14 is a flowchart of the main program that performs the search process.

Fig. 15 is a flowchart of a subroutine that performs a search for a start condition part. Fig. 16 is a flowchart of a subroutine that performs a search of a lock part. Fig. 17 is a subroutine that performs a search of an output part. flowchart, Fig. 18 is a flowchart of a subroutine for performing "Next circuit block search". Fig. 19 is a flowchart of a subroutine for performing "Pattern matching processing". Fig. 20 is an example of a message displayed on the CRT when a pattern matches. The figure

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

FIG. 22 is a diagram showing the state of the ladder circuit shown in FIG. 21 on the character memory, FIG. 23 is a diagram showing an example of another ladder circuit,

Figure 24 shows the configuration when the ladder circuit is stored in the character memory.Figure 25 shows the ladder circuit shown in Figure 23 with some additional components of the ladder circuit added. A diagram showing the appearance of

Figure 26 is a diagram showing the structure of the memory when the ladder circuit is held in the memory, that is, the character memory.

FIG. 27 is a diagram showing a configuration of a character memory for temporarily saving a ladder circuit for comparison.

Fig. 28 is a diagram showing the configuration of character memory for temporarily saving the ladder circuit for comparison.

Figure 29 is a flowchart of the main program that performs the search process.

FIG. 30 is a flowchart of a subroutine for performing “pattern matching processing”. FIG. 31 is a diagram showing an example of a message displayed on the CRT when a pattern matches.

FIG. 32 is a diagram showing a table of a circuit pattern storage destination list,

Figure 33 shows the circuit pattern storage area.

FIG. 34 shows a circuit pattern position table.

FIG. 35 is a diagram showing a circuit pattern position character memory table.

Figure 36 is a flowchart of the main program that performs the search process.

FIG. 37 is a flowchart of a subroutine for performing “pattern matching processing”, and FIG. 38 is a flowchart of a subroutine for performing “circuit pattern replacement processing”. BEST MODE FOR CARRYING OUT THE INVENTION

Hereinafter, embodiments of the present invention will be described with reference to the drawings.

Example 1

FIG. 1 is a block diagram showing a device configuration of the ladder circuit editing device of the present invention. In FIG. 1, reference numeral 0 101 denotes a ladder one-circuit editing apparatus, and reference numeral 0 102 denotes a ladder one-circuit editing apparatus. 1 1 \ 0 1 0 3 is a keyboard, 0 1 0 4 is an auxiliary storage device, 0 1 0 5 is a processing unit, 0 1 0 6 is a screen control unit, 0 1 0 7 is a key input control unit, 0 1 08 indicates an auxiliary storage device control unit, 0109 indicates memory, and 110110 indicates a function key.

FIG. 2 is a diagram showing names of respective parts of the ladder circuit. In FIG. 2, reference numeral 0201 denotes a ladder circuit. Although details will be described later, the ladder circuit 0 201 is the left bus 0 202, the start condition section 0 203, the in-lock block 0 204, the output section 205, the right It has a bus bar 0 206.

FIG. 3 shows a configuration of a memory (hereinafter referred to as a character memory) when the ladder circuit 0201 is held in the memory 0109. In FIG. 3, reference numeral 0301 denotes a character memory stored at a predetermined position of the memory 0109.

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.

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

FIG. 6 is a diagram showing an example of a code set in the instruction code section 04 03. FIG. 7 is a diagram illustrating an example of the ladder circuit. In the figure, reference numeral 0501 denotes a ladder circuit.

FIG. 8 shows a configuration of a memory when the ladder circuit 0501 is held in the memory 0109, that is, a character memory. In FIG. 8, reference numeral 0601 denotes a character memory stored at a predetermined position in the memory 0109.

FIG. 9 is a diagram showing a state in which some of the components of the ladder circuit added to the ladder circuit shown in FIG. 7 are added. In the figure, 0.701 indicates a ladder circuit, and 0.702 indicates an additional part. FIG. 10 shows the configuration of a memory that is used when the ladder circuit 0701 is held in the memory 0109, that is, a character memory. In FIG. 10, reference numerals 0801 and 0802 denote character memories stored at predetermined positions in the memory 0109. The character memory 0801 constitutes an input area in which at least one input completed circuit pattern is stored. 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 present apparatus processes a search operation. In FIG. 11, 0 901 is a comparison position table for indicating the position on the character memory 0 801 currently being edited, 0 902 is a column number area of the comparison position table 0 901, Reference numeral 0903 denotes a line number area of the comparison position table 0901.

FIG. 12 is a diagram showing a comparison position table created in the memory 0109 when the present apparatus processes a search operation. In FIG. 12, reference numeral 0904 denotes a search position table for indicating a position on the character memory 0801 where a search process is being performed, reference numeral 0905 denotes a column number area of the search position table 0904, Reference numeral 0906 denotes a row number entry of the search position table 0904.

FIG. 13 shows the configuration of a search character memory for temporarily saving the components of the ladder circuit for comparison. In FIG. 13, reference numeral 1001 denotes a search character memory, and reference numeral 1002 denotes a device number portion of the search character memory 1001. FIGS. 14, 15, 16, 17, 18, and 19 are flowcharts of the processing of the processing unit 0105. Figure 20 shows an example of the message displayed on the CRT when the patterns match. In FIG. 20, 1301 is a message.

Figure 21 shows the ladder circuit after the patterns match. In FIG. 21, reference numeral 1310 denotes a ladder circuit after the pattern is matched.

FIG. 22 shows the character memory after the pattern matches. In FIG. 22,

1311 indicates a character memory of the ladder circuit 1310.

Next, the operation will be described. Generally, the ladder circuit, as shown in Figure 2, There is a start condition unit 0203 on the right of the bus 0202 and an output unit 0205 on the left of the right bus206. Further, an in-lock unit 0204 is combined between the start condition unit 0203 and the output unit 205 to form a ladder circuit 0201.

Editing such a ladder circuit is performed by the ladder circuit editing apparatus 0101 shown in FIG. First, when a key is input from the keyboard 0103, the symbol of the instruction corresponding to the key is displayed on the screen on the CRT0102, and the data is stored in the memory0109. The memory area for storing is called a character memory as described above, and this character memory is configured, for example, as shown in FIG. The character memory 0301 is arranged in the same manner as the screen display, and the position can be indicated by (row, column).

As shown in FIG. 4, one component of the character memory 0 310 is a symbol section 04 0 2 where an instruction symbol is set and a device number section 0 4 0 1 where a device number is set. It is composed of As shown in FIG. 5, the symbol section 0402 has an internal structure composed of an instruction code 0403 and a branch designation section 0404. Then, as the data to be entered into the instruction code 403, for example, a value shown in the code table 405 of the instruction code part shown in FIG. 6 is entered.

For example, the start condition section 0203 of the ladder circuit 0201 in Fig. 2 is located at the positions (1,1) and (2,1) on the character memory 0301 in Fig.3. There is a night. Referring to FIG. 5, the value of the data at the position of (1, 1) is as follows. As shown in FIG. 5, the four bits of the instruction code part 04 03 are the instruction code 0, and the four bits of the branch specification part 04 04 are 0 0 0 0 0 1 0 0 B because there is a branch. Also, the value of the data of (2, 1) is that the 4 bits of the instruction code section 0403 have an instruction code of 0, and the 4 bits of the branch specification section 0404 have a branch above. 0 0 0 0 1 0 0 0 B.

Now, here, the ladder circuit 0501 shown in FIG. 7 has already been input, and the corresponding character memory 0601 is stored in the memory 0109 as shown in FIG. Suppose A case where an additional portion 0702 is added to the ladder circuit 501 will be described (FIG. 9). By adding the additional part 0702, the character memory becomes as shown in Fig.10. At this time, the character memory which constitutes the input area and the character which constitutes the input area as described above And memory 0802.

In this state, a search instruction is issued by operating the keyboard 0 1 0 3. The search instruction is given, for example, by pressing a function key 0110 of the keyboard 0103. By pressing the function key 0 1 1 0, the row number 5 of the input area 0 8 0 2 shown in FIG. 10 is moved to the row number area 0 9 0 3 of the comparison position table 0 9 0 1 shown in FIG. Is set. After that, the search process starts.

The search process is performed according to the flowchart of FIG. 14, and roughly checks the pattern matching of the start condition section 0 203, the pattern matching of the interlock section 0 204, and the output section 0 205 Are performed in the order of checking for pattern matching. The processing will be described according to the flowchart of FIG. When the search process is started, first, 0 is set in the line number area 0906 of the search position table 0904 by step 1100. In step 1111, "Next circuit block search" is performed. The subroutine "Next circuit block search" will be described later in detail. Next, “search for a start condition part” is performed in step 1 1102. The subroutine of “Searching for the start condition part” will also be described in detail later.

Then, it is determined whether or not the patterns match in step 111. If they match, “search for interlock section” is performed in step 111. The subroutine of “search for lock section” will be described later in detail. Then, it is determined in step 111 that the patterns match. If they match, perform “Search for output” in step 1 1 10 6. The subroutine of "search for output section" will be described later. Next, it is determined whether or not the patterns match in step 111. If they match, the process proceeds to step 111, performs “pattern matching processing”, and ends the processing. The “pattern matching process” subroutine will also be described later.

If it is determined in step 1 1 10 3 that the patterns do not match,

Perform “Search for a part of the app” on 1 1 1 0 9. If it is determined in step 1111 that the patterns match, the flow advances to step 1108 to perform "pattern matching processing" and end the processing. On the other hand, if it is determined in step 1 1 1 1 0 that the patterns do not match, the process further proceeds to step 1 1 1 1 1 to perform “search for an output unit”. . Then, if it is determined in step 111 that the patterns match, the process proceeds to step 111 08 to perform “pattern matching processing”, and ends the processing. If it is determined in Step 1 1 1 1 2 that the patterns do not match, in Step 1 1 1 13 a “Next circuit block search” is performed. In step 1 1 1 1 4 it is determined whether there is a night, and if not, the process is terminated. If there is one night, go to step 1102 and repeat the process.

“Search for a start condition part” in the flowchart shown in FIG. 14 is processed according to the flowchart in FIG. First, in step 1121, the search start position (L, C) is set to (1, 1). In step 1122, (L c · C c) is set to (value of row number area 0903 of comparison position table 0901, 1). Next, in step 112203, the data at the (L, C) position of the search character memory 1001 and the symbol of the data at the (Lc, Cc) position of the character memory 0801 are stored. Compare parts 0 4 0 2.

Step 1 1 204 determines whether or not there is a match. If not, then in step 1 125, Lc and the value of the row number area 0 9 0 3 of the comparison position table 0 9 0 1 Compare. If they are the same, it is determined in step 112 that the patterns do not match, and the process ends. If they are not the same in step 1 1 205, the flow advances to step 1 1 2 1 1 to determine that the patterns match, and ends the processing.

If it is determined in step 1124 that the patterns match, the flow advances to step 1207 to set L = L + 1. In step 11208, it is checked whether or not there is any data at the (L, C) position of the search character memory 1001. In step 112, it is determined whether there is any data. If there is no data, the process proceeds to 1121, where it is determined that the patterns match, and the process is terminated. If it is determined in step 112 that there is a delay, the process proceeds to step 112, sets Lc = Lc + 1, returns to step 1123, and repeats the process.

In the flowchart shown in Fig. 14, "Search for interlock part"

It is processed according to the flowchart of 6. First, in step 1131, the search start position (L, C) is set to (1, 2). Step 1 1 3 2 to (L c, C c)

(The value of the row number area 0903 of the comparison position table 09001, 2) is set. Next In step 11303, the symbol portion of the data at the position (L, C) in the search character memory 1001—the evening and the data at the position (Lc, Cc) in the character memory 0801

Compare 0402.

In step 11304, it is determined whether or not they match, and if they do not match, in step 11305, Lc is compared with the value of the row number area 0903 of the comparison position table 0901. If they are 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 to determine that the patterns match, and ends the processing.

If it is determined in step 11304 that the patterns match, the flow advances to step 11308 to set L = L + 1. Then, in step 11309, it is checked whether or not there is any data at the position (L · C) of the search character memory 1001. In step 11310, it is determined whether or not there is any data. If there is no data, the process proceeds to 11311 and Cc = Cc + 1. Next, it is determined in step 11312 whether C c = 8. If 8, the process proceeds to step 11307, where it is determined that the patterns match, and the process ends. If it is determined in step 11312 that C c is not 8, the value of the row number area 0903 of the comparison position table 0901 is set in L c in step 11314, and the flow returns to step 11303 to repeat the processing.

If it is determined in step 11310 that there is data, the flow advances to step 11313 to set L c = L c + 1 and returns to step 11303 to repeat the processing.

“Search for an output unit” in the flowchart shown in FIG. 14 is processed according to the flowchart in FIG. First, in step 11401, (1, 8) is set to the search start position (L, C). In step 11402, (0, (0) is set to (the value of the row number area 0903 of the comparison position table 0901, 8).

At 11403, the data at the position (L, C) in the search character memory 1001 is compared with the symbol portion 0402 of the data at the position (Lc, Cc) in the character memory 0801.

In step 11404, it is determined whether or not they match, and if they do not match, in step 11405, Lc is compared with the value of the row number area 0903 of the comparison position table 0901. If they are the same, then the pattern Judge and end the process. If not the same in step 11405, the flow advances to step 11410 to determine that the patterns match, and ends the processing.

If it is determined in step 11404 that the patterns match, the flow advances to step 11407 to set L = L + 1. In step 11408, it is checked whether or not there is any data at the position (L, C) in the search character memory 1001. At step 11409, it is determined whether there is any data. If not, the process proceeds to 11410, where it is determined that the patterns match, and the process is terminated.

If it is determined in step 11409 that there is data, the flow advances to step 11411 to set L c = L c + 1 and returns to step 11403 to repeat the processing.

The “next circuit block search” in the flowchart shown in FIG. 14 is processed according to the flowchart in FIG. First, in step 11500, it is determined whether or not the value of the row number area 0906 of the search position table 0904 is 0. If it is not 0, (L, C) is set to (0, 1) in step 11502. Next, in step 11503, the data at the position of (line number error 0906 + L, C of the search position table 0904) on the character memory 0801 is checked. In step 11504, it is determined whether or not the lower bit is ON in branch designation 0404 of the symbol portion 0402. If ON, proceed to step 11505, where L = L + 1. Next, the return process of step 11503 is repeated.

If the bit is not ON in step 11504, that is, if there is no lower branch, the process proceeds to step 11506, where C = C + 1. In step 11507, a search is made for the data at the position of (line number area 0906 + L, C of the search position table 0904) on the character memory 0801. In step 11508, it is determined whether the lower bit is ON in branch designation 0404 of the symbol part 0402. If ON, go to step 1150 5 and repeat the process. If it is not ON in step 11508, it is determined in step 11509 whether C = 8. If not C = 8, return to step 11506 and repeat the process. If C = 8, go 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 character memory 0801

Overnight at the position of (line number area 0906 + L, C in search position table 0904) Find out. It is determined in step 1 15 12 whether there is any data, and if so, in step 1 15 13 C = 1 is set. In step 1 15 14, L = 0 is set, and then in step 1 15 15, the data at the position of (line number area 0906 + L, C in the search position table 0904) on the character memory 080 1 is examined. In step 1 15 16, it is determined whether the lower bit is ON in branch designation 0404 of the symbol section 0402. If ON, set L = L + 1 in step 1 15 17 and return to step 1 15 15 to repeat the process ο

If the value of the row number area 0906 of the search position table 0904 is ◦ at step 1 1500, the value of the line number area 0 906 of the search position table 0904 is set to 1 at step 1 1 501. Go to 1 1 5 1 1. If it is determined that there is no data in step 1 5 12, it is determined that there is no data in step 1 15 18 and the processing is terminated.

If it is determined that the bit is not turned on in step 1115 16, C is set to C + 1 in step 115 9. Next, at step 1 520, the data at the position of (line number area 0906 + L, C of the search position table 0904) on the character memory 080 1 is examined. In step 1 152 1, it is determined whether or not the lower bit is ON in branch designation 0404 of the symbol portion 0402. If the bit is ON, go to step 1 15 17 to repeat the process. If the bit is not ON, it is determined in step 11522 whether C = 8. If C = 8, proceed to step 1 1 523 and copy the data for L rows from the row of the row number area 0906 of the search position table 0904 on the character memory 080 1 to the search character memory 1001 and finish. I do. If it is not C = 8 in Step 1 1522, the process returns to Step 1 15 19 to repeat the processing.

When the processing up to this point is completed, in step 1 523, the line of the character memory 0801 corresponding to the component is 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.

Therefore, the processing up to this point, that is, the flowcharts shown in FIGS. 14, 15, 16, 17, and 18 show the components of the circuit pattern being input to the character memory 0802 as the input area, Character memory 08, which is the input area 01 The circuit pattern extracting means for comparing the circuit pattern components stored in 1 with each other and extracting a circuit pattern including a matching component is configured.

The “pattern matching processing” called in step 111 of the flowchart shown in FIG. 14 performs processing according to the flowchart in FIG. First, in step 122, the data in the device number section 1002 of the search character memory 1001 is deleted. At step 127, the data of the search character memory 1001 is displayed on the screen CRT0102. In step 122, it is asked whether this is enough. This is displayed, for example, as message 1301 shown in FIG. Steps 1207 and 1208 constitute a display means for displaying the circuit pattern extracted by the circuit pattern extraction means on the input screen CRT0102.

After that, the operator's operation input is performed from, for example, the keyboard 0103, and if it is determined in step 1209 that "OK" is not selected, the search result is discarded in step 1221. The process ends.

On the other hand, if it is determined in step 1209 that "OK" has been selected, the process proceeds to step 1209, where the data in the search character memory 1 0 1 1 is stored in the comparison position table in the character memory 0 8 0 1. 0 9 0 1 line number area Set to 0 9 0 3 line. That is, the data of the search character memory 1 001 is copied to the character memory 808 1. That is, step 12210 constitutes the copying means for copying the circuit pattern extracted by the circuit pattern extracting means into the character memory 0801 which is the input area.

When the data in the search character memory 1001 is copied to the character memory 0801, the ladder circuit becomes a ladder circuit 1310 shown in FIG. The corresponding character memory is as shown in FIG. At this time, the ladder circuit becomes like the ladder circuit 1310. After the matching pattern is automatically added to the ladder circuit, the device number is entered to complete the ladder circuit.

In the ladder circuit editing device configured as described above, when the operator presses function key 0 1 1 10 while inputting to the input target area, the input is already completed. A circuit pattern that matches a component in the middle of the input is extracted from the input area, and is automatically displayed at the input position. As a result, similar ladder circuits can be automatically performed without unnecessary operations by the operator.Furthermore, it is possible to improve the efficiency of the design of one ladder circuit without wasting unnecessary memory. .

Note that the operator does not use the search results, and then enters the character memory that is the input area.

If additional components are added to 08001, and the function key is pressed at this point, this component is included under further different conditions (the number of components increases). It goes without saying that a circuit pattern is searched. Example 2.

FIG. 23 is a diagram showing another example of the ladder circuit. In FIG. 23, 1401 is a ladder circuit.

FIG. 24 shows a 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 showing a state in which components of the ladder circuit are added to the ladder circuit 1401 shown in FIG. In FIG. 25, 1601 indicates a ladder circuit, and 1602 indicates an additional portion.

FIG. 26 shows the configuration of a memory that is provided when the ladder circuit 1601 is held in the memory 0109, that is, a character memory. In FIG. 26, 1Ί01 and 1702 indicate character memories stored at predetermined positions in the memory 0109. The character memory 1701 constitutes an input area in which at least one input completed circuit pattern is stored. 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.

FIGS. 27 and 28 show the configuration of the character memory for temporarily saving the ladder circuit for comparison. In Figures 27 and 28, 1703 and 1705 indicate the search character memory, and 1704 and 1706 indicate the device number of the search character memory 1703 and 1705. Show.

FIG. 29 and FIG. 30 are flowcharts of the processing of the processing unit 0105. Fig. 3 1 Shows an example of the message displayed on the CRT when the pattern matches. In FIG. 31, reference numeral 2001 denotes a message.

Now, suppose that the ladder circuit 1401 shown in FIG. 23 has already been created, and the corresponding character memory 1501 has already been stored as shown in FIG. Consider the case where an additional part 1602 is added to this program (Fig. 25). With the addition of the additional part 1602, the character memory becomes as shown in Figure 26.

In this state, a search instruction is issued from the keyboard 0 103. The search instruction is given by, for example, pressing the function key 0 1 1 0 of the keyboard 0 103. By pressing the function key 0 1 1 0, the line number 7 of the additional instruction 16 02 is compared. After that, the search process starts. The search is performed in the following order: a check for a pattern match in the start condition unit 0203, a check for a pattern match in the interface unit 0204, and a check for a pattern match in the output unit 0205. The search process is performed according to the flowchart in FIG.

The processing procedure will be described with reference to the flowchart in FIG. When the search process starts, first, in step 180, 0 is set to the row number area 0906 of the search position table 0904. In step 1801, "Next circuit block search" is performed. Next, in step 1802, “search for start condition part” is performed. In step 1803, it is determined whether the patterns match. If they match, proceed to step 1811 to perform “pattern matching processing”.

If it is determined in step 1803 that the patterns do not match, "search for an interlock unit" is performed in step 1804. If it is determined in step 1805 that the pattern of the lock unit matches, the process proceeds to step 1811 to perform “pattern matching processing”.

If step 1805 determines that the patterns do not match,

Proceed to 806 to perform “Search for output section”. If it is determined in step 1807 that the pattern of the output unit matches, the flow advances to step 1811 to perform “pattern matching processing”. If step 1807 determines that the pattern does not match, 0 Performs "Next circuit block search" in step 8. In step 1810, it is determined whether there is a next circuit block. If there is no next circuit block, the search processing is terminated. If the next circuit block exists, the process returns to step 1802 and continues. In step 1812, it is determined whether or not "next" is selected in "pattern matching process". When "next" is selected, the process returns to step 1801. If other than (next) is selected in step 1812, it is determined that the search is completed and the processing is terminated.

In addition, "Search for the next circuit block" in Step 1801, "Search for the start condition part" in Step 1802, "Search for the lock part in the unit" in Step 1804, Step 1 The subroutines called out in 806 "Search for output unit" and in Step 808 "Search for next circuit block" are the same as in the first embodiment.

When the “pattern matching process” is called in step 1811 of the flowchart of FIG. 29, the process is performed according to the flowchart of FIG. First, in step 1900, all the device number portions 1704 of the search character memory 1Ί03 are deleted. At step 1 901, the data of the search character memory 1 Ί 0 3 is displayed on the CRT 0102. At step 1902, the message 2001 shown in Fig. 31 is displayed, and an inquiry is made as to whether to use the displayed circuit block. Step 1901 and step 1902 constitute display means for displaying the circuit pattern extracted by the circuit pattern extraction means on the input screen CRT0102.

Thereafter, the operator's operation input is performed from, for example, the keyboard 0103, and if it is determined that "OK" is selected in step 1903, the process proceeds to step 1904, where the search character memory 1 is set. The data of 703 is set to the line of the line number area 0903 of the comparison position table 0900 in the character memory. That is, the data in 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 into the character memory 0801 which is the input area.

If it is determined in step 1903 that "Next" is selected, then nothing is done

When "NO" is selected in step 1903, the "pattern matching process" is ended. In step 1905, the search result is discarded, and the process ends.

If “Next” is selected in step 1903, the flowchart in Figure 29 Perform “Next circuit block search” by the processing described above. When "next" is selected based on the ladder circuit of FIG. 25, a search character memory 1704 is created, and the processing of the above-described flowchart of FIG. 29 is performed.

In the ladder one-circuit editing apparatus thus configured, the effect of the first embodiment can be obtained, and a plurality of similar ladder ones can be automatically searched for, thereby further improving the efficiency of the ladder one-circuit design. be able to. Example 3.

FIG. 32 shows a table of the circuit pattern storage destination list. In FIG. 32, 2101 is a circuit pattern storage destination list which is a selected circuit pattern address storage area, 2102 is a pattern 1 storage address, 2103 is a pattern M-1 storage address, 2 1 04 is the pattern M storage address, 210 is the end of the list, and 210 is the list order M.

Figure 33 shows the circuit pattern storage area. In FIG. 33, reference numeral 2107 denotes a circuit pattern storage area.

Figure 34 shows the circuit pattern position table. 2221 indicates a circuit pattern position table, 2222 indicates a column number, and 2203 indicates a row number.

FIG. 35 shows a circuit pattern position character memory table. Reference numeral 222 denotes a circuit pattern position character memory table, reference numeral 222 denotes a device number part, and reference numeral 222 denotes a symbol part.

FIG. 36, FIG. 37, and FIG. 38 are flowcharts of the processing of the processing unit 0105. Now, it is assumed that the ladder circuit 0501 shown in FIG. 7 has already been created, and the corresponding character memory 0601 is in the memory 0109 as shown in FIG.

Instruction 0702 is added to this ladder circuit (Fig. 9). With the addition of the instruction 0702, the character memory 0601 becomes as shown in Fig.10.

In this state, a search instruction is issued from the key board 0 1 0 3. Search instruction is, for example, keyboard

-Instructed by pressing function key 0 1 1 0 etc.

. By pressing function key 0 1 1 0, line number 5 of added part 0 8 0 2 is compared. It is stored in the row number 0903 of the comparison position table 0901. After that, the search process starts. The search consists of checking the matching of the pattern in the start condition section 0203, checking the match of the pattern in the interlock section 0204, and checking the match of the pattern in the output section 0205. It is performed in order. The search process is performed according to the flowchart in FIG.

The processing procedure will be described with reference to the flowchart of FIG. When the search process starts, first, in step 2301, M = 1 is set. Next, in step 2302, the first line number of the circuit pattern storage area 2107 indicated by the pattern M storage address 2104 of the circuit pattern storage destination list 2101 in the search character memory 1 0 Copy it to 01, and set the first row number of the circuit pattern storage area 210 7 in the row number 0906 of the search position table 0904.

In step 2303, “search for a start condition part” is performed by processing according to the flowchart in FIG. In step 230, it is determined whether the patterns match. If they match, “search for the lock section” is performed in step 2305 by the processing according to the flowchart in FIG. At step 230, it is determined whether the patterns match. If they match, “search for output section” is performed in step 2305 by processing according to the flowchart in FIG. Next, it is determined in step 2308 whether the patterns match. If they match, the process proceeds to step 2309, and the circuit pattern storage area 2 1 0 1 pattern of the circuit pattern storage list 2 1 0 1 The circuit pattern storage area 2 1 0 7 indicated by the address 2 1 0 4 is set to the circuit pattern position Set to row number 2203 in table 2201. Then, in step 230, "pattern matching processing" is performed, and the processing ends.

If step 2 304 determines that the patterns do not match,

3 1 In 1, perform the “Search process for the input part of the icon”. If it is determined in step 2 3 12 that the password has matched, the process proceeds to steps 2 3 0 9 and 2 3 10 to perform “matching process” and terminate the process. If it is determined in step 2 3 12 that the patterns do not match, the process proceeds to step 2 3 13 to perform “search for output section”. If it is determined in step 2314 that the patterns match, the process proceeds to steps 230 and 230 to perform "pattern matching processing" and end the processing. If it is determined in step 2 3 14 that the patterns do not match, then in step 2 3 15 it is assumed that M = M + 1. In step 2 3 16, it is checked whether there is M-th data in the circuit pattern storage destination list. If it is determined in step 2 3 17 that there is data, the flow returns to step 2 32.

If it is determined in Step 2 3 17 that there is no data, the process proceeds to Step 2 3 18 to perform “new circuit pattern search processing”. In step 2 3 19, it is determined whether there is a new match. If it is determined that there is a day, the process proceeds to step 230, and the line number of the line number area 0 906 of the search position table 0 9 0 4 is replaced with the line of the circuit pattern position table 2 2 0 1 Set the number to 2203, perform "pattern matching processing" in step 230, and end the processing. If it is determined in step 2 3 19 that there is no data, the process is terminated.

The “pattern matching process” in step 230 operates according to the flowchart in FIG. First, N = 0 is set in step 2401. Next, in step 2402, in the row indicated by the row number 2203 + N of the circuit pattern position template 2221 of the character memory Check to see if there is an overnight branch to. If it is determined in step 2403 that there is a lower branch, the flow advances to 2404, and in step 2404, N = N + 1. If it is determined in step 2403 that there is no lower branch, the process proceeds to step 2405.

The “circuit pattern replacement processing” of step 2405 operates according to the flowchart of FIG. First, in step 2501, the list order M2106 is compared with the circuit path storage destination list 2101 at the end of the list 2101. Next, if it is determined in step 2502 that it is large, the process proceeds to step 2506. In step 2506, the data from the row numbers 2203 to N of the circuit pattern position table 2201 are set in the circuit pattern storage area 2107, and the circuit pattern storage area 210 is set. Set the address of 7 to the end 210 5 of the circuit pattern storage destination list 210 1. In step 2506, the circuit replacement process is completed, and the process returns to step 240.

On the other hand, if it is determined in step 2502 that it is not large, the process proceeds to step 2503. Step 2 Delete the pattern M storage destination address 210 4 of the circuit pattern that matches in step 5 03 from the circuit pattern storage destination list 210 1. Step 2 Shift storage destination list 2 1 0 1 Pattern 1 Storage destination address 2 1 0 2 to Pattern M-1 Insertion destination address 2 1 0 3 Shift down one line. At step 2505, set the circuit pattern position table 2201 row number 2203 to N in the circuit pattern storage area 2107 to the circuit pattern storage area 210, and set the circuit pattern storage area 2 1 Set the start address of 07 to the pattern 1 storage destination address 2 1 0 2 of the circuit pattern storage destination list 2 1 0 1. That is, the address of the selected circuit pattern is stored at the head of the circuit pattern storage destination list 210. In other words, the “circuit pattern replacement process” constitutes a replacement means for replacing the address of the selected circuit pattern with the highest order in the circuit pattern storage destination list 210 1. When the circuit pattern replacement processing is completed in step 2505, the flow returns to step 2406.

In step 2406, the data from the row numbers 2203 to N of the circuit pattern position table 2201 are set in the search character memory 1001. In step 2407, all the device number sections 1002 of the search character memory 1001 are deleted. In step 2408, the data in the character memory 1001 is displayed on the screen. Inquires whether "OK" in step 2409. If it is determined in step 2410 that "OK" has been selected, the process proceeds to step 2411. When step 2 4 1 1 is completed, the password matching process ends, and the search process ends. If it is determined in step 2 410 that "OK" has not been selected, the process proceeds to 2 4 12. In step 2 4 1 2 the search results are discarded. When step 2 4 1 2 is completed, the pattern matching processing ends, and the search processing ends.

In the ladder circuit editing device configured as described above, the effects of the first and second embodiments can be obtained, and the previously selected circuit pattern is automatically searched with priority, and the searched circuit pattern can be easily searched. Since it can be selected and used, the efficiency of ladder circuit design can be further improved. Industrial applicability

A ladder one-circuit editing apparatus according to the present invention comprises: a sequence controller for inputting and editing a sequence program in the form of a ladder diagram; an input area in which at least one input completed circuit pattern is stored; Enter the pattern In a ladder circuit editing apparatus having an input area and sequentially inputting a circuit pattern from an input area, a component of a circuit pattern being input to an input area and an element of a circuit pattern stored in an input area are provided. Circuit pattern extraction means for extracting a circuit pattern including a matching component, a display means for displaying the circuit pattern extracted by the circuit pattern extraction means on an input screen, and And copying means for copying the circuit pattern extracted by the circuit pattern extracting means into the input area. Therefore, when the operator presses the function key 0 1 1 1 0 in the middle of the input to the input area, the circuit pattern that matches the component in the middle of the input is input from the already input area. Extract and automatically display at the input position. As a result, similar ladder circuits can be automatically performed without extra operations by the operator.Furthermore, unnecessary memory is not wasted and the design of one ladder circuit can be made more efficient. .

The display means sequentially displays the plurality of circuit patterns extracted by the circuit pattern extraction means, and the copying means displays an arbitrary one selected from the plurality of sequentially displayed circuit patterns based on an operation input. The circuit pattern is copied to the input area. For this reason, a plurality of similar ladder circuits are automatically searched, and the operator selects an arbitrary circuit pattern from among them, so that the efficiency of the ladder circuit design can be further improved. .

The display means displays the circuit pattern selected last time with priority. Therefore, the efficiency of ladder circuit design can be further improved.

Further, the display device further includes a selected circuit pattern address storage area for storing an address of a previously selected circuit pattern, and a switching means for replacing the address of the selected circuit pattern with the top of the selected circuit pattern address storage area. Displays the circuit pattern selected last time with priority according to the order of the addresses stored in the selected circuit pattern address storage area. Therefore, the capacity of the auxiliary storage device is not wasted, and the efficiency of the design of the ladder circuit can be further improved.

Claims

The scope of the claims

1. Input the sequence program of the program controller in the form of a ladder diagram. • Edit and edit the input area where at least one completed circuit pattern is stored and the input area where a new circuit pattern is input. A ladder circuit editing device for sequentially inputting a circuit pattern from the input area;

A circuit pattern that compares a component of the circuit pattern being input to the input area with a component of the circuit pattern stored in the input area and extracts a circuit pattern including a matching component. Extraction means;

Display means for displaying the circuit pattern extracted by the circuit pattern extraction means on an input screen;

Copying means for copying the circuit pattern extracted by the circuit pattern extracting means on the input area based on the operation input;

A ladder one-circuit editing device, comprising:

2. The display means sequentially displays a plurality of circuit patterns extracted by the circuit pattern extraction means,

2. The ladder circuit editing apparatus according to claim 1, wherein the copying unit copies an arbitrary circuit pattern selected from the plurality of sequentially displayed circuit patterns based on the operation input to the input area. .

3. The ladder circuit editing device according to claim 2, wherein the display means displays the circuit pattern selected last time with priority.

4. A selection circuit address storage area for storing the address of the previously selected circuit pattern;

The apparatus further comprises a switching unit that replaces an address of the selected circuit pattern at the top of the selected circuit pattern address storage area,

The display means includes an address stored in the selected circuit pattern address storage area. 4. The ladder circuit editing device according to claim 3, wherein the circuit pattern selected last time is displayed with priority in the order of the ladder circuit.