WO2000007081A1 - Dispositif d'edition a circuits en escalier - Google Patents

Dispositif d'edition a circuits en escalier Download PDF

Info

Publication number
WO2000007081A1
WO2000007081A1 PCT/JP1998/003402 JP9803402W WO0007081A1 WO 2000007081 A1 WO2000007081 A1 WO 2000007081A1 JP 9803402 W JP9803402 W JP 9803402W WO 0007081 A1 WO0007081 A1 WO 0007081A1
Authority
WO
WIPO (PCT)
Prior art keywords
circuit pattern
circuit
ladder
search
input
Prior art date
Application number
PCT/JP1998/003402
Other languages
English (en)
Japanese (ja)
Inventor
Yasunobu Iwata
Taku Watanabe
Shigeki Yamada
Hiroyasu Kimura
Teruyuki Harada
Tomoko Nakamura
Original Assignee
Mitsubishi Denki Kabushiki Kaisha
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Mitsubishi Denki Kabushiki Kaisha filed Critical Mitsubishi Denki Kabushiki Kaisha
Priority to JP2000562808A priority Critical patent/JP4245811B2/ja
Priority to KR10-2001-7001193A priority patent/KR100432407B1/ko
Priority to PCT/JP1998/003402 priority patent/WO2000007081A1/fr
Priority to DE19882995T priority patent/DE19882995T1/de
Publication of WO2000007081A1 publication Critical patent/WO2000007081A1/fr
Priority to US09/722,306 priority patent/US6952811B1/en

Links

Classifications

    • G—PHYSICS
    • G05—CONTROLLING; REGULATING
    • G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
    • G05B19/00—Programme-control systems
    • G05B19/02—Programme-control systems electric
    • G05B19/04—Programme control other than numerical control, i.e. in sequence controllers or logic controllers
    • G05B19/05—Programmable logic controllers, e.g. simulating logic interconnections of signals according to ladder diagrams or function charts
    • G05B19/056—Programming the PLC
    • G—PHYSICS
    • G05—CONTROLLING; REGULATING
    • G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
    • G05B2219/00—Program-control systems
    • G05B2219/10—Plc systems
    • G05B2219/13—Plc programming
    • G05B2219/13052—Display of ladder diagram
    • G—PHYSICS
    • G05—CONTROLLING; REGULATING
    • G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
    • G05B2219/00—Program-control systems
    • G05B2219/10—Plc systems
    • G05B2219/13—Plc programming
    • G05B2219/13152—Modification of program

