JP2932105B2 - A method for creating a connection information table in a multi-layer multiple control device integrated system - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an integrated system for a plurality of control devices in which a plurality of control devices such as programmable controllers (PCs) are hierarchically operated in parallel. Related to a method of creating a connection information table.

[0002]

2. Description of the Related Art A PC is a control device effective for controlling a production machine or the like. A plurality of PCs are used in such a manner that a plurality of PCs are driven in parallel in controlling a transfer machine or the like. Further, there is known a method of integrally configuring a control system using a plurality of control devices such as PCs. Here, a system configured according to such a method is referred to as a multiple PC integrated system.

FIG. 15 shows links relating to a transfer machine and a plurality of PCs for controlling the transfer machine.

As shown in FIG. 1, a transfer machine 10 includes a transfer bar 12 and a plurality of stations STn.

[0005] The transfer bar 12 travels in the center of the transfer machine 10 and conveys a work to be processed or the like by the transfer machine 10.

The station STn includes a general station ST0 and a processing station STn (n = 1, 2,...)
There is. The general station ST0 shares functions such as the operation of the transfer bar 12, and the processing station ST0.
n shares functions such as predetermined processing on the work.

FIG. 16 shows an example of the structure of the processing station STn. As shown in this figure, one station STn is provided with a processing unit 14 for performing processing and the like on the work W on the transfer bar 12 from the left and right.
L, 14R, and a jig unit 16 located immediately above the transfer bar 12. Therefore, in each processing station STn, the processing units 14L,
By causing the 14R and the jig unit 16 to perform a predetermined operation, it is possible to execute a predetermined part of the operation in the transfer machine 10.

In order to execute such a predetermined operation in each station STn (including the general station ST0), a device for controlling each station STn according to a predetermined program is required. A PC generally used as such an apparatus in the transfer machine 10 is a PC. That is, in the transfer machine 10, each station S
Two PCs are provided for each Tn (but one for the general station ST0). In FIG. 15, P
C is indicated by codes such as PC11, PC12,..., And is indicated by PCL, PCR in FIG.

Normally, each PC is given two numbers as PC names so that its arrangement can be identified. FIG.
Here, the station number n is given as the first numeral. Also, a PC corresponding to the PCL in FIG.
That is, “1” is assigned to the PC arranged on the left side with respect to the flow direction of the work W, and “2” is assigned as the second number to the PC corresponding to the PCR, that is, the PC arranged on the right side. I have to.

Therefore, in the transfer machine 10 shown in FIG. 15, if there are N processing stations STn, PC1 corresponding to the general station ST0 is added, and a total of 2N + 1 PCs are used.

Thus, when using a plurality of PCs,
It is necessary to transmit and receive data between the PCs and operate them while communicating with each other. Therefore, a link line 18 is used as shown in FIG.

FIG. 17 shows an example of a configuration of PCs connected to each other by a link line 18. The PC shown in this figure is a PC having the configuration previously proposed by the present applicant.
C (see Japanese Patent Application No. 2-74521). As shown in this figure, the PC includes a memory unit 20 and a CPU unit 22.
It has.

The memory section 20 is a circuit for storing a control program corresponding to a sequence diagram. The storage area is divided into at least a command word section 100, an input / output address section 110, a signal name section 120, and a link management table section 130 as shown in a table inside the memory section 20 in FIG.

The command word section 100 is an area for storing a command word indicating opening and closing of a contact. Input / output address section 110
Is an area for storing an address related to the instruction word.
The signal name section 120 is an area for storing a signal name representing the content of the instruction word in a readable code. The link management table unit 130 is an area for storing a link management table indicating a destination of an output according to the command word.

The storage area of the memory section 20 is further allocated to a signal name / address correspondence table section 140 and a connection condition storage section 150.

Signal name / address correspondence table section 140
Is an area for storing a signal name / address correspondence table indicating the correspondence between signal names and input / output addresses. The storage contents of the signal name / address correspondence table section 140 are input in advance, but can be sequentially rewritten. The connection condition storage unit 150 is an area for storing connection conditions indicating what PCs are present in the system and how the PCs are related to each other on a program. This area can be rewritten.

