EP0842472A1 - Verfahren zum betreiben eines datenübertragungssystems - Google Patents
Verfahren zum betreiben eines datenübertragungssystemsInfo
- Publication number
- EP0842472A1 EP0842472A1 EP96928333A EP96928333A EP0842472A1 EP 0842472 A1 EP0842472 A1 EP 0842472A1 EP 96928333 A EP96928333 A EP 96928333A EP 96928333 A EP96928333 A EP 96928333A EP 0842472 A1 EP0842472 A1 EP 0842472A1
- Authority
- EP
- European Patent Office
- Prior art keywords
- subscriber
- call
- subscribers
- telegram
- participants
- 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
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F13/00—Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
- G06F13/14—Handling requests for interconnection or transfer
- G06F13/36—Handling requests for interconnection or transfer for access to common bus or bus system
- G06F13/362—Handling requests for interconnection or transfer for access to common bus or bus system with centralised access control
- G06F13/3625—Handling requests for interconnection or transfer for access to common bus or bus system with centralised access control using a time dependent access
Definitions
- the invention relates to a method for operating a data transmission system according to the preamble of claim 1.
- Such a method for operating a data transmission system is already known from DE-OS 42 13 792.
- a data telegram (COP) called there by a subscriber who is in possession of the bus access right transfers several data for different other subscribers.
- Hardware coding by the user during commissioning, parameterization in the initialization phase or definition depending on the subscriber addresses are mentioned as options for determining this sequence.
- the direct mapping of the subscriber addresses to the time slot numbers is emphasized, so that the time slot, beginning at time t1, the subscriber with address 1, the time slot at t2 with address 2, etc. is assigned.
- the known method already improves the transmission speed, but it is not yet an optimal solution.
- the invention has for its object to find a method for operating a data transmission system with which the transmission speed is further increased.
- the invention has the advantage that the order of the responding participants is fixed in a time-optimized manner. For example, it cannot happen that a subscriber with a very short response time, because of a high subscriber address, has to wait for the transmission of his data until slow subscribers have reacted and have transmitted their data. Since the actual transmission times are often short compared to the internal processing time of a call telegram by the called subscriber, the time required for processing a call telegram to several other subscribers is determined by the reaction time of the slowest subscriber. In the calling subscriber, the occurrence of none, one or more response telegrams that arrive one after the other or overlap in time can be controlled.
- a method is specified with which in bus systems a subscriber can collect data from one or more subscribers simultaneously, a subscriber can distribute data to one or more subscribers at the same time, a subscriber can simultaneously distribute data to one or more subscribers and data from these Collect participants, a participant can determine the presence of other participants and a participant can query certain properties of other participants.
- severeal participants denotes a group of at least two and a maximum of all other connected participants.
- Figure 1 shows the time sequence of a transmission with successively arriving response telegrams
- Figure 2 shows a sequence with overlapping response telegrams.
- the positions of subscribers 1 ... 4 are represented by vertical lines and the transmission directions and times of telegrams by arrows next to a vertical time axis t.
- a calling subscriber 1 addresses a call telegram 5 to a number of other subscribers 2, 3 and 4, which arrives at these approximately simultaneously. Only those participants who meet a certain selection criterion, which will be explained later, feel addressed.
- the following responses to the call telegram 5 that can be determined for the calling subscriber 1 are possible in principle:
- the waiting time 6 begins to run at the calling subscriber 1, which is dimensioned such that the called subscribers 2 ... 4 can respond within this waiting time 6 if operation is error-free. If one or more answers arrive after this waiting time 6 has elapsed, this is interpreted as incorrect behavior by the participants 2, 3 or 4 concerned.
- the procedure can be carried out in the data access protocol (layer 2 of the 7-layer model) of the individual participants or in the application (in layers 3 ... 7).
- the reaction to the arrival of call or response telegrams must be determined in the specific individual case according to the respective needs.
- the reaction only after the waiting time 6 has elapsed, even if the reason for this already exists earlier. If e.g., if the method is handled entirely in the data access protocol, a request from the user can trigger the process, and after the waiting time 6, a reaction to the user can take place as confirmation.
- the impetus does not necessarily have to come from the user either.
- Call telegram 5 contains at least the following parts:
- Destination address (e.g. global address for addressing all connected subscribers).
- the selection criterion is used to select the addressed participants. It determines whether an individual subscriber, a group of subscribers or all subscribers are addressed and, if appropriate, which subscribers make up a group.
- a selection criterion can e.g. Legs
- Identifier for a certain access channel in the subscriber similar to an LSAP (Link Service Access Point) of the PROFIBUS, which is used there for multicast telegrams. Then all participants are addressed for whom the required function is activated on this access channel.
- the selection criterion is optional in the call telegram 5. If it is not broadcast, it must be known to participants 2, 3 and 4 in another way, e.g. B. by implicit determination.
- the execution instruction serves to communicate the desired reaction to the called participants.
- Examples of implementation regulations are: - collect data from multiple participants,
- the execution rule does not have to be sent in the call telegram 5.
- the transmitted data can be pure user data or can also contain components which contribute to the implementation of the described method. They are optional, e.g. For example, no data is transmitted in the call telegram in the first embodiment.
- the method is carried out according to the "immediate response" principle, i. that is, no other traffic takes place on the bus between the call telegram and the response telegram or the expiration of the waiting time 6.
- the required waiting time 6 can therefore be calculated if the reaction times of the called subscribers 2, 3 and 4 and the transmission times of the response telegrams are known. Repetitions of the telegram transmissions are e.g. B. due to transmission errors, possible.
- the reaction times of the called subscribers 2, 3 and 4 are indicated in FIG. 1 by vertical, dotted lines 7, 8 and 9, respectively.
- the answers of different called subscribers appear one after the other on the bus. This will do so ensures that for each called subscriber 2, 3 or 4, a time window 10, 11 or 12 is given in which he may answer. Gaps between time slots 10, 11 and 12 are allowed, but should not overlap.
- Each called subscriber 2, 3 and 4 must know his own time window 10, 11 and 12, but not the time window of other called subscribers. Outside the allocated time window, none of the called up participants may answer.
- the calling subscriber 1 does not have to know the individual time windows 10, 11 or 12, but the waiting time 6 for answers 13, 14 and 15, which must be large enough to enable all called subscribers to respond within this time.
- a list with the called subscribers 2, 3 and 4 can also be kept, e.g. B. to check whether all called participants have answered.
- the time windows 10, 11 and 12 must be configured and coordinated with one another for the individual case.
- the response times 7, 8 and 9 and the transmission times of the response telegrams 13, 14 and 15 must be taken into account. In general, they are to be selected so that the answering programs cannot overlap.
- the order of the time windows 10, 11 and 12 is determined by the reaction times 7, 8 and 9 of the called-up participants 2, 3 and 4, to which they are assigned.
- the first time window, here time window 10 is assigned to the called subscriber who has the shortest reaction time, in this case subscriber 2.
- the calling subscriber 1 sends a request to the other subscribers 2, 3 and 4 to return data and receives the desired data in the response telegrams 13, 14 and 15, respectively.
- the response telegrams must be sent one after the other respective time windows 10, 11 and 12 arrive so that they do not interfere with each other. A sequential query of individual participants is not necessary.
- a call telegram 1 is sufficient to query several subscribers.
- the call data 5 and the response telegrams 13, 14 and 15 contain the respective data.
- subscriber 1 sends a search request telegram 16 to all other subscribers 2, 3 and 4 according to FIG. 2, which may contain data indicating the searched subscriber feature.
- This allows participants to access features such. B. bus address, serial number, presence of a certain functionality, manufacturer, are checked. All participants who have this feature respond to the search request telegram 16.
- the answers can arrive one after the other or overlapping, depending on the type of search request. If the calling subscriber 1 z. B. wants to know whether none, one or more participants have a required property, e.g. B. to check for multiple existence of the same bus address, the Answers may be overlapping. This is illustrated in FIG. 2 for response telegrams 17 and 18 with an overlap area 19.
- the calling subscriber 1 z. B. wants to know how many subscribers are present on the bus with a certain property, for example for checking for a particular manufacturer, called subscribers 2, 3 and 4 in the assigned time windows 10, 11 and 12 according to FIG. 1 their response telegrams 13, 14 or 15 so that the number of responses can be clearly determined.
- the calling subscriber 1 sends a call telegram 5 to all other subscribers in order to determine their existence or functionality. All existing and functional subscribers, in this case subscribers 2, 3 and 4, respond with an acknowledgment as reply telegram 13, 14 or 15 to indicate this. The acknowledgments must arrive one after the other so that they do not interfere with each other and the calling subscriber 1 can distinguish between the individual response telegrams 13, 14 and 15. Time slots 10, 11 and 12 are therefore used. Since no individual calls are required for each individual subscriber in the method according to the invention for the creation of a subscriber image, the entire subscriber image is created at almost the same time. The subscriber image is consistent, since the response telegrams arrive in a very short period of time and the status of the subscribers can hardly change during this time, for example due to a new connection or failure of a subscriber.
- the call telegram 16 contains this bus address as a feature in the data field.
- the two participants 3 and 4 have the address 22 and therefore respond to the search request. All other participants answer Not. In this case, overlaps are permitted, since it is only of interest whether more than one participant answers. If overlaps are permissible, there must be a uniqueness criterion that is sent in the response telegrams and guarantees that the response telegrams of different called subscribers differ. It must therefore have the property that it is different for all participants involved. Examples of such uniqueness criteria are: serial number,
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Small-Scale Networks (AREA)
- Selective Calling Equipment (AREA)
Description
Claims
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
DE19528437A DE19528437A1 (de) | 1995-08-02 | 1995-08-02 | Verfahren zum Betreiben eines Datenübertragungssystems |
DE19528437 | 1995-08-02 | ||
PCT/DE1996/001390 WO1997005552A1 (de) | 1995-08-02 | 1996-07-25 | Verfahren zum betreiben eines datenübertragungssystems |
Publications (2)
Publication Number | Publication Date |
---|---|
EP0842472A1 true EP0842472A1 (de) | 1998-05-20 |
EP0842472B1 EP0842472B1 (de) | 1999-05-26 |
Family
ID=7768543
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP96928333A Expired - Lifetime EP0842472B1 (de) | 1995-08-02 | 1996-07-25 | Verfahren zum betreiben eines datenübertragungssystems |
Country Status (6)
Country | Link |
---|---|
US (1) | US6192036B1 (de) |
EP (1) | EP0842472B1 (de) |
AT (1) | ATE180585T1 (de) |
DE (2) | DE19528437A1 (de) |
ES (1) | ES2134633T3 (de) |
WO (1) | WO1997005552A1 (de) |
Families Citing this family (22)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6515967B1 (en) * | 1998-06-30 | 2003-02-04 | Cisco Technology, Inc. | Method and apparatus for detecting a fault in a multicast routing infrastructure |
EP0978776A1 (de) * | 1998-08-06 | 2000-02-09 | Siemens Aktiengesellschaft | Kommunikationsverfahren |
DE19843447A1 (de) * | 1998-09-22 | 2000-03-23 | Siemens Ag | Netzwerk sowie Koppelgerät zur Verbindung zweier Segmente in einem derartigen Netzwerk |
DE19909091A1 (de) * | 1999-03-02 | 2000-09-14 | Siemens Ag | Bussystem mit verbesserter Datenübertragungssicherheit |
JP3761814B2 (ja) * | 1999-08-02 | 2006-03-29 | 富士通株式会社 | 網側装置及び通信システム |
DE19939567B4 (de) | 1999-08-20 | 2007-07-19 | Pilz Gmbh & Co. Kg | Vorrichtung zum Steuern von sicherheitskritischen Prozessen |
CN1218231C (zh) * | 1999-09-14 | 2005-09-07 | 西门子公司 | 经过总线系统的串行数据传输 |
DE19946716A1 (de) * | 1999-09-29 | 2001-04-12 | Infineon Technologies Ag | Verfahren zum Betrieb eines Prozessorbusses |
KR100455030B1 (ko) * | 2001-07-16 | 2004-11-12 | 홍승호 | 프로피버스에서 실시간 데이터 전송을 위한 대역폭 할당방법 |
US7729267B2 (en) * | 2003-11-26 | 2010-06-01 | Cisco Technology, Inc. | Method and apparatus for analyzing a media path in a packet switched network |
US7738383B2 (en) * | 2006-12-21 | 2010-06-15 | Cisco Technology, Inc. | Traceroute using address request messages |
US7706278B2 (en) * | 2007-01-24 | 2010-04-27 | Cisco Technology, Inc. | Triggering flow analysis at intermediary devices |
US9137815B2 (en) * | 2009-06-17 | 2015-09-15 | Qualcomm Incorporated | Multi-user multiple input multiple output wireless communications |
US8774010B2 (en) | 2010-11-02 | 2014-07-08 | Cisco Technology, Inc. | System and method for providing proactive fault monitoring in a network environment |
US8559341B2 (en) | 2010-11-08 | 2013-10-15 | Cisco Technology, Inc. | System and method for providing a loop free topology in a network environment |
US8982733B2 (en) | 2011-03-04 | 2015-03-17 | Cisco Technology, Inc. | System and method for managing topology changes in a network environment |
US8670326B1 (en) | 2011-03-31 | 2014-03-11 | Cisco Technology, Inc. | System and method for probing multiple paths in a network environment |
US8724517B1 (en) | 2011-06-02 | 2014-05-13 | Cisco Technology, Inc. | System and method for managing network traffic disruption |
US8830875B1 (en) | 2011-06-15 | 2014-09-09 | Cisco Technology, Inc. | System and method for providing a loop free topology in a network environment |
US9450846B1 (en) | 2012-10-17 | 2016-09-20 | Cisco Technology, Inc. | System and method for tracking packets in a network environment |
CA3066775A1 (en) | 2017-10-16 | 2019-04-25 | Illumina, Inc. | Deep learning-based techniques for training deep convolutional neural networks |
US11861491B2 (en) | 2017-10-16 | 2024-01-02 | Illumina, Inc. | Deep learning-based pathogenicity classifier for promoter single nucleotide variants (pSNVs) |
Family Cites Families (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
DE3128706C2 (de) * | 1981-07-21 | 1985-11-14 | Horst Prof. Dr. 4790 Paderborn Ziegler | Fühleinheit zur Fernmesssung des Wärmeverbrauches an einer Mehrzahl von Verbrauchsstellen |
US4481572A (en) | 1981-10-13 | 1984-11-06 | Teledyne Industries, Inc. | Multiconfigural computers utilizing a time-shared bus |
CA1226638A (en) * | 1982-08-19 | 1987-09-08 | Mitsuji Takao | Data communication method |
US4595921A (en) * | 1983-08-11 | 1986-06-17 | Wang Laboratories, Inc. | Method of polling to ascertain service needs |
JPH0748739B2 (ja) * | 1988-12-09 | 1995-05-24 | 富士通株式会社 | 多重アクセス制御方法および該方法を実施する多重アクセス制御システム |
SE464946B (sv) * | 1989-11-10 | 1991-07-01 | Philips Norden Ab | Oeverfoeringssystem innefattande en fraagestation och ett antal svarsstationer |
DE4009685C2 (de) * | 1990-03-26 | 1994-10-20 | Siemens Nixdorf Inf Syst | Verfahren für einen Initialisierungsvorgang in einem Multiprozessorsystem |
EP0476175A1 (de) * | 1990-09-20 | 1992-03-25 | Siemens Aktiengesellschaft | Einrichtung zum Betrieb eines Mehrprozessorsystems, insbesondere einer numerischen Steuerung |
DE4213792A1 (de) | 1992-04-27 | 1993-10-28 | Siemens Ag | Verfahren zum Betreiben eines Datenübertragungssystems |
JP3251640B2 (ja) * | 1992-06-18 | 2002-01-28 | 株式会社東芝 | データ伝送方法とその装置 |
EP0581063A1 (de) * | 1992-07-27 | 1994-02-02 | Siemens Aktiengesellschaft | Verfahren zum Aufruf von Stationen anhand des Inhalts eines Adressenspeichers und Anordnung zur Durchführung des Verfahrens |
-
1995
- 1995-08-02 DE DE19528437A patent/DE19528437A1/de not_active Withdrawn
-
1996
- 1996-07-25 DE DE59602013T patent/DE59602013D1/de not_active Expired - Lifetime
- 1996-07-25 AT AT96928333T patent/ATE180585T1/de not_active IP Right Cessation
- 1996-07-25 WO PCT/DE1996/001390 patent/WO1997005552A1/de active IP Right Grant
- 1996-07-25 EP EP96928333A patent/EP0842472B1/de not_active Expired - Lifetime
- 1996-07-25 ES ES96928333T patent/ES2134633T3/es not_active Expired - Lifetime
- 1996-07-25 US US09/011,502 patent/US6192036B1/en not_active Expired - Fee Related
Non-Patent Citations (1)
Title |
---|
See references of WO9705552A1 * |
Also Published As
Publication number | Publication date |
---|---|
EP0842472B1 (de) | 1999-05-26 |
DE19528437A1 (de) | 1997-02-06 |
US6192036B1 (en) | 2001-02-20 |
ATE180585T1 (de) | 1999-06-15 |
WO1997005552A1 (de) | 1997-02-13 |
DE59602013D1 (de) | 1999-07-01 |
ES2134633T3 (es) | 1999-10-01 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP0842472A1 (de) | Verfahren zum betreiben eines datenübertragungssystems | |
EP2622826B1 (de) | Verfahren zur automatischen adressvergabe an gleichartige busteilnehmer | |
EP1309920B1 (de) | Adressvergabeverfahren für mindestens einen neu an ein bussystem angeschlossenen busteilnehmer | |
DE69634983T2 (de) | Verfahren und vorrichtung für ein hybrides wettbewerbs- und abfrageprotokoll | |
DE3041600C2 (de) | Verfahren und Schaltungsanordnung zum Übertragen von Datensignalen zwischen an Datenvermittlungseinrichtungen einer Datenvermittlungsanlage angeschlossenen Datensignalsendern und Datensignalempfängern | |
EP2503763B1 (de) | Verfahren zur vergabe von netzwerkadressen für ventilatoren | |
EP1020051A2 (de) | Verfahren und bussystem zur automatischen adressvergabe sowie in dieses system oder in dessen rahmen einfügbare telekommunikationsstationen | |
DE102004052075A1 (de) | Knoten für ein Bus-Netzwerk, Bus-Netzwerk und Verfahren zum Konfigurieren des Netzwerks | |
CH632365A5 (de) | Datenaustauschverfahren zwischen mehreren partnern. | |
DE19721740B4 (de) | Steuerungsverfahren für den Medienzugriff bei einem seriellen Bus | |
DE69434976T2 (de) | Rangadressenzuweiseung in einem modulsystem | |
DE102019114303B3 (de) | Verfahren zum Erfassen von Netzwerkteilnehmer in einem Automatisierungsnetzwerk und Automatisierungsnetzwerk | |
DE60206780T2 (de) | Netzwerkverbindungsvorrichtung, verbindungssystem und netzwerkverbindungsverfahren | |
EP2484058A1 (de) | Adressierungsverfahren und kommunikationsnetzwerk mit einem solchen adressierungsverfahren | |
EP0290894B1 (de) | Verfahren zum Verteilen von aktuellen Adressentabellen in "n" ringförmigen Netzen | |
WO1996005676A1 (de) | System zur überprüfung eines datenübertragungsnetzwerks | |
DE19547000A1 (de) | Kommunikationssteuerverfahren und Kommunikationsvorrichtung | |
EP1075110B1 (de) | Kombiniertes Master/Slave-Producer/Consumer-Kommunikations-verfahren für ein Netzwerk | |
EP1642207B1 (de) | Zuordnung von stationsadressen zu kommunikationsteilnehmern in einem bussystem | |
WO2003036879A1 (de) | Teilnehmergerät für ein hochperformantes kommunikationssystem | |
WO2005107173A1 (de) | Einrichtung zur adressvergabe in einem normierten feldbus-system | |
DE3620407A1 (de) | Verfahren und vorrichtung zur ringfoermigen nachrichtenuebertragung | |
DE102018123819A1 (de) | Bussystem zugehörige Busteilnehmervorrichtungen sowie Verfahren zum Ermitteln und Vermeiden von Adresskollisionen | |
DE10201319B4 (de) | Verfahren zur Datenübertragung und serielles Bussystem | |
EP1103022A1 (de) | Kommunikationsverfahren |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
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 |
|
17P | Request for examination filed |
Effective date: 19980121 |
|
AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AT BE CH DE ES FR GB IT LI NL |
|
GRAG | Despatch of communication of intention to grant |
Free format text: ORIGINAL CODE: EPIDOS AGRA |
|
17Q | First examination report despatched |
Effective date: 19980702 |
|
GRAG | Despatch of communication of intention to grant |
Free format text: ORIGINAL CODE: EPIDOS AGRA |
|
GRAH | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOS IGRA |
|
GRAH | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOS IGRA |
|
GRAA | (expected) grant |
Free format text: ORIGINAL CODE: 0009210 |
|
AK | Designated contracting states |
Kind code of ref document: B1 Designated state(s): AT BE CH DE ES FR GB IT LI NL |
|
REF | Corresponds to: |
Ref document number: 180585 Country of ref document: AT Date of ref document: 19990615 Kind code of ref document: T |
|
REG | Reference to a national code |
Ref country code: CH Ref legal event code: EP |
|
REG | Reference to a national code |
Ref country code: CH Ref legal event code: NV Representative=s name: SIEMENS SCHWEIZ AG |
|
REF | Corresponds to: |
Ref document number: 59602013 Country of ref document: DE Date of ref document: 19990701 |
|
ET | Fr: translation filed | ||
GBT | Gb: translation of ep patent filed (gb section 77(6)(a)/1977) |
Effective date: 19990705 |
|
ITF | It: translation for a ep patent filed |
Owner name: STUDIO JAUMANN P. & C. S.N.C. |
|
REG | Reference to a national code |
Ref country code: ES Ref legal event code: FG2A Ref document number: 2134633 Country of ref document: ES Kind code of ref document: T3 |
|
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 |
|
26N | No opposition filed | ||
REG | Reference to a national code |
Ref country code: GB Ref legal event code: IF02 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: NL Payment date: 20020715 Year of fee payment: 7 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: BE Payment date: 20020719 Year of fee payment: 7 |
|
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: 20030731 |
|
BERE | Be: lapsed |
Owner name: *SIEMENS A.G. Effective date: 20030731 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: NL Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20040201 |
|
NLV4 | Nl: lapsed or anulled due to non-payment of the annual fee |
Effective date: 20040201 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: IT Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20050725 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: ES Payment date: 20080827 Year of fee payment: 13 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: AT Payment date: 20080613 Year of fee payment: 13 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: CH Payment date: 20081016 Year of fee payment: 13 |
|
REG | Reference to a national code |
Ref country code: CH Ref legal event code: PCAR Free format text: SIEMENS SCHWEIZ AG;INTELLECTUAL PROPERTY FREILAGERSTRASSE 40;8047 ZUERICH (CH) |
|
REG | Reference to a national code |
Ref country code: CH Ref legal event code: PL |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: LI Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20090731 Ref country code: CH Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20090731 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: AT Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20090725 |
|
REG | Reference to a national code |
Ref country code: ES Ref legal event code: FD2A Effective date: 20090727 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: ES Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20090727 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: FR Payment date: 20110801 Year of fee payment: 16 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: DE Payment date: 20110919 Year of fee payment: 16 Ref country code: GB Payment date: 20110720 Year of fee payment: 16 |
|
GBPC | Gb: european patent ceased through non-payment of renewal fee |
Effective date: 20120725 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: ST Effective date: 20130329 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: GB Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20120725 Ref country code: FR Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20120731 Ref country code: DE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20130201 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R119 Ref document number: 59602013 Country of ref document: DE Effective date: 20130201 |