A METHOD FOR ALLOCATING AN IDENTIFICATION CODE TO NODES IN A NETWORK, FOR COMMUNICATION IN A NETWORK AS WELL AS FOR CONTROLLING A NETWORK

Abstract: The invention relates to a method for allocating a unique ID to a node in a network making a request to that effect, wherein the requesting node generates an ID and sends an ID request comprising the ID over the network, wherein each node in the network that already possesses said generated ID will send an ID ban comprising the generated ID over the network in response to detection of said ID request. The invention furthermore relates to a method for communication between objects in a network, in particular sensors, actuators and/or control objects, wherein a sending object sends a message intended for one or more receiving objects by making use of data output means, wherein at least substantially every receiving object in the network possesses a set of address fields which may comprise a non-unique address value, wherein the message is addressed by the sending object by prescribing one or more address values for one or more address fields, and wherein the message will be input by data input means of the receiving object if all the stated address values in the corresponding address fields of the object comply with the prescribed address values in the message. The invention furthermore relates to a method for controlling objects in a network, in particular sensors, actuators and/or control objects, wherein a controlling object sends a message comprising data on its characteristic variables over the network via data output means without being requested to do so.

Description: A METHOD FOR ALLOCATING AN IDENTIFICATION CODE TO NODES IN A NETWORK, FOR COMMUNICATION IN A NETWORK AS WELL AS FOR CONTROLLING A NETWORK The invention relates to a method for allocating a unique ID (identification code) to a node in a network making a request to that effect. The invention can be used in particular in industrial control networks, more in particular a Controller Area Network (CAN) as has been developed by the firm of Robert Bosch GmbH of Germany. Such a control network is used for controlling production processes, for example, or for controlling the climate and/or the lighting in buildings. The nodes in the network in particular comprise one or more sensors, actuators and control objects such as PID (proportional/integral/derivative) or other types of controllers. Furthermore, the network usually comprises a central control unit, such as a PLC, which controls the process. It is common practice to give each node in the network at least one unique ID, so that said node can identify itself as part of the communication in the network. So far, the setting of the ID has often been effected manually, for example by means of dip switches. It is the installer's responsibility thereby that each ID within a network is unique, which implies that there is a real risk of errors and breakdowns, and in addition it is a laborious operation, in particular in the case of large networks. When two large networks are coupled, it requires a major effort and intense concentration on the part of installer to avoid errors. A few general objectives of the invention are to provide a distributed process control, that is, a system which is less dependent on a central control unit, so that the processes on the control unit itself can have a simple structure and the amount of data traffic within the network can be reduced, to provide a process control wherein the making of changes in the network structures is simple and/or to provide a process control wherein maintenance of the network does not require much knowledge of network technology. An ultimate general objective of the invention is to provide a process control which can function without a central control unit . More in particular it is an object of the invention to provide a simple yet reliable method of giving each node in a network its own unique ID, which preferably does not require a human operation and/or which reduces the risk of errors and breakdowns . In order to accomplish these objectives, the requesting node generates an ID and sends an ID request comprising the ID over the network, wherein each node in the network that already possesses said generated ID will send an ID ban comprising the generated ID over the network in response to detection of said ID request. Unlike the process in conventional networks, the nodes thus play an active role in obtaining an ID, to which end the nodes may be provided with the hardware and the software required to enable this process. Preferably, the requesting node will generate a new ID in response to the ID ban and send a new ID request comprising the new ID over the network. In this way a repetitive process is created, which is continued until the node has obtained an ID. When the requesting node has not detected an ID ban, the node will present an ID confirmation comprising the ID and a device identification on the network after a predetermined period of time. Said predetermined period of time preferably varies with each individual node, it is computed on the basis of the device identification (the serial number) of the object that forms the node, for example, in order to prevent a situation wherein two nodes simultaneously requesting the same ID, which may happen in the case of an ID reset, for example, both try to claim said ID for themselves. The ID that has been accepted as unique is preferably stored in permanent storage means . Preferably, the requesting node will also generate a new ID when it has not been able to send the ID confirmation after a predetermined number of attempts, and it will send a new ID request comprising a new ID over the network. The fact of the matter is that the inability to send the ID confirmation may be an indication that another node is simultaneously trying to claim the ID by means of an ID confirmation. The result is that both nodes will make a new attempt with a different ID. When the requesting node subsequently detects an ID confirmation comprising the same ID but a different device identification on the network, it will preferably no longer its ID to be unique and it will generate a new ID and send a new ID request comprising the new ID over the network. Both nodes will thus lose their ID. This is an additional safeguard to ensure that a situation wherein two nodes have obtained the same ID is corrected yet . Preferably, the format of an ID ban and that of an ID confirmation are identical for that matter, so that a receiving node is unable to distinguish between the two. Consequently, an ID confirmation has the same effect as an ID ban on a node that has made an ID request comprising the ID in question. Preferably, the ID is generated on the basis of at least part of the node's serial number. This reduces the risk of an identical ID being generated. The invention is especially advantageous if a network is to be configured anew, as is the case when two networks are coupled, whereby a node sends an ID reset command over the network, in response to which at least substantially each node in the network will generate a new ID and send a new ID request comprising the new ID over the network. A situation may occur wherein a node temporarily needs several ID ' s . In such a case it is advantageous if a node does not send an ID ban over the network in response to detection of an ID request comprising an ID it will no longer use, and no longer considers said ID as being its own, so that the ID will be available to the requesting node. The invention furthermore relates to a method for communication between objects in a network, in particular sensors, actuators and/or control objects, wherein a sending object sends a message intended for one or more receiving objects by making use of data output means . A known and obvious manner of sending such messages is to address the message by means of the ID'S of the nodes to which the objects to which the message is to be sent are connected. It is a drawback thereby that it is necessary for the sending node to know the ID'S in question. Furthermore it is difficult to find out the significance of messages upon analysis of the data traffic in the network, because the address is an abstract rather than an informative code. Such analysis is used for tracing errors in the process control and for further optimizing the process control. Furthermore it is difficult to address a group of objects having identical attributes in one go, because it must first be determined in that case which ID'S are associated with that particular group of objects. In this connection it is a special object of the invention to provide a simple, transparent and efficient manner of addressing objects in a network. In order to accomplish that objective, at least substantially every receiving object in the network possesses a set of address fields which may comprise a non-unique address value, wherein the message is addressed by the sending object by prescribing one or more address values for one or more address fields, and wherein the message will be input by data input means of the receiving object if all the stated address values in the corresponding address fields of the object comply with the prescribed address values in the message. In this manner it is possible to address the objects in the network for their object attributes, which are presented by the address values in the address fields. This manner of addressing shows great similarity with the retrieval of data from a database, for example by means of a query language such as SQL. It is thereby possible to use so- called "wild cards". In particular, this way of communication makes it possible in a simple manner to retrieve the status of an object or a group of objects. In order to be able to address each object individually on the basis of object attributes, the combination of address values of at least part of the set of address fields preferably identifies the receiving object in a unique manner. Preferably, the address values constitute functional attributes, such as "emergency provision", "light", "horizontal actuator", "temperature sensor" and/or location attributes, such as "Installation 3", "Second floor", "Room 3" of the receiving object. This makes it possible in a simple and transparent manner, for example, to turn the lights in all rooms having room number 3 of all floors of a building on or off at one go by means of a single message, or to retrieve the status of all emergency provisions, without there being a need to know the ID'S of the objects in question. The message that is sent can thus be a control command or a status information request. Furthermore, the control software need not be adapted as regards this point when new objects are being introduced into the network, because this method of addressing makes it possible to address new objects directly as regards their attributes. The invention furthermore relates to a method of controlling objects in a network, in particular sensors, actuators and/or control objects. Generally, the control objects and actuators in a network are the objects being controlled. The controlling objects are generally the sensors and also the control objects. Also servomotors are an example of both controlling and controlled objects . In a known method, the central control unit retrieves the status of the controlling objects, such as the sensors, and on the basis thereof it sends instructions to objects to be controlled, such as the actuators, for the purpose of adjusting or controlling the process. This method places a heavy load on the central control unit, in particular in the case of extensive and complicated networks, whereby the processes that take l ι t to H H in o in O in o U l H- 0 <J rr Ω H- Ω Ω <J Ω O 0 S * O Ω 0 H Ω Φ Ω 0 SD ø P. H- H rr rr P. 3 3 φ Ω rt TJ co φ SD tr 0 0 0 ø J P ) O tr rr H- ø r tr 0 Φ - 1 φ Φ 0 φ Φ ø 0 tr tr ti PJ ø J X 0 0 rr ■ i Φ 3 rr 0 $u I- 1 ø tr rr rr SD (_j. 0 H- ø rt P rt Ω φ φ SD ■ V SD PJ 0 SD TJ s H- TJ Φ rr 0 0 rt φ Φ tr T3 i Φ O rr 3 rr Ξ s; Φ φ rr ≤ Φ r Ω rt rt Ω o 0 SD p. •i i i-i iQ Φ ii Ω ■ i O SD Ω ti ti H- ti 0 O 0 0 r ø tr Ω Ω tr O rt ti tr Φ to i tr SD H- < O Φ O rr C r Ω rr SD 0 SD ii ii ti rr rr H- Φ φ JU ξ h- 1 O φ ω ?r rr ra JU ω o h- 0 rr rr Φ PJ ? ■ 7T t H- CD ø 0 Ω H- SD ^ h- 1 H- H- φ PJ Φ (- ■ Hi ■ CD tr 3 Φ ω ti rr rr - SD 0 rr rr X rt ■ ; CD 0 tr H- CQ co ω H- to H- Φ H- Φ ii Φ Ω Φ Ω ^ O 0 Ω ii ti ≤ φ ^ t- J •3 Ω 0 H- $u 0 ø φ ø J H- ø rr o O H- rt μ. 0 SD J 0 P. CD tr P. CD CD Φ rr 0 0 C IQ tQ rr iQ J Ω r 0 CQ Pi O 0 rr 0 rr 3 0 N rt 0 f- 1 h- 1 Hi H- SU SD ft J O Hi 0 PJ trj ø CQ rr Φ CO rr CD rr tr rr ø J SD φ O 0 Hi μ. rr tr Φ H- Hi Ω rr ϋ O H- (- ' 0 ω ti H- J ι-i Φ ti O f* •i Pi φ Ω Ω rr Hi P. ^ 3 Pi O rr 0 Φ SD Φ tr Hi φ tr PJ Hi € Ω SU Ω O 0 ø φ φ Φ Ω O 0 tr H- O 1- t ø i Hi H- PJ ii Φ H- Ω Pi I— ' rr Pi 3 0 rr 0 ø H- Ω 0 tr rt 3 Ω Φ φ ø H- Φ φ Ω CO φ Φ H3 ii rr < 3 0 φ H- ø ID SD H- rr rr co 0 tr l_I. tr SD φ α> H- P t Ω PJ rt Ω tr Φ tr SD Φ 3 0 IQ ø P- rr Ω 0 tr 0 ti ii l—l. φ Φ ø 0 0 0 0 TJ J rr 0 rr *a Φ ø O ti CD » o 0 ti 0 i φ 0 0 O O 3 rr φ Ω $u rt Ω t ti ιq 0 tr rr O ti Ω 0 H- CO l- H- Φ H- 5" Φ φ Φ I- 1 φ Ω ft Ω Q ii O l_l. r 01 M 0 ^ Φ Ω Φ rr SD SD H- rr φ rr CD !D rr ti H- rr rt rr CO o Φ SD P φ 3 TJ Φ *< Φ H- Hi tr tr CQ 01 rr CD tr J rr ø 0 tr 0 CO ø ti h- ΓΓ Ω o > 3 ø φ J Hi tr (- ■ φ tr rr tr H- H- φ o ø 0 o SD rt ti rr »i Φ Φ P- O l- 1 i ti ii Φ φ 0 Φ Ω φ Hi CO H- μ. H- Pi 3 SD ii ti Ω 0 Φ Ω, J DJ co H Hi PJ $u O H- ω Ω rr H- ti M H- ω rr rr ID ii Φ 0 0 h- J rr φ P 0 0 01 tr Ω 3 ø O ø J ≤ ø Ω o Ω 3 • H- H- Φ h- 1 tr 0 0 Ω rr to rr H- Φ t- 1 rr LQ 0 3 P ) tr iQ tr rr SD 0 •ϋ ID ≤ CD ø TJ Φ rt H- 0 Φ 0 tr SD rt 0 •< Φ rr < t5 rr H- ID 0 ϋ 0 M H- rr rr ti ø ii 0 tr 0 •i 3 tr Φ 0 to Q, ti tr ti φ ii Ω ti ø rt Φ CD I- 1 ft J 0 Φ ø Φ 0 iQ Φ rr 3 tr J H- φ Φ ti H- 0 tr Φ CQ 3 o ii - TJ tr H- CD H- ø ,_, •i H- H- φ 3 0 ) Ω O Ω. ω Λ ω tr Λ Φ ) ø 0 φ Φ 0 ii φ ft rr 0 Ω 0 0 Ω Ω Φ h * - 1 tr Hi ι_ι. rr Ω ø rt H- c . ^ ø CD ? b- Ω Ω ■ i Φ ø - H- ø tr 0 φ tr rr to rr SD Hi C H- φ Φ tr ø Φ ti H- Φ rr O μ. Φ Hi PJ PJ rt ii ι_J. ø 3 i ω φ i ■ cn Ω ø CD Φ C Ω O ti H- tr H- 0 J 0! SD 0 Ω ≤ Φ H- Φ rr H- tr rr $u ■ i SD rr rr rr rt rr Ω φ 0 ID φ 0 < 0 Ω rt μ. 0 ' rt Ω ■i ø Ω $U 0 iQ ø Ω tr JU < ti Φ ø α H- φ α p. i Φ rt 0 0 Φ TJ rr 0 iQ tr <i φ $u rr Φ tr PJ SD Φ SD CD rr l_l. Ω 0 0 rr < r ti ii Ω SD Φ tr rr Φ I— ' ii rt rr φ Ol tr 0 φ rr H- tr rr φ 0 rt Φ 0 SD r 0 ■ i φ PJ H- H 3 φ H- rr ≤ SD - SD φ CD ø tr Φ l_J. H- tr ti tr tr Ω 0 O φ tr ID t rr <! H- Φ . J Ω O 0 i 0 rr rr φ 0 φ ø SD <! Φ Φ > < Φ P. U- Ω Φ Ω Φ 01 ω tr O ti 0 J φ P CD 3 ii rr Ω rt H- PJ CD σ SD • φ rt Φ o i rt 01 •τl I- 1 ø a ? 0 ti 0 Φ PJ 0 rr rt Φ Ω ø H- CD φ TJ Ω Φ ø 0 φ Φ H- SD ti Φ rr O Ω φ 0 Hi ø tr SD tr SD ≤ tr Φ rt TJ rr H rr IQ 3 Ω i Φ O i H- 0 ø ϋ rr rr l—l- ø 0 Φ rt H- u 3 CQ H- 01 t ø tr φ Hi O ra H- CT 0 Pi s; ω Ω Φ Pi Hi tr o ≤- 3 ω φ O CQ φ O o < Φ Z l- 1 O SU O rr CO rr PJ 0 Ω tr ii > rt 0 ø ii $U Or H- rr rr h-> SD SD ti tr - ϋ O ti H- 0 rr rr ti φ 0 tr ti CO rt ^ Ω tr 0 H- ■ i H- ■i tr £D H- ø Pi 0 0 Φ ø rr D tr Φ ID 0 φ X rt tr tT H- Ω rt Φ 3 H- Φ tr Ω 0 rr SD H 0 ii ■i Φ P ) W rt i φ 0 Q rr 0 a Φ PJ ø H tr H- tr rr H Φ 0 rr 0 μ. ?f Pi ø J J tr ii tr SD r ø tr rr SD SD H- r ^ Pi Hi tr ■r- 1 0 , 0 Φ 0 φ Φ CD P S * φ H- rr t- j rr rr rr 0 tr ø Φ 0 s: ii • Pi tr Ω SD P - Φ tr tr O iQ Φ Ω rr ø rr s: ø tr ; 0 * • TJ co Φ rr Φ i H- Φ ø tr H- H- ø ii ø rr ø' 01 Φ H- φ o Ω 0 0 Φ p- rr tr Φ - O rr o Hi tr ≤ rr Φ ii Hi ø object to be controlled directly without the two objects being aware of each other's existence and without the intermediary of a central control unit. One object is arranged for sending particular data, the other object is arranged for specifically receiving and processing said data. The objects are thus provided with intelligent logics which reduce the load on the control unit, as a result of which a modular process control is constructed, which is easy to extend. Preferably, the data input means are set to listen specifically to particular messages by means of a message, so that no manual adjustments of the objects are required in this connection. Said setting messages may originate from the control unit, for example, or from a (portable) computer which may be connected to the network temporarily. The invention will now be explained in more detail by means of an exemplary embodiment . An industrial control network, such as a CAN, usually comprises a physical network comprising a number of nodes with one central control unit, for example, a number of sensors , a number of actuators and a number of PID controllers, which jointly control a production process or the climate in a building, for example. The sensors can for example measure the temperature, the pressure, the light intensity, the position, the chemical composition and the like of a process. The actuators, which are capable of influencing process parameters, may for example comprise heating elements, valves, cocks, servomotors and the like. The PID controllers thereby determine the degree to which and the manner in which the actuators respond to the signals from the sensors. In a conventional control system, all signals are passed through the central control unit, which thus controls the entire data traffic in the network. In the case of complex control networks, a high degree of expertise on the part of the operator is required for controlling such a process, tracing and remedying trouble and making changes in the network configuration . The CAN network that is described herein has a decentralized control, wherein the tasks of the central control unit have been minimized. The invention even makes it possible for a network to function without making use of a central control unit. One feature of the objects in the present network is that each object has its own intelligence, that is, hardware and software, to carry out particular tasks independently, so that the load on the control unit is reduced, less data traffic on the network is required, the control process becomes more transparent and a possibility is created to exchange objects in the network for objects of a different type without adjustments in the central control being required. The intelligence of the objects is contained in standard interface modules, to which the (conventional) objects are linked. The format of the information that is exchanged between the various objects is standardized thereby, so that it is not necessary to take the peculiarities of the various types of objects into account. One aspect of said decentralized control is that the sensors are so arranged that each time they detect a relevant change, they send a message comprising the new value they have measured on the network on their own accord, or send such a message at regular intervals. The actuators in the network are arranged to filter from said messages those messages that contain information that is relevant to their functioning. This process does not require any interference from a central processing unit, therefore. What is required, however, is that a setting be made, only once or each time a change occurs, if necessary, which messages an object is to send at which point in time, and which objects must listen to those messages. Said setting can take place on the interface modules of the objects themselves, but it can also be done by sending messages to said objects. In particular it can take place by setting the various connections graphically by means of connecting lines between the outputs and the inputs of objects in a graphic representation on a display screen of the system to be controlled, which is done on a computer that is connected to the network, after which the control unit sends the required messages with instructions to the various objects on the basis of said graphic representation . Furthermore, the control method described herein provides a possibility of sending messages to objects without stating an explicit address in the form of a node ID. Also this reduces the load on the central control unit as well as the amount of data traffic on the network, because it is also possible to send a message to a particular group of objects in one go. To that end, the storage means of each object include a record comprising a number of fields, which contain object attributes. Object attributes comprise both functional attributes and location attributes, as well as status information of the object. Such a record may look as follows, for example: This record shows that the object is a lighting object, which belongs to the group of "Emergency provisions" and which is located in the area "Second floor" at location "Room 2". The object has a variable called "Status", which currently has value "On". An object may have more than one variable for that matter. In actual practice, the values of the fields will for example be represented by a character which takes up 1 byte, for example, in order to minimize the data traffic in the network. In this example, however, complete and meaningful indications are used for the sake of clarity. When another object in the network wants to know the status of, for example, all emergency provisions on the second floor, it will send a message containing the following query on the network: In response thereto, each object that meets these criteria will send a message containing its current record to the querying object, so that the following result could be obtained: When the emergency lighting in room 3 on the second floor must be turned off, for example, this can be done by sending a message with the following contents over the network: In this example, the first three fields "Area", "Location", and "Type of object" jointly form a unique key, and thus a unique address for the object in question. In principle the need to allocate unique ID'S to the objects is obviated when this method is used. The number of fields can be extended as required for that matter, so as to increase the selection possibilities or extend the number of objects in the network. Generally, the message will be accepted by several objects when one or more of the fields of a message contain the wild card "All". In this manner it is for example possible within a control network to regulate the temperature in various ovens, the velocity of various conveyor belts or the rotational speed of several drive shafts by means of one message, whereby the object that sends the message does not need to know how many and which ovens, conveyor belts or drive shafts form part of the network. Furthermore this makes it possible to add or remove objects during operation, that is, without interrupting the process, without this having consequences for the control . Furthermore it is simple to change or extend the CAN network that is described herein, or to couple two such networks (think for example of trains, truck/trailer combinations), because node ID'S are set automatically so that this does not need to be done manually. This takes place in the following manner. When a node, which may be an object, must be given a new ID, for example because it is newly introduced into the network, or because two networks have been coupled and conflicting ID'S occur, the interface module of the node will generate an ID, which is derived from, for example, the last digits of its serial number, so as to prevent as much as possible different nodes generating the same ID. The node will then send an ID request comprising said ID on the network, which ID request is addressed to all nodes in the network. In CAN terms, such a message is an "RTR message", that is, a short message which, in the main, only consists of said ID and an RTR bit. In this case the RTR bit indicates that this is an ID request . The advantage of RTR messages is that several nodes are capable of sending send such messages simultaneously, and are allowed to do so. In response to said ID request, a node which already has the aforesaid ID will send a message with an ID ban for the ID in question to the requesting node, whereupon the requesting node will generate a new ID and make a new attempt . When no ID ban has been received after a predetermined period of time, the node will send an ID confirmation message containing a device identification (for example its serial number) on the network, it will adopt the ID as its own unique ID and store said ID in its permanent storage. The ID may be stored in a volatile storage, but in that case the method described herein must be repeated every time the system is started. An ID ban and an ID confirmation message have the same format for that matter (at least comprising the ID and the device identification) , and they are indistinguishable from each other. Preferably, the waiting period until the ID confirmation message is sent varies with each node, because otherwise there would be a risk of two nodes trying to send the same ID confirmation message simultaneously. This can be realised, for example, by making said waiting period dependent on at least part of the device identification (the serial number) of the object in question, or to use a random waiting period. Since different waiting periods are used, one of the two nodes will obtain the ID by being the first to send an ID ban (in the form of an ID confirmation message) , as a result of which the other node will be forced to make a new attempt . When two nodes, in spite of the above-described procedure, simultaneously try to send an ID confirmation message containing the same ID (but with a different device identification, of course) , the CAN network protocol will not allow this (CAN only allows short RTR messages to be sent simultaneously) . The two nodes will then continue to present the message, albeit without any result. According to the invention, this process is stopped after a number of failed attempts, for example after five attempts, after which the two nodes will assume that the ID is not available, whereupon they will send a new ID request containing a new ID. As an additional safeguard, a first node, upon detecting an ID confirmation message containing its own ID but a different device identification, will assume that its ID is no longer valid and send a new ID request . The second node, from which the ID confirmation message originated, will do the same in response to the ID confirmation message from the first node, so that neither one of the two nodes will retain the ID in question. Other nodes, for example the central control unit, can keep a list of the nodes that are present in the network and their ID'S on the basis of the confirmation messages . Although the present invention has been described herein by means of an exemplary embodiment, several variations thereto are possible, and consequently the present description must not be construed to be limitative in any way as regards the scope of the rights being applied for.