The CPU section 22 has a control processing section 24 and a signal name information interpreting section 26.

The control processing section 24 is a member for controlling the corresponding processing unit 14 and the like based on the contents stored in the memory section 20.

The signal name information interpreting section 26 interprets, for example, when a signal name is input from the outside, as an instruction to confirm the contents of the corresponding input / output address portion of the memory section 20. Alternatively, it is interpreted that the signal name and the input / output address have been input based on the storage contents of the signal name / address correspondence table section 140. The signal name information interpreting section 26 performs processing with reference to the signal name / address correspondence table section 140 when the input of the signal name is performed together with the instruction of new writing to the memory section 20, and performs other instructions, For example, when an instruction to read a corresponding portion from the memory unit 20 is given, the process of referring to the signal name / input / output address correspondence table unit 140 is not particularly performed. This is because since the memory unit 20 has the above-described configuration, the signal name unit 120 can be directly viewed.

The actual reading, rewriting or new writing of information is performed by the control processing unit 24.
Of course, the signal name information interpreting section 26 may have the ability to perform such processing.

Further, in the PC shown in FIG. 17, based on the information in the link management table section 130, for example, if it is a zig-julme, information indicating the jig-zul-me
PC01 corresponding to general station ST0 via
Output. Such information, ie, the interlock information, is stored in all the PCs having the interlock.
Is written. Therefore, each PC
The necessary information is extracted from the interlock information from C00, and the extracted information is transmitted to the link management table unit 1 in the sending PC.
30 must be written. The PC shown in FIG. 17 automatically performs this operation, that is, the operation of creating a link management table.

FIG. 18 shows a link management table creation routine executed for each PC in this conventional example.

Prior to operating the transfer machine 10, a program (sequence diagram) for operating the PC is created, and the created program is written to each PC from a peripheral tool or the like. The operation shown in FIG. 18 is an operation executed when starting up the system after performing operations such as program creation, modification, and addition.

When the system is turned on, each PC first creates input request information (200). The input request information referred to here is information including control PC information. More specifically, the input request information is information such as a contact point directly monitored and controlled by another PC from its own program. Information to be done. Each PC extracts this information from its own program.

This extraction is performed by referring to the signal name section 120. That is, the signal name includes the control PC information for specifying the PC that directly monitors and controls the contact point and the like as described above. Therefore, based on this, the input request information can be easily extracted using the search technology in the information processing.

The input request information thus obtained is:
It is converted into data in the form of a card. FIG. 19 conceptually illustrates the contents of the card. That is, the card is actually in the form of data, but can be grasped by imitating a card in which the card issuer PC, request destination PC, and signal name are described.

The card 300 shown in FIG.
The control PC information 310 related to the card issuer PC includes “00” representing PC00 in the example of FIG. The card issuing PC is a PC that issues the card 300, that is, a PC that sends input request information.

The card 300 is a card request destination PC.
Is included. This control PC
The information 320 is indicated as “11”, “12”, etc. in the figure.

Further, a signal name 330 corresponding to the control PC information 320 is included. The signal name 330 is information indicated as “11F1D2P” or the like in FIG. If there is no signal name (interlock information) corresponding to certain control PC information 320, information indicating that there is no signal name is associated as information 330 in this control PC information 320.

The card 300 is created in all PCs, and each PC receives a card created by another PC. Confirmation of the presence or absence of reception is confirmed by information shown in a confirmation column 340 in the figure.

In creating the card 300, information on what PC is used in the system related to the transfer machine 10 and what kind of association the program has is required. Such information, so-called connection information, is stored in the connection condition storage unit 150 of the memory unit 20 as described above. That is, each PC
In, the card is created based on the connection condition stored in the own connection condition storage unit 150.

Thereafter, the PC determines whether or not it has the right to send the code train (202). Here, the code train transmission right is a right to transmit the code train. The code train refers to a process of sending a card to inform another PC of its own input request information, and the sending of a code train refers to executing this process.