Definitions

  • 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 for controlling mechanical equipment, and more particularly to a ladder one-circuit editing device for programming a ladder one circuit of a programmable controller.
  • FIG. 7 is a diagram illustrating an example of a general sequence program displayed by a ladder circuit.
  • 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.
  • 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.
  • 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.
  • 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 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
  • 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.
  • 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.
  • 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.
  • 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.
  • 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”
  • FIG. 38 is a flowchart of a subroutine for performing “circuit pattern replacement processing”.
  • FIG. 1 is a block diagram showing a device configuration of the ladder circuit editing device of the present invention.
  • reference numeral 0 101 denotes a ladder one-circuit editing apparatus
  • 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
  • 110110 indicates a function key.
  • FIG. 2 is a diagram showing names of respective parts of the ladder circuit.
  • reference numeral 0201 denotes a ladder circuit.
  • 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.
  • 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.
  • reference numeral 0401 denotes a device number portion
  • reference numeral 0402 denotes a symbol portion.
  • FIG. 5 is a diagram further illustrating the internal data structure of the symbol section 0402.
  • reference numeral 0403 denotes an instruction code section
  • 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.
  • 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.
  • 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.
  • 0.701 indicates a ladder circuit
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • reference numeral 1001 denotes a search character memory
  • 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.
  • FIG. 20, 1301 is a message.
  • Figure 21 shows the ladder circuit after the patterns match.
  • reference numeral 1310 denotes a ladder circuit after the pattern is matched.
  • FIG. 22 shows the character memory after the pattern matches.
  • 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.
  • 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).
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 0 is set in the line number area 0906 of the search position table 0904 by step 1100.
  • step 1111 "Next circuit block search” is performed.
  • the subroutine "Next circuit block search” will be described later in detail.
  • 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.
  • step 111 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.
  • step 1 10 3 If it is determined in step 1 1 10 3 that the patterns do not match,
  • step 1111 determines whether the patterns match. 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.
  • step 1121 the search start position (L, C) is set to (1, 1).
  • step 1122 (L c ⁇ C c) is set to (value of row number area 0903 of comparison position table 0901, 1).
  • 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.
  • step 11208 it is checked whether or not there is any data at the (L, C) position of the search character memory 1001.
  • step 1131 the search start position (L, C) is set to (1, 2).
  • step 1 1 3 2 to (L c, C c)
  • 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
  • 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.
  • step 11401 (1, 8) is set to the search start position (L, C).
  • step 11402 (0, (0) is set to (the value of the row number area 0903 of the comparison position table 0901, 8).
  • 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.
  • 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.
  • step 11408 it is checked whether or not there is any data at the position (L, C) in the search character memory 1001.
  • 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.
  • 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.
  • 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.
  • 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.
  • step 11510 L + 1 is added to the value of the row number area 0906 of the search position table 0904.
  • step 11511 the character memory 0801
  • step 1 1500 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.
  • 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.
  • 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.
  • step 122 the data in the device number section 1002 of the search character memory 1001 is deleted.
  • step 127 the data of the search character memory 1001 is displayed on the screen CRT0102.
  • 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.
  • step 1209 the search result is discarded in step 1221. The process ends.
  • step 1209 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.
  • the ladder circuit becomes a ladder circuit 1310 shown in FIG.
  • the corresponding character memory is as shown in FIG.
  • the ladder circuit becomes like the ladder circuit 1310.
  • FIG. 23 is a diagram showing another example of the ladder circuit.
  • 1401 is a ladder circuit.
  • FIG. 24 shows a configuration when the ladder circuit 1401 is stored in the character memory.
  • 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.
  • 1601 indicates a ladder circuit
  • 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.
  • 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.
  • 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.
  • 1703 and 1705 indicate the search character memory
  • 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.
  • reference numeral 2001 denotes a message.
  • 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.
  • the line number 7 of the additional instruction 16 02 is compared.
  • 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.
  • step 180 0 is set to the row number area 0906 of the search position table 0904.
  • step 1802 “Next circuit block search” is performed.
  • step 1802 “search for start condition part” is performed.
  • step 1803 it is determined whether the patterns match. If they match, proceed to step 1811 to perform “pattern matching processing”.
  • step 1803 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”.
  • step 1805 determines that the patterns do not match.
  • step 1807 determines that the pattern of the output unit matches. 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.
  • Step 1801 "Search for the next circuit block” in Step 1801
  • Step 806 "Search for output unit” and in Step 808 "Search for next circuit block” are the same as in the first embodiment.
  • step 1900 all the device number portions 1704 of the search character memory 1 ⁇ 03 are deleted.
  • step 1 901 the data of the search character memory 1 ⁇ 0 3 is displayed on the CRT 0102.
  • 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.
  • step 1904 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.
  • step 1903 If it is determined in step 1903 that "Next" is selected, then nothing is done
  • step 1903 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.
  • step 1903 the flowchart in Figure 29 Perform “Next circuit block search” by the processing described above.
  • “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.
  • 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 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.
  • FIG. 32 shows a table of the circuit pattern storage destination list.
  • 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
  • 210 is the list order M.
  • Figure 33 shows the circuit pattern storage area.
  • 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
  • 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.
  • Search instruction is, for example, keyboard
  • 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.
  • 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.
  • step 2303 “search for a start condition part” is performed by processing according to the flowchart in FIG.
  • 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.
  • 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.
  • step 2308 it is determined in step 2308 whether the patterns match.
  • step 2309 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.
  • step 230 "pattern matching processing" is performed, and the processing ends.
  • step 2 304 determines that the patterns do not match
  • Step 2 3 17 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.
  • step 2501 the list order M2106 is compared with the circuit path storage destination list 2101 at the end of the list 2101.
  • 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.
  • step 2506 the circuit replacement process is completed, and the process returns to step 240.
  • step 2502 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.
  • 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.
  • the address of the selected circuit pattern is stored at the head of the circuit pattern storage destination list 210.
  • 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.
  • 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.
  • step 2407 all the device number sections 1002 of the search character memory 1001 are deleted.
  • 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.
  • 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.
  • a ladder one-circuit editing apparatus 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
  • 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.
  • 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.
  • 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.

Landscapes

  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Automation & Control Theory (AREA)
  • Programmable Controllers (AREA)

Abstract

L'invention concerne un dispositif d'édition de circuits en escalier, doté d'une région entrée, laquelle reçoit et édite un programme de séquences d'un module de commande de programmes, sous la forme d'un diagramme en escalier, et conserve au moins un motif de circuit reçu, et d'une région non entrée dans laquelle un nouveau motif de circuit doit être entré et qui reçoit successivement des motifs de circuit à partir de la région entrée ; la région entrée comprend des moyens d'extraction de motifs de circuits, lesquels moyens comparent des éléments constituants d'un motif de circuit qui doit être entré dans la région non entrée, avec des éléments constituants d'un motif de circuit conservé dans la région entrée, et extraient des motifs de circuit, notamment des éléments constituants qui sont conformes. Ce dispositif comporte également des moyens d'affichage, sur un écran d'entrée, des motifs de circuits extraits, ainsi que des moyens de copie, sur la région non entrée, des motifs de circuits extraits, en fonction de l'entrée d'exploitation.
PCT/JP1998/003402 1998-07-30 1998-07-30 Dispositif d'edition a circuits en escalier WO2000007081A1 (fr)

Priority Applications (5)

Application Number Priority Date Filing Date Title
JP2000562808A JP4245811B2 (ja) 1998-07-30 1998-07-30 ラダー回路編集装置
KR10-2001-7001193A KR100432407B1 (ko) 1998-07-30 1998-07-30 사다리형회로 편집장치
PCT/JP1998/003402 WO2000007081A1 (fr) 1998-07-30 1998-07-30 Dispositif d'edition a circuits en escalier
DE19882995T DE19882995T1 (de) 1998-07-30 1998-07-30 Leiterschaltungseditiersystem
US09/722,306 US6952811B1 (en) 1998-07-30 2000-11-28 Ladder circuit editing system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/JP1998/003402 WO2000007081A1 (fr) 1998-07-30 1998-07-30 Dispositif d'edition a circuits en escalier

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US09/722,306 Continuation US6952811B1 (en) 1998-07-30 2000-11-28 Ladder circuit editing system

Publications (1)

Publication Number Publication Date
WO2000007081A1 true WO2000007081A1 (fr) 2000-02-10

Family

ID=14208723

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP1998/003402 WO2000007081A1 (fr) 1998-07-30 1998-07-30 Dispositif d'edition a circuits en escalier

Country Status (4)

Country Link
JP (1) JP4245811B2 (fr)
KR (1) KR100432407B1 (fr)
DE (1) DE19882995T1 (fr)
WO (1) WO2000007081A1 (fr)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1283456A1 (fr) * 2001-08-09 2003-02-12 Mori Seiki Co., Ltd. Outil pour la recherche de données d'usinage semblables et appareil de programmation automatique basé sur celui-ci
US7340683B2 (en) 2001-03-29 2008-03-04 Mitsubishi Denki Kabushiki Kaisha Programming tool
WO2014155717A1 (fr) * 2013-03-29 2014-10-02 三菱電機株式会社 Programme de création de composant de programme de séquence et dispositif de création de composant de programme de séquence
CN105974875A (zh) * 2015-03-13 2016-09-28 发那科株式会社 具有梯形图程序的分支电路提取及显示功能的监视装置

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100817364B1 (ko) * 2006-04-05 2008-03-26 미쓰비시덴키 가부시키가이샤 프로그래머블 로직 컨트롤러의 주변 장치 및 그 프로그램작성 방법
JP6224575B2 (ja) * 2014-12-19 2017-11-01 ファナック株式会社 指定した信号の演算条件によりラダー回路を検索可能なラダープログラム検索装置

Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS6255703A (ja) * 1985-09-04 1987-03-11 Yaskawa Electric Mfg Co Ltd プログラム入力装置
JPH02220102A (ja) * 1989-02-22 1990-09-03 Fanuc Ltd シーケンス・プログラム編集方式
JPH0310322A (ja) * 1989-06-07 1991-01-17 Toshiba Corp 論理型言語編集装置
JPH04205312A (ja) * 1990-11-30 1992-07-27 Nissan Motor Co Ltd シーケンスプログラムの照合方法
JPH04348404A (ja) * 1990-11-26 1992-12-03 Hitachi Ltd プログラマブルコントローラのプログラミング装置
JPH05189012A (ja) * 1992-01-10 1993-07-30 Yaskawa Electric Corp プログラマブルコントローラのプログラミング装置
JPH0695712A (ja) * 1992-09-10 1994-04-08 Fanuc Ltd シーケンス・プログラムの編集方式
JPH07146642A (ja) * 1993-11-24 1995-06-06 Fanuc Ltd ラダープログラムの入力方式
JPH07319513A (ja) * 1994-05-20 1995-12-08 Fuji Electric Co Ltd プログラマブルコントローラのプログラミング装置およびそのシーケンスプログラム作成方法
JPH09251305A (ja) * 1996-03-14 1997-09-22 Omron Corp プログラム作成装置

Patent Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS6255703A (ja) * 1985-09-04 1987-03-11 Yaskawa Electric Mfg Co Ltd プログラム入力装置
JPH02220102A (ja) * 1989-02-22 1990-09-03 Fanuc Ltd シーケンス・プログラム編集方式
JPH0310322A (ja) * 1989-06-07 1991-01-17 Toshiba Corp 論理型言語編集装置
JPH04348404A (ja) * 1990-11-26 1992-12-03 Hitachi Ltd プログラマブルコントローラのプログラミング装置
JPH04205312A (ja) * 1990-11-30 1992-07-27 Nissan Motor Co Ltd シーケンスプログラムの照合方法
JPH05189012A (ja) * 1992-01-10 1993-07-30 Yaskawa Electric Corp プログラマブルコントローラのプログラミング装置
JPH0695712A (ja) * 1992-09-10 1994-04-08 Fanuc Ltd シーケンス・プログラムの編集方式
JPH07146642A (ja) * 1993-11-24 1995-06-06 Fanuc Ltd ラダープログラムの入力方式
JPH07319513A (ja) * 1994-05-20 1995-12-08 Fuji Electric Co Ltd プログラマブルコントローラのプログラミング装置およびそのシーケンスプログラム作成方法
JPH09251305A (ja) * 1996-03-14 1997-09-22 Omron Corp プログラム作成装置

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7340683B2 (en) 2001-03-29 2008-03-04 Mitsubishi Denki Kabushiki Kaisha Programming tool
DE10197097B4 (de) * 2001-03-29 2012-02-23 Mitsubishi Denki K.K. Programmierwerkzeug
EP1283456A1 (fr) * 2001-08-09 2003-02-12 Mori Seiki Co., Ltd. Outil pour la recherche de données d'usinage semblables et appareil de programmation automatique basé sur celui-ci
WO2014155717A1 (fr) * 2013-03-29 2014-10-02 三菱電機株式会社 Programme de création de composant de programme de séquence et dispositif de création de composant de programme de séquence
US9626160B2 (en) 2013-03-29 2017-04-18 Mitsubishi Electric Corporation Sequence-program-component creation program and sequence-program-component creation device
CN105974875A (zh) * 2015-03-13 2016-09-28 发那科株式会社 具有梯形图程序的分支电路提取及显示功能的监视装置

Also Published As

Publication number Publication date
KR20010106422A (ko) 2001-11-29
DE19882995T1 (de) 2001-06-21
KR100432407B1 (ko) 2004-05-22
JP4245811B2 (ja) 2009-04-02

Similar Documents

Publication Publication Date Title
US7272450B2 (en) Development aid device
JP4513806B2 (ja) プログラマブルロジックコントローラの周辺装置及びそのプログラム作成方法
JP2526692B2 (ja) プログラマブルコントロ―ラのプログラミング方法
JP4242361B2 (ja) 開発支援装置
JPH0863346A (ja) プログラム編集方法とその装置
JP4366605B2 (ja) 開発支援装置およびプログラムならびに処理方法
WO2000007081A1 (fr) Dispositif d'edition a circuits en escalier
CN111033399B (zh) 梯形图程序制作支持装置、及其方法与记录媒体
JP2003084813A (ja) ラダー回路の編集装置、および、その編集方法
JP2006146955A (ja) 開発支援装置
US6952811B1 (en) Ladder circuit editing system
JP4517302B2 (ja) 開発支援装置の制御方法及びプログラム並びに記録媒体
WO2024014354A1 (fr) Dispositif d'édition de programme de commande, procédé d'édition et programme
WO2020184195A1 (fr) Dispositif, procédé et programme d'aide à la création de programme de schéma à contacts
WO2024014355A1 (fr) Dispositif d'édition de programme de commande, procédé d'édition et programme
JPH06110884A (ja) 編集装置
JPH0895612A (ja) Ｓｆｃプログラム開発装置
JP4362777B2 (ja) プログラミング装置、シンボル自動登録方法、プログラムおよび記録媒体
JP2848444B2 (ja) 回路図エディタ
US20040210867A1 (en) Sequence program editing apparatus
JPH09212673A (ja) 画像編集装置
JP4592646B2 (ja) 作図方法、作図装置及びコンピュータプログラム
JP3223559B2 (ja) ディジタル保護継電装置の整定方法
JPH04367029A (ja) プログラマブルコントローラ用プログラミング装置
JPH0793008A (ja) シーケンスデータの生成方法

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): DE JP KR US

DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
WWE Wipo information: entry into national phase

Ref document number: 09722306

Country of ref document: US

WWE Wipo information: entry into national phase

Ref document number: 1020017001193

Country of ref document: KR

RET De translation (de og part 6b)

Ref document number: 19882995

Country of ref document: DE

Date of ref document: 20010621

WWE Wipo information: entry into national phase

Ref document number: 19882995

Country of ref document: DE

WWP Wipo information: published in national office

Ref document number: 1020017001193

Country of ref document: KR

WWR Wipo information: refused in national office

Ref document number: 1020017001193

Country of ref document: KR

REG Reference to national code

Ref country code: DE

Ref legal event code: 8607