Claims: CLAIMS 1. A method for allocating a unique ID to a node in a network making a request to that effect, wherein the requesting node generates an ID and sends an ID request comprising the ID over the network, wherein each node in the network that already possesses said generated ID will send an ID ban comprising the generated ID over the network in response to detection of said ID request. 2. A method according to claim 1 , wherein the requesting node will generate a new ID in response to the ID ban and send a new ID request comprising the new ID over the network. 3. A method according to claim 1 or 2, wherein the node will present an ID confirmation comprising the ID and a device identification on the network after a predetermined period of time when the requesting node has not detected an ID ban. 4. A method according to claim 3, wherein said predetermined period of time is varies with substantially each individual node. 5. A method according to claim 3 or 4 , wherein the node will accept the ID as unique after the ID confirmation has been sent and wherein said ID is stored in permanent storage means. 6 . A method according to claim 3, 4 or 5, wherein the requesting node will generate a new ID when it has not been able to send the ID confirmation after a predetermined number of attempts, and it will send a new ID request comprising a new ID over the network . <_ U) • NJ M H H in o in o ι_n o H H ID -J H O o tr 3 TJ 3 Ω ø I- 1 tr 3 Ω 0 > ii rr Ω > Ω CQ ω O Ω PJ Ω ti SD 0 H p. Ω > tr Φ 0 ti Φ O φ φ *<: φ O Φ Φ tr O Φ ø <J rr Φ 0 φ α Φ ti Φ O 3 rr J ω ø ft 3 & Φ PJ 3 3 0 μ. tr Φ J 3 J 3 •Λ P ft rt J 3 φ Φ CO CO TJ ■ S CD 3 to rt 3 φ ø μ. Φ TJ Φ CD ii F- φ H- Φ ø ≤ tr φ H- Φ Ω ø Ω PJ ti 0 ft PJ SD ti 0 ft Φ ø 3 rt ti ■i rr 3 rt Φ 3 rt Φ H- 0 0 Ω 3 r rt TJ (D ii iQ H- t PT iQ O ti tr O Φ 01 tr H- PJ SD rt O tr SD CO tr 01 rt i rt r 01 tr 0 α H- φ o CD H- Φ ?? o rt rt - o 01 rt ø tr o CD -. 0 rt ? H- o F- rt Pi tr φ 0 0 •*. i s: Pi H- Φ rt φ i rr i ^ *- ID O ω Hi ti H- H- T tr iQ H- o Ω o 3 0 F- ^ ≤ Ω H- 0 tr Φ 0 ω ID o CD ø tr H- Hi O ii tr SD IQ SD J 0 t PJ TJ tr SD O ≤ a SD SD ^ CO iQ ω rt ø rr 0 o 3 W φ Ω φ Φ Ω SD φ Ω 3 H- H- O Ω CD J 0 σ SD CO φ φ ii TJ ti Ω rt 0 I- 1 ft ■ i Ω ii ti Ω T l- 1 Hi Hi m Ω P. 0 Pi 0 φ 0 φ ø Ω TJ ti H- Φ O tr Φ • : z Φ 0 rt Φ O ti IQ Hi - 0 ID Hi 0 P. 0 CO rr SOi rr SD Ω H- 0 H- ti φ o F- ti F- F- Φ Φ SD ii rr rt H- Φ ti D H- o Φ CO i o 01 0 α Φ ii 0 Pi O ø p. 01 0 0 i 0 « P. tr SD Φ Φ 0 φ PJ Hi Pi - rt 3 F- ti M- ø H J T H- Hi F- H- Φ O φ tr H- φ 0 D 0 CO μ. 3 0 Φ ID 0 Φ α Ω - PJ 0 rt 0 0 ti 0 H Φ 0 H- Pi ii CO H- Pi Hi ≤ Ω ø iQ CD CQ 3 tr iQ rt tr CQ iQ SD h*- 1 rr α i CQ CO 0 O Φ μQ SD KJ PJ o tr 0 ø TJ 0 PJ F- 0 tr φ rt 0 φ rt TJ - 3 P. 0 rt ii Φ H- J 0 O rt H ø ø 0 0 rt φ r rt Φ 0 P. Ω H- rt ID 0 0 Φ CD φ SD ii SD Ω 0 0 Pi O α so* 0 Pi O H O tr CQ Φ 0 ø O rr rt ID ti tr Φ o Φ ti ID 01 φ Pi ti Φ ø α Φ J Φ < ø φ 0 Φ ^ PJ rr φ 0 0 H- rt H φ J o 01 Φ φ J 0 PJ ii H- Hi rt SD a 3 i Pi ti ø φ ø 01 μ. t) Pi ø <! φ 01 CD 0 P* H- ø ø 0 Ω H- tr 0 Φ SD rt P. 0 ; rt φ 0 rt O ^ Φ 0 H- TJ Φ ^ φ CD ■ : Φ Φ SD Φ ■ i φ *< SD ID S P. tr ti Hi TJ 0 SD 0 0 H- O Φ Pi ø O 0 - S £ CD 3 P. 0 tr Pi Φ φ ti ø ti 01 rt O O 0 Pi o 01 CQ o O μ. J ii 0 P. CD Φ ti CD SD Φ rr CD 0 tr Pi 0 rt SD rt CD CD 0 φ ø H H 0 P. rt φ 0 ti ti φ CO ■ O Pi Ω 3 φ ϋ Φ ≤ Φ 0 Φ t tr Φ φ CD 0 α α 3 Φ H- Λ φ Φ 0 Φ CO Φ Pi φ 3 O 0 CD rt μ- rt O φ 0 φ PJ φ φ Φ 0 O 0 CD Hi H- D ø <! ii H- φ ti i - s; h- 1 Φ rt o Φ rt 0 o ii ti 0 o SD rt 0 Φ O D 0 P. SD φ <! Si ) Φ H- Φ -> Ω Hi ø 3 ø O Hi F- ID Hi <! 0 H- H- CO Hi ft <! H- - 1 CD μ. ø 0 PJ Φ rt ω φ φ H PJ rt Φ Pi r Hi Ω ft < tr rt P 0 0 CD 0 CD ii IQ Ω ø ø F- Φ rt rt H rt S α rt Φ rt ti D t- - O H- rt SD Φ tr H CQ φ iQ - φ ft 0 O ø tr ^ a s: tr tr Pi tr 01 Ω 3 0 tr φ ø ^ Hi Ω O 0 o ø Pi Φ o o F- ii Φ 0 Φ rt Φ H P TJ CQ φ 0 ii Φ o H- o S Φ tr SD tr h*- 1 ii ti ii Ω Φ 0 O tr 0 α rt ii φ Φ 3 CD tr s: Φ tr tr H- ft o O SD T ?? Φ W tr CO TJ 3 0 TJ φ Pi H- μ. 0 TJ CD o φ <_ι. tr \-> Φ < φ o φ 0 Hi ø ϋ • Λ φ ti tr ti rr O CO 0 i Φ CD Hi Φ φ P. φ ti H- Ω ii Ω IQ Φ 0 s: SD ft φ φ rt φ ø SD O 0 H- i Φ μ. H- CD O Ω ii O Ω φ 0 rt 01 rt Φ J H Ω φ F- rt Ω ti rr Ω φ ø Φ Ω 0 <! PJ ii rt Φ rr H- CQ 01 ti 0 σ Φ ω Ω φ • Φ φ rt 0 tr O CQ φ H- iQ H- Ξ ø O SD SO* rt h- 1 0 Pi P s: φ φ 0 Pi rt 0 φ 0 tr 0 tr μ. O Φ 0 μ. ø H tr H- Φ 3 F- tr F- 0 s rt 0 H- tr CQ 0 ; H- ø PJ tr ø P. 0 CO α PJ 0 J 3 0 JD 0 ii ø rt tr TJ 0 φ S Φ rr Ω rt Pi Φ ø iQ CD J CQ CD IQ IV 0 tr Φ o CQ H- tr tr t φ 01 0 SD • ft ø F- α H- Φ 0 - 1 o Φ tr Ω ii o P, 01 ■Λ 01 I- 1 ti 3 φ rr SD < ø ID sn ω Φ 0 Φ 3 ϋ Hi φ corresponding address fields of the object comply with the prescribed address values in the message. 12. A method according to claim 11, wherein the combination of address values of at least part of the set of address fields identifies the receiving object in a unique manner. 13. A method according to claim 11 or 12, wherein the address values constitute functional attributes and/or location attributes of the receiving object. 14. A method according to any one of the preceding claims 11 - 13, wherein the message that is sent is a control command or a status information request . 15. A method for controlling objects in a network, in particular sensors, actuators and/or control objects, wherein a controlling object sends a message comprising data on its characteristic variables over the network via data output means without being requested to do so. 16. A method according to claim 15, wherein it is possible to set the characteristic variables that the object sends off. 17. A method according to claim 15 or 16, wherein the controlling object will send off the message when the value of at least one of its characteristic variables changes significantly. 18. A method according to claim 17, wherein the controlling object sends off the message at regular intervals. 19. A method according to any one of the preceding claims 15 - 18, wherein an object to be controlled comprises data input means which have been set to input the data concerning predetermined characteristic variables of one or more controlling objects in the network into the object to be controlled. 20. A method according to claim 19, wherein the setting of said data input means takes place by means of a message. 21. A method according to any one of the preceding claims 1 - 20, wherein said network is an industrial control network. 22. A method according to any one of the preceding claims 1 - 21, wherein said network is a Controller Area Network (CAN) .

Inventors: REINDERS ROELOF, REINDERS, ROELOF
Applicants: REINDERS ROELOF, REINDERS, ROELOF
Application year: 2001
Main classification: G05B19
IPC codes: G05B19