Regarding the transmission of the code train, rules are defined in the system, and the subsequent transmission operation is executed according to the rules. For example, if it is a rule that the code train transmission right is determined in order from the one located on the upstream side in the program connection as the whole system, based on this rule, step 20
2 is performed.

In general, the system is designed so that the right to send a code train circulates all PCs. That is, a certain PC does not acquire the code train transmission right again unless the code train transmission right goes around all the other PCs after transmitting the code train by itself.

If it is determined in step 202 that there is a code train transmission right, the process proceeds to step 204. In step 204, it is determined whether or not the code train transmission right has completed one cycle.

In step 204, if it is determined that one round has been completed, it is considered that the link management table has already been created, and the operation ends. It is determined whether or not the round has been completed when the code train transmission right occurrence on the PC is 2
The determination is made as to whether or not it is the first time.

If the cycle has not been completed yet, that is, if the right to send the code train is generated for the first time, the card 300 is sent out as data on the link line 18 (206). That is, the transmission of the code train is executed. The sent card 300 is circulated to the downstream PC.

The card 300 is taken in by the downstream PC. This operation is performed in step 202 in FIG.
, Ie, steps 208 to 21
6 is represented.

As described above, in step 202, the presence or absence of the code train transmission right is determined. Step 2
The case where it is determined that there is no code train transmission right according to 02 corresponds to the case where the code train transmission right has not been circulated for all PCs. Therefore, the operation when it is determined in step 202 that there is no right to send the code train is the operation of the downstream PC. Downstream side P
In C, first, it is determined whether or not the code train relating to the card 300 to be captured has arrived (20).
8).

When it is determined that the vehicle has not arrived, the step 208 is repeated. If it is determined that the vehicle has arrived, the process proceeds to step 210, where the code train is captured.

When the code train capture is executed,
An output signal link management table is created based on the acquired information on the card 300, that is, the input request information from the card issuing PC (212). At this time, the input request information to be processed is a PC in which the corresponding control PC information 320 of the information constituting the card 300 indicates itself.
What is a name. The output signal link table is a table that associates a PC name indicating an output destination with a signal name. In this case, the signal name may not include the control PC information. After step 212, step 214 is executed.

In step 214, the confirmation mark 3
40 is given. That is, the fact that the self has already executed the code train fetch is indicated on the card 300, and the card 300 is sequentially sent (216).

When the card 300 makes one cycle by the operation of the downstream PC, the card issuing PC collects the card 300 which has made one cycle (218). Collected card 30
0 contains a confirmation mark 340 for the PC that executed the code train capture. The PC determines whether or not responses have been received for all PCs based on the presence or absence of the confirmation mark 340 (220).

If it is determined that responses have been received from all the PCs, an input signal link management table is created (222), otherwise, a bypass process is executed (224). The link management table for input signals created in step 222 is a table having the same contents as the card 300. Step 2
The bypass process executed in 24 is, for example, a process that enables a partial test run at an intermediate stage of the system design. After this processing, step 2
Then, the process proceeds to step S22, where the input signal link management table including the bypass processing result is created. After step 222,
The code train transmission right is forwarded (226), and the operation is repeated from step 202.

Since such an operation is performed by all the PCs constituting the multi-PC integrated system, a link management table is created for all the PCs, so that the necessary operations can be comprehensively executed according to the program.

Incidentally, there are two types of system configuration of the multiple PC integrated system, that is, a single-layer link and a multi-layer link. FIG. 20 shows an example configuration of a single-layer link, and FIG.
3 shows an example configuration of a multi-layer link.

As shown in these figures, the single-layer link has a single link line LINK1, and each of the PC11, CPU12,.
PC12,... Are connected to the link line LINK1. Further, the link line LINK1 is
Are connected to the PC 00 including

The multi-level link has a plurality of, in the figure, 3
Book link lines LINK1, LINK2, LINK3
And each link line LINK1, LINK
2, LINK3 have PC11, PC12,.
, PC51, PC52,... Are connected. Link lines LINK1, LINK2
LINK3 are both connected to PC00.

These configurations are selectively adopted according to the scale of the system and the like. For example, the maximum number of stations (the number of PCs) per link line 18 is generally, for example, about 64 at maximum. In order to suppress a time delay in response, for example, 20 stations / link are preferable. Therefore, in general, it is preferable to use a multi-layer link in a large-scale system, a system that requires a quick response, and the like.

[0050]

However, when a multi-layered link is employed, there are several problems such as the inability of a certain PC to access a PC connected to another link line. Here, the access from a certain PC to another PC refers to an operation of connecting the peripheral tool 28 to an arbitrary PC (PC 21 in the figure) and taking in information from the other PC, as shown in FIGS. For example, it refers to a search operation. For example, access from the PC 21 to the PC 52 is possible for a single-layer link because the link management table is created by the operation shown in FIG. However, the operation in FIG. 18 is an operation for PCs connected to the same link line, that is, PCs belonging to the same link. In a multi-layered link having a plurality of links, access to a PC belonging to the same link is possible, but information necessary for accessing a PC belonging to another link is not prepared. Cannot access the PC belonging to. Therefore, for example, PC2
From 1 on, PC00 indicated by hatching in the figure is the access limit.

When accessing a PC belonging to the same link, the user of the peripheral tool 28 must know the parameters and the station number (information for specifying the PC). In other words, since the same also belong to the system, it can not access the PC if it belongs to the other link,
The user needs to be aware of this, and usability cannot be ensured. Further, the PC does not have the connection information between the links and cannot grasp the information by itself.

As described above, in the multi-layer link in which the link management table is created by the conventional method, there is a problem that the access operation is restricted in particular.

An object of the present invention is to solve such a problem, and a method of making a control device (for example, a PC) accessible to a control device belonging to another link, that is, a method of controlling a plurality of control devices, An object of the present invention is to provide a method for creating a connection information table in a device integration system.

In order to achieve such an object, the present invention creates a link management table for each link line ,
The link management table for each link line is integrated into a single connection information table, and the connection information table is stored in at least one of the control devices. Characterized by

[0055]

In the present invention, a link management table is created for each link to which a control device such as a PC belongs . The created link management table is integrated into a single connection information table and stored in at least one of the control devices.

Therefore, by accessing the control device related to the storage, information related to the control device connected to another link line , for example, information on the coil block in the sequence diagram can be obtained.

[0057]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Preferred embodiments of the present invention will be described below with reference to the drawings. The same components as those of the conventional example shown in FIGS. 15 to 20 are denoted by the same reference numerals, and description thereof is omitted.

FIG. 1 shows a flow of a connection information table creating operation according to an embodiment of the present invention. The connection information table in this embodiment is a table that integrates the link management table in the conventional example or a table that constitutes a part thereof. An apparatus for executing the operation shown in this figure is a PC having a configuration as shown in FIG. 17, particularly a CPU section 22 thereof, and a system configuration is a multi-layered link as shown in FIG. Although the operation of FIG. 1 may be executed in a single-layer link, the effect of the present invention is remarkable in a case of a multi-layer link.

The operation shown in FIG. 1 is basically different from the operation of the conventional example shown in FIG. 18 in that after a link management table is created for all links, these are integrated and a connection information table is created. It is. Hereinafter, the characteristic operation and the modification of the operation related thereto will be described.

As shown in this figure, in the present embodiment, prior to the operation of creating the link management table, the link N
o is initialized to 1 (228). This link No
Indicates that the link currently creating the link management table is L
An index indicating INK1, LINK2, or LINK3. In this embodiment, first, a link management table is created for LINK1.

After step 228, input request information is created (200) and the presence or absence of a code train transmission right is determined (202), as in the conventional example. If there is no code train transmission right, a series of operations (208 to 216) relating to the creation of the output signal link table are executed, and the process returns to step 202. If the user has the code train transmission right, a series of operations (204, 206, 218 to 226) for creating the input signal link table are executed, and the process returns to step 202 in the same manner. In this way, a link management table is created in the same manner as in the related art.

In the latter operation, that is, a series of operations relating to the creation of the input signal link table, in this embodiment,
The determination of the link No is performed.

That is, after the code train is collected in step 218, in this embodiment, the link number of the collected code train is reduced to the number n (three in FIG. 21) of the link lines 18 included in the system. It is determined whether or not they are in agreement (230). In this embodiment, it is assumed that the card includes the information of the link No.

If it is determined in step 230 that there is no match, it can be considered that there is a link that has not yet been subjected to the link management table creation operation, so that it is not necessary to execute the bypass process. Therefore, step 220
And 224, without executing the step 222. If they match, step 220 and, if necessary, 224 are executed, and the process proceeds to step 222.

In this embodiment, step 2
If it is determined in 04 that the code train transmission right has completed one cycle, that is, it is determined that the second code train transmission right has occurred, the process related to step 232 is executed instead of terminating the operation.

In step 232, step 23
Similarly to 0, it is determined whether or not the link number matches the number n of the link lines 18. At this time, if they do not match, it can be considered that the creation of the link management table has not yet been completed for all the links, so the link number is incremented (234). For example,
Link No. initialized to 1 in step 228
Is incremented to 2. After this, step 200
Then, a link management table for a new link is created.

If it is determined in step 232 that they match, it can be considered that link management tables have been created for all the links belonging to the system, so step 236 is executed, after which the operation is performed. finish. Step 236 is an operation according to the feature of the present invention, that is, an operation of integrating the link management table into the connection information table. This operation is performed by, for example, designing the system so that all the PCs have the entire range of the connection information table, or setting the number of the PCs having the entire range of the connection information table to one, and setting the other PCs to the link to which the PC belongs. The specific contents differ depending on whether the system is designed to have only a portion (this corresponds to a link management table).

Next, the contents of step 236, that is, the design of the connection information table integration routine will be described in the first place.
The design of the embodiment will be described as a second embodiment.

FIG. 2 shows the contents of the connection information table integration routine according to the first embodiment.

In this embodiment, first, it is determined whether or not the PC executing the routine is the PC related to the integrated connection, that is, PC00 (400). PC0
If it is 0, m is set to 1 in the following step 402. m is an index indicating the number of the link currently being integrated. Therefore, after step 402, the card is taken into the PC00 from the link of link No = m (404). This card has a link number
= PC connected to link m (If m = 1, PC
C11, PC12, PC21 and PC22), the request destination PC name corresponding to the PC name, and the signal name are described.
In step 404, a standby state is set until the card associated with link No = m arrives.

After step 404, it is first determined whether m = n (406). If m = n, m is incremented (408) and steps 404 and 4 are performed.
06 is repeated. In step 404, integration is sequentially performed based on the information on the card that has been captured so far and the information on the card that has been captured this time. When m = n by this repetition, the operation of step 410 is performed, and the connection information table integration routine ends.

The operation of step 410 is an operation in which the PC 00 transmits a connection information table to another PC. As shown in FIG. 3, the connection information table created by repeating step 404 includes LINK1 (L1),
LINK2 (L2) and information indicating which PC is connected to LINK2 (L2). That is, control PC information indicating the PC connected to each link is included. The connection information table having such contents is received and taken in by all other PCs.

This receiving operation is represented as step 412 in FIG. That is, step 400
If it is determined that is not PC00 in,
The PC executes only the receiving operation, and then the connection information table integration routine ends. In this embodiment, the integration into the connection information table is performed in this manner, and the situation of the system realized as a result is shown in FIG. As shown in this figure, in this embodiment, all PCs have a connection information table. Therefore, any PC can access any PC by the peripheral tool 28. That is, if the user of the peripheral tool 28 inputs information for specifying the PC at the time of access, the PC related to the connection with the peripheral tool 28
Can refer to the connection information table and execute an access operation based on the result.

FIG. 5 shows a search / display operation of a coil block as an example of access. FIGS. 5A and 5B show the screens of the peripheral tool 28, both of which are 500 for the former and 510 for the latter.
, Respectively.

Here, an operation in a system of two layers and three systems as shown in FIG. 21, that is, a system in which three link lines 18 are provided and all the link lines 18 are integrated in one PC (PC00) will be described. Think. However, LINK1 is the first and second stations, LINK2
Is assumed to be in charge of the third and fourth stations, LINK3 is in charge of the fifth and sixth stations, the transfer device is in charge of the CPU 00, and controls the entire equipment.

In such a system, it is assumed that "52T1D2P" is a condition for performing the jigging on the PC 21 (on the left PC of the second station). That is, when this condition is not satisfied, it is assumed that jigging does not start.

At this time, when the PC 21 accesses the PC 52 to search for the coil block of the signal name "52T1D2P" (the second transfer forward end), the following operation is performed.

First, the peripheral tool 28 searches for a coil block of the jig shim command in the program of the PC 21 and displays the coil block on its display screen (FIG. 5).
(A)). Next, the peripheral tool 28 determines that the unsatisfied condition “52
T1D2P "is retrieved and displayed (FIG. 5B).

In the search display of the unsatisfied condition “52T1D2P”, the peripheral tool 28 outputs the signal name “52T1D2P”.
The connection information table of the PC 21 is referred to based on the information “52” of the first two characters representing the PC name of “P”, and it is ascertained that the PC represented by the information “52” exists as the PC 52 in the LINK 3. PC21 is a PC
The PC 52 that has requested access to the PC 52 performs a search by itself based on the information “T1D2P” in the latter half of the signal name “52T1D2P”, and transmits the corresponding coil block statement program information via the LINK3. Return to PC 21 belonging to LINK1. PC21 is
The information obtained by the return is transferred to the peripheral tool 28 as data, and the peripheral tool 28 performs display processing based on the transferred data. Next, the operation of the CPU of each PC when performing such a search operation, that is, the flow of the search operation in the present embodiment will be described with reference to FIG. FIG. 6 shows a coil block search routine. As shown in this figure, the operation of the coil block search routine differs depending on whether it is a search side or a search side.

First, the case of the search side will be described. At this time, it is determined whether or not the PC related to the connection with the peripheral tool 28, that is, the coil whose search is requested exists in the program of the own station. Is executed (60
0). When a search for a certain coil block is requested from the peripheral tool 28, if this coil block exists in the program of the own station, there is no need to make an inquiry to another PC. Therefore, if it is determined in step 600 that the program exists, the information included in the program is immediately searched (602), and after the information is output to the peripheral tool 28 (604), the search operation ends. I do. The peripheral tool 28 takes in the output information and executes a predetermined operation such as displaying on a screen.

If it is determined in step 600 that the PC does not exist, the process proceeds to an inquiry operation to another PC.
At this time, first, regarding the coil block related to the search,
The affiliation link of the search destination PC is obtained based on the signal name (60
6). As described above, since the first two characters of the signal name are information for specifying the PC, the link No. to which the search target PC belongs can be determined by referring to the connection information table using this information.

After determining the link No. to which the search destination PC belongs, the own station sends a coil read request including the link No. and the signal name as information (608). Search PC
As shown in step 610 in FIG. 6, in response to a coil read request, retrieves a coil block corresponding to the request, and sends out corresponding program information on a link. For example, when the PC 52 is a search destination PC,
The program information is transmitted on LINK3. Search side P
C receives the transmitted information via PC00 and LINK1 (612), and proceeds to step 604.

As described above, according to this embodiment, it is possible to access a PC belonging to another link. This effect is obtained by creating, storing, and referring to the connection information table. In this embodiment, the creation (integration) of the connection information table is performed by the PC00.
Of the connection information table is collectively performed by the CPU 00 of the other PC.
There is an advantage that the burden on the user can be reduced.

FIG. 7 shows a connection information table creation routine in the system according to the second embodiment of the present invention.

In this embodiment, as described above, the connection information table of the entire range is held only by the PC 00, and the other P
C is an example in which a part of the connection information table of PC00 is held. The connection information table held by a PC other than the PC 00 is a table indicating which PC is connected to the same link as the own station.

Therefore, in this embodiment, unlike the first embodiment, the integrated connection information table of the entire range is
There is no need to transmit from C00 to another PC. For this reason,
As shown in FIG. 7, the connection information table integration routine includes only steps 402 to 408 in FIG.

The connection information table created and integrated in this way and stored in each PC has contents as shown in FIGS. FIG. 8 shows the LI
FIG. 9 shows the connection information table held in the PC belonging to LINK2, and FIG. 10 shows the connection information table held in the PC belonging to LINK3. FIG. 11 shows the entire range of the connection information table held in the PC00. The connection information table integration status of the entire system is shown in FIG.
The contents are as schematically shown in FIG.

In such a system, when a search for a coil block is to be performed, a search routine as shown in FIGS. 13 and 14 is performed. FIG.
0 shows a routine executed by the CPU 00, and FIG. 14 shows a routine executed by the CPU of another PC.

In this embodiment, first, the search-side PC
In step, the determination according to step 600 is performed in the same manner as in the first embodiment. If the result of this determination is that the information on the coil block to be searched exists in the program of the search PC, the search (602) and the result output (604) are executed, and the routine ends.

If the result of the determination is that none exists, step 614 is executed. Step 614 is for judging whether or not the search destination PC exists in the connection information table of the own station. This determination is made based on the first two characters of the signal name related to the search. As a result of the determination, if it is determined that there is a coil read request in step 608, the other PC specified by the coil read request responds to this request in step 6 as in the first embodiment.
Execute Step 10. The coil block output in step 610 is received by the CPU of the search-side PC (61).
2) The result output is executed (604).

If it is determined in step 614 that the search destination PC does not exist in the table of the own station, another P
An inquiry is made as to whether or not the search destination PC exists in the connection information table held by C (616). This inquiry is made with information including at least the signal name. In the case of a system with two layers and three systems as shown in FIG. 21, the PC or PC00 belonging to another link responds to this inquiry. That is, since the PCs belonging to the same link have only the same connection information table as the search side PC, even if there is an inquiry, the search destination P
I can't show where C is. Therefore, in this case, the inquiry is forwarded to another PC, and as a result, the PC or PC00 belonging to another link returns a response to the inquiry.

The inquiry and reply will be described as follows. In step 616, the search side P
When C issues an inquiry, an arbitrary or predetermined PC responds to the inquiry (618) and refers to the connection information table held by the own station (620). As a result of the reference, when it becomes clear that the search destination PC exists on the connection information table of the own station, the PC receiving the inquiry replies the result to the search side PC (622). The search-side PC receives this response (624), and executes the operation after step 606. At this time, since the link No. to which the search destination PC belongs is clarified by the reply, step 60
8, the search destination link can be specified in the coil read request. The search destination PC executes the coil block output (610) in response to the coil read request.

In step 620, the search destination P
If it is determined that C does not exist in its own connection information table, the PC receiving the inquiry sends the inquiry to other PCs in order. The sequentially forwarded PC performs the same operation as the previously inquired PC, as shown in FIG.

Therefore, according to the present embodiment, it is possible to access a PC belonging to another link by circulating an inquiry to each PC. Further, in this embodiment, since each PC has only the connection information relating to the PC belonging to the same link as the own station, the load on storage is small. Also,
Even if a new PC is provided for expansion or change of the system, it is only necessary to correct the connection information table for the PC belonging to the same link as the PC and the upper PC (PC00).

In the above description, a system having a relatively simple configuration of two layers and three systems as shown in FIG. 21 is assumed. However, the second embodiment can also be applied to a system having a more complicated configuration, for example, a system in which a sub system further exists under the PC 11 belonging to the LINK 1.

In this case, the connection information table held by the PC 11 does not have the same contents as the connection information table of another PC on the same link, for example, the PC 21. That is, the connection information table of the PC 11 includes the connection information of the PC belonging to the lower hierarchy.
In such a case, in the forward operation of the inquiry shown in FIG. 14, the P belonging to the same link (LINK1)
You can expect a response from C.

Further, for the same reason, PC00 does not hold the connection information table of the entire range. That is, PC00
The connection information table of LINK1 to LINK1
3 has only connection information of PCs belonging to
Does not hold the connection information of the PC belonging to the lower layer. Generally speaking, in a system designed based on the same concept as the second embodiment, each PC has only the connection information of its own lower layer PC and the PC of the same link in its own connection information table. It can be said that there is.

[0098]

As described above, according to the present invention,
Since the connection information table is created, access to a control device belonging to another link becomes possible by referring to the connection information table, and integrated use of the system becomes possible. Also,
This eliminates the need for the user to move around the facility and operate peripheral tools or the like for searching or the like. further,
It is possible for a certain control device to quickly and easily grasp the state and the like of another control device.

[Brief description of the drawings]

FIG. 1 is a flowchart illustrating a connection information table creation routine in a two-layer, multi-PC integrated system according to an embodiment of the present invention.

FIG. 2 is a flowchart illustrating a connection information table integration routine according to the first embodiment of the present invention.

FIG. 3 is a conceptual diagram showing a connection information table created in this embodiment.

FIG. 4 is a conceptual diagram showing a connection information table integration status in this embodiment.

FIG. 5 is a diagram showing a coil block search display screen according to this embodiment. FIG. 5A shows a signal name “52T1D”.
FIG. 5 (b) is a screen view showing a 2P ″ coil block.
FIG. 7 is a screen diagram displaying a search result related to the signal name.

FIG. 6 is a flowchart illustrating a coil block search routine in this embodiment.

FIG. 7 is a flowchart illustrating a connection information table integration routine according to a second embodiment of the present invention.

FIG. 8 is a conceptual diagram showing a connection information table held by a PC relating to LINK1 in this embodiment.

FIG. 9 is a conceptual diagram showing a connection information table held by a PC relating to LINK2 in this embodiment.

FIG. 10 is a conceptual diagram showing a connection information table held by a PC relating to LINK 3 in this embodiment.

FIG. 11 is a conceptual diagram showing a connection information table held by PC00 in this embodiment.

FIG. 12 is a conceptual diagram showing a connection information table integration status in this embodiment.

FIG. 13 is a flowchart illustrating an operation of a search-side PC in a coil block search routine in this embodiment.

FIG. 14 is a flowchart showing the operation of a PC other than the search-side PC in the coil block search routine in this embodiment.

FIG. 15 is a diagram showing a general configuration of a transfer machine.

FIG. 16 is a perspective view showing a configuration of a station.

FIG. 17 is a block diagram illustrating a configuration of a PC.

FIG. 18 is a flowchart showing a link management table creation routine in a system according to a conventional example.

FIG. 19 is a conceptual diagram showing the contents of a card.

FIG. 20 is a diagram showing a configuration of a single-layer link.

FIG. 21 is a diagram showing a configuration of a multi-layer link.

[Explanation of symbols]

18 link line 20 memory unit 22 CPU unit 300 card 320 control PC information 330 signal name 500, 510 display screen PC, PC00, PC11, PC12, ... programmable controller CPU00, CPU11, CPU12, ... CPU LINK1, LINK2, LINK3 link L1, L2, L3 link

────────────────────────────────────────────────── ─── Continuation of the front page (56) References JP-A-62-216542 (JP, A) JP-A-62-12228 (JP, A) JP-A-2-292927 (JP, A) (58) Field (Int.Cl. ⁶ , DB name) G06F 15/177 672 G05B 19/05 H04L 12/28 H04L 12/44 H04L 12/46

Claims (1)

(57) [Claims] A plurality of link lines to which control devices such as PCs are connected are provided, and each control device operates integrally according to a predetermined program, and at least one of the control devices is connected between the link line and each control device. a plurality controller integrated system for storing connection information as the link management table to create a link management table for each link line, integrated link management table according to each link line into a single connection information table, connection information table Is stored in at least one of the control devices.