EP3987697A1 - Procédé d'exploitation d'un réseau de communication, réseau de communication et abonnés d'un réseau de communication - Google Patents

Procédé d'exploitation d'un réseau de communication, réseau de communication et abonnés d'un réseau de communication

Info

Publication number
EP3987697A1
EP3987697A1 EP20780630.8A EP20780630A EP3987697A1 EP 3987697 A1 EP3987697 A1 EP 3987697A1 EP 20780630 A EP20780630 A EP 20780630A EP 3987697 A1 EP3987697 A1 EP 3987697A1
Authority
EP
European Patent Office
Prior art keywords
telegram
error
data section
slave
telegrams
Prior art date
Legal status (The legal status 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 status listed.)
Granted
Application number
EP20780630.8A
Other languages
German (de)
English (en)
Other versions
EP3987697B1 (fr
Inventor
Holger BÜTTNER
Dirk Janssen
Erik Vonnahme
Hans Beckhoff
Thomas Rettig
Thorsten Bunte
Johannes BECKHOFF
Guido Beckmann
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beckhoff Automation GmbH and Co KG
Original Assignee
Beckhoff Automation GmbH and Co KG
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 Beckhoff Automation GmbH and Co KG filed Critical Beckhoff Automation GmbH and Co KG
Publication of EP3987697A1 publication Critical patent/EP3987697A1/fr
Application granted granted Critical
Publication of EP3987697B1 publication Critical patent/EP3987697B1/fr
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0061—Error detection codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/33—Flow control; Congestion control using forward notification
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/0078—Avoidance of errors by organising the transmitted data in a format specifically designed to deal with errors, e.g. location
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/40—Bus networks
    • H04L12/407—Bus networks with decentralised control
    • H04L12/413—Bus networks with decentralised control with random access, e.g. carrier-sense multiple-access with collision detection [CSMA-CD]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/20—Hop count for routing purposes, e.g. TTL
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2416—Real-time traffic
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/06—Notations for structuring of protocol data, e.g. abstract syntax notation one [ASN.1]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/08—Error detection or correction by redundancy in data representation, e.g. by using checking codes
    • G06F11/10—Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's
    • G06F11/1004—Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's to protect a block of data words, e.g. CRC or checksum

Definitions

  • the present invention relates to a method for operating a communication network comprising a plurality of subscribers.
  • the invention also relates to a communication network and a subscriber for a communication network.
  • information can be transmitted between the participants in the form of discrete data packets, also known as telegrams.
  • the communication network can be implemented in the form of an Ethernet-based field bus system in which the data exchange takes place in accordance with the Ethernet standard.
  • the telegrams can have a plurality of data sections with a data volume of one byte each.
  • the telegrams can be processed by the participants in transit, i.e. that the telegrams are forwarded by the participants to another participant while they are being received.
  • the telegrams can have an end area comprising several data sections and interpreted as a test value by the participants.
  • the check value which can relate to previous data sections, it can be checked whether the data sections concerned are free of errors or have an error.
  • the contents of the telegram can be changed. This makes it necessary to also change the test value of the telegram.
  • the subscriber can calculate both a check value over received data sections and a check value over sent data sections. If the subscriber detects a difference between the two test values and thus an error when comparing the calculated test value over the received data sections with the test value reproduced by the end area of the received telegram, he must also not recognize a valid test value send. As a result of the through processing, however, a part of the end range reproducing the calculated (valid) test value can already be sent. In this case, the subscriber can send a manipulated remaining part of the end range so that an incorrect check value is transmitted to the following subscriber. As a result, the following subscriber can recognize that the telegram otherwise correctly received by him is incorrect.
  • the object of the present invention is to provide an improved method for operating a communication network in which a subscriber transmits a telegram with an intentionally incorrect test value end range to a next subscriber and the next subscriber is also given the opportunity to recognize that the faulty one Telegram should not be viewed as a first error but as a subsequent error. It is a further object of the invention to specify a correspondingly designed communication network and a correspondingly trained subscriber for a communication network.
  • a method for operating a communication network comprises several participants mer.
  • a data exchange in the communication network between the participants takes place in the form of telegrams which have several data sections.
  • the participants interpret an end area of the telegrams as a test value to check that previous data sections of the telegrams are free from errors.
  • the telegrams are processed by the participants on the fly, so that the telegrams are received by the participants and sent on to the next participant while they are being received.
  • the participants send the relevant telegram to the next participant with an identifying data section of the telegram at the end of the telegram so that it is sent to the next participant Telegram has an end area which reflects an invalid test value.
  • the identifying data section which is part of the end area of the telegram, the telegram is marked for the next participant in such a way that the telegram should not be considered as a first error but as a subsequent error.
  • the method is based on performing the transmission of the telegram to the next participant with a characteristic data section at the end of the telegram in the event of a detected error when receiving a telegram by a participant. This is done in such a way that the telegram sent to the next participant has an end range which reproduces an invalid test value, or in other words a false test value or a test value indicating an error for data sections of the telegram previously sent to the next subscriber. Furthermore, the telegram is identified by the identifying data section for the next participant to the effect that the error has already been recognized beforehand, and insofar as the telegram is not to be taken into account by the next participant as a first error but instead as a subsequent error. Based on this, the source of the error, i.e. which participant the error first occurred with, can be localized.
  • Sending a telegram with such an identifying data section of the telegram at its end offers the possibility of identifying the telegram as a consequential error with a high degree of reliability.
  • the proposed procedure can be used universally and is suitable for a large number of different configurations of communication networks or field bus systems in which telegrams are processed in transit. In the following, further possible details and embodiments are described in more detail, which can be considered for the method.
  • the data sections of the telegrams can each have the same amount of data.
  • the data sections can each comprise one byte or eight bits.
  • the communication network is an Ethernet-based field bus system.
  • This can be a system with a transfer rate of, for example, 1 Gbit / s.
  • a configuration in the form of an EtherCAT fieldbus system is also possible, for example.
  • the end area of the telegrams interpreted by the participants as a test value can comprise several data sections. For example, four data sections are possible.
  • the identifying data section is part of the end area of the telegram interpreted as a test value.
  • the identifying data section can be located at the end of the test value end range and the last data section of the end range.
  • the test value end area can comprise four data sections and, in this respect, four bytes. If a telegram with an identifying data section is sent to the next subscriber, the identifying data section can be the last or fourth data section of the test value end range. With regard to a characterizing data section used in the method, this data section is provided or set by a subscriber in such a way that the next subscriber receiving the associated telegram can recognize the associated identification and consequently consider the telegram as a subsequent error. The following embodiments can be considered here.
  • the participants select the characteristic data section from a group comprising several different predetermined data sections.
  • the specified data sections can be stored in the participants. If a participant receives a telegram with an end range which reproduces an invalid check value, and the telegram also has one of the specified data sections as the identifying data section, the participant in question can recognize the identification of the telegram achieved in this way and the telegram as a result Consider consequential errors.
  • the aforementioned group can include, for example, two different predefined data sections, hereinafter referred to as first and second predefined data sections.
  • the first and second predetermined data sections can be data sections that are inverted with respect to one another, for example.
  • the participants check whether a valid calculated check value is present when the first specified data section is sent, or in other words a correct or error-free calculated check value for previously sent data sections is present. If this is not the case and an invalid calculated test value is present, the first specified data section is selected by the participants as the characterizing data section. On the other hand, as far as it is determined that a valid and thus error-free calculated test value is present when the first specified data section is sent, the second specified data section is selected by the subscribers as the characterizing data section. In this way it can be ensured that a telegram sent to a next subscriber has an end area which reproduces an invalid test value.
  • a check is carried out to determine whether there is an invalid and thus an error-indicating calculated test value for previously sent data sections when sending the first specified data section and when sending the second specified data section.
  • the other of the first and second specified data sections is output by the participants as a characteristic data section elects.
  • an invalid calculated test value is present, that of the first and the second specified data section is selected by the participants as the characteristic data section, with its use a greater difference to a valid and error-free calculated test value is selected for previously sent data sections can be achieved.
  • the participants define the characterizing data section by performing a predetermined calculation using at least one previously sent data section, ie at least one data section of the associated telegram previously sent to a next participant.
  • This procedure also offers the possibility of marking a telegram with a high degree of reliability.
  • a characterizing data section provided according to the aforementioned procedure is linked in a manner that is comprehensible to a next participant with at least one data section previously sent to the next participant. This is because the participants are each trained to carry out the same calculation steps.
  • a subscriber receives a telegram with an end range which reproduces an invalid check value indicating an error, and the telegram also has an identifying data section created on the basis of the specified calculation and thus linked in a recognizable manner to at least one previously sent data section , the participant in question can carry out an analog Calculation using at least one received data section, understand the identification of the received telegram achieved in this way and, as a result, consider the telegram as a consequential error.
  • performing the predefined calculation includes determining a valid test value, indicating that it is free from errors, for previously transmitted data sections and forming an alternative value by applying a predefined calculation algorithm to a partial value of the valid test value determined at its end.
  • a valid check value a fictitious error-free telegram can be viewed or calculated, when the valid check value would be available when it was sent, and when it was sent, the next participant would be shown that the check value was free from errors.
  • the alternative value formed is defined as a characteristic data section.
  • the test value end area of a telegram can have several data sections. In a corresponding manner, the test value can comprise several partial values.
  • an alternative value is calculated by means of a predetermined calculation algorithm.
  • This alternative value is used as the identifying data section.
  • the calculation algorithm is an inversion. Notwithstanding this, other arbitrary calculation algorithms can also be used.
  • the above-indicated localization of one (or more) error source (s) can be reliably implemented using unmarked telegrams that are therefore to be taken into account as first errors and, if necessary, additionally using marked telegrams that are therefore to be taken into account as subsequent errors.
  • the subscribers of the communication network it can be seen in this context that the subscribers have corresponding counters.
  • a further embodiment provides that the participants have an error counter relating to a first error.
  • the Error counter of the participants relating to the first error is incremented.
  • one or more points of error in the communication network can be localized by evaluating the subscribers' first error error counters.
  • the participants furthermore determine an error type of the detected error or first error and an error counter of the participants relating to the error type is incremented.
  • This embodiment can be used when different types of errors can occur during data transmission during the operation of the communication network. Examples of this are explained in more detail below.
  • the participants can each have a corresponding error counter for the different error types and, after determining an error type, increment the associated error counter. By evaluating the subscriber's error type error counters, statistical statements can be made, for example, about different errors that have occurred in the communication network.
  • the participants have an error counter relating to a subsequent error.
  • the subscriber's error counter relating to the subsequent error is incremented.
  • one or more error points in the communication network can be localized by evaluating the first error error counter and the subsequent error error counter of the subscribers.
  • data units can be physically transmitted in the form of coded data units or symbols, as is used, for example, in Ethernet-based systems.
  • a malfunction can lead to a non-assigned or invalid symbol being received when a telegram is received. This error case is also referred to as a symbol error.
  • the telegrams can also contain length information, i.e. information about the number of data sections in a telegram.
  • a malfunction can result in a participant receiving a telegram from the Length information a different larger or smaller number of data sections receives. This error case is also referred to as a length error.
  • an error can also consist in the fact that a subscriber receives a number of data sections corresponding to the length ninformation when receiving a telegram, but the end area of the received telegram reproduces an invalid and thus an error indicating the test value.
  • the test value relating to the previous data sections of the telegram and reproduced by the received end area can deviate from an expected test value determined on the basis of the preceding data sections. This error case is also referred to as a test value error.
  • the telegrams do not contain any length information.
  • the end range of the telegrams is interpreted by the participants as a test value.
  • the end area of the received telegram can correspondingly reproduce an invalid and thus an error-indicating test value, so that a test value error is present.
  • the proposed method and its embodiments can be used with respect to all of the aforementioned types of errors. If one of the errors mentioned is detected when a subscriber receives a telegram, the telegram is forwarded in the above-mentioned manner, i.e. with a characteristic data section at its end. In the event that the incorrect telegram received from the subscriber is not marked, the telegram is taken into account as the first error. For this purpose, a first error error counter of the subscriber and, if necessary, a further error counter relating to the type of error can be incremented. If the telegram received from the subscriber is marked with an identifying data section at its end, the telegram is taken into account as a consequential error. For this purpose, the participant's subsequent error counter can be incremented.
  • the subscribers prematurely terminate the sending of the telegram to the next subscriber by sending the identifying data section in the event that an error is detected when receiving a telegram, depending on an error type of the detected error.
  • This configuration can come into consideration, for example, provided that a participant is one Symbol error or a length error in the form of a telegram with a number of data sections differing from a length ninformation is detected. Due to the premature termination, the telegram sent to the next participant can (also) have a length error. In this embodiment it is possible that the presence of an end area of the telegram sent to the next subscriber, which reproduces an invalid check value, is a consequence of the premature termination of the telegram by sending the identifying data section.
  • the communication network has a master-slave structure.
  • the aforementioned participants in the communication network are configured as slaves, and the communication network has a further active participant configured as a master.
  • the master participant and the slave participant can be connected via a transmission link such as a data line.
  • the master participant has network access authorization and can output telegrams on the transmission link and receive them over the transmission link.
  • the slave participants do not have their own Netzzu access authorization to the communication network, and are therefore not allowed to output any independent telegrams to the communication network, but only to exchange data with the telegrams circulating on the transmission path.
  • a CRC check value is used as the check value. This is a test value calculated using the CRC (cyclic redundancy check) method from previous data sections of a telegram.
  • the CRC method is based on a polynomial division using a generator polynomial.
  • a communication network is proposed.
  • the communication network can be designed to carry out the aforementioned method or a method according to one or more of the aforementioned embodiments.
  • the communication network comprises several participants.
  • a data exchange in the communication network between the participants takes place in the form of telegrams which have several data sections.
  • the participants are designed to interpret an end area of the telegrams as a test value to check that previous data sections of the telegrams are free of errors.
  • the participants are also designed to process the telegrams in transit so that the telegrams are received by the participants and during the Received can be forwarded to the next participant.
  • the participants are des Also designed to carry out the sending of a telegram to a next participant with a characterizing data section of the telegram at the end of the telegram if an error in the telegram is detected when the telegram is received, so that the telegram sent to the next participant has an end area which has a returns invalid check value.
  • the identifying data section which is part of the end area of the telegram, the telegram for the next participant is identified in such a way that the telegram should not be considered as a first error but as a subsequent error.
  • the participants can be designed to select the characterizing data section from a group comprising a plurality of predetermined data sections. Furthermore, the participants can be designed to define the characterizing data section by performing a predetermined calculation using at least one previously transmitted data section.
  • the participants can also have at least one error counter. This includes a first error error counter, a subsequent error error counter, as well as several error counters relating to different types of errors.
  • the participants can also be designed to prematurely end the sending of the telegram to a next participant by sending the identifying data section as a function of an error type of a detected error.
  • the communication network can have a master-slave structure.
  • the communication network can also be an Ethernet-based field bus system, for example an EtherCAT field bus system.
  • a CRC check value can be used as the check value.
  • a subscriber for a communication network is proposed.
  • This can be the aforementioned communication network.
  • a data exchange in the communication network takes place in the form of telegrams which have several data sections.
  • the subscriber is designed to interpret an end area of the telegrams as a test value to check that previous data sections of the telegrams are free from errors.
  • the participant is also designed to process the telegrams on the fly, so that the telegrams are received by the participant and sent to each other while they are being received. because the next participant will be forwarded.
  • the subscriber is also trained to send a telegram to the next subscriber with a characteristic data section of the telegram at the end of the latter, provided that an error in the telegram is detected when the telegram is received, so that the telegram sent to the next subscriber has a Has end region which reproduces an invalid test value.
  • the identifying data section which is part of the end area of the telegram, the telegram is identified for the next participant in such a way that the telegram should not be considered as a first error but as a subsequent error.
  • FIG. 1 shows a communication network with a master-slave structure
  • FIG. 2 a slave participant
  • FIGS. 3 to 12 are diagrams which illustrate the processing of telegrams in transit by slave participants in the event of errors that have occurred.
  • FIG. 1 shows a schematic representation of a communication network 100 in which the method can be used.
  • the communication network 100 has a master-slave structure and has a master participant 110 and a plurality of slave participants 120.
  • the master participant 110 and the slave participants 120 are connected to one another via a transmission link 105.
  • Data can be exchanged in the communication network 100 in the form of telegrams 150 via the transmission link 105, which is implemented in the form of a data line.
  • the communication network 100 shown by way of example in FIG. 1 has four slave users 120, which are also provided with the subscripts 0, 1, 2, 3 for differentiation.
  • the slave participants 120 can be sensors, actuators, display devices, operating devices, motors, etc., for example.
  • the communication network 100 can also include a different or greater number of slave users 120.
  • the master participant 110 represents the active participant of the communication network 100, which can determine the data traffic. For this purpose, only the master participant 110 has access authorization to the communication network 100 and can output telegrams 150 on the transmission link 105 and receive them via the transmission link 105.
  • the slave users 120 do not have their own network access authorization and are therefore not allowed to output any independent telegrams 150 on the transmission path 105. Instead, the slave users 120 can only exchange data with the telegrams 150 circulating on the transmission link 105.
  • the slave participants 120 and the master participant 110 are connected together in the form of a chain or a ring.
  • the slave participants 120 are, according to their sequence in the transmission direction after the master participant 110, also as the first slave Subscriber 120o, referred to as the second slave subscriber 120i, as the third slave subscriber 120 2 and as the last slave subscriber 120 3 .
  • the data transmission in the form of telegrams 150 takes place in one direction starting from the master subscriber 110 to the first slave subscriber 120o, from there from one to the next slave subscriber 120 to the last slave subscriber 120 3 , and from there again back to the master subscriber 110.
  • the telegrams 150 are processed in transit.
  • the telegrams 150 are received by the participants 120 and, while receiving, they are sent on with a delay to the next participant 120 or, in the case of the last slave participant 120 3, to the master participant 110.
  • the telegrams 150 can be sent on by the slave users 120 without changing the data content or with changed data content.
  • the telegrams 150 deviating from the representation in Figure 1, from the last slave participant 120 3 by the other slave participants 120 (in the order third slave participant 120 2 , second slave participant 120i, first slave participant 120o) can be sent back to the master participant 110 without further processing.
  • the communication network of FIG. 1 can be an Ethernet-based field bus system in which the data exchange takes place via the telegrams 150 in accordance with the Ethernet standard. This can be a system with a transfer rate of 1 Gbit / s.
  • an embodiment of the network 100 in the form of an EtherCAT field bus system can also be considered.
  • the data are physically transmitted as coded data or symbols on the transmission link 105.
  • coding and decoding take place when the telegrams 150 are sent and received.
  • the slave subscribers 120 have, as shown in FIG. 2 with reference to a slave subscriber 120, a receiving device 121 and a transmitting device 123, the telegrams 150 being received and decoded with the aid of the receiving device 121, and with the aid of the transmitting device 123 the telegrams 150 are coded and sent.
  • Another component of the slave subscriber 120 is a processing device 122 located between receiving and transmitting devices 121, 123, with the help of which the telegrams 150 are processed and the data content of the telegrams 150 can be changed if necessary.
  • the slave participants 120 can furthermore comprise further components, not shown, such as a data memory for example.
  • the master subscriber 110 by which the output of the telegrams 150 on the transmission path 105 is controlled and initiated as stated above, also has a transmitting device for encoding and sending the telegrams 150 and a receiving device for receiving and decoding the telegrams 150, as well as others Components such as a central control unit and a memory (not shown).
  • a telegram 150 received from a slave user 120 can have an error.
  • the slave users 120 as is also shown in FIG. 2, have a first error error counter 130 and a subsequent error error counter 131.
  • the first error error counter 130 is incremented.
  • the subsequent error error counter 131 is incremented.
  • the slave users 120 can have further error counters 132. This means that different types of errors can also be taken into account.
  • the error counters 132 are each assigned to one type of error.
  • the slave users 120 further determine the type of error present when a first error in a received telegram 150 is detected, and the associated error counter 132 is incremented based on this. In this way, for example, statistical statements can be made about different errors that have occurred in the communication network 100.
  • the slave participants 120 can be carried out with the aid of the processing device 122.
  • the processing device 122 can initiate the incrementing of the error counters 130, 131, 132.
  • the evaluation of the error counters 130, 131, 132 can take place with the aid of the master subscriber 110, wel chem the error counter information can be transmitted with the aid of one or more telegrams 150.
  • FIGS. 3 to 12 show diagrams which illustrate the processing of telegrams 150 in transit through slave users 120 of the communication network 100 of FIG. 1 for different errors.
  • the error occurs first when a telegram 150 is received by a slave participant 120, which forwards the telegram 150 to a next slave participant 120.
  • the second slave subscriber 120i in which the error occurs first
  • the third slave subscriber 120 2 are considered as the next subscriber.
  • RX 1 and TX 1 indicate a first reception and a first transmission of the telegram 150 by the second slave user 120i
  • RX 2 and TX 2 indicate a second reception and a second transmission of the telegram 150 subsequent third slave subscriber 120 2 designated.
  • FIGS. 3 to 12 show diagrams which illustrate the processing of telegrams 150 in transit through slave users 120 of the communication network 100 of FIG. 1 for different errors.
  • the error occurs first when a telegram 150 is received by a slave participant 120, which forwards the telegram 150 to a next slave participant 120.
  • TX-CRC is also used to first calculate a (fictitious) valid check value from data of telegram 150 sent by second slave user 120i and with RX-CRC a second calculation of a (fictitious) valid test value of data of the telegram 150 received by the third slave user 120 2 is shown.
  • the telegrams 150 have a plurality of data sections 155.
  • Each data section 155 comprises the same amount of data, which in the case of Ethernet is one byte or eight bits. To distinguish them, the data sections 155 are additionally provided with designations such as D_0, D_n, DO, D1, etc. Depending on the respective designation, the data sections 155 are also referred to as the zeroth data section DO, first data section D1, second data section D2, third data section D3, fourth data section D4 and fifth data section D5.
  • the above-mentioned identification of a telegram 150 is carried out with the aid of a characterizing data section 160 of the telegram 150 at its end.
  • the characterizing data section 160 has the same amount of data as the other data sections 155, that is, one byte in the case of Ethernet.
  • the telegrams 150 also have an SOF field 151 (start of frame) at the beginning and an EOF field 152 (end of frame) at the end, with the help of which a slave participant 120 starts and ends a telegram 150 when receiving of the same can be displayed.
  • the two fields 151, 152 can be specific symbols or signals transmitted.
  • the actual useful data in the form of the data sections 155, 160 are located between the two fields 151, 152.
  • the processing of the telegrams 150 by the slave subscribers 120 takes place from left to right, i.e. from the receipt of the SOF field 151 to the EOF field 152. Furthermore, in FIGS. 3 to 12, the processing delay present in the processing of the telegrams 150 is indicated, which in the present case corresponds to the length of a data section 155 or a byte. The telegram 150 received from the second slave user 120i is thus sent on to the third slave user 120 2 offset by a data section 155 or one byte.
  • the slave subscribers 120 are also designed in such a way that an end area 157 of the telegrams 150 located in front of the EOF field 152 is interpreted as a check value, on the basis of which there is no error in previous data sections 155 of the telegrams 150, that is to say before the end area 157 can be checked.
  • the end area 157 comprises four data sections 155 or four bytes.
  • the identifying data section 160 is part of the end area 157 and is located at its end, so that the end area comprises three data sections 155 and then the identifying data section 160.
  • the test value can be calculated from the preceding data sections 155 in accordance with a predefined calculation method, and is thereby linked to these data sections 155 in a predetermined manner.
  • the check value can be a CRC check value which can be calculated from the preceding data sections 155 in accordance with the CRC method (cyclic redundancy check). If there is no error and a telegram 150 is correctly received by a slave user 120, there is a valid test value which indicates that the data sections 155 located in front of the end area 157 are free from errors.
  • FIG. 3 illustrates the presence of a symbol error.
  • a received telegram 150 contains an unassigned and therefore invalid symbol.
  • FIG. 3 shows that the telegram 150 received by the second slave subscriber 120i after the second data section D2 does not have a correct third data section D3, but instead has an incorrect data section RX ERR.
  • the delayed forwarding of the telegram 150 to the next or third slave subscriber 120 2 is terminated prematurely, in which the second slave subscriber 120i after the second Data section D2 sends an identifying data section 160 and then the sending of the telegram 150 by sending the EOF field 152 completes.
  • the first error error counter 130 of the second slave subscriber 120i is incremented. If present, a further error counter 132 of the second slave user 120i relating to a symbol error can also be incremented (cf. FIG. 2).
  • this data section 160 provision is made for this data section 160 to be selected from a first specified data section V1 and a second specified data section V2.
  • the relevant first and second predetermined data sections V1, V2 are stored here in all slave subscribers 120 of the communication network 100, whereupon the slave subscribers 120 can recognize the identifier.
  • the given data sections V1, V 2 can be inverted data sections (for example with the values 0xA4 and 0x5B).
  • the selection of one of the two pre-given data sections V1, V2 can be provided to ensure that the telegram 150 sent to the next or third slave subscriber 120 2 has an end area 157 which does not reproduce a valid check value but instead an invalid check value.
  • the telegram 150 sent by the second slave subscriber 120i to the next or third slave subscriber 120 2 and received by the latter has an end area comprising the zeroth, first and second data sections DO, D1, D2 and the characterizing data section 160 157 (compare the first transmission TX 1 and the second reception RX 2).
  • the test value reproduced by the end area 157 relates to the preceding data sections, ie the further zeroth data section D_0 to the further nth data section D_n.
  • the second slave user 120i can proceed as follows.
  • the second slave user 120i it is possible, for example, for the second slave user 120i to check, by performing a corresponding calculation, whether, when the telegram 150 is sent with the first specified data section V1, a valid test value for the preceding further zeroth to n- th data sections D_0 to D_n would be present. If this is not the case, the second slave participant 120i sends the first predetermined data section V1 following the second data section D2. If, on the other hand, the second slave subscriber 120i determines that the end area 157 would reproduce a valid check value by sending the telegram 150 with the first specified data section V1, the second specified data section V2 is selected by the second slave subscriber 120i and after sent to the second data section D2.
  • the telegram 150 transmitted to the next or third slave subscriber 120 2 in this way has an end area 157 reproducing an invalid check value, comprising the zeroth, first and second data sections DO, D1, D2 and the characterizing data section 160, so that the Telegram 150 can be recognized as faulty by the third slave user 120 2. It is also possible that the shortened telegram 150 due to the premature termination of the transmission is additionally recognized as faulty by the third slave user 120 2 due to the shorter telegram length. In addition, the telegram 150 is through the identifying data section 160, that is, the first specified data section V1 or the second specified data section V2, is identified in a recognizable manner for the third slave user 120 2 , so that the error in the telegram 150 is taken into account as a consequential error. For this purpose, the subsequent error error counter 131 of the third slave subscriber 120 2 is incremented (cf. FIG. 2).
  • a further variant with regard to the selection consists in the fact that the second slave user 120i checks, by performing a corresponding calculation, whether when the telegram 150 is sent with each of the specified first or second data section V1 or V2, respectively the invalid test value reproduced in the end area 157 would be present for the preceding data sections, ie the further zeroth to n-th data sections D_0 to D_n.
  • the second slave user 120i can furthermore calculate a valid check value for the further zero-th to n-th data sections D_0 to D_n sent. If it is found that when sending with one of the two specified data sections V1,
  • V2 the valid check value would be transmitted by the end area 157, the other of the two predetermined data sections V1, V2 is selected by the second slave user 120i and sent after the second data section D2.
  • the marked telegram 150 is sent to the third slave subscriber 120 2 and a possibly occurring error occurs, the telegram 150 is received by the third subscriber 120 2 with an end area 157 which a Presence of a valid test value conveyed.
  • the third slave participant 120 2 the faulty telegram 150 also in a marked form with a characteristic data section 160 at its end to the next slave participant 120 (in this case the last slave participant 120 3 , See FIG. 1) forwards (see second transmission TX 2). Doing so leads the third slave participant 120 2 through the same steps as the second slave participant 120i.
  • the third slave user 120 2 does not detect a symbol error, but instead a check value error and, if necessary, an error in the form of a telegram 150 that is too short, as will be described further below.
  • the identification of the telegram 150 sent on to the last slave subscriber 120 3 takes place in accordance with the description above, in that the identifying data section 160 is selected from one of the specified first or second data sections V1, V2 and sent after the second data section D2.
  • the diagram of FIG. 4 shows a further variant of the method which can be carried out when a symbol error is present.
  • the second slave participant 120i after recognizing the received incorrect data section RX ERR, prematurely terminates the forwarding of the telegram 150 to the next or third participant 120 2 by the second slave participant 120i after sending the second Data section D2 sends an identifying data section 160 and then the sending of the telegram 150 is completed by sending the EOF field 152 (cf. first sending TX 1).
  • the first error error counter 130 and possibly a further error counter 132 of the second slave user 120i relating to a symbol error are incremented in a corresponding manner.
  • the characterizing data section 160 it is provided that it is defined by performing a predetermined calculation. In this context, all slave users 120 of communication network 100 are designed to carry out the predefined calculation explained below, whereupon slave users 120 can recognize the identifier.
  • the second slave subscriber 120i calculates a fictitious valid check value C, in the present case including the zeroth partial value C0, the first partial value C1, the second partial value C2 and the third Partial value C3 for further zeroth to n-th data sections D_0 to D_n previously sent to the next or third slave user 120 2.
  • the second slave subscriber 120i is based on sending a fictitious correct telegram 170, in which an end area 157 present after the further zeroth to nth data sections D_0 to D_n would reproduce the valid test value C, and thus the third slave Subscriber 120 2 would be shown to be error-free with regard to the test value.
  • the first slave participant 120i determines a third alternative value C3 'for the last valid third partial value C3 of the fictitious valid test value C. This is done by applying a predetermined calculation algorithm to the third partial value C3. For example, it is possible to invert the third partial value C3. Alternatively, a different calculation algorithm can also be used.
  • the third alternative value C3 ′ determined in this way is defined as the characterizing data section 160.
  • the identifying data section 160 or the third data section D3, which here corresponds to the third alternative value C3 ' is sent to the third slave user 120 2 after the second data section D2.
  • the telegram 150 sent to the next or third slave subscriber 120 2 has an end area 157 reproducing an invalid check value, comprising the zeroth data section DO, the first data section D1, the second data section D2 and the identifying data section 160, so that the telegram 150 can be recognized as faulty by the third slave user 120 2. It is also possible that the shortened telegram 150 due to the premature termination of the transmission is additionally recognized as faulty by the third slave user 120 2 due to the shorter telegram length. In addition, the telegram 150 for the third slave subscriber 120 2 is identified by the identifying data section 160 or by the third data section D3, which here corresponds to the third alternative value C3 ', in a comprehensible manner for the subscriber 120 2 as a consequential error.
  • the third slave subscriber 120 2 performs the same calculation as previously the second slave subscriber 120i (cf. second test value calculation RX-CRC), ie the third slave subscriber 120 2 calculates a fictitious valid test value C with the zeroth, first, second and third partial values C0, C1, C2, C3 for the further zeroth to nth data sections D_0 to D_n received from the third slave user 120 2.
  • the third slave user 120 2 is based on receiving a fictitious correct telegram 170, in which an end area 157 present after the further zeroth to nth data sections D_0 to D_n would reproduce the valid check value C.
  • the third slave user 120 2 determines a third alternative value C3 'for the last valid third partial value C3 by applying the predefined calculation algorithm (for example inverting) to the third partial value C3. If the third alternative value C3 'calculated by the third slave user 120 2 corresponds to the received third alternative value C3' and the third slave user 120 2 can recognize the identifier as a result, the error in the received telegram 150 can be caused by the third user 120 2 be taken into account as a consequential error. To this purpose, the subsequent error error counter 131 of the third slave subscriber 120 2 is incremented.
  • FIG. 4 also shows that the third slave participant 120 2 forwards the faulty telegram 150, likewise with an identifying data section 160 at its end, to the next slave participant 120 (last slave participant 120 3 , see FIG. 1) (cf. second transmission TX 2).
  • the third slave participant 120 2 carries out the same steps as the second slave participant 120i.
  • the third slave user 120 2 does not detect a symbol error, but instead a test value error and, if necessary, an error in the form of a telegram 150 that is too short.
  • the telegram 150 that is sent on is also identified here by the fact that the identifying data section 160 is defined in accordance with the description above by performing the specified calculation and is sent after the second data section D2.
  • the telegrams 150 used for data exchange in the communication network 100 can contain length information, that is, information about the number of data sections 155 of a telegram 150.
  • the length information can be contained in data sections 155 at the beginning of a telegram 150.
  • a fault can lead to a slave user 120 receiving a larger or smaller number of data sections 155 when receiving a telegram 150, which differs from the length information, and thus a length error is present.
  • the diagram of FIG. 5 shows the presence of a length error in the form of a telegram 150 that is too short. In FIG early, which receives the EOF field 152 indicating the end of the telegram 150. In this case, the number of received data sections 155 is smaller than the number of data sections 155 reproduced by the length information of telegram 150.
  • the delayed forwarding of the telegram 150 to the next or third slave participant 120 2 is terminated by the second slave participant 120i sending an identifying data section 160 after the second data section D2 and then the sending of the telegram 150 by sending the EOF field 152 completes. Furthermore, the first error error counter 130 is incremented and, if applicable, a further error counter 132 of the second slave participant 120i relating to a length error (telegram 150 that is too short).
  • the characterizing data section 160 is selected from a first predetermined data section V1 and a second predetermined data section V2.
  • the telegram 150 sent by the second slave subscriber 120i to the next or third slave subscriber 120 2 and received by the latter has a zero data section DO, the first data section D1, the second data section D2 and the identifying data section 160 which include the End area 157 (cf. first transmission TX 1 and second reception RX 2).
  • the test value reproduced by the end area 157 relates to the preceding further zeroth to n-th data sections D_0 to D_n.
  • the second slave subscriber 120i selects, according to the description above for FIG.
  • the telegram 150 received from the next or third slave subscriber 120 2 has an end area 157 reproducing an invalid check value, so that the telegram 150 can be recognized as faulty by the third slave subscriber 120 2.
  • the telegram 150 is also identified in a recognizable manner for the third slave user 120 2 due to the identifying data section 160, so that the error in telegram 150 is taken into account as a consequential error. This is done by incrementing the subsequent error error counter 131 of the third slave subscriber 120 2 .
  • FIG. 5 also shows that the third slave participant 120 2 sends the faulty telegram 150 on to the next slave participant 120 (last slave participant 120 3 , cf. FIG. 1), likewise with an identifying data section 160 at its end (see second transmission TX 2).
  • the third slave subscriber 120 2 performs the same steps as the second slave subscriber 120i by selecting the characterizing data section 160 from one of the first or second predetermined data sections V1, V2 and sending it after the second data section D2.
  • the diagram of FIG. 6 shows a further variant of the method, which can be carried out in the form of a telegram 150 that is too short when a length error is present.
  • the second slave participant 120i terminates the transmission of the telegram 150 to the next or third slave participant 120 2 by the second slave participant 120i adding an identifying data section after the second data section D2 160 sends and then completes the sending of the telegram 150 by sending the EOF field 152 (cf. first sending TX 1).
  • the first error error counter 130 is incremented, as is, if necessary, a further error counter 132 of the second slave user 120i relating to a length error (shortened telegram 150).
  • the characteristic data section 160 is determined by performing a predetermined calculation.
  • the second slave participant 120i calculates a fictitious valid test value C including the zeroth partial value C0, the first partial value C1, the second partial value C2 and the third partial value C3 for the further zeroths previously sent to the next or third participant 120 2 to n-th data sections D_0 to D_n.
  • the second slave subscriber 120i is based on sending a fictitious correct telegram 170, the end area of which would reproduce the valid check value C (cf. first check value calculation TX-CRC).
  • the second slave user 120i forms a third alternative value C3 'by applying a predetermined calculation algorithm (for example, inverting) to the third partial value C3.
  • This is sent as an identifying data section 160 or third data section D3, which here corresponds to the third alternative value C3 ', after the second data section D2 to the next or third slave user 120 2 .
  • the telegram 150 received from the next or third slave subscriber 120 2 has an end area 157 reproducing an invalid check value, comprising the zeroth data section DO, the first data section D1, the second data section D2 and the identifying data section 160, so that the telegram 150 can be recognized as faulty by the third slave user 120 2.
  • the telegram 150 for the third slave subscriber 120 2 is identified by the identifying data section 160 or the third data section D3, which here corresponds to the third alternative value C3 ', in a comprehensible manner for the third slave subscriber 120 2 as a consequential error .
  • the third slave participant 120 2 performs the same calculation as the second slave participant 120i before, by the third slave participant 120 2 adding a fictitious valid test value C with the zeroth partial value CO, the first partial value C1, the second partial value C2 and the third partial value C3 for the further zeroth to n-th data sections D_0 to D_n received by the third slave user 120 2.
  • the third slave subscriber 120 2 is based on receiving a fictitious correct telegram 170, the end area 157 of which would reproduce the correct check value C (cf. second check value calculation RX-CRC).
  • the third slave user 120 2 determines a third alternative value C3 'by applying the predefined calculation algorithm to the third partial value C3. If there is a match between the calculated and the received third alternative value C3 ', the third slave user 120 2 can recognize the identifier and consider the telegram 150 as a consequential error.
  • the subsequent error error counter 131 of the third slave user 120 2 is incremented.
  • FIG. 6 also shows that the third slave participant 120 2 sends the faulty telegram 150, also with an identifying data section 160 at its end, to the next slave participant 120 (last slave participant 120 3 , see FIG. 1) ( see second transmission TX 2).
  • the third slave user 120 2 carries out the same steps as the second slave user 120i, in that the characteristic data section 160 is determined by performing the specified calculation and sent after the second data section D2.
  • FIG. 7 shows the presence of a length error in the form of a telegram 150 that is too long.
  • FIG. 7 illustrates as an example that the second When receiving the telegram 150 after a third test value data section CRC3, slave subscriber 120i still receives (at least) one data section 155 instead of the EOF field 152, which is marked with a question mark in FIG.
  • the number of data sections 155 received is greater than the number of data sections 155 reproduced by the length information of the telegram 150.
  • the four data sections 155 which are located in front of the data section 155 marked with the question mark, are the zeroth test value data section CRCO, first check value data section CRC1, second check value data section CRC2 and third check value data section CRC3 shown.
  • the four check value data sections CRCO, CRC1, CRC2, CRC3 are treated by the second slave user 120i as end area 157 and are thus interpreted as check values in relation to the previous further zeroth to nth data sections D_0 to D_n. This is because if there were no length errors, the four test value data sections CRCO, CRC1, CRC2, CRC3 would form the last data sections 155 of the telegram 150.
  • the four correct test value data sections CRCO, CRC1, CRC2, CRC3 are therefore already transmitted to the next or third slave user 120 2 , which reflect the absence of errors in the other zeroth to nth data sections D_0 to D_n previously sent.
  • the second slave subscriber 120i After the length error has been determined, the second slave subscriber 120i therefore sends an identifying data section 160 following the third check value data section CRC3 and then the EOF field 152 to the next or third slave subscriber 120 2 . Furthermore, the first error error counter 130 is incremented and, if necessary, a further error counter 132 of the second slave user 120i relating to a length error (telegram 150 that is too long).
  • the characteristic data section 160 is selected from a first predetermined data section V1 and a second predetermined data section V2.
  • the telegram 150 sent by the second slave subscriber 120i to the next or third slave subscriber 120 2 and received by the latter has a first test value data section CRC1, the second test value data section CRC2, and the third test value data section CRC3 and end area 157 comprising the characterizing data section 160 (cf. first transmission TX 1 and second reception RX 2).
  • the check value reproduced by the end area 157 relates to the preceding data sections 155, ie in the present case the data sections 155 proceeding from the further zeroth data section D_0 to the zeroth check value data section CRCO.
  • the second slave participant 120i dials, analogous to the description above, one of the two predetermined data sections V1, V2. This is done in such a way that the next or third slave subscriber 120 2 receives an end area 157 relating to the further zeroth data section D_0 to zeroth check value data section CRCO, which reproduces an invalid check value or which is invalid and is as large as possible reproduces a test value different from a valid test value.
  • the telegram 150 received from the next or third subscriber 120 2 has an end area 157 reproducing an invalid check value, comprising the check value data section CRC1, the check value data section CRC2, the check value data section CRC3 and the identifying data section 160, see above that the telegram 150 can be recognized as faulty by the third slave user 120 2.
  • the third slave user 120 2 can also recognize the presence of an error from the fact that the received telegram 150 is too long due to the additional characterizing data section 160 at its end.
  • the telegram 150 is also identified in a more recognizable manner for the third slave user 120 2 on the basis of the identifying data section 160, so that the erroneous telegram 150 is taken into account by the latter as a consequential error. This is done by incrementing the subsequent error error counter 131 of the third slave user 120 2 .
  • FIG. 7 also shows that the third slave participant 120 2 sends the faulty telegram 150 on to the next slave participant 120 (last slave participant 120 3 , cf. FIG. 1), likewise with an identifying data section 160 at its end (see second transmission TX 2).
  • the third slave subscriber 120 2 performs the same steps as the second slave subscriber 120i by selecting the characterizing data section 160 from one of the first or second predetermined data sections V1, V2 and sending it after the third check value data section CRC3 .
  • the diagram in FIG. 8 shows a further variant of the method which can be carried out in the form of a telegram 150 that is too long when a length error is present.
  • the second slave user 120i sends an identifying data section 160 and then the EOF field 152 to the next or third slave user 120 2 after the third check value data section CRC3 (cf. first transmission TX 1).
  • the first error error counter 130 is incremented and, if necessary, a further error counter 132 of the second slave participant 120i relating to a length error (telegram 150 that is too long).
  • the characteristic data section 160 is determined by performing a predetermined calculation.
  • the second slave subscriber 120i calculates a fictitious valid check value C including the zeroth partial value CO, the first partial value C1, the second partial value C2 and the third partial value C3 for data sections 155 previously sent to the next or third participant 120 2 comprising the further zeroth data section D_0 to zeroth test value data section CRCO.
  • the second slave user 120i is based on sending a fictitious correct telegram 170, the end area 157 of which would reproduce the valid check value C (cf. first check value calculation TX-CRC).
  • the second slave user 120i forms a third alternative value C3 'by applying a predefined calculation algorithm (for example inverting) to the third partial value C3.
  • the third alternative value C3 ' is sent as a characterizing data section 160 or third data section D3, which here corresponds to the third alternative value C3', after the third check value data section CRC3 to the next or third slave user 120 2 .
  • the telegram 150 received from the next or third subscriber 120 2 has an end area 157 reproducing an invalid check value, comprising the first check value data section CRC1, the second check value data section CRC2, the third check value data section CRC3 and the identifying data section 160, see above that the telegram 150 can be recognized as faulty by the third slave user 120 2.
  • the third slave user 120 2 can also recognize the presence of an error from the fact that the received telegram 150 is too long due to the additional characterizing data section 160 at its end.
  • the telegram 150 is for the third slave participant 120 2 further through the characterizing data section 160 or the third data section D3, which here corresponds to the third alternative value C3 ', in a comprehensible manner for the third slave participant 120 2 as follows-up errors marked.
  • the third slave participant 120 2 performs the same calculation as the second slave participant 120i before, by the third slave participant 120 2 adding a fictitious valid test value C with the zeroth partial value C0, the first partial value C1, the second partial value C2 and the third partial value C3 for the data sections 155 received by the third slave user 120 2 comprising the further zeroth data section D_0 to the zeroth check value data section CRCO.
  • the third slave user 120 2 is based on receiving a fictitious correct telegram 170, its end area 157 would reproduce the correct check value C (cf. second check value calculation RX-CRC).
  • the third slave user 120 2 determines a third alternative value C3 'by applying the predefined calculation algorithm to the third partial value C3. If the calculated and received third alternative values C3 'match, the third slave user 120 2 can recognize the identifier and consider the telegram 150 as a consequential error. For this purpose, the subsequent error error counter 131 of the third slave subscriber 120 2 is incremented.
  • FIG. 8 also shows that the third slave participant 120 2 sends the faulty telegram 150 on to the next slave participant 120 (last slave participant 120 3 , see FIG. 1), likewise with an identifying data section 160 at its end (see second transmission TX 2).
  • the third slave subscriber 120 2 performs the same steps as the second slave subscriber 120i by defining the characterizing data section 160 by performing the specified calculation and sending it after the third check value data section CRC3.
  • An occurrence of an error can furthermore consist in the fact that a slave subscriber 120 receives a number of data sections 155 corresponding to the length information when receiving a telegram 150 containing length information, but there is a check value error in the form of an invalid check value.
  • the diagram of FIG. 9 illustrates the presence of such a check value error.
  • the second slave user 120i receives a telegram 150 in which the end area 157 comprising the four check value data sections CRC0, CRC1, CRC2, CRC3 reproduces a check value which is derived from one of the preceding further zeroth to nth data sections D_0 to D_n specified or associated with this expected test value deviates.
  • the second slave participant 120i After the test value error has been determined, which the second slave participant 120i can perform based on a comparison of the aforementioned test values, the second slave participant 120i therefore sends an identifying data section 160 following the second test value data section CRC2 and then the EOF field 152 to the next or third slave participant 120 2 .
  • the first error error counter 130 is incremented and, if applicable, a further error counter 132 of the second slave subscriber 120i relating to a test value error.
  • the characteristic data section 160 is selected from a first predetermined data section V1 and a second predetermined data section V2.
  • the telegram 150 sent by the second slave subscriber 120i to the next or third slave subscriber 120 2 and received by the latter has a zeroth test value data section CRCO, the first test value data section CRC1, the second test value data section CRC2 and end area 157 comprising the characteristic data section 160 (cf. first transmission TX 1 and second reception RX 2).
  • the test value reproduced by the end area 157 relates to the preceding further zeroth to n-th data sections D_0 to D_n.
  • the second slave subscriber 120i selects, analogously to the description above, one of the first or second predetermined data sections V1, V2, to the effect that the next or third slave subscriber 120 2 addresses the further zeroth to
  • the end area 157 relating to the nth data sections D_0 to D_n is received, which reproduces an invalid test value or which reproduces an invalid test value which differs as much as possible from a valid test value.
  • the telegram 150 received from the next or third subscriber 120 2 therefore has an end area 157 reproducing an invalid check value, comprising the zeroth check value data section CRCO, the first check value data section CRC1, the second check value data section CRC2 and the identifying data section 160, so that the telegram 150 from the third slave subscriber 120 2 can be recognized as faulty. Due to the identifying data section 160, the telegram 150 is also identified in a more recognizable manner for the third slave user 120 2 , so that the telegram 150 is taken into account by the third slave user 120 2 as a consequence of an error. This is done by incrementing the subsequent error error counter 131 of the third slave user 120 2 .
  • FIG. 9 further shows that the third slave participant 120 2 sends the faulty telegram 150 on to the next slave participant 120 (last slave participant 120 3 , cf. FIG. 1), likewise with an identifying data section 160 at its end (see second transmission TX 2).
  • the third slave subscriber 120 2 performs the same steps as the second slave subscriber 120i by selecting the identifying data section 160 from one of the first or second predetermined data sections V1, V2 and sending it after the second check value data section CRC2 .
  • the diagram of FIG. 10 shows a further variant of the method which, when a known and correct telegram length is present and a test value error is present, in Can be considered.
  • the second slave user 120i sends an identifying data section 160 and subsequently the EOF field 152 to the next or third slave user 120 2 following the second check value data section CRC2.
  • the first error error counter 130 and, if applicable, a further error counter 132 of the second slave user 120i relating to a test value error are incremented.
  • the characteristic data section 160 is determined by performing a predetermined calculation.
  • the second slave subscriber 120i calculates a fictitious valid test value C including the zeroth partial value CO, the first partial value C1, the second partial value C2 and the third partial value C3 for further zeroth to previously sent to the next or third participant 120 2 n-th data sections D_0 to D_n.
  • the second participant 120i is based on a transmission of a fictitious correct telegram 170, the end area 157 of which would reproduce the valid test value C (cf. first test value calculation TX-CRC).
  • the second slave user 120i forms a third alternative value C3 'by applying a predetermined calculation algorithm (for example, inverting) to the third partial value C3.
  • the third alternative value C3 ' is sent as an identifying data section 160 or third check value data section CRC3, which here corresponds to the third alternative value C3', after the second check value data section CRC2 to the next or third slave user 120 2 .
  • the telegram 150 received from the next or third subscriber 120 2 has an end area 157 which reproduces an invalid check value and which comprises the zeroth check value data section CRCO, the first check value data section CRC1, the third check value data section CRC2 and the identifying data section 160 .
  • the telegram 150 for the third slave subscriber 120 2 is also provided by the identifying data section 160 or the third check value data section CRC3, which here corresponds to the third alternative value C3 ' corresponds, identified in a comprehensible manner for the third slave user 120 2 as follow-up errors.
  • the third slave participant 120 2 performs the same calculation as the second slave participant 120i before, by the third slave participant 120 2 adding a fictitious valid test value C with the zeroth, first, second and third partial values CO, C1, C2 , C3 is calculated for the further zeroth to n-th data sections D_0 to D_n received from the third slave user 120 2.
  • the third slave user 120 2 is based on receiving a fictitious correct telegram 170, the end area 157 of which would reproduce the correct check value C (cf. second check value calculation RX-CRC).
  • the third slave user 120 2 determines a third alternative value C3 'by applying the predefined calculation algorithm to the third partial value C3.
  • the third slave user 120 2 can recognize the identifier and consider the telegram 150 as a consequential error. For this purpose, the subsequent error error counter 131 of the third slave subscriber 120 2 is incremented.
  • FIG. 10 also shows that the third slave participant 120 2 sends the faulty telegram 150 on to the next slave participant 120 (last slave participant 120 3 , see FIG. 1), likewise with an identifying data section 160 at its end (see second transmission TX 2).
  • the third slave participant 120 2 performs the same steps as the second slave participant 120i, in that the characterizing data section 160 is determined by means of the specified calculation and sent after the second check value data section CRC2.
  • the telegrams 150 do not contain any length information.
  • its end area 157 can correspondingly reproduce an invalid and thus an error indicating test value, so that a test value error is present.
  • the diagram in FIG. 11 shows the presence of such a test value error.
  • the second slave subscriber 120i receives a telegram 150 in which the end area 157 comprising the four check value data sections CRC0, CRC1, CRC2, CRC3 reproduces a check value which is derived from one of the preceding further zeroth to nth data sections D_0 to D_n specified or associated with this expected test value deviates. Since the telegram 150 does not contain any length information, the second slave user 120i can only detect the check value error when the EOF field 152 is received determine.
  • the second slave user 120i can only determine the telegram end, and thus the end area 157 comprising the four check value data sections CRCO, CRC1, CRC2, CRC3, using the EOF field 152.
  • the second slave participant 120i sends an identifying data section 160 and then the EOF field 152 to the next or third slave participant 120 2 following the second test value data section CRC2.
  • the first error error counter 130 and, if necessary, a further error counter 132 of the second slave participant 120i relating to a test value error are incremented.
  • the characteristic data section 160 is selected from a first or second predetermined data section V1 or V2.
  • the telegram 150 sent by the second slave subscriber 120i to the next or third slave subscriber 120 2 has an end area 157 comprising the zeroth, first and second check value data sections CRCO, CRC1, CRC2 and the identifying data section 160 (cf. first transmission TX 1 and first reception RX 2).
  • the test value reproduced by the end area 157 relates to the further zeroth to n-th data sections D_0 to D_n.
  • the second slave subscriber 120i selects one of the two specified data sections V1, V2 to the effect that the next or third subscriber 120 2 receives an end area 157 which reproduces an invalid test value or which represents an invalid test value reproduces a test value that differs as much as possible from a valid test value.
  • the telegram 150 received from the next or third subscriber 120 2 has an end area 157 reproducing an invalid check value, so that the telegram 150 can be recognized as faulty by the third slave subscriber 120 2. Due to the identifying data section 160, the telegram 150 is also identified in a more recognizable manner for the third slave user 120 2 , so that the telegram 150 is taken into account by the third slave user 120 2 as a consequential error. This is done by incrementing the subsequent error error counter 131 of the third slave subscriber 120 2 .
  • FIG. 11 also shows that the third slave participant 120 2 forwards the faulty telegram 150, likewise with an identifying data section 160 at its end, to the next slave participant 120 (last slave participant 120 3 , see FIG. 1) (cf. second transmission TX 2).
  • the third slave participant 120 2 performs the same here Steps through like the second slave subscriber 120i, in that the characterizing data section 160 is selected from one of the first or second predetermined data sections V1, V2 and sent after the second check value data section CRC2.
  • the diagram in FIG. 12 shows a further variant of the method, which can be considered if the telegram length is unknown and a test value error is present.
  • the second slave participant 120i sends an identifying data section 160 after the second test value data section CRC2 and then the EOF field 152 to the next or third slave participant 120 2 .
  • the first error error counter 130 is incremented and, if applicable, a further error counter 132 of the second slave participant 120i relating to a test value error.
  • the characteristic data section 160 is determined, as in the variant of FIG. 10, by performing a predetermined calculation.
  • the second slave participant 120i calculates a fictitious valid test value C including the zeroth, first, second and third partial values C0, C1, C2,
  • the second slave user 120i is based on sending a fictitious correct telegram 170, the end area 157 of which would reproduce the valid check value C (cf. first check value calculation TX-CRC). Furthermore, the second slave user 120i forms a third alternative value C3 'by applying a predefined calculation algorithm (for example, inverting) to the third partial value C3. This is sent as an identifying data section 160 or third check value data section CRC3, which here corresponds to the third alternative value C3 ', after the second check value data section CRC2 to the next or third slave user 120 2 .
  • a predefined calculation algorithm for example, inverting
  • the telegram 150 received from the next or third slave user 120 2 has an end area 157 which reproduces an invalid check value and which includes the zeroth, first and second check value data sections CRC0, CRC1, CRC2 and the identifying data section 160.
  • the telegram 150 can be recognized as faulty by the next or third slave user 120 2.
  • Telegram 150 for third slave subscriber 120 2 is also identified in a comprehensible manner for third slave subscriber 120 2 as a consequential error by identifying data section 160 or third check value data section CRC3, which here corresponds to third alternative value C3 ' .
  • the third slave participant 120 2 performs the same calculation as previously the second slave participant 120i, by the third participant 120 2 adding a fictitious valid test value C with the zeroth, first, second, third partial value CO, C1, C2, C3 for the further zeroth to n-th data sections D_0 to D_n received by the third slave user 120 2 are calculated.
  • the third slave user 120 2 is based on receiving a fictitious correct telegram 170, the end area 157 of which would reproduce the correct check value C (cf. second check value calculation RX-CRC).
  • the third slave user 120 2 determines a third alternative value C3 'by applying the predefined calculation algorithm to the third partial value C3. If the calculated and the received third alternative value C3 'match, the third participant 120 2 can recognize the identifier and consider the telegram 150 as a consequential error. For this purpose, the subsequent error error counter 131 of the third participant 120 2 is incremented.
  • FIG. 12 also shows that the third slave participant 120 2 forwards the faulty telegram 150, likewise with an identifying data section 160 at its end, to the next slave participant 120 (last slave participant 120 3 , see FIG. 1) (cf. second transmission TX 2).
  • the third slave participant 120 2 performs the same steps as the second slave participant 120i by defining the identifying data section 160 as stated above and sending CRC2 after the second test value data section.
  • a possible modification is, for example, to use only first error error counters 130 and possibly error counters 132 relating to error types and no subsequent error error counters 131 or to use slave participants 120 which first error error counters 130 and possibly error counters relating to error types 132 and do not have any subsequent error error counters 131.
  • a subscriber 120 can take into account a marked telegram 150 as a subsequent error in that the associated first error error counter 130 is not incremented. If there is no identification, the first error error counter 130 can be incremented as indicated above.
  • the communication network 100 shown in FIG. 1, on the basis of which the method was described, merely represents one possible exemplary embodiment. Deviating from this, other configurations can come into consideration which, for example, have a different number of slave users 120 and / or a different structure, for example a multiple ring structure.
  • the communication network 100 can also be an Ethernet-based system with a configuration that deviates from the description above, for example with a different transmission rate. For example, a transmission rate of 100 Mbit / s is possible.
  • a 4B / 5B coding can be used here, i.e. 4-bit data units are transmitted encoded as 5-bit data units.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)
  • Maintenance And Management Of Digital Transmission (AREA)
  • Computer And Data Communications (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

L'invention porte sur un procédé d'exploitation d'un réseau de communication. Le réseau de communication comprend une pluralité d'abonnés. Dans le réseau de communication, un échange de données entre les abonnés est réalisé sous la forme de télégrammes qui comprennent une pluralité de parties de données. Les abonnés interprètent une région d'extrémité des télégrammes en tant que valeur d'essai pour surveiller la précision des parties de données précédentes des télégrammes. Les télégrammes sont traités lors de leur transfert par l'intermédiaire des abonnés, de sorte que les télégrammes sont reçus par les abonnés et, pendant le processus de réception, sont transmis à l'abonné correspondant le plus proche. Si une erreur est détectée dans le télégramme lors de sa réception, les abonnés envoient le télégramme en question à l'abonné le plus proche conjointement avec une partie de données d'identification du télégramme à son extrémité, et ainsi, le télégramme envoyé à l'abonné le plus proche comprend une région d'extrémité qui représente une valeur de test non valide. Grâce à la partie de données d'identification, qui est un élément de la région d'extrémité du télégramme, le télégramme est identifié pour l'abonné le plus proche de telle sorte que le télégramme ne doit pas être considéré comme une erreur initiale, mais plutôt comme une erreur de séquence. L'invention concerne également un réseau de communication et un abonné d'un réseau de communication.
EP20780630.8A 2019-09-24 2020-09-23 Procédé d'exploitation d'un réseau de communication, réseau de communication et abonnés d'un réseau de communication Active EP3987697B1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE102019125693.3A DE102019125693A1 (de) 2019-09-24 2019-09-24 Verfahren zum Betreiben eines Kommunikationsnetzwerks, Kommunikationsnetzwerk und Teilnehmer für ein Kommunikationsnetzwerk
PCT/EP2020/076564 WO2021058561A1 (fr) 2019-09-24 2020-09-23 Procédé d'exploitation d'un réseau de communication, réseau de communication et abonnés d'un réseau de communication

Publications (2)

Publication Number Publication Date
EP3987697A1 true EP3987697A1 (fr) 2022-04-27
EP3987697B1 EP3987697B1 (fr) 2022-08-24

Family

ID=72659205

Family Applications (1)

Application Number Title Priority Date Filing Date
EP20780630.8A Active EP3987697B1 (fr) 2019-09-24 2020-09-23 Procédé d'exploitation d'un réseau de communication, réseau de communication et abonnés d'un réseau de communication

Country Status (5)

Country Link
US (1) US12101258B2 (fr)
EP (1) EP3987697B1 (fr)
CN (1) CN114051702B (fr)
DE (1) DE102019125693A1 (fr)
WO (1) WO2021058561A1 (fr)

Family Cites Families (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1868109A1 (fr) * 2006-06-12 2007-12-19 Siemens Aktiengesellschaft Signalisation d'évènement entre des modules périphériques et une unité de traitement
DE102007016917B4 (de) * 2007-04-05 2009-12-17 Phoenix Contact Gmbh & Co. Kg Verfahren sowie System zur sicheren Übertragung von zyklischen zu übertragenden Prozessdaten
DE502007002941D1 (de) * 2007-08-23 2010-04-08 Siemens Ag Verfahren zur Datenübertragung
DE102009050767B4 (de) * 2009-10-27 2017-06-14 Siemens Healthcare Gmbh Verfahren und Vorrichtung zur Datenübertragung
DE102010003448A1 (de) * 2010-03-30 2011-10-06 Beckhoff Automation Gmbh Adressierungsverfahren und Kommunikationsnetzwerk mit einem solchen Adressierungsverfahren
EP2400682B1 (fr) * 2010-06-23 2013-04-17 Robert Bosch GmbH Procédé et dispositif pour modifier une somme de vérification et identifier la somme de vérification modifiée
DE102011082969B4 (de) * 2011-09-19 2015-04-30 Siemens Aktiengesellschaft Verfahren zum Betreiben eines Kommunikationsnetzwerkes und Netzwerkanordnung
US8902922B2 (en) * 2012-01-05 2014-12-02 Texas Instruments Incorporated Unified programmable interface for real-time Ethernet
DE102012224024A1 (de) 2012-12-20 2014-06-26 Robert Bosch Gmbh Datenübertragung unter Nutzung eines Protokollausnahmezustands
WO2016110326A1 (fr) * 2015-01-08 2016-07-14 Siemens Aktiengesellschaft Procédé et dispositif de transmission de données dans un réseau de données avec au moins deux modes de transmission avec fragmentation
ES2951001T3 (es) * 2019-07-11 2023-10-17 Inventio Ag Procedimiento y red de datos para comunicar contenido de datos, en particular en una instalación de ascensor

Also Published As

Publication number Publication date
US12101258B2 (en) 2024-09-24
US20220103485A1 (en) 2022-03-31
CN114051702B (zh) 2023-01-24
EP3987697B1 (fr) 2022-08-24
WO2021058561A1 (fr) 2021-04-01
CN114051702A (zh) 2022-02-15
DE102019125693A1 (de) 2021-03-25

Similar Documents

Publication Publication Date Title
EP2160857B1 (fr) Procédé de contrôle et circuit électronique de transmission série sécurisée de données
EP3977682B1 (fr) Dispositif de test de détection d'erreur pour une station d'abonné d'un système de bus série et procédé de test de mécanismes de détection d'erreur lors d'une communication dans un système de bus série
WO2009124780A1 (fr) Procédé, système et coupleur de bus pour l'échange de données entre un réseau de recouvrement et un réseau sous-jacent
EP2695075A1 (fr) Procédé et dispositif d'augmentation de la capacité de transmission de données dans un système de bus sériel
WO2012146631A1 (fr) Procédé et dispositif de transmission de données sérielle adaptée à la capacité mémoire
WO2016034349A1 (fr) Procédé de transmission série d'une trame par un système de bus d'un émetteur à au moins un récepteur et station abonnée pour un système de bus
EP1802019A1 (fr) Détection d'erreurs lors de la transmission de données
DE10361194B4 (de) Sicherheitsnetzwerk mit Phantomadressinformation
EP1686732B1 (fr) Procédé et système de transmission d'unités de données de protocole
DE19547000C2 (de) Kommunikationssteuerverfahren und Kommunikationsvorrichtung
DE10318068A1 (de) Verfahren und Vorrichtung zum Paket-orientierten Übertragen sicherheitsrelevanter Daten
DE102010028485B4 (de) Verfahren und Vorrichtung zur Absicherung von über eine Schnittstelle zu übertragenden Datenpaketen
EP2829011A1 (fr) Procédé et dispositif de génération de paquets de données redondants protégés par cryptographie
DE102012110712A1 (de) Verfahren und System zur Funktionsprüfung einer Fehlererkennungseinheit einer CAN-Bus-Controllereinheit
WO2021058561A1 (fr) Procédé d'exploitation d'un réseau de communication, réseau de communication et abonnés d'un réseau de communication
EP0977395B1 (fr) Méthode de transfert monocanal sécurisé de données entre les noeuds de calcul d'un réseau d'ordinateurs ainsi qu'un réseau d'ordinateurs et que des noeuds de calculs
EP1596517B1 (fr) Procédé de transmission sur un seul canal de données fournies sous forme redondante
EP2575282B1 (fr) Dispositif et procédé de réception d'un télégramme sécurisé
DE102010003741A1 (de) Verfahren zum Datenaustausch
DE69933719T2 (de) Kommunikationsverfahren mit verbesserter Empfangsquittierung
DE102009016972B4 (de) Kommunikationssystem zum dezentralen und autarken Überwachen und Steuern eines unterlagerten Bussystems
DE102013204891B4 (de) Verfahren zur Rekonstruktion von Messdaten
DE102005059021A1 (de) Eingebettetes System und Verfahren zum Betreiben eines eingebetteten Systems mit verbesserter Kennzeichnung von fehlerhaften ausgetauschten Signalen
WO2017032402A1 (fr) Système de communication et procédé de communication au moyen d'une séquence de télégrammes
EP2299616A1 (fr) Procédé et système de transmission de télégrammes

Legal Events

Date Code Title Description
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: UNKNOWN

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE

PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: GRANT OF PATENT IS INTENDED

17P Request for examination filed

Effective date: 20220118

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

INTG Intention to grant announced

Effective date: 20220414

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE PATENT HAS BEEN GRANTED

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

DAV Request for validation of the european patent (deleted)
DAX Request for extension of the european patent (deleted)
REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 502020001587

Country of ref document: DE

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

Free format text: LANGUAGE OF EP DOCUMENT: GERMAN

REG Reference to a national code

Ref country code: AT

Ref legal event code: REF

Ref document number: 1514407

Country of ref document: AT

Kind code of ref document: T

Effective date: 20220915

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG9D

REG Reference to a national code

Ref country code: NL

Ref legal event code: MP

Effective date: 20220824

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220824

Ref country code: RS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220824

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20221226

Ref country code: NO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20221124

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220824

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220824

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220824

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220824

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: PL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220824

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20221224

Ref country code: HR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220824

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20221125

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SM

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220824

Ref country code: RO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220824

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220824

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220824

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220824

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 502020001587

Country of ref document: DE

Ref country code: BE

Ref legal event code: MM

Effective date: 20220930

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220824

Ref country code: MC

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220824

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220824

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220923

Ref country code: AL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220824

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220923

26N No opposition filed

Effective date: 20230525

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: BE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220930

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: IT

Payment date: 20230930

Year of fee payment: 4

Ref country code: CH

Payment date: 20231001

Year of fee payment: 4

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220824

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220824

Ref country code: HU

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT; INVALID AB INITIO

Effective date: 20200923

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220824

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220824

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20240725

Year of fee payment: 5

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20240924

Year of fee payment: 5