WO2013135764A1 - Procédé d'exploitation d'un réseau - Google Patents

Procédé d'exploitation d'un réseau Download PDF

Info

Publication number
WO2013135764A1
WO2013135764A1 PCT/EP2013/055126 EP2013055126W WO2013135764A1 WO 2013135764 A1 WO2013135764 A1 WO 2013135764A1 EP 2013055126 W EP2013055126 W EP 2013055126W WO 2013135764 A1 WO2013135764 A1 WO 2013135764A1
Authority
WO
WIPO (PCT)
Prior art keywords
bit
devices
check
bit position
participate
Prior art date
Application number
PCT/EP2013/055126
Other languages
German (de)
English (en)
Inventor
Thomas Rickes
Original Assignee
Robert Bosch Gmbh
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 Robert Bosch Gmbh filed Critical Robert Bosch Gmbh
Publication of WO2013135764A1 publication Critical patent/WO2013135764A1/fr

Links

Classifications

    • G—PHYSICS
    • G08—SIGNALLING
    • G08B—SIGNALLING OR CALLING SYSTEMS; ORDER TELEGRAPHS; ALARM SYSTEMS
    • G08B25/00—Alarm systems in which the location of the alarm condition is signalled to a central station, e.g. fire or police telegraphic systems
    • G08B25/003—Address allocation methods and details
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L61/00—Network arrangements, protocols or services for addressing or naming
    • H04L61/50—Address allocation
    • H04L61/5038—Address allocation for local use, e.g. in LAN or USB networks, or in a controller area network [CAN]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L2101/00—Indexing scheme associated with group H04L61/00
    • H04L2101/60—Types of network addresses
    • H04L2101/695—Types of network addresses using masks or ranges of addresses
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L61/00—Network arrangements, protocols or services for addressing or naming
    • H04L61/09—Mapping addresses
    • H04L61/10—Mapping addresses of different types
    • H04L61/103—Mapping addresses of different types across network layers, e.g. resolution of network layer into physical layer addresses or address resolution protocol [ARP]

Definitions

  • the invention relates to a method and a control element for operating a network
  • Control element which is connected via a network designed as a bus network with at least one fire alarm device, wherein a bus protocol is used for communication.
  • the network is often looped back to the point of origin, starting from the fire panel, for redundancy in the event of a short circuit. Therefore, a network section as
  • each fire detector as a device has its own address, usually between 1 and 255, allowing the control element to communicate with each device point-to-point.
  • each device will receive its address at a setup by programming it with a so-called programming tool, each device storing an address in a nonvolatile memory.
  • the programming involved in the installation is performed on each device before it is used for the first time within the network. If more than 100 devices are used in a loop, programming the devices prior to installation is expensive. Therefore, the programming can be performed automatically considering the serial numbers of the devices. Serial numbers often include production characteristics such as date of manufacture and place of manufacture and can therefore be quite long. Should serial numbers record a dataset, the z. B. encoded in 64 bits, results in a number of 2 64 individual serial numbers. Due to this large number, the problem arises of finding a single device with a particular serial number within a reasonable time frame.
  • the document DE 102 40 832 A1 describes a bus which has one master and several slaves.
  • an addressing of the connected slaves is carried out on the basis of the serial number, with a partial feature being interrogated by the master to the individual slaves. Only if a single slave responds to the master's question does this slave receive an address. If several slaves or no slave answers, the question is refined.
  • a time-efficient search algorithm for searching for a separate, individual serial number for a device is performed. Furthermore, after an identification round for a device, an address is automatically assigned to it by a typically central control element and thus assigned.
  • each new device that is connected to a network, searched by the control element, being found by the control element in each identification round usually a device.
  • Commands for example bus commands sent by the central control element, can be understood by all devices on the network formed as a bus, for example. There are commands that are directed to individual devices and those that are directed to groups of devices.
  • the method uses a
  • bit positions of serial numbers are initially determined, which have bits that match all devices of a loop as a group of devices within the network and can be defined as constant.
  • At least one query is carried out by first erasing or clearing a search mask for serial numbers for each device to be searched for.
  • the search mask comprises in design for each bit position to be checked, on the one hand, the information as to whether a k-th bit position should be taken into account in the search, and, on the other hand, the information with which of the two possible bit values the k-th bit position should be filtered.
  • Each device locally maintains such a search mask that can be modified by commands from the central control element. This will send a command to clear all bits of the search mask.
  • the search mask for the serial numbers is completely reset for every device that does not yet have a valid bus address.
  • the search mask is used to check, for each k-th bit position of the serial number to be considered, whether there are devices which have a bit value to be filtered, for example 0 or 1, in their serial number at the specified k-th bit position.
  • the control element sends the command for setting and querying a bit position of the search mask at a k-th check for a k-th bit position of the serial number, once for the first and once for the second bit value. Any device where the kth bit position of the serial number matches the set value of the requested bit value search form sends a response to that command. Devices in which the bit value of the k-th bit position deviates from the requested bit value does not respond. The content of the answer is irrelevant to the control element. It only has to determine if there is no response or at least one response from at least one device and thus possibly multiple simultaneous responses.
  • this bit position is not constant in the quantity of the serial numbers of the devices, usually the devices of the group. If there is at least one answer in one case and not in another case, it can be stated that this bit position is the same and therefore constant for all devices, usually for all devices of the group. If there is no response in both cases, uninitialized devices will no longer be on the bus. Constant bit positions are memorized by the control element and can always be skipped in the further procedure for speeding up the method, since within the set of serial numbers, content-identical bit positions do not provide a distinguishing criterion. The control even knows after these queries the bit value at the constant bit positions.
  • the command for resetting or deleting the search masks is sent.
  • the property of a single bit position is successively checked. That is, each device only checks the match of a single bit position of its serial number with the requested bit value. A bit position other than the bit position being queried is of no significance.
  • the command for setting and querying a k-th selected bit position is sent in a k-th check and thus query, which in design with the highest, non-constant bit position of the search masks of the devices and the first bit value started who - that can. If no responses are obtained, it is assumed that there are no unassigned devices in a loop of the network whose k-th bit position of the serial number has the first bit value. Thereafter, the command for setting and retrieving the k-th bit position for the second bit value is sent. If no response is received either, there are no unassigned devices in the loop whose kth bit position tion is occupied, so that the search process is already completed at the k-th bit position.
  • the search continues at the next k + 1 th bit position and so on until the control receives a response from receives a device for the last mth bit position.
  • a device receives the command to set and poll for a bit position, that device locks the searched bit position for the bit value searched for. This means that for other search commands others
  • Bit positions are taken into account with the bit values after which the device was previously requested. This applies as long as the search mask is not completely, usually only partially, reset.
  • the kth bit position is handled as soon as the first response from at least one
  • the second bit value is not requested, but immediately advanced to the next k-1 th bit position. Only if there is no response to the query for the first bit value, the second bit value for the k-th bit position is also queried. In case that both
  • That device which gives an answer to the command for setting and querying the kth bit position switches or sets an internal flag and thus a marking. Only such a device is ready to receive the subsequent command for setting a temporary bus address. Due to the procedure described above, only one device is identified in an identification round since each device has a serial number with its own bit pattern.
  • the control element assigns a temporary bus address to a single device if a single device is found during an identification round. By assigning an address, the device no longer belongs to the addressless devices that participate in responses to search commands and ignores the search commands. Thereafter, a re-identification round can be performed, whereby another device is taken from the set of addressless devices. This will continue until all devices have received addresses.
  • a new device which can be designed as a sensor, for example for the detection of smoke and / or fire, can be connected to the network while a system is in operation, whereby an address can be assigned to this new device only a few seconds later , Thus, devices can be replaced without much effort. If desired, automatically assigned addresses, for example via a network interface, can be changed later.
  • each device is assigned a serial number with n bit positions. The devices are searched and identified one after the other in identification rounds on the basis of their serial numbers, whereby in each of the identification rounds one device is usually identified. In an identification round, bit values for m of the n bit positions of the serial numbers of the devices are checked for a maximum of m checks.
  • the at least one device participating in the k-th checking is asked whether its k-th bit position has a first of two possible bit values. If, for at least one of the devices, the k-th bit position has the first bit value, this becomes at least one device for
  • the at least one device participating in the kth verification is asked if its kth bit position has a second bit value If, for at least one of the devices, the kth bit position has the second bit value, this at least one device is authorized to participate in a subsequent k + 1th check, and the next k + 1th check is performed.
  • the device is identified by its serial number during a mth check. At least one device participating in the kth verification is entitled to participate in a subsequent k + 1th validation if its kth bit position has one of two possible bit values.
  • the coding of the commands shown here is arbitrary or arbitrary and proves that the commands can be encoded in the specified number of bytes.
  • the instructions each comprise three bytes, the first byte being a command identifier, the second byte being a parameter, and the third byte being a checksum relating to the first two bytes. Not all bits of the parameter are always used for these methods, resulting in further functional possibilities. If the transmission of a command due to a communication failure in a device disturbed, for example, received changed, so this can be discarded.
  • a reset of the search mask for all devices is performed with the query ⁇ 0x01> ⁇ 0xC0> ⁇ CS> of the control element. Then the query ⁇ 0x02> ⁇ 0xBF> ⁇ CS> searches for devices whose k-th bit position of the serial number is 0. Bits 0 to 5 of the parameter comprise the position, bit 6 comprises information on whether a bit value of the search mask to be checked should be set to 0 or 1 (here 0), bit 7 is constant 1.
  • bit positions will be decoded until the last, mth bit position is reached. If a response is received, the next k + 1th bit position is checked.
  • the control element For temporary or temporary assignment of a new bus address for a device discovered during an identification round, the control element provides the query ⁇ 0x03> ⁇ 0xFF> ⁇ new bus address> ⁇ CS>, whereupon the device with ⁇ 0xFF> ⁇ new bus address> ⁇ CS> answers what the control element confirms with ⁇ 0x04> ⁇ CS>. The control element has thus recognized that the device has received the correct address and confirms that this address may now be accepted. From then on, the device has a valid address and will not participate in any further described device identification steps because devices with a valid address ignore the search commands described above.
  • control element After performing identification of the devices and assigning the new addresses, the control element may issue further commands using the new ones
  • Procedure irrelevant It is thus possible to determine the sequence of bit positions in any permutation. In an embodiment, however, it is possible to start with a highest, for example, 63rd bit position, and finally to conclude by decrementing k values, a last, zeroth bit position is checked.
  • the method may be performed for a plant comprising a network with the typically centralized control element and spatially distributed devices connected together.
  • the system can be provided as a security system, such as. A fire alarm system for a building.
  • the control element is designed as a control or control center.
  • the devices can be configured as sensors, for example video cameras or, in the case of a fire alarm system, as fire detectors.
  • the method for searching for devices and assigning addresses to devices for various network-type devices may be performed with a control element performing a function of a master and a number of devices performing functions of slaves.
  • Whether a device or multiple devices respond during a scan is irrelevant to the process.
  • the control only recognizes that at least one device is responding. However, it is possible to measure a response current, the z. B. 20 mA per device is. By monitoring the voltage, the devices can prevent too many devices from responding at once; H. if 200 devices wanted to pull 20 mA, the voltage could break down, causing some devices to cancel their response immediately. This avoids a complete breakdown of the network. In combination, there remains a measurable summation current at which the control element detects the presence of at least one response or no response.
  • control element according to the invention is designed to carry out all steps of the presented method.
  • individual steps of this method can also be carried out by individual components of the control element.
  • functions of the control element or functions of individual components of the control element can be implemented as steps of the method.
  • steps of the method are realized as functions of at least one component of the control element or the entire control element.
  • Figure 1 shows a schematic representation of an embodiment of the control element according to the invention for an example of a network in carrying out an embodiment of the method according to the invention.
  • Figure 2 shows a first Flussidagramm to the embodiment of the inventive method.
  • FIG. 3 shows a second flow chart relating to the embodiment of the method according to the invention.
  • Figure 4 shows a third Flussidagramm to the embodiment of the inventive method.
  • FIG. 1 shows, in a schematic representation, a network 2 which comprises an embodiment of a control element 4 according to the invention. Furthermore, the network 2 comprises a plurality of devices 6, 8, 10, wherein only three of the devices 6, 8, 10 are shown in FIG.
  • the control element 4 is here connected via a trained as a bus line connection 12 with the devices 6, 8, 10.
  • the devices 6, 8, 10 are connected to one another via connections 12.
  • the network 2 shown by way of example in FIG. 1 may be loop-shaped, the devices 6, 8, 10 being connected in series.
  • the network 2 shown in FIG. 1 may also be formed as a loop of a larger, superordinate network, the devices 6, 8, 10 in the loop being referred to as a group of devices 6, 8, 10.
  • the embodiment of the method according to the invention that can be carried out by the control element 4, which is described with reference to FIG. 1 and the following FIGS. 2, 3 and 4 can also be used for other configurations of networks 2, for example for star-shaped networks, within which devices 6, 8 , 10 with each other and / or with the control element 4 differently, as shown in Figure 1 explicitly shown, are connected, performed.
  • the usually central control element 4 is designed to control and thus to control and / or regulate functions of the devices 6, 8, 10 within the network 2. Accordingly, the control element 4 within the network 2, the function of the so-called master assigned, whereas the devices 6, 8, 10 are assigned within the network 2 functions of so-called slaves.
  • each of the devices 6, 8, 10 has a memory 14 in which, in addition to other data, a respective serial number 16, 18, 20 of the device 6, 8, 10 is stored.
  • each serial number 16, 18, 20 of each device 6, 8, 10 has n bit positions 22, 24, 26, 28, wherein in FIG. 1 of each serial number 16, 18, 20 only four bit positions 22, 24, 26, 28 are shown.
  • FIG. 1 shows in detail a highest, ⁇ -1 th bit position 22, a second highest, ⁇ -2 th bit position 24, a third highest ⁇ -3 th bit position 26 and a lowest, 0 th bit position 28.
  • this at least one device 6, 8, 10 will have a subscription authorization 48 for a subsequent, in this case second check, of a second bit position 22, 24, 26, 28 assigned. If none of the participating devices has the first bit value at its first checked bit position (no 50), a second bit value check 52 is performed for all devices 6, 8, 10 for the first bit position to be checked, checking to see if the bit position has a second bit value , Each device 6, 8, 10, which responds positively (yes 46) receives a subscription 48 for checking the next bit position 22, 24, 26, 28. If it should be provided that no device 6, 8, 10, the first Bit position of the serial number 16, 18, 20 has the second bit value (no 50), the identification round 38 is completed (end 54).
  • a meter check 56 is carried out. In this case, it is checked whether the performed k-th check for the k-th bit position 22, 24, 26, 28 was already the mth and thus last check for an mth and thus last bit position 22, 24, 26, 28 , Accordingly, it is checked whether the counter is still k ⁇ m. If this is the case (yes 46), an incrementation 58 of the counter is performed by 1, with the counter k being increased to k + 1. After that, after the kth check of the k-th bit position
  • a total of m of n bit positions 22, 24, 26, 28 are checked by a first bit value check 44 and, if necessary, by a second bit value check 52.
  • a first bit value check 44 is checked by a first bit value check 44 and, if necessary, by a second bit value check 52.
  • a kth check is followed by a kth + 1st check and so on.
  • a meter check 56 is carried out. In this case, it is checked whether the performed kth check for the kth bit position 22, 24, 26, 28 was already the mth check for the mth and thus last bit position 22, 24, 26, 28. Accordingly, it is checked if k ⁇ m.
  • each device 6, 8, 10 it is intended to carry out an identification round 38 for each device 6, 8, 10 to be identified.
  • only one device 6, 8, 10 is identified on the basis of the serial number 16, 18, 20 in each identification round 38, since each serial number 16, 18, 20 is assigned only once.
  • m checks are performed for m bit positions 22, 24, 26, 28 of the serial numbers 16, 18, 20.
  • a maximum of two devices 6, 8, 10 take part in the last, mth check of the mth bit position 22, 24, 26, 28, to which in all previous m-1 checks a right to participate 48 in the respective subsequent check is granted has been.
  • a device which has not been given the right to participate 48 after a k th verification is excluded from all m - k subsequent checks of the identification round 38.
  • a first bit value check 72 is carried out, with all devices 6, 8, 10 being asked whether their first bit position 22, 24, 26 , 28 has the first of two possible bit values.
  • a second bit value check is performed for all devices 6, 8, 10
  • a decision step 76 it is decided whether the checked kth, here first bit position 22, 24, 26, 28, is constant or not. In this case, the checked k-th bit position 22, 24, 26, 28 is constant, if only one of the two bit value checks 72, 74, d. H. either at the first bit value check 72 or only at the second bit value check 74, at least one device 6, 8, 10 has responded and none of the devices 6, 8, 10 has responded to the other of the two bit value checks 72, 74. If at least one device 6, 8, 10 has answered in each of the two bit value checks 72, 74, the checked k th bit position is
  • a k + 1-th bit position 22, 24, 26, 28 is checked to see whether it is constant for all devices 6, 8, 10 or not.
  • a first bit value check 72 and a second bit value check 74 are performed and then a decision 76 is made.
  • a general method for operating the network 2 with a plurality of devices 6, 8, 10 is illustrated by the third flow diagram of FIG.
  • a constantity check 92 it is checked which c of the total of n bit positions 22, 24, 26, 28 of the serial numbers 16, 18, 20 are constant for all devices 6, 8, 10. Details of this constant checking 92 are shown in FIG.
  • an identification round 94 is performed for a next device 6, 8, 10 to be identified. If this is not the case (no 102), the end 104 has been reached and an identification and addressing of all devices 6, 8, 10 to be identified and addressed are concluded.
  • a search mask associated with a device 6, 8, 10 comprises a search value and a search filter, both of which are 64 bits long.
  • the search filter determines that only bit values with a filter bit set to 1 are taken into account during the search.
  • the search value determines with which bit position 22, 24, 26, 28 of the serial number 16, 18, 20 in the search a match must be achieved.
  • a search command specifies the bit position and the bit value. Of the Bit value, for example 0 or 1, comes in the search value at bit position 22, 24, 26, 28 and replaces the previous bit value at this bit position 22, 24, 26, 28. At bit position 22, 24, 26, 28 is written in Search filter sets the filter bit to 1.
  • bit value can thus be set to 0 or 1 in succession, but the search filter is only reset as a whole in the above method. Therefore, in the course of time, more and more bit positions 22, 24, 26, 28 are taken into account in the identification rounds 38, 94 to be performed.
  • a list of constant bit positions 22, 24, 26, 28 may also be used as bit patterns, e.g. A 1 at each point, which is constant.
  • the search mask built up during the search and / or serial number 16, 18, 20 can be used. A comparison can be used to verify that the procedure has gone through properly. Therefore, it is also possible to retrieve the serial number 16, 18, 20 again from the device 6, 8, 10, instead of deriving only from the search mask of the control element 4. If commands are transmitted disturbed, there may be differences. In contrast, a multiple transmission of search commands can be made, but this costs transmission time. If more than one device 6, 8, 10 remains at the end, that is probably what happened. In this case, the identification round 38, 94 can be ignored and repeated. If, despite errors, a single device 6, 8, 10 with an unexpected serial number has been identified, this can also be ignored, since the goal of singling has nevertheless been achieved.
  • At least one device 6, 8, 10, which is to be identified in an identification round 38, 94, is assigned an internal search mask with at least one placeholder before carrying out the checks.
  • this at least one placeholder after a k-th review on the eligibility 48 is assigned a mark is specified for this at least one device 6, 8, 10, whether it is entitled to participate in the subsequent k + 1-th review is or not.
  • the at least one placeholder is assigned a positive mark at the k th check on the eligibility 48, if the at least one device 6, 8, 10 is authorized to participate in the subsequent k + 1 th check.
  • the at least one placeholder is assigned a negative mark in the kth check if the at least one device 6, 8, 10 is not entitled to participate in the subsequent k + 1th check, which means that the eligibility 48 is denied.
  • a first check of an identification round 38, 94 the highest of the m of n bit positions 22, 24, 26, 28 is checked. For each subsequent, hard check, the bit position 22, 24, 26, 28 is decremented by one. Alternatively, in the first check, the lowest of the m of n bit positions 22, 24, 26, 28 is checked, with the bit position 22, 24, 26, 28 being incremented by one at each subsequent k th check,

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Business, Economics & Management (AREA)
  • Emergency Management (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Small-Scale Networks (AREA)

Abstract

L'invention concerne un procédé d'exploitation d'un réseau (2) qui comporte plusieurs appareils (6, 8, 10). Un numéro de série (16, 18, 20), qui comprend n positions binaires (22, 24, 26, 28), est attribué à chaque appareil (6, 8, 10) du réseau (2). Les appareils (6, 8, 10) sont identifiés dans des cycles d'identification à l'aide de leur numéro de série (16, 18, 20). Dans un cycle d'identification avec au plus m vérifications, on vérifie des valeurs binaires pour m des n positions binaires (22, 24, 26, 28) des numéros de série (16, 18, 20) des appareils (6, 8, 10). Seul l'appareil ou seuls les appareils (6, 8, 10), qui ont été autorisés lors d'une k-1ème vérification précédente à participer à une kème vérification, participe à la kème vérification d'une kème position. L'appareil ou les appareils (6, 8, 10) autorisés à participer à la kème vérification est ensuite interrogé pour savoir si sa kème position binaire (22, 24, 26, 28) comporte une de deux valeurs binaires possibles. Chaque appareil (6, 8, 10), dont la kème position binaire (22, 24, 26, 28) comporte cette valeur parmi les deux valeurs binaires possibles, est autorisé à participer à une k+1ème vérification suivante.
PCT/EP2013/055126 2012-03-14 2013-03-13 Procédé d'exploitation d'un réseau WO2013135764A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE102012203958.9 2012-03-14
DE102012203958A DE102012203958A1 (de) 2012-03-14 2012-03-14 Verfahren zum Betreiben eines Netzwerks

Publications (1)

Publication Number Publication Date
WO2013135764A1 true WO2013135764A1 (fr) 2013-09-19

Family

ID=47891699

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2013/055126 WO2013135764A1 (fr) 2012-03-14 2013-03-13 Procédé d'exploitation d'un réseau

Country Status (2)

Country Link
DE (1) DE102012203958A1 (fr)
WO (1) WO2013135764A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2018134640A1 (fr) * 2017-01-17 2018-07-26 Tyco Fire & Security Gmbh Système de fourniture en fonction de l'emplacement destiné à un système d'alarme incendie et procédé associé

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0485878A2 (fr) * 1990-11-16 1992-05-20 Caradon Esser GmbH Procédé pour déterminer la configuration des détecteurs d'un système d'alarme
DE10240832A1 (de) 2002-09-04 2004-03-18 Robert Bosch Gmbh Bus
WO2009010745A1 (fr) * 2007-07-16 2009-01-22 Thorn Security Limited Identification d'une pluralité de dispositifs

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0485878A2 (fr) * 1990-11-16 1992-05-20 Caradon Esser GmbH Procédé pour déterminer la configuration des détecteurs d'un système d'alarme
DE10240832A1 (de) 2002-09-04 2004-03-18 Robert Bosch Gmbh Bus
WO2009010745A1 (fr) * 2007-07-16 2009-01-22 Thorn Security Limited Identification d'une pluralité de dispositifs

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2018134640A1 (fr) * 2017-01-17 2018-07-26 Tyco Fire & Security Gmbh Système de fourniture en fonction de l'emplacement destiné à un système d'alarme incendie et procédé associé
US11417195B2 (en) 2017-01-17 2022-08-16 Johnson Controls Fire Protection LP Location-aware provisioning system for fire alarm system and method therefor

Also Published As

Publication number Publication date
DE102012203958A1 (de) 2013-09-19

Similar Documents

Publication Publication Date Title
EP1309920B1 (fr) Procede d'adressage pour au moins un dispositif de bus nouvellement raccorde a un systeme de bus
EP2622826B1 (fr) Procédé d'attribution automatique d'adresse à des abonnés de bus de même type
EP2266297B1 (fr) Attribution automatique d'adresses de bus par contrôle de collision
WO1995015043A1 (fr) Dispositif pour l'echange de donnees et procedes permettant de faire fonctionner ce dispositif
EP1352497B1 (fr) Procede pour controler un reseau et reseau correspondant
EP2733910B1 (fr) Système bus, procédé de fonctionnement d'un système bus et système fluidique doté d'un système bus
DE102017117128A1 (de) Drahtlose Vergabe von Netzwerkadressen
DE102006050135A1 (de) Verfahren zum Betrieb eines Bussystems
WO2013135807A1 (fr) Dispositif de commande pour la commande de processus critiques pour la sécurité dans une installation automatisée et procédé de paramétrisation du dispositif de commande
WO2011120856A1 (fr) Procédé d'adressage et réseau de communication utilisant un tel procédé d'adressage
WO2013135764A1 (fr) Procédé d'exploitation d'un réseau
DE102006050134A1 (de) Verfahren zum Betrieb eines Bussystems
DE102012221487B3 (de) Verfahren zum Vergeben von Adressen innerhalb eines Bussystems und Bussystem
EP2826227B1 (fr) Procédé d'exploitation d'un réseau
WO2017097737A1 (fr) Système de bus comprenant un premier ensemble d'abonnés et procédé pour faire fonctionner un système de bus
DE10032533A1 (de) Verfahren und Einrichtung zum Überwachen und Steuern von Maschinen bzw. maschinellen Anlagen
CH699970A1 (de) Verfahren zur Adressierung von Aktuatoren und Anordnung mit Aktuatoren.
DE102017117225B3 (de) Kommunikationssystem mit Bus und Codierleitung
EP3681109B1 (fr) Procédé de détection d'une condition d'un participant dans un bus de communication, système de bus de communication, système de verrouillage doté d'un système de bus de communication et émetteur-récepteur
WO2004017182A2 (fr) Procede pour transferer un enregistrement dans une unite de calcul
DE102022102143A1 (de) Verfahren zum automatischen Vergeben von Adressen in einem Modbus-Kommunikationsnetzwerk
DE102020134167A1 (de) Verfahren zur Adresskonfiguration für ein Master/Slave-System
EP2875438B1 (fr) Procédé d'enregistrement et dispositif de communication par bus
DE102018123819A1 (de) Bussystem zugehörige Busteilnehmervorrichtungen sowie Verfahren zum Ermitteln und Vermeiden von Adresskollisionen
DE102017223110A1 (de) Verfahren zur Zuordnung einer eindeutigen Positionsidentifikationsnummer einer Steuereinheit auf einem Bussystem, Steuereinheit, Batteriemodul und Fahrzeug mit Batterie

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 13709888

Country of ref document: EP

Kind code of ref document: A1

122 Ep: pct application non-entry in european phase

Ref document number: 13709888

Country of ref document: EP

Kind code of ref document: A1