DE19952883A1 - Bus system for multiple users in which one user transmits its address via bus and informs other users of change of state - Google Patents

Abstract

Several users (2,3,4) are connected to a bus line (5) of the bus system (1). When one user makes use of the bus system, this change of state is detected by the remaining users. In order to allocate unique addresses (16,17,18) to the users, they are sequentially activated, so that an activated user (2 or 3) takes the first free or the next available address in a predefined sequence of addresses. This user transmits its address and data via the bus to the other users and informs them that this address is occupied, or informs them of the last valid user status. After a certain rest period (29), the first activated user begins sending its address and data again.

Description

The invention relates to a bus system as defined in claims 1 and 22 and a method for configuration as well as an addressing method for a bus system as set out in claims 21 and 37.

There are already various serial bus systems, such as. B. CAN, I ² C, Profibus and the like. With these bus systems, the respective bus subscriber must be assigned a fixed address. This is realized by a corresponding setting of switches, jumpers or by fixed programming in the program instructions to be processed by the participants or in the memory devices assigned to them. The disadvantage here is that subsequent expansions of the bus system are difficult to perform.

The present invention has for its object the address assignment or Simplify address assignment to bus-capable participants or target determination or improve addressing of data to a designated subscriber.

This object of the invention is achieved by the features of claim 1. she is independent of this but also by a method according to the in claim 21 given characteristics solved.

The he by the features of the characterizing part of claim 1 or 21 giving advantage is that the address assignment is almost fully automated is carried out and takes place with extremely high reliability. By the own Address assignment of a subscriber connected to the bus is namely the danger double addressing, as was previously the case with manual address assignment was possible by a service technician in case of carelessness, is now excluded sen. This also means keeping electronic tables or listing in paper form and, above all, the maintenance of these lists to guarantee of the current technical status in the bus system. It is also advantageous that now there are gaps in the address assignment, as has been the result of ignorance about already assigned addresses could occur again and again, due to the automatic Address assignment can be eliminated and thus always the maximum number of parts can be connected to the bus without any problems. Especially belong there through trial runs with different addresses to determine a free one Address of the past. Another significant advantage is that not only is the commissioning of the bus system simplified, but also in service if a substantial relief is achieved. Due to the defined rest period on The bus can automatically switch itself into new participants connected to the bus system integrate the bus system and work immediately according to the bus protocol. It is therefore not absolutely necessary to remove the bus system for an expansion switch and start again because the added participant may follow deliberate initiation of address assignment fully automatically at the end of the last one Address sequence is enqueued. Likewise, when replacing a z. B. defective Participant the new participant after initiation of the address allocation procedure auto the gap in the address sequence by adopting the missing address lift so that there is again a continuous address sequence without a service technician the address of the exchanged participant.

Further advantageous designs and measures are set out in claims 2 to 20  described. The advantages that can be achieved with this are the detailed description of the figures refer to.

The object of the invention is particularly independent by the features of claim 22 or 37 solved.

Which result from the combination of features of the characterizing part of claim 22 or 37 resulting advantages are that a participant sending a data packet determine in a simple manner via the start address to be output by this which of the remaining participants in the bus system can use the data packet has or for which of the other participants the data before transmission package is determined. Another major advantage is that the review, whether the data packet received by a participant is the destination address or the Be has reached the venue, can take place particularly quickly and unmistakably. Ins In particular, the limit-related labeling can determine whether the data packet is for the respective participant is determined, a takeover or Ver evaluation of the data packet, for example in the manner of the existence of the limit value initiated interrupt routine. Another major advantage lies in the fact that none of the participants has a fixed address for the remaining participants is present and in particular none of the participants has a predefined address must, so that an elaborate address assignment is unnecessary. Because it's just required that the individual participants to transmit a data packet to egg NEN recognize other participants, how many upstream or downstream Participants the data packet to the intended upstream or downstream switched participants is to be handed over. According to these conditions, the each participant, the start address in such a way that by the predefined ned change of the start address by the upstream or downstream participants the address field at the intended destination address predefined for the bus system Has limit. A significant benefit is achieved in that the individual no fixed address has to be assigned to subscribers, which means especially with great advantages can be achieved during commissioning and servicing. Furthermore can the bus-capable participants by eliminating switches, jumpers or other plug or switching devices smaller or simpler and relatively expensive be built cheaply.

Further advantageous developments are described in claims 23 to 36. The The achievable advantages can be found in the detailed description of the figures.

The invention is described below with reference to that shown in the drawings Exemplary embodiments explained in more detail.

Show it:

Figure 1 shows the structure of a bus system and an exemplary sequence for the auto matic address assignment by the bus system, in highly simplified schematic representation.

2 is a block diagram of a further bus system with an exemplary ge selected data transfer to a directly adjacent subscriber or a subscriber of time.

Fig. 3, the bus system with other embodiments, a data transmission to one or to two upstream participants of time;

Fig. 4 shows the bus system with another exemplary data transmission from a host computer across two participants.

In the introduction it should be noted that in the differently described execution form the same parts with the same reference numerals or the same component designations provided with the disclosures contained throughout the description analogously to the same parts with the same reference numerals or the same component drawings can be transferred. Also are those chosen in the description Location information, such as B. upstream or downstream of the immediately described plane as well as shown figure and are analogous to a change in position to transfer the new location. Furthermore, individual features or feature com binations from the shown and described different execution examples len represent independent, inventive or inventive solutions.

In Fig. 1 the structure of a serial bus system 1 is shown in a highly simplified manner in the block diagram shown. The bus system 1 comprises a plurality of participants 2 , 3 , 4 , which are in electrical line connection via at least one bus line 5 of a bus 6 .

The bus 6 can include several data and / or address and / or control lines as well as voltage supply lines. It is also possible to use multiple use of the bus lines 5 for the transmission of data and / or addresses or control commands.

In particular, each participant 2 to 4 is connected via nodes 7 to 9 to the bus lines 5 of the bus 6 . Thus, when the bus 6 is used or subjected to electrical power by one of the participants 2 to 4, this change in state on the bus 6 can be detected simultaneously or directly by the other participants 2 to 4 , since a change in potential on at least one of the bus lines 5 is caused by the electrical connection of all participants 2 to 4 with this bus line 5 is present at the other participants 2 to 4 at the same time.

Communication between the individual bus-capable subscribers 2 takes place in accordance with a defined bus protocol, each of the subscribers 2 to 4 being able to comply with the corresponding bus protocol or to work in accordance with this. Further bus-capable participants can be switched to bus 6 at any time, the maximum number N of participants being determined by the bus protocol or by the number of available addresses. Likewise, at least one subscriber 2 to 4 can be removed from the bus 6 if required.

The expansion or removal or an exchange of participants 2 to 4 and the adjustment of the configuration parameters required thereby takes place automatically in the bus system 1 according to the invention. Likewise, the initial configuration of the bus system 1 can be carried out largely automatically.

The individual bus states depending on the time and depending on the configuration of the bus system 1 are illustrated in extracts in individual diagrams 10 to 13 . In the diagrams 10 to 13 , the ordinate shows the bus status, ie the high or low level on the corresponding bus lines. The abscissa shows the time t over which the bus states correspond to those shown Modify blocks 14 , 15 . The blocks 14 , 15 have different lengths and / or a different sequence of bus states, depending on the type of data to be transmitted via the bus 6 . The blocks 14, 15 veran show here that the bus 6, a certain block-wise sequence of high or Lowzuständen exists or of the individual subscribers 2 to 4 ge to the bus 6 is inserted.

An automatic configuration according to the invention of the bus system 1 and the corresponding operation of the bus system 1 is exemplified in the diagrams 10 to 13 .

According to diagram 10 in the original state or before the initial configuration, the participants 2 to 4 uniquely determining addresses 16 to 18 are deleted. Furthermore, none of the participants 2 to 4 is active on the bus 6 , as is shown in particular in diagram 10 . In this state, none of the nodes 2 to 4 is configured or, in this initial state, none of the nodes 2 to 4 has an address 16 to 18 before the initial configuration. Participants 2 to 4 are connected to bus 6 or are connected to bus 6 via nodes 7 to 9 in an electrical line connection. By activating a previously inactive subscriber 2 , the lowest free address 16 is assigned to this subscriber 2 . The lowest, free address for an initial configuration of the bus system is usually "1" or possibly "0". The activation of the participant 2 can, for. B. by pressing a A device 19 , such. B. by pressing a certain key 20 on the configu rating subscriber 2 . The further bus-capable subscribers 3 , 4 also preferably have corresponding input devices 19 or keys 20 .

Likewise, the activation of a participant 2 to 4 connected to the bus 6 can be carried out by activating or commissioning at least one sensor 21 , 22 connected to the respective participant 2 to 4 . The measured values recorded by the sensors 21 , 22 are to be transmitted to at least one further subscriber 2 to 4 in the bus system 1 for further processing or evaluation.

Furthermore, it is possible to initiate the largely automatic address assignment or address assignment by connecting a subscriber 2 to 4 to the bus 6 or to the electrical supply lines. The participants 2 to 4 are connected to the voltage-carrying supply lines, whereupon the automatic address assignment is started in a boot process.

The activation of a subscriber 2 to 4 on the bus 6 can also be carried out by all other methods known from the prior art. So z. B. for the activation of the participant 2 to 4, the processing of the corresponding Steuerpro program can be initiated. Following the activation of a specific participant 2 to 4 , this is then assigned a free address 16 to 18 by the processed control program. This address 16 to 18 is preferably formed by the lowest available address 16 to 18 . Likewise, it is also possible within the scope of the invention to assign the first activated subscriber the highest available address 16 to 18 or to proceed according to a different address sequence defined for each subscriber 2 to 4 .

If the first activated subscriber 2 is automatically assigned the first address 16 of the predefined address sequence via the control program or has been assigned to it automatically by activating the address assignment, then this sends the corresponding address 16 and possibly also the associated data 23 . All other subscribers 3 , 4 are thereby informed of the assignment of this address 16 . Furthermore, the other participants 3 , 4 are indirectly informed of the number of participants actively switched to the bus 6 .

Any other subscriber, for example the next subscriber 3 , is subsequently activated in accordance with one of the aforementioned methods and the next free address 17 is assigned to it in the address sequence. The activation of the next participant 3 can, for example, in turn be carried out manually by pressing a key and is then assigned to this participant 3, for example, an address 17 increased by the amount "1". This subscriber 3 also sends out its assigned address 17 , in the example shown the identifier “2” and possibly also the associated data 24 . In this way, the remaining participants 2 , 4 are informed of the assignment of address 17 .

Those at any later point in time, preferably manually activated by the commissioning or service personnel, subscriber 4 is then again assigned the next free address 18 in the defined address sequence. The last activated participant 4 sends his address 18 , illustrated in the exemplary embodiment shown by the variable "N" and possibly the corresponding data 25 , whereby the rest of the participants 2 , 3 is in turn informed of the latest address assignment.

This process of automatically accepting the next available address 16 to 18 in the address sequence by subscribers 2 to 4 and sending the accepted address is repeated for each subscriber 2 to 4 who is responsible for initiating the automatic address assignment by the operator. or service personnel has been specifically activated.

Individual data packets 26 to 28 consisting at least of the address 16 to 18 and the corresponding data 23 to 25 are preferably sent by the participants 2 to 4 in succession in accordance with the address sequence known to all participants 2 to 4 . That is, after sending the data packet 26 of the subscriber 2 with the address value "1", the subscriber with the next address according to the address sequence, in the example shown the subscriber 3 with the address value "2", puts the data packet 27 , including his address 17 and the associated data 24 , on the bus 6 .

After all activated subscribers 2 to 4 on bus 6 have placed their data packets 26 to 28 on bus 6 or received the corresponding data packets 26 to 28 in accordance with the sequence determined by the address sequence and no further active subscriber has switched to bus 6 there is a certain idle time 29 or a certain "timeout". This defined idle time 29 on bus 6 always begins at the end of the data packet output by the subscriber last activated for bus participation. After the predefined rest period 29 has elapsed, the subscriber 2 , who was activated first or which has the first address 16 in the address sequence, starts again with the transmission of his address 6 and corresponding data 23 .

In diagram 11 , only one participant, namely participant 2 with address value "1" is active on bus 6 , as can be seen from the occurrence of idle time 29 on bus 6 following the output of data 23 of participant 2 .

According to diagram 12 , two subscribers, namely subscribers 2 and 3 with the address values "1" and "2", are active after the rest period 29 has started after the sending of the last activated subscriber 3 with the address value "2".

According to diagram 13 , all "N" subscribers with address values "1", "2", "3" to "N" are active on bus 6 and send their data packets 26 to 28 in succession. After the last participant 4 or the last specifically activated participant 4 has sent its address 18 with the address value "N" and its associated data 25 , the specific idle time 29 on the bus 6 starts again. Subsequently, the first activated subscriber 2 with the address value "1" starts again with the sending of his address 16 and the corresponding data 23 .

A cycle duration 30 within which all participants 2 to 4 have put their data packets 26 to 28 on the bus 6 , including the idle time 29 following the bus occupancy by the last participant 4, is primarily based on the number of participants activated in the bus system 1 2 to 4 depending. The cycle duration 30 is therefore sometimes a measure of the availability of the bus 6 for each individual participant 2 to 4 .

During the time windows or time blocks with a transmission process of a particular subscriber 2 to 4 , at least one other subscriber 2 to 4 is set to receive at least one of the transmitted data packets 26 to 28 .

The idle time 29 is always greater than a time period 31 that a subscriber 2 to 4 needs to be able to switch to the bus sequence. In particular, the time duration 31 is greater than a response time of a new participant to be switched to the bus 6 . The time period 31 is thus chosen such that a participant manually activated for integration into the bus system 1 can output his independently assigned address via the bus 6 and thus can notify the remaining participants 2 to 4 of the assignment of this address or the remaining participants 2 to 4 the increase in the number of participants is announced. Basically, the idle time 29 is so dimensioned that a new subscriber to be connected to the bus 6 can preferably automatically integrate into the bus system 1 after the manual initiation of the address assignment procedure.

When the predefined idle time 29 on the bus 6 is reached or immediately after the predefined idle time 29 , a new cycle with the corresponding cycle duration 30 starts at the beginning of which the first addressed subscriber 2 or the subscriber to whom the first free address 16 was assigned once again sends his address 16 or source address and the corresponding data 23 . Alternatively or in combination, the transmission of a destination address and corresponding data 23 can also be started at the beginning of the subsequent cycle duration 30 .

The lowest available address 16 in the predetermined address sequence is preferably assigned to the subscriber 2 first activated for automatic address assignment. Of course, it is also possible, for example, to assign the highest address 18 in the address sequence to the first subscriber 2 provided for address assignment and to assign all of the subsequent subscribers 3 , 4 the next lower addresses 17 , 16 in the address sequence. Likewise, it is possible to determine the address sequence or the address assignment according to a uniform, predefined sequence for all participants 2 to 4 or according to a uniformly calculable rule. So it is z. B. also possible that the individual address values to be assigned for the bus system 1 or the address sequences are predefined in at least one register accessible to all participants 2 to 4 or that the address sequence can be calculated by the control program to be processed by participants 2 to 4 .

Difference amounts 32 between successive address values for subscribers 2 to 4 are, however, preferably constant and preferably have the amount "1".

The difference amounts 32 or the address jumps between immediately consecutive addresses 16 to 18 in the address sequence are given to each participant 2 to 4 before or are available to each participant 2 to 4 in a predefined manner.

If necessary, it is also possible that the difference 32 between successive address values for the subscribers 2 to 4 is not linear but is nevertheless predictable or indirectly predefined by a certain function.

In the bus system 1 according to the invention, further participants can be switched to the bus 6 at any time after the initial configuration. After the manual initiation of the address assignment for a subsequently expanded subscriber, preferably by pressing a key on this subscriber, the next free address from the address sequence is automatically assigned to this subscriber, or this subsequently expanded subscriber independently accepts the next free address. To detect the next free address, the subscriber provided for the expansion, switched to the bus 6, monitors the events on the bus 6 at least over a cycle duration 30 and thereby averages the latest number of subscribers 2 to 4 on the bus 6 . Thus, the subscriber intended for the bus system expansion can automatically integrate into the process on bus 6 at the right time.

Is a z. B. defective subscriber 3 from the bus 6 , ent is a gap in the address sequence, in particular the address 17 of the subscriber 3 is no longer present on the bus 6 . This creates a gap 33 in the address sequence that can be recognized by the remaining participants 2 , 4 . This gap 33 in the predefined or expected address sequence is illustrated by a reservation time 34 in diagram 35 . The removal of a z. B. defective subscriber 3 resulting gap 33 in the address sequence can be detected by the remaining subscribers 2 , 4 in particular by exceeding the usual response time of this subscriber 3 . The subscriber 4 following the missing or defective subscriber 3 therefore only sends out his source or destination address, ie his address 18 and the associated data 25, after a certain reservation time 34 has passed .

The reservation time 34 as a result of an expected but inactive subscriber 3 on the bus 6 is different, in particular less than the idle time 29 after the bus activity of the last subscriber 4 in the address sequence. The reservation time 34 is different, in particular always longer than the longest required time period 31 for the reaction of a bus-capable subscriber.

For a newly installed subscriber or a subscriber connected to the bus 6 , the gap 33 in the address sequence or the corresponding reservation time 34 can be recognized and the latter can then automatically take over the missing address. However, the free gap 33 in the address sequence is preferably taken over only after deliberate initiation of an address assignment for the new subscriber or preferably only after the bus activities have been observed by this subscriber. The detection of the bus configuration by the new subscriber can be completed after a cycle duration 30 has elapsed.

Participants 2 to 4 on bus 6 are designed to send and / or receive addresses 16 to 18 and data 23 to 25 from at least one other participant 2 to 4 on bus 6 . The utilization or processing of the data 23 to 25 can take place according to the "message principle", according to which all participants 2 to 4 have defined how the received data 23 to 25 are to be evaluated.

Likewise, at least one participant 2 to 4 can act as a host or master, to which the remaining participants 2 to 4 are subordinate in the manner of slaves. Above all, the data recorded by the slaves can be transferred to the master.

The data transmission between the individual subscribers 2 to 4 can thus be carried out unidirectionally as well as bidirectionally.

The bus system 1 is not limited to a serial bus structure, but rather can be any bus architecture known from the prior art, such as. B. star architecture, parallel bus architecture, ring bus architecture and the like. Have.

In Figs. 2 to 4 show a different embodiment of a bus according to the invention is shown in a highly simplified, schematic diagram of system 36.

In this bus system 36 , a plurality of subscribers 37 to 42 are placed one after the other in the manner of a row at different locations and connected to one another via at least one bus power 43 for the transmission of electrical signals. In particular, the bus system 36 has a chain-like bus structure and the bus lines 43 between the individual subscribers 37 to 42 comprise at least one voltage supply line 44 , 45 and at least one data line 46 for the transmission of addresses and / or data.

The bus lines 43 thus represent a bus 47 which has a so-called “daisy chain” structure. In such a bus system 36 , a data packet 50 consisting of at least one address field 48 and at least one data field 49 is passed on from one participant 37 to 42 to the next participant 37 to 42 in each case. The data packets 50 are thus forwarded by a subscriber 37 to 42 in the bus system 36 to at least one of the two closest or at least one of the two adjacent subscribers 37 to 42 . If necessary, the subscriber 37 to 42 who has received the transmitted data packet 50 then also passes this on to the subsequent subscriber 37 to 42 .

At least one of the participants 37 to 42 , in the exemplary embodiment shown the participant 37 at the beginning of the chain, can act as a host 51 or as a master and control the bus 47 or the participants 38 to 42 defined as "slaves". It is therefore possible for data packets 50 to be transmitted from the host 51 to at least one further subscriber 38 to 42 and vice versa. Likewise, data packets 38 to 42 50 can be transferred to another, acting as a "slave" parti mer 38 to 42 of one of the participants.

Several participants, preferably all participants 37 to 42 , have at least one interface, preferably two interfaces 52 , 53 . The first interface 52 is provided for connection to the bus lines 43 of the bus 47 to the upstream participant in the subscriber chain. The further interface 53 is provided for electrical connection to the bus lines 43 of the bus 47 for downstream participants in the subscriber chain. Each participant 37 to 42 is able to be able to address the interface 52 to the upstream participant and the interface 53 to the downstream participant in a targeted manner or to be able to recognize at which of the interfaces 52 , 53 data packets 50 have arrived, so that a clear A distinction can be made between communication with the upstream subscriber or communication with the downstream subscriber. The interfaces 52 , 53 are designed both for receiving and for sending data packets 50 as a function of the desired transmission direction of the data packets 50 in the bus system 36 .

The address specified in the address field 48 of a data packet 50 has usually contained information about the sender of the data packet 50 or about the destination address for the data packet 50 . According to the invention, it is now provided that each participant changes the address field 48 of a received data packet 50 in a defined manner.

According to the invention, the participants change the address field 48 of a data packet 50 received from another participant via one of the interfaces 52 , 53 according to a predefined rule. If this change in the address in the address field 48 results in a specific limit value 54 , then this is a feature or indicator for reaching the destination or an indicator for the arrival of the data packet 50 or the corresponding data field 49 at the destination address or on intended participants 37 to 42 .

In the context of the invention it is also possible to evaluate the presence of the predefined limit value 54 in the address field 48 of a received data packet 50 as a signal or feature or identifier for the destination of the data packet 50 . That is, Before the change, the address field 48 is checked for equality with the defined limit value 54 and, if the limit value 54 is present, the data packet 50 is used by this subscriber 37 to 42 and is no longer changed or forwarded.

The limit value 54 for recognizing the destination or destination address is preferably defined by the upper or, alternatively, by the lower limit value 54 of the value-limited address field 48 .

A data packet received by one of the subscribers 37 to 42 can therefore either be checked immediately after receipt for equality with the predefined limit value 54 or only after the defined change by the corresponding subscriber 37 to 42 .

If the address specified in the address field 48 does not match the limit value 54 , the address field 48 may be changed before the data packet 50 is transferred to a neighboring subscriber. Is in this case the data packet is received 50 from an upstream subscriber 37 to 42 and to this reach a consequence of failure or absence of the limit value are passed 54 to the downstream parti mer 37 to 42, the address field 48 is changed preferably by Subtrak tion and the changed address field 48 passed together with the data field 49 to the respective downstream subscriber 37 to 42 .

In particular, the corresponding address field 48 of the received data packet 50 is changed by the corresponding subscriber 37 to 42 by subtraction, and when the lower limit value 54 arises in the address field 48 , the attached data in the data field 49 are intended for this subscriber 37 to 42 .

In contrast to this, the address field is preferably changed by another mathematical operation, for example by an addition, before a transfer or transmission of a data packet 50 from a subscriber 37 to 42 to a preceding or upstream subscriber 37 to 42 . If the upper limit value 54 is not reached after the addition, the changed address field 48 with the enclosed data in the data field 49 is sent to the participant 37 to 41 which is upstream of this participant.

In particular, when a data packet 50 is received at the second interface 53 to a downstream subscriber 37 to 42, the address field is changed by addition and, if a value overflow occurs or occurs in the address field 48, the associated data in the data field 39 is considered as for this subscriber 37 up to 42 definitely recognized. On the other hand, if there is no value overflow in the address field 48, the changed address field 48 with the associated data in the data field 49 is passed on via the first interface 52 to the upstream subscriber 37 to 42 or to the predecessor.

It is of course also possible within the scope of the invention to carry out a uniform change in the address field 48 both for forwarding a data packet 50 to an upstream subscriber and to a downstream subscriber. The intended direction of the data forwarding or the direction of the data transfer can also be recognized by the participants 37 to 42 themselves. The intended transmission direction is namely determined by the input of the data packet 50 at the first interface 52 to the predecessor or at the second interface 53 to the successor. For example, when a data packet 50 is received at the second interface 53, it is defined that the data packet 50 should only be forwarded to the upstream subscriber via the first interface 52 if the limit value 54 is not reached or is not available. Similarly, when a data packet 50 is received at the first interface 52 and if the limit value 54 is not reached or not available in the address field 48, it is expedient to transfer the data packet 50 to the downstream subscriber via the second interface 53 .

However, the address field is preferably changed by subtraction before the data packet 50 is transferred to a downstream subscriber, and the address value is changed by addition before a data packet 50 is transferred to an upstream subscriber in the subscriber chain.

The summand for the value in the address field preferably has the amount "1" or the next address can be calculated using a regularity known to all participants 37 to 42 .

Likewise, the subtrahend for the value forming the minuend in the address field 48 preferably has the amount "1". As an alternative to this, the subtrahend can also be calculated by each participant 37 to 42 according to a predefined rule.

It is also possible that the summand or subtrahend is uniform for each participant 37 to 42 a multiple of "1".

The bus system 36 according to the invention also enables the number of users 37 to 42 on the bus 47 to be determined in a simple manner. For this purpose, the last subscriber 42 sends out "0" in the chain-like bus architecture as address information to the upstream subscriber 41 . By adding in each upstream subscriber 41 , 40 , 39 , 38 , 37 , the host 51 at the beginning of the chain-like bus system 36 has the number of connected subscribers 37 to 42 available.

Of course, it is also possible that the last participant 42 with respect to the host 51 forwards address information different from "0" and the host 51 calculates the number of participants on the bus 47 from this predefined initial value by forming the difference.

In principle, the maximum number of participants 37 to 42 is limited by the size of the address field 48 .

The previously explained method of addressing or the method for determining the destination address is illustrated below with reference to the examples shown in FIGS . 2 to 5.

The example according to FIG. 2 illustrates how subscriber 38 sends a data packet 50 to subscriber 39 and how subscriber 40 simultaneously sends another data packet 50 to subscriber 42 . "1" is stored as the start value in the address field 48 for the participant 38 and the value "0" is formed when transferring it to the downstream participant 39 by changing the address field 48 , as a result of which this agreed limit value 54 for the participant 39 as an identifier for the Reaching the destination of the data packet 50 is recognized and the participant 39 thus uses or processes the data field 49 .

Correspondingly, the subscriber 40 sends to the transfer of its data packet 50 to the next but one, downstream subscriber 42 is a two over the club disclosed limit 54 incremented address in the address field 48 of the data packet 50 from so that the subtraction in the downstream participants 41, 42 in the addressing the subscriber 42 of the agreed limit value 54 is present and then the parti mer 42 the data packet is processed 50th

FIG. 3 shows how the start or start address is to be determined when the subscriber 42 has to send the data packet 50 to the subscriber 39 upstream via 2 subscribers 41 , 40 . Likewise, FIG. 3 shows how subscriber 40 specifies the start address in address field 48 if the latter has to send a data packet 50 via subscriber 39 to subscriber 38 . By the addition of the value "1" at the upstream to the emitting subscriber 40 participants 39, 38 applies the emitting subscriber 40 the address value by the value "- 2" fixed to an evaluation of the data packet 50 through the next but one, upstream subscriber 38 to cause. Analogously to this, the sending subscriber 42 defines its address value by “-3” in order to effect an evaluation of the data packet 50 to be sent out by the upstream subscriber 39 .

Basically, it can thus be specified, by way of example, that for the transmission of data from any subscriber to a downstream subscriber separated by two subscribers, the address and the corresponding data packet 50 are increased by three above the limit value 54 or one by three above zero .

Analogously to this, a data packet 50 is transferred to an upstream subscriber separated by two subscribers by outputting an address which is three below the generally applicable limit value 54 , for example zero.

The value "0" or the maximum value determined by the length of the address field 48 is preferably defined as the limit value 54 . This is because this lower limit "0" or the upper limit as the maximum value in the address field of the participants 37 to 42 is relatively easy or quick to query. Usually, when loading the address field 48 into a corresponding register, the participants 37 to 42 can determine with only one program step whether the lower limit value 54 or the upper limit value 54 is present. Such program steps then relate to the query of an "overflow bit" in the registers of the subscriber 37 to 42, who is usually in the form of a microcontroller.

Finally, it should be noted that it is within the scope of the invention whether the address field 48 is queried beforehand with regard to the presence of the limit value and then, if appropriate, the address field is changed or whether the address field 48 is changed beforehand and then checked for equality with the agreed limit value 54 .

For the sake of order, it should finally be pointed out that, for a better understanding of the functional relationships, the bus system 1 and the diagrams have been represented in a highly simplified manner.

The task on which the independent inventive solutions are based can be Description can be taken.

Above all, the individual in FIGS. 1; 2, 3, 4 shown form the subject of independent, inventive solutions. The related tasks and solutions according to the invention can be found in the detailed descriptions of these figures.

List of reference symbols

1

Bus system

2nd

Attendees

3rd

Attendees

4th

Attendees

5

Bus line

6

bus

7

Node

8th

Node

9

Node

10th

diagram

11

diagram

12th

diagram

13

diagram

14

block

15

block

16

address

17th

address

18th

address

19th

Input device

20th

button

21

sensor

22

sensor

23

Data

24th

Data

25th

Data

26

Data packet

27

Data packet

28

Data packet

29

Idle timeout

30th

Cycle duration

31

Duration

32

Difference

33

gap

34

Reservation time

35

diagram

36

Bus system

37

Attendees

38

Attendees

39

Attendees

40

Attendees

41

Attendees

42

Attendees

43

Bus line

44

Power supply line

45

Power supply line

46

Data line

47

bus

48

Address field

49

Data field

50

Data packet

51

Host

52

interface

53

interface

54

limit

Claims (37)

1. Bus system for a plurality of participants, which can be switched on bus lines of the bus system and when using or loading the bus system by a participant, this change in state on the bus can be detected simultaneously or immediately by the other participants, characterized in that for an assignment or allocation of unique addresses ( 16 , 17 , 18 ) to the participants ( 2 , 3 , 4 ) these are activated sequentially in time and an activated participant ( 2 or 3 ) the first free or possibly the next unoccupied address ( 16 or 17 ) accepts a predefined address sequence or is assigned to it and this subscriber ( 2 or 3 ) receives its address ( 16 or 17 ) and possibly data ( 23 or 24 ) via the bus ( 6 ) sends out and the remaining participants ( 3 or 4 ) the assignment or assignment of this address ( 16 or 17 ) or the last valid number of participants is communicated and after a certain idle time ( 29 ) in the bus system ( 1 ), the first activated participant ( 2 ) starts again with sending his address ( 16 ) and data ( 23 ). 2. Bus system according to claim 1, characterized in that the rest time ( 29 ) is greater than a required time period ( 31 ) for the response or Reagie ren another bus-capable subscriber ( 3 , 4 ). 3. Bus system according to claim 1 or 2, characterized in that when reaching or exceeding the predefined idle time ( 29 ) on the bus ( 6 ) the first addressed subscriber ( 2 ) or the subscriber to whom the first free address ( 16 ) is assigned was started again with the transmission of its address ( 16 ) and data ( 23 ) and / or with the transmission of at least one destination address and corresponding data ( 23 ). 4. Bus system according to one or more of the preceding claims, characterized in that the lowest activated address ( 16 ) in the address sequence is assigned to the first activated or first subscriber ( 2 ). 5. Bus system according to one or more of the preceding claims, characterized in that difference amounts ( 32 ) between successive address values for the participants ( 2 , 3 , 4 ) are constant and preferably have the value 1. 6. Bus system according to one or more of the preceding claims, characterized in that the difference amounts ( 32 ) or the jump sequences for non-numerical addresses between immediately successive addresses ( 16 , 17 , 18 ) for each participant ( 2 , 3 , 4 ) uniformly are or are pre-defined in each participant ( 2 , 3 , 4 ). 7. Bus system according to one or more of the preceding claims, characterized in that the sequence of assignable or available addresses ( 16 , 17 , 18 ) is stored in each participant ( 2 , 3 , 4 ) or by each participant ( 2 , 3rd , 4 ) can be called up or calculated. 8. Bus system according to one or more of the preceding claims, characterized in that the difference ( 32 ) between successive address values for the participants ( 2 , 3 , 4 ) is not linear but predefined or can be calculated according to a specific rule. 9. Bus system according to one or more of the preceding claims, characterized in that the initiation of address assignment or address assignment for a subscriber ( 2 , 3 , 4 ) by manually pressing a button ( 20 ) or by activating at least one sensor connected to it ( 21 , 22 ). 10. Bus system according to one or more of the preceding claims, characterized in that the address assignment or address assignment is initiated by switching the participants ( 2 , 3 , 4 ) to the bus ( 6 ) or to the electrical supply lines. 11. Bus system according to one or more of the preceding claims, characterized in that one after the initial configuration to the bus ( 6 ) switched participants ( 4 ) and definitive initiation of address assignment for the subsequently expanded participant ( 4 ) automatically the next free Address ( 18 ) is assigned. 12. Bus system according to one or more of the preceding claims, characterized in that the removal of a z. B. defective subscriber ( 3 ) resulting gap ( 33 ) in the address sequence by exceeding the usual reaction time of this subscriber ( 3 ) can be detected and the missing subscriber ( 3 ) subsequent subscriber ( 4 ) only after the elapse of a certain Reservation time ( 34 ) sends the address ( 18 ) and the data ( 25 ). 13. Bus system according to one or more of the preceding claims, characterized in that the reservation time ( 34 ) on the bus ( 6 ) after a failure or a distance of a participant ( 3 ) is different, in particular less than the rest time ( 29 ) on the bus . 14. Bus system according to one or more of the preceding claims, characterized in that the reservation time ( 34 ) is different, in particular greater than the longest response time of a participant ( 2 , 3 , 4 ) for the bus ( 6 ). 15. Bus system according to one or more of the preceding claims, characterized in that the gap ( 33 ) in the address sequence is recognizable for a newly installed subscriber ( 3 ) and this then automatically takes over the missing address ( 17 ). 16. Bus system according to one or more of the preceding claims, characterized in that the free gap ( 33 ) is taken over in the address sequence following a deliberate initiation of an address assignment for the new subscriber ( 3 ). 17. Bus system according to one or more of the preceding claims, characterized in that the data transmission between the individual participants ( 2 , 3 , 4 ) is unidirectional or bidirectional or the participants ( 2 , 3 , 4 ) for sending and / or Receiving addresses ( 16 , 17 , 18 ) and data ( 23 , 24 , 25 ) to or from other participants ( 2 , 3 , 4 ) on the bus ( 6 ) are formed. 18. Bus system according to one or more of the preceding claims, characterized in that in at least one subscriber ( 2 , 3 , 4 ) in the bus system ( 1 ) is defined as the data ( 23 , 24 , 25 ) from at least one other subscriber ( 2 , 3 , 4 ) are to be recycled or processed. 19. Bus system according to one or more of the preceding claims, characterized in that the participants ( 2 , 3 , 4 ) can be connected in succession or in series via nodes ( 7 , 8 , 9 ) to the bus lines ( 5 ) of the bus ( 6 ) and at least one participant ( 2 , 3 , 4 ) acts as the host or master. 20. Bus system according to one or more of the preceding claims, characterized in that the addresses ( 16 , 17 , 18 ) of each participant before the initial configuration or before the first initiation of an address assignment directly to one of the participants ( 2 , 3 , 4 ) ( 2 , 3 , 4 ) are deleted and none of the participants ( 2 , 3 , 4 ) on the bus ( 6 ) is active. 21. A method for configuring a bus system for a plurality of subscribers, which are connected to bus lines of the bus system and when the bus system is used or acted upon by a subscriber from the remaining subscribers, this change of state on the bus is detected simultaneously or immediately, thereby characterized in that for an assignment or allocation of unique addresses ( 16 , 17 , 18 ) to the participants ( 2 , 3 , 4 ) these are activated sequentially in time and an activated participant ( 2 or 3 ) the first free or if necessary, the next unoccupied address ( 16 or 17 ) of a previously defined address sequence is accepted or assigned to it and this subscriber ( 2 or 3 ) then his address ( 16 or 17 ) and possibly data ( 23 or 24 ) are sent out via the bus ( 6 ) and the other participants ( 3 or 4 ) are assigned or assigned this address ( 16 or 17 ) or the last valid number of participants is communicated and after a certain idle time ( 29 ) in the bus system ( 1 ) the first activated participant ( 2 ) in turn sends out his address ( 16 ) and data ( 23 ). 22. Bus system for a plurality of subscribers which can be switched sequentially or in series via at least a first interface and at least a second interface on bus lines of the bus system and thus form a so-called "daisy chain" bus architecture, in which data packets include at least one Address and a data field are passed on from one subscriber to the next or neighboring subscriber, characterized in that the subscribers ( 37 to 42 ) for changing the address field ( 48 ) of data packets ( 50 ) received via one of the interfaces ( 52 , 53 ) ) are formed and the emergence or existence of a certain limit value ( 54 ) in the address field ( 48 ) is evaluated as an indicator for reaching the destination or for the arrival of the associated data at the destination address. 23. Bus system according to claim 22, characterized in that the limit value ( 54 ) for defining the destination or destination address is defined by the upper or lower limit value ( 54 ) of the address field. 24. Bus system according to claim 22 or 23, characterized in that before or after a transfer or transmission of a data packet ( 50 ) of a subscriber ( 38 ) to a subsequent or downstream subscriber ( 39 ) changes the address field ( 48 ), for example by subtraction and wherein the absence or failure to reach the lower limit (54) the data packet (50) is further sent with or without change in the address field (48) at a further subsequent devices (40) during the subsequent subscriber (38). 25. Bus system according to one or more of claims 22 to 24, characterized in that a subscriber ( 42 ) when receiving a data packet ( 50 ) at the first interface ( 52 ) changes the corresponding address field ( 48 ) by subtraction and when the lower limit value ( 54 ) in the address field ( 48 ) which are intended for the respective subscriber ( 42 ) in the case of added data. 26. Bus system according to one or more of claims 22 to 25, characterized in that the address field ( 48 ) before or after a data packet ( 50 ) is transferred or sent by a subscriber ( 40 ) to an upstream or upstream subscriber ( 39 ). is changed, for example, by addition and if the upper limit value ( 54 ) is not present or is not reached at the upstream subscriber ( 39 ), the data packet ( 50 ) with or without change in the address field ( 48 ) is sent to a further upstream subscriber ( 38 ). 27. Bus system according to one or more of claims 22 to 26, characterized in that a participant ( 39 ) when receiving a data packet ( 50 ) at the second interface ( 53 ) changes the address field ( 48 ) by addition and when a value overflow or . of the predefined limit value ( 54 ) in the address field ( 48 ) the associated data are intended for this subscriber ( 39 ). 28. Bus system according to one or more of claims 22 to 27, characterized in that if there is no value overflow in the address field ( 48 ), the changed address field ( 48 ) with the associated data via the first interface ( 52 ) to the upstream subscriber ( 38 ) is passed on. 29. Bus system according to one or more of claims 22 to 28, characterized in that the summand for the address field ( 48 ) has the value 1 or can be calculated using a rule which is uniform for all participants ( 37 to 42 ). 30. Bus system according to one or more of claims 22 to 29, characterized in that the subtrahend for the address value forming the minuend in the address field ( 48 ) has the amount 1 or can be calculated according to a predefined rule by each participant ( 37 to 42 ). 31. Bus system according to one or more of claims 22 to 30 that the summand or subtrahend is a multiple of 1 for each participant ( 37 to 42 ). 32. Bus system according to one or more of claims 22 to 31, characterized in that the bus ( 47 ) is controlled starting from a host ( 51 ) or from one of the participants ( 37 to 42 ) data for previous and subsequent participants ( 37 to 42 ) can be generated. 33. Bus system according to one or more of claims 22 to 32, characterized in that to determine the number of participants ( 38 to 42 ) on the bus ( 6 ) the last participant ( 42 ) "zero" as address information to the upstream participant ( 41 ) sends out and by adding in each upstream participant ( 38 to 40 ) the host ( 51 ) at the beginning of the chain-like bus system ( 1 ) the number of connected participants ( 38 to 42 ) is communicated. 34. Bus system according to one or more of claims 22 to 33, characterized in that the maximum number of participants ( 37 to 42 ) is limited by the size of the address field ( 48 ). 35. Bus system according to one or more of claims 22 to 34, characterized in that the transmission of data from any subscriber ( 37 ) to a downstream subscriber ( 40 ) separated by two subscribers ( 38 , 39 ) by issuing one by the amount "Three" above the predefined limit ( 54 ), such as. B. "zero", raised address. 36. Bus system according to one or more of claims 22 to 35, characterized in that the transfer of a data packet ( 50 ) to an over two subscribers ( 40 , 41 ) separate, upstream subscriber ( 39 ) by outputting a by the amount "three "below the predefined limit ( 54 ), such as. B. "zero", lying address. 37. Addressing method for a bus system, in which a plurality of subscribers are connected to bus lines of the bus system in succession or in series via at least one first interface and at least one second interface, thereby forming a so-called "daisy chain" bus architecture and comprising at least one data packet Address and a data field are passed on from one subscriber to the next or neighboring subscriber, characterized in that the address field ( 48 ) is basically received by the subscribers ( 37 to 42 ) in data packets ( 50 ) received via one of the interfaces ( 52 , 53 ). is changed and an emergence or existence of a defined limit value ( 54 ) in the address field ( 48 ) at one of the participants ( 37 to 42 ) is evaluated as a sign for reaching the destination or for the arrival of the associated data at the destination address.