DE102014003066B4 - Method for semi-automatic address determination for bus participants of a mixed star / serial lighting network for use in vehicles - Google Patents

Abstract

bus network (5),
a. wherein the bus network (5) comprises at least one bus node, i.e. at least one first bus subscriber (7a-7k, 14), which is connected to at least one serial bus sub-network (4a-4s), and
b. wherein the serial bus sub-network (4a-4s) is a serial bus sub-network (4a-4s) of the bus network (5) and
c. wherein the serial bus subnetwork (4a-4s) comprises a further bus subscriber (3, 12) and
d. wherein the serial bus subnetwork (4a-4s) comprises at least one second bus subscriber (2), and
i. wherein the further bus subscriber (3, 12) only communicates via the second bus subscriber (2) with a first bus subscriber (7a-7k, 14) in the serial bus sub-network (4a-4s) of the bus network ( 5) is connected and
ii. wherein the second bus subscriber (2) is set up to carry out a method to determine the bus position of the second bus subscriber (2) within the serial bus subnetwork (4a-4s) relative to the first bus subscriber (7a -7k, 14), which is assigned to the serial bus subnetwork (4a-4s) as this first bus subscriber (7a-7k, 14), to be clearly determined and
iii. wherein in the method a bus subscriber (13) receives bus position 1 if it is closest to this first bus subscriber (7a-7k, 14) or
iv. wherein in the process the bus subscriber (12) is the Bus position 1 is given if it is the last additional bus participant (12), and
v. wherein the second bus participant (2) holds information, a look-up table, and/or algorithms or receives it from this first bus participant (7a-7k, 14), which determines the said determined bus position within the Link the serial bus subnetwork (4a-4s) with a logical bus network address within the bus network (5) and
vi. that the second bus participant (2) determines the logical bus network address of the second bus participant (2) within the bus network (5) based on said information and/or said algorithm,
vii. wherein the second bus subscriber (2) uses at least one sub-device of the second bus subscriber (2) to carry out the method which determines the logical bus network address of the second bus subscriber (2) based on said information and/or said algorithm. determined within a bus network (5) and characterized in that
e. that the bus network (5), at least in a partial network, at least temporarily does not have a physical topology of a directed cycle-free graph without multiple edges and
f. that it has additional bus subnetworks (4t`) within this subnetwork of the bus network (5), which are at least temporarily deactivated after the logical bus network addresses have been determined, and
G. that the bus network (5) and/or the said Subnetwork of the bus network (5) after the respective logical bus network addresses of the bus participants (7a-7k, 2, 12, 13, 14) have been determined by them and after the at least temporary deactivation of the additional bus subnetworks (4t' ) has at least partially a logical topology of a directed cycle-free graph without multiple edges.

Description

Introduction and state of the art

Various auto-addressing methods for the participants of serial bus systems are known from the prior art. The writings can be used as examples EP 1 364 288 B1 , DE 10 256 631 B4 and EP 1 490 772 B1 to be named. These methods from the prior art enable, in particular, the unambiguous determination of the bus position of a bus subscriber within a serial bus subnetwork. However, they do not make it possible to determine a unique bus address for a bus network that, although it contains such serial bus subnetworks, does not itself have a serial topology in its entirety. The bus participants are not able to determine the bus address for such a bus network autonomously. In such bus networks, the bus network address must be assigned to the individual bus participants.

It is also known from the prior art that bus addresses can be assigned to the individual bus participants of an unstructured lighting network. (compare EP 1 016 062 B1 ) However, this method has the disadvantage that the addresses always have to be programmed individually, which is time-consuming and can lead to significant costs and errors in the series production of automobiles.

From the US 2010 / 0 274 945 A1 is a method for addressing the bus participants of a serial Dali network based on the RS485 standard, in which the nodes of the network are connected in series and the bus is interrupted by the individual nodes. In 5 the US 2010 / 0 274 945 A1 the higher-level bus master sends an initial network address to the subordinate bus participant closest to it (reference number 502). US 2010 / 0 274 945 A1 ). This receives the address assigned to it and transmits a bus address incremented by the value 1 to the next bus participant (section [0024] of the US 2010 / 0 274 945 A1 ). This takes over the address and passes on an address incremented by 1 to the bus node subordinate to it and so on. Address allocation is stopped when there are no longer any subordinate nodes on a bus participant and the bus master no longer detects any further assignment by a subordinate bus participant. Branches are in the US 2010 / 0 274 945 A1 also described ( 11 and 12 and Section 30 of the US 2010 0 274 945 A1 ). In contrast to the fonts already mentioned EP 1 364 288 B1 , DE 10 256 631 B4 and EP 1 490 772 B1 The participants in a serial subnetwork do not determine their bus position themselves, but rather this is assigned to them by the preceding bus participant or bus master. This requires a certain amount of time in a complex network because address assignment is done sequentially. The aim, however, would be for the bus nodes to independently recognize the bus position within the serial sub-network and then to independently generate their respective individual bus addresses for the entire bus network in parallel or at least quasi-parallel, which makes the overall addressing in contrast to US 2010 / 0 274 945 A1 would accelerate massively. The ones in the US 2010 / 0 274 945A1 The disclosed technology therefore fails in complex networks with many participants due to the required initialization time. This long initialization time may be irrelevant for use in a building. In systems that require a quick system start, for example in automobiles, such a delay is unacceptable.

From the EP 2 420 907 A1 is also a method for assigning logical addresses to second fieldbus participants (reference number 2 and lines 51 to 55, column 5 of the EP 2 420 907 A1 ), which is part of a serial sub-bus system (reference numbers 31, 32, 33 of the EP 2 420 907 A1 ). A first fieldbus participant asks (reference number 1). EP 2 420 907 A1 ) a base address from a higher-level instance (reference number 20 of the EP 2 420 907 A1 ) away. With the help of a reference number 1 previously in the first fieldbus participant EP 2 420 907 A1 ) stored configuration file, which must be created through programming work, which contains the participant names (reference numbers 41, 42, 43 of the EP 2 420 907 A1 ) and the addresses (51, 52, 53), whereby these are initially marked in such a way that they still have to be assigned (section [0021] lines 11 to 13 of the EP 2 420 907 A1 ). After the first address for the first bus participant (reference number 1 of EP 2 420 907 A1 ) from the higher-level unit (reference number 20 of the EP 2 420 907 A1 ) this was assigned, the first bus participant (reference number 1 determines the EP 2 420 907 A1 ) of the serial subnetwork (reference number 31 of EP 2 420 907 A1 ) the addresses of the subordinate bus participants (reference numbers 2 and 3 of the EP 2 420 907 A1 ) and assigns them the corresponding IP addresses (section [0023] lines 38 to 52 of the EP2420907A1 ). The EP 2 420 907 A1 It leaves open how the individual nodes can actually be addressed. But this is the one in the EP2420907A1 (Section [0027] line 48 of EP 2 420 907 A1 ) referenced font EP 2 110 725 A1 refer to. There in section [0002] the EP 2 110 725 A1 executed, that the bus participants have individual, globally unique and unique MAC addresses, which naturally have to be managed. That in the EP 2 420 907 A1 The method described thus uses an already implemented, hard-wired and permanently installed individualization and requires that at least one method similar to that of a DNS server at least in the first bus participant (reference numbers 1 and 9 of EP 2 420 907 A1 ) is carried out. Such a fixed assignment of MAC addresses to functions of the bus participants is a significant manufacturing disadvantage in a motor vehicle. Rather, it is desired that all parts with a similar function are manufactured in the same way and only individualize completely independently after they have been installed in vehicle production. In the process of EP 2 420 907 A1 However, the bus address, comparable to an IP address, and thus the later function determined by the software is given to the subordinate second bus participant (reference number 2 of the EP 2 420 907 A1 ) by the first bus participant (reference number 1 of the EP 2 420 907 A1 ) assigned on request using said hardwired, built-in MAC address. This in turn has the disadvantage of a slow network startup and is therefore not suitable for use in automobiles. In addition, programming work is required to create the configuration file. The aim is therefore to instead enable the subsequent bus participants to autonomously determine an individual bus address in parallel in order to increase the speed of bus initialization through this parallelization.

The introduction of LED lighting in cars has led to an increase in the number of serial buses with bus participants that require a unique address to adequately control the light intensity.

These buses do not always have the serial topology mentioned above. Therefore, bus network addresses that are used in the serial bus subnetworks when using the said methods and devices from the prior art, for example, correspond to those of the documents EP 1 364 288 B1 , DE 10 256 631 B4 and EP 1 490 772 B1 may be awarded multiple times.

From the US 2010 / 0 274 945 A1 the address assignment within a Dali network is known. Each bus participant determines a logical network address that applies globally in the bus network. The method of US 2010 / 0 274 945 A1 However, it does not allow the use of individual bus participants that only correspond to an existing standard, such as the Lin-Bus standard with auto-addressing. When using the addressing method in accordance with the technical teachings of US 2010 / 0 274 945 A1 The physical bus position is not determined, but only a network address that can match the physical bus position but does not always have to match.

From the EP 2 420 907 A1 and, among other things, sections [0007] to [0010], a method for manual configuration of a professional bus system is known.

From the DE 103 10 250 A1 Another method for determining the physical bus position within a linear branch-free bus network by means of voltage drops in the supply voltage line is known.

The proposed bus system (5) (see 1 ) (consists of at least a first bus participant (1), the data bus (6) and at least one second bus participant (2). Of course, as a rule, more than one second bus participant (2) will be connected. A proposed bus -System (5) therefore generally has additional bus participants (3). A first additional bus participant (13) is shown as the closest to the first bus participant (1). A last additional bus participant (12 ) completes the chain of bus participants in the bus subnetwork (4). All of these together form a bus network branch (4) of the proposed bus system (5). A proposed bus system (5) can have several bus Subnetworks (4, 9a-9i) ( 2 ), which in the simplest case radiate in a star shape from at least one first bus participant (1). This first bus participant (1) can be connected to further first bus participants (7) ( 3 ), which can also have additional bus subnetworks (4, 9a-9i) and all together form the proposed bus system (5). In this respect, the proposed bus system (5) still corresponds to the state of the art up to this point. The proposal explained below does not extend to the topology of the network known from the prior art, but rather to the method for addressing the second and further bus participants (2, 3, 12, 13). This means that the proposal gives a Method of how the bus participants receive a unique bus network address linked to this position based on their position in the bus network (5).

As already mentioned, it is now possible for a unique bus sub-network address to be assigned within an individual bus sub-network (4, 9a-9i) using a method from the prior art. In the methods from the prior art, this first bus sub-network address is used once in each bus sub-network (4, 9a-9i). and therefore typically assigned multiple times in relation to the bus system (5), which represents the problem to be solved since the bus sub-network address does not correlate with the bus network address.

Abandonment of the proposal

The task is now to design the proposed bus system (5) with the same second and further bus participants (2, 3, 12, 13) and the same first and further first bus participants (1, 7) in such a way that No programming work is required when assembling the bus system (5), for example in a motor vehicle, and all bus network addresses within the bus system (5) are unique. In addition, the system should start quickly in contrast to US 2010 / 0 274 945 A1 and the EP 2 420 907 A1 to be possible.

The aim is therefore to use a device and a method for the unique assignment of bus network addresses within a bus network (5) of at least the second and further bus participants (2, 3, 12, 13) of the bus sub-networks (4). the mentioned previous auto-addressing methods from the prior art can be specified.

The proposal presented here is intended to enable auto-addressing even for bus networks (5) that actually do not have a physical topology in the sense that the bus network (5) at least partially has the topology of a directed, cycle-free graph without multiple edges, since it has additional bus subnetworks (4t`) (see 6 ) has.

This task is achieved with a device according to claim 1.

Description of the basic proposal

The basic idea of the proposal is that the second and further bus participants (2, 3, 12, 13) have information and/or algorithms, such as, firstly, the bus sub-network address determined by an auto-addressing method from the prior art as a bus sub-network address. Positions within their respective bus sub-network (4, 9a-9i) and secondly a bus sub-network number of their respective bus sub-network (49a-9i) that is unique within the bus network (5), which is in one within the bus network ( 5) unique bus network address should be implemented. The information can be available, for example, in the form of a look-up table or individual data and algorithms for generating the bus network address. An exemplary algorithm that is carried out by a bus subscriber or a sub-device thereof can, for example, look like this: the bus sub-network number is increased by the maximum length of a bus sub-network in number of bus sub-network subscribers multiplied by one to the bus position, i.e. the independently determined bus sub-network address, within the respective bus sub-network (4, 9a-9i) is added and thus a unique bus network address within the bus network (5) for the respective second or further bus participant (2, 3, 12, 13). But, as I said, this is just an example of such an algorithm.

This information, which, as mentioned, can also include the algorithm for bus network address generation and/or its parameters, can be stored, for example, in a look-up table in a second or further bus participant (2, 3).

A first bus subscriber (1) or further first bus subscribers (7, 10, 11) can be assigned to all second and further bus subscribers (2, 3, 12, 13) of a bus sub-network (4, 9a-9i), for example by means of a bus sub-network number or a similar order symbol, which bus sub-network (4, 9a-9i) they are in. This bus subnetwork number can initially be specific for the connection of the bus subnetwork to the first (1) or further first bus participants (7, 10, 11). In addition to this connection-specific bus subnetwork number, which can be assigned multiple times within the bus network (5) for different bus nodes, consisting of the first (1) and/or further first bus participants (7, 10, 11), A bus network-specific bus subnetwork number can also be assigned. Their investigation is also described here. First, the case of further connected bus subnetworks (4, 9a-9i) is described in a bus hierarchy level. By transmitting the connection-specific bus subnetwork number, the second and further bus participants (2, 3, 12, 13) are enabled to have an associated connection-specific bus network address using the determined bus position within the named bus subnetwork (4). a serial topology and using the bus subnetwork number from the look-up table. As described, it is also conceivable instead that the second or further bus participant (2,3) can carry out an algorithm to determine the bus address within the bus network. For example, it is possible to multiply the bus subnetwork number by a factor, typically the maximum number of bus participants (2, 3) per bus subnetwork (4), and the bus position of the second or further bus participant ( 2, 3) to be added.

The first bus participant (1, 7, 10, 11) is typically housed in a control unit or the control unit itself. The topology and routing of the individual bus subnetworks (4, 9a-9i) are usually different. It is therefore conceivable to use either the entire cable harness of all bus subnetworks (4, 9a-9i) of a bus node, which is typically identical to the first (1) or further first bus participants (7, 10, 11). Plug to connect this first (1) or further first bus participants (7, 10, 11) or to use coded plugs instead for subsets of the bus sub-networks (4, 9-9i). Since the bus sub-network number is assigned to a specific plug and/or a specific pin/pin pair within a plug, the relevant first (1) or further first bus participants (7, 10, 11) can have the bus sub-network number assign exactly the correct bus subnetwork (4, 9a-9i) because it is always on the same connection.

It is therefore not necessary to specifically program the second and further bus participants (2, 3, 12, 13). The bus subnetwork number, the bus position in the bus subnetwork (4, 9a-9i) and thus the bus address within the bus network (5) are determined independently.

4 shows a special version of the device. Such a particularly advantageous embodiment of the proposed device represents a serial bus topology of the first (1) and further first bus participants (7, 10, 11). These then themselves form a serial, higher-level bus sub-network (8), whereby the Known algorithms for determining the bus position of the first bus subscriber (1) and the other first bus subscribers (7, 10, 11) can be reused within this higher-level bus subnetwork (8). The first bus participants (1, 7, 10, 11), which are the bus participants of the higher-level bus network (8), are also able to determine their bus position within this higher-level bus subnetwork ( 8) and thus determine your own bus network address within the bus network (5). The subordinate bus subnetworks (9a to 9i) then each form a subtree of the bus network (5), which is shown here in the 4 then there is no further branching. On the other hand, the first and further bus participants (1, 7, 10, 11) are able to clearly determine the respective bus sub-network number of the respectively assigned bus sub-networks (9a to 9i). This can happen either based on pre-programmed data within the first bus participants (1, 7, 10, 11) or by counting at the connections of the first bus participants (1, 7, 10, 11) with which the bus subnetworks ( 9a to 9i) are connected to their respective first bus participants (1, 7, 10, 11). In this case, a preceding first or further first bus subscriber (eg 1) in the higher-level serial bus subnetwork transmits information about the number of bus subnetworks (eg bus subnetworks 9d to 9f) to a subsequent first or further first bus subscriber (eg 11). ), which are connected to it and/or to it (1) and to the preceding further first bus participants (eg 7) (eg bus subnetworks 9d to 9i). Likewise, a preceding first or further first bus participant (e.g. 1) can give a subsequent first or further first bus participant (e.g. 11) the number of preceding bus participants in the preceding bus subnetworks (e.g. 9d to 9i) including first, second and further bus participants (1, 2, 3) in all further bus subnetworks that may branch off within the bus subnetworks, which are connected to those of the preceding first and further first bus participants (e.g. 10) and to the said The first bus participants (e.g. 1) are themselves connected, inform the subsequent first, second and further bus participants (e.g. 11, 2, 3, 12, 13) in the bus sub-networks 9a to 9c) the calculation of their own Bus network address within the bus network (5) based on the own bus position characterized by the bus network-specific bus sub-network number and the bus position within the bus sub-network (eg 9a).

A proposed device is therefore characterized in that the device is part of the second bus subscriber (2) and that a second bus subscriber (2) has a device and means for carrying out a method to determine the bus position of the second Bus subscriber (2) within the serial bus subnetwork (4) can be clearly determined relative to a first bus subscriber (1) to which this serial bus subnetwork (4) is connected. The second bus participant (2) also has information, namely, for example, in the form of the said look-up table and/or a device that carries out a suitable algorithm that determines the said bus position within the associated bus sub-network (4) with the logical bus network address within the bus network (5) in the sense of a mathematical mapping. For this purpose, the proposed device carries out a method that determines the logical bus network address within the bus network (5) for this second bus subscriber (2) based on the said information.

• Als erstes bestimmt der zweite bzw. weitere Bus-Teilnehmer (2, 3, 12, 13) seine physikalische Bus-Position innerhalb seines seriellen Bus-Teilnetzwerkes (4). Hierfür gibt es im Wesentlichen zwei Verfahren, die sich in Wirkung nicht wesentlich unterscheiden.

This method for determining the bus network address of the second or further bus subscriber (2, 3) within the bus network (5) proceeds as follows:

• First, the second or further bus participant (2, 3, 12, 13) determines its physical bus position within its serial Bus subnetwork (4). There are essentially two methods for this, which do not differ significantly in effect.

In both methods, this determination always takes place for the respective serial bus subnetwork (4, 8, 9a to 9i) relative to the associated first bus subscriber (1, 10, 11).

In the first method, the second or further bus participant closest to the associated first bus participant (1), in the drawings a further bus participant (13), determines position 1, the following bus participant (in the drawings the second bus participant (2)) determines bus position 2 and so on.

In the second method, the last additional bus participant (12) determines bus position 1, reports its bus position to the first bus participant (1) and does not react until a final signal from the associated first bus participant (1). more. After this, the penultimate additional bus participant (here 3) determines bus position 2, reports its bus position to the first bus participant (1) and no longer responds until a final signal from the associated first bus participant (1). . This continues until all second and further bus participants (2, 3, 12, 13) of the respective bus sub-network (4, 9a-9i) have determined their bus position in the respective bus sub-network. The first bus participant (1) recognizes this, for example, because no bus participant responds anymore. The first bus participant (1) then sends a termination signal, which means that all second and further bus participants (2. 3. 12, 13) of the bus subnetwork (4), whose bus participants (2. 3. 12, 13) have determined their bus position, react.

In addition to these methods, other methods for determining the bus position within a serial network are conceivable.

The second and/or further bus participants (2, 3, 12, 13) or a part of them each carry out a method to determine their physical bus position within their associated serial bus subnetwork (4) relative to the respective first Bus participants (1) of their respective bus subnetwork (4, 9a-9i) can be clearly determined. The first bus participant (1, 7, 10, 11) assigns its respective bus sub-networks (4, 9a-9i), for example, a global bus sub-network number and/or sub-tree-specific bus number that is unique within the bus network (5). Subnetwork number. The first bus subscriber (1) preferably first transmits the respective sub-tree-specific bus sub-network number of their respective bus sub-network (4) to the second and further bus subscribers (2, 3, 12, 13). With the help of this sub-tree-specific bus sub-network number and the physical bus position, the second or further bus subscriber (2, 3, 12, 13) of the respective bus sub-network (4, 9a to 9i) now uses the said information, for example with the help of said exemplary look-up table, its logical subtree-specific bus network address within the relevant subtree (4, 9a, 9i) of the bus network (5). The transmission of the subtree-specific bus subnetwork number can, for example, be omitted if the bus system (5) only contains one bus subnetwork (4).

Two subtrees can now be synchronized with each other by a preceding first bus participant (e.g. 10) giving a subsequent first bus participant (e.g. 1) the number of bus subnetworks (9a-9i) (e.g. number 3) for its and reports the preceding bus subnetworks (9g to 9i) in all of its connected subtrees. Here, your own serial higher-level bus subnetwork (eg 8) is preferably counted as a bus subnetwork. The following first bus participant (e.g. 1) can now determine a unique bus subnetwork number for each of its connected bus subnetworks (e.g. 9d to 9f). The following first bus participant (e.g., 1) can now pass on this bus subnetwork number to the second and further bus participants (2, 3, 12, 13) of the respective bus subnetwork (e.g. 9d) and the bus - Request participants (2, 3, 12, 13) to determine their bus network address within this now expanded subtree. The determination is made step by step for one bus participant after the other, with each of the preceding bus participants passing on the information of the bus subnetwork number to a subsequent bus participant. When branching, only a first bus subnetwork branch is addressed with the bus subnetwork number that has already been received. As soon as the addressing process reaches the end or the beginning of a bus subnetwork, the bus participant in question preferably determines that it is an end bus participant (12) and sends this information to the associated first bus participant (e.g. 1 ). In doing so, it preferably sends to the first bus subscriber (eg 1) the number of bus subscribers in the bus subnetwork (eg 9d) and its bus subnetwork number. The associated first bus participant (e.g. 1) checks whether further bus subnetworks are connected. If this is the case, the first bus participant (eg 1) increases the bus subnetwork number and uses it to address this bus subnetwork or subtree using the previously described method. In doing so, it sends the message to the first other bus participant (e.g. 13) that is closest to it, or to the last bus participant (12), depending on the method to determine the bus positions, the new bus subnetwork number. If no further bus subnetworks or subtrees are connected, the first bus subscriber (eg 1) sends the previously determined number of bus subscribers and/or the last bus subnetwork number to the subsequent bus subscriber (eg 11). In this way, all bus participants in the entire bus network can be provided with a unique bus network address without the need for any programming effort. What is important here is the synchronous activation of the determined bus network addresses. After all subtrees have been addressed, the last first bus participant (eg 11) then determines that no further bus participants, further bus subnetworks and/or further subtrees are not addressed. The last first bus participant (here 11) then transmits the determined number of bus participants and/or the determined number of bus subnetworks to the first bus participant (eg 14) of its higher-level bus subnetwork (eg 8). If the first bus participant (14) of the higher-level bus sub-network is itself part of an even higher-level bus sub-network (4, 9a-9i), it continues to address other bus sub-networks connected to it, etc. until all Bus participants of the entire bus network (5) are addressed.

The first bus participant (14) arranged highest in the hierarchy can then address and query each bus participant (1, 2, 3, 7, 10, 11, 12, 13). For this purpose, after the bus network addresses have been determined by the bus participants (1, 2, 3, 7, 10, 11, 12, 13), the highest first bus participant (14) sends an activation message to the bus participants ( 1, 2, 3, 7, 10, 11, 12, 13), which will be explained in more detail later. It is particularly useful if the highest first bus participant (14) has the bus address, the bus subnetwork number and the number of connected bus subnetworks and the connected bus participants on each bus node (first bus participant 7, 10, 11). In this way a topology check is possible. If the topology does not match a predetermined topology, the highest first bus participant (14) can, for example, also check the specific assignment of the plugs on the first bus participants and thus identify failed and/or interrupted bus subnetworks (4, 9a-9i) or identify failed subtrees and initiate corresponding error messages and emergency running programs.

In this case, it is particularly conceivable that in the case of a tree structure, inactive connections are activated from a first subordinate bus subscriber of a first subordinate subtree to another second subordinate bus subscriber of another second subordinate subtree, which are switched off in normal operation. The first subordinate bus subscriber of a first subordinate subtree thereby becomes the first bus subscriber of the bus subnetwork of the second subordinate bus subscriber of the second subordinate subtree. When constructing such replacement connections, care must be taken to ensure that a tree structure results again after activation after the failure of a connection or a bus participant.

The information for determining the logical bus network address within the bus network (5) can be transmitted to the second or further bus participants (2, 3, 12, 13) at different times, for example in the form of a look-up table become. In addition to pre-programming during the production of the second or further bus participants (2, 3, 12, 13), the exemplary look-up table (address table) can be used for the second and further bus participants (2, 3, 12, 13). the starting phase of the bus network (5) and/or after a restart of the bus network (5) and/or when an addressing error is detected and/or upon request from a second or further bus participant (2, 3, 12, 13) are transmitted by the respective first bus participant (1, 7, 10, 11, 14). Instead of transmitting and/or providing information or in addition to this, it is also conceivable to transmit or provide algorithms that enable the second and/or further bus participants (2, 3, 11, 12) to do so to calculate the look-up table and/or to calculate individual data of such a look-up table, which typically makes the storage of the look-up table unnecessary. Of course, this also applies to the first and further first bus participants (14, 1, 10, 11) if they are part of a higher-level bus subnetwork (8). The transmission typically takes place without specific addressing to a specific bus subscriber (2, 3, 12, 13) of the respective bus subnetwork (4, 9a-9i), since it is not certain that the latter has a valid address at this point in time . Rather, the transmission takes place as a broadcast, i.e. as a transmission from the respective first bus participant (1, 7, 10, 11) to all second and further bus participants (2, 3, 12, 13) of the respective exemplary bus subnetwork ( 4, 9a-9i) or a connected subtree.

A proposed bus subnetwork (4, 9a-9i) is characterized by the fact that it includes second and further bus participants (2, 3, 12, 13) which are capable of or are set up to carry out the previously described method to carry out. It therefore typically contains a second and/or further bus participant (2, 3, 12, 13), which has the properties described above and is capable of carrying out a proposed method for determining the bus network address in a bus network (5). A proposed bus network (5) therefore comprises at least one bus node, i.e. a first bus subscriber (1, 7, 10, 11, 14), which is connected to at least one bus sub-network (4, 8, 9a-9i). of the type described above.

To carry out the method described above, it makes sense for each of the bus subnetworks (4, 8, 9a-9i) to be provided with a bus subnetwork number that is unique to the bus network. This must be achieved by programming the control devices that form the first bus participants (1, 7, 10, 11, 14) in the bus nodes. In one embodiment of the proposal, the control devices can be programmed and manufactured specifically for the bus node or their programming includes the programming of all bus node positions, in which case the specific bus node program is then selected based on a bus node address. In order to prevent the control devices, i.e. the first bus participants (1, 7, 10, 11, 14) from being mixed up with one another, and thus the bus sub-networks (4, 8, 9a-9i), it is advisable, for example, to use the physical ones Connections of the control devices, i.e. the first bus participants (1, 7, 10, 11, 14), and the bus subnetworks (4, 8, 9a-9i) are designed to be interchangeable. As a result, the respective bus sub-network address is assigned to a specific physical connection and/or plug on the bus node, i.e. the control device, which is identical to a first bus participant (1, 7, 10, 11, 14). Another form of mix-up security can be guaranteed, as described above, in that the first bus participants (1, 7, 10, 11, 14), i.e. the bus nodes, themselves, as described, have a said higher-level serial bus Form sub-network (8). The bus node address then results as the bus subnetwork address of the respective first bus participant (1, 7, 10, 11). Using this bus sub-network address, each first bus subscriber can then select the correct bus node program and assign an individual bus sub-network (4, 9a to 9i) to the bus sub-networks (4, 9a to 9i) connected to this first bus subscriber (10, 1, 11, 7). Assign subnet number. From these bus sub-network numbers determined in this way, the second and further bus participants (2, 3, 12, 13) can then determine their individual, unique bus network address within the bus network (5).

In this special embodiment of the proposal itself, the first bus participants (10, 11, 7, 1) form a higher-level serial bus subnetwork (8). This hierarchy gives the bus network (5) a special hierarchical topology, which is part of the disclosure and has more than two hierarchy levels (see 5 ) may include. The topology of the bus network (5) is then the very general structure of a directed cycle-free graph without multiple edges. Such a structure is also called a tree. Parts of this tree are then the subtrees already mentioned. The origin of the graph is then the highest first bus participant (14). Various bus sub-networks (8, 9a to 9i) are then attached to this, which can be linear without branches (e.g. bus sub-networks 9a to 9i) or branch-shaped with branches (e.g. bus sub-network 8). Each bus participant (10, 1, 11) of a linear main branch of a branch now first determines its subtree-specific bus address for its bus subnetwork (8) in the manner already described. He then uses a data message in a role as the first bus participant (e.g. 1) of a bus subnetwork (e.g. 9e) to cause the first further bus participant (13) of this first bus subnetwork (e.g. 9e) to act as Branch is connected to determine its bus position and thus the bus network address. In the said alternative bus position determination method, the process would begin analogously with the last additional bus participant (12), in which case the process runs from the end of the chain analogously to the process described below. This is made clear below by the fact that the alternative method is always marked with “or.” After the address determination for the initial additional bus participant (13 or 12), the additional or second bus participant (eg 2 or 3) following or preceding in the bus subnetwork is used to determine the bus position and the bus -Network address initiated by the preceding additional bus participant (13) and/or the first bus participant (e.g. 1). This happens until all bus participants in a bus subnetwork (e.g. 9e) have received a unique bus network number and the last additional bus participant (e.g. 12) or the first additional bus participant (e.g. 13) has a bus -network address and has preferably informed the first bus participant (e.g. 1) of its bus subnetwork (e.g. 9e) that it is the last bus participant (e.g. 12) or first bus participant (e.g. 13) of this bus Subnetwork (9e) and the address assignment within this hierarchy level for this bus subnetwork (eg 9e) is completed. In this way, the bus position within the bus subnetwork can be assigned using both bus position determination methods. Further methods for determining a bus position within a serial bus subnetwork are known from the prior art, which will not be explained further here. Subsequently, the first bus participant (e.g. 1) of this burst subnetwork (e.g. 9e) initiates the first further bus participant (e.g. 13) which bus subnet may be connected to it to initiate tasks at a lower hierarchy level to determine the address. However, this is not the case here for all bus participants of the bus subnetworks (9a to 9i) and will be explained later. It is particularly advantageous if the bus participants of a bus subnetwork (e.g. 9e) also send other information to the send back to the first bus participant (e.g. 1) of your bus subnetwork (e.g. 9e). This information typically includes, for example, at least partially the last bus network address, the number of following bus participants, the number of following nodes with branches and thus the number of connected sub-networks.

It makes sense if a first bus participant (e.g. 1) sends information about the number of bus participants (13, 2, 3, 12) of a bus subnetwork (e.g. 9e) connected to it to the respective second and further bus participants (13, 2, 3, 12). preceding bus participants (1, 2, 3, 13, 12) within its higher-level bus subnetwork (8), which are located in preceding bus subnetworks (9f to 9i), or via the number of preceding bus subnetworks (9f -9i) or via the number of the preceding first bus nodes (10), i.e. the preceding first bus participants (10, 14), and/or via the number of bus hierarchy levels or the bus level within a bus subtree and/ or a bus subnetwork number that is unique to the first bus subscriber is transmitted.

Carrying out the proposed method thus ensures that each of the second and further bus participants (13, 12, 2, 3) has a unique one, regardless of which bus subnetwork (4, 9a to 9i) they are currently in Bus network address related to the entire bus network (5) has or automatically by means of information available to the second and / or further bus participants (2, 3), for example a look-up table, and / or by means of an algorithm that is also available to the second or further bus participants (2, 3). The bus network addresses within the bus network (5) determined in this way by the bus participants themselves are typically activated by a command from the highest first bus participant (14). Such a command can refer to all bus participants of the bus network (5), the bus participants of a single connected subtree of several bus subnetworks and/or a single bus subnetwork and/or a single bus participant. The bus network address may already be used here. At this point in time, the bus participants can be addressed both via their bus position by the respective first bus participant in their bus subnetwork and via the self-determined bus network address. At this point it is still advantageous if addressing via the bus network address requires a special command. In the final state. But this special command reduces bus throughput. Therefore, the determined bus network address must be able to be used as standard addressing without a special command. This is done by activating the determined bus network addresses. For this purpose, the highest first bus participant (14) sends an activation command to all bus participants (2, 3, 7, 10, 12, 13) by means of a broadcast message. This activation command activates all bus participants via the bus network address. Addressing via a bus address that has not yet been activated before activation requires an additional control command from the sending bus participant, which distinguishes the following bus network address from a bus position within the bus subnetworks. Activation eliminates the need for such marking of the bus network address. Addressing via an activated bus address after activation does not require any additional control command from the sending bus participant that distinguishes the following bus network address from a bus position within the bus subnetworks. However, after activation, addressing via a bus position within a bus subnetwork requires an additional control command from the sending bus participant, which distinguishes the following bus position from a bus network address within the bus subnetworks. When activated, the bus position and bus network address swap roles. In principle, both addressing options can be maintained. However, this is not absolutely necessary.

In order to be able to provide the bus subnetwork number, the first bus participant (1) and possibly the other first bus participants (7, 10, 11, 14) would have to have a unique bus node identifier. In addition to the self-addressing mentioned, this can be done, for example, by coding using a plug and/or programming. The first and/or further first bus participants (1, 7, 10, 11, 14) are now assigned to a bus subnetwork (4, 9a-9i) in which a bus participant (2, 3, 12, 13 ) is to determine a bus address, a bus subnetwork number that is unique to the bus network (5). The first or further first bus subscriber (1, 7, 10, 11, 14) transmits this bus sub-network number of the said respective bus sub-network (4, 9a to 9i) of a second bus subscriber (eg 2) to this second bus Participants (e.g. 2). In another version of the proposal, the second bus participant receives this information from the preceding bus participant (eg 13). Said second bus subscriber (2) then determines the bus sub-network number of its bus sub-network (4, 9a to 9i) based on said information and/or said algorithm and this transmitted bus sub-network number. the logical bus address of this second bus participant (2) within the bus network (5).

Due to the interchange-proof design of the plugs and connections of the control devices, i.e. the first bus participants (1, 7, 10, 11, 14), the plugs and/or lines for the bus sub-networks (4, 9a-9i) can be coded and assigned to a unique bus subnetwork number.

The proposed method and the proposed devices thus combine the known advantages of car addressing from the prior art with the advantages of a star-shaped network and make them available for use without increasing the programming effort during vehicle assembly too much.

1 shows the topology of an exemplary simple bus network (5) with a first bus participant (1), which is typically a control device, a first further bus participant (13), a second bus participant (2), another bus -Participants (3) and a last additional bus participant (12). The bus participants are connected serially, starting with the first bus participant (1) from left to right by data lines (6). The second and further bus participants (2, 3, 12, 13) form a bus subnetwork (4). The length of the bus subnetwork in the sense of the number of bus participants (2, 3, 12, 13) following one another in series is indicated as not being determined. In order to reach a rear bus participant (e.g. 12), the data must pass through the bus nodes in front of it (e.g. 2, 3, 13). An exemplary network from the prior art with this topology is the LIN bus network.

2 shows an exemplary star-shaped extension of the bus system (5). 1 . In this example, three bus subnetworks (9g-9i) of the originally one bus subnetwork (4) are shown as examples. The bus system (5) has a star-shaped basic structure around the bus node, the first bus participant (1). The number of bus subnetworks (4, 9g, 9h, 9i) is not fixed at three and may vary from application to application. The length of the bus subnetworks (4, 9a, 9b, 9c) can vary from bus subnetwork (e.g. 9g) to bus subnetwork (e.g. 9h) and does not necessarily have to be the same. The respective first further bus participant (13) is connected to the first bus participant (1). The respective serial bus is terminated by a respective last additional bus participant (12).

3 shows an exemplary more complicated structure with two hierarchy levels of a bus system (5) based on 2 with three bus nodes, i.e. first bus participants (1, 7), and three bus subnetworks (4, 9a-9i). In addition to the first bus subscriber (1), the exemplary bus network (5) includes further first bus subscribers (7) with further bus sub-networks (4, 9a to 9cf), all of which can be designed differently. The second and further bus participants (12, 2, 3, 13) receive the bus subnetwork number from the respective bus node, i.e. the respective assigned first bus participant (1, 7). These control devices in these bus accounts recognize, for example, based on plug coding, which role of which first bus participant (1, 7) they should assume. Based on this determined position in the higher-level NON-serial network, these first bus participants (1, 7), for example, then transmit the respective look-up table to the respective second and further bus participants (12, 13, 2, 3). Likewise, the control devices, which play the role of the first bus participants (1, 7), transmit the respective information to the first and second bus participants (12, 13, 2, 3) of each bus subnetwork (4, 9a-9i). Bus subnetwork number of their respective bus subnetwork (4, 9a-9i). This information can also be passed on within the chain of the respective bus subnetwork, as described above. Typically, at least one of the bus nodes, the first bus participants (1, 7), and/or second or further bus participants (2, 3), for example the first bus participant (1), has a further data interface, with which the bus network (5) can be accessed. It is then typically the highest bus node (highest first bus participant (14)). All bus participants (1, 2, 3, 7, 12, 13, 14) of the bus network (5) can use this data interface. for example, to re-determine their bus addresses within the bus network (5).

4 shows a similar bus network (5) as 3 . Here, the topology of the higher-level network is changed so that the network of the first bus participants (14, 1, 10, 11) itself forms a bus sub-network compared to a highest first bus participant (14), namely a higher-level bus sub-network ( 8) forms. The other bus subnetworks (9a to 9i) are subordinate to this. The addressing now preferably takes place in such a way that first the bus participants (10, 1, 11) of the higher-level bus sub-network of a bus receive a network address related to the bus network (5) and then the participants of the lower-level bus sub-networks ( 9a to 9i). The completion of the addressing of the higher-level bus sub-network (8) is reported by the last bus participant (here 11) of the higher-level bus sub-network (8) to the first bus participant (here 14) of the higher-level bus sub-network (8). , whereupon this starts addressing the subordinate th bus subnetworks (9g to 9i) for the closest subordinate first bus subscriber (10) of the higher-level bus subnetwork (8). This then addresses all connected bus subnetworks (9g to 9i), which also includes the addressing, not shown here for simplicity, of these additional bus subnetworks.

After addressing the bus subnetworks (9g-9i) of this subordinate first bus subscriber (10), the bus subscribers of the bus subnetworks (9d to 9f) and their subordinate, not shown bus subnetworks, on the subsequent subordinate one, are addressed first bus participants (1) etc. until all bus subnetworks (9a-9i) of all subordinate first bus participants (1, 10, 11) of the higher-level bus subnetwork (8) are addressed and thus a unique bus network address for received the bus network (5).

5 shows an exemplary complex structure with three hierarchy levels of bus subnetworks.

The highest bus subnetwork begins at the highest first bus subscriber (14), which, for example, has a data interface for controlling the bus subnetwork.

For example, three bus subnetworks (4a, 4b, 4c) are connected to this highest first bus subscriber (14).

The first bus subnetwork (4a) consists of a first further bus subscriber (13), a further bus subscriber (3) and a last further bus subscriber (12).

The second bus subnetwork (4b) only consists of a first further bus subscriber (13) and a last further bus subscriber (12).

The third bus subnetwork (4c) is a higher-level bus subnetwork of the first hierarchy level. It consists of a first first bus participant of the first hierarchy level (7a), followed by a second first bus participant of the first hierarchy level (7b), followed by a third first bus participant of the first hierarchy level (7d), followed by a fourth first bus participant of the first hierarchy level (7f), followed by a fifth first bus participant of the first hierarchy level (7g), followed by a sixth first bus participant of the first hierarchy level (7h). The sixth first bus subscriber (7h) is the last bus subscriber of the third bus subnetwork (4c).

A fourth bus subnetwork (4d) of the second hierarchy level with the bus subnetwork number 4 is connected to the first first bus subscriber of the first hierarchy level (7a). It consists of a first first bus participant of the second hierarchy level (7c), followed by a second first bus participant (7k) of the second hierarchy level. This is the last bus participant of the fourth bus subnetwork (4d).

The fifth bus sub-network (4h) of the third hierarchy level is connected to the first first bus subscriber of the second hierarchy level of the fifth bus sub-network (7c). Its first additional bus participant (13) is connected to its last additional bus participant (12). The fifth bus subnetwork (4d) has bus subnetwork number 5.

The sixth bus sub-network (4i) of the third hierarchy level is connected to the second first bus subscriber of the second hierarchy level of the fifth bus sub-network (7k). Its first additional bus participant (13) is connected to its last additional bus participant (12).

The seventh bus sub-network (4j) of the third hierarchy level is also connected to the second first bus subscriber of the second hierarchy level of the fifth bus sub-network (7k). Its first further bus subscriber (13) is connected to a second bus subscriber (2), which in turn is connected to a further bus subscriber (3), etc. until the seventh bus subnetwork (4j) is connected to a last further bus -Participant (12) is completed.

An eighth bus subnetwork (4s) of the second hierarchy level with the bus subnetwork number 8 is connected to the second first bus subscriber of the first hierarchy level (7b) of the third bus network (4c) of the first hierarchy level. It consists of a first first bus participant of the second hierarchy level (7i), followed by a second first bus participant (7j) of the second hierarchy level. This is the last bus participant of the eighth bus subnetwork (4s) of the second hierarchy level.

The ninth bus sub-network (4g) of the third hierarchy level is connected to the first first bus subscriber of the second hierarchy level of the eighth bus sub-network (7i). Its first additional bus participant (13) is connected to its last additional bus participant (12). The ninth bus subnetwork (4g) has bus subnetwork number 9.

The tenth bus subnetwork (4f) of the third hierarchy level is on the second first bus part Subscriber of the second hierarchy level of the eighth bus subnetwork (7j) is connected. Its first additional bus participant (13) is connected to its last additional bus participant (12). The tenth bus subnetwork (4f) has bus subnetwork number 10.

The eleventh bus sub-network (4e) of the third hierarchy level is also connected to the second first bus subscriber of the second hierarchy level of the eighth bus sub-network (7j). Its first additional bus participant (13) is connected to its last additional bus participant (12). The eleventh bus subnetwork (4e) has bus subnetwork number 11.

A twelfth bus subnetwork (4k) of the second hierarchy level with the bus subnetwork number 12 is connected to the third first bus subscriber of the first hierarchy level (7d) of the third bus network (4c) of the first hierarchy level. It consists of a first bus participant of the second hierarchy level (7e). This is the last bus participant of the twelfth bus subnetwork (4k) of the second hierarchy level. The twelfth bus subnetwork (4e) has bus subnetwork number 12.

The thirteenth bus sub-network (4m) of the third hierarchy level is connected to the first first bus subscriber of the second hierarchy level of the twelfth bus sub-network (7e). Its first additional bus participant (13) is connected to a second bus participant (2), followed by another bus participant (3), etc. Its last additional bus participant (12) closes the chain of bus participants thirteenth bus subnetwork (4m) of the third hierarchy level. The thirteenth bus subnetwork (4m) has bus subnetwork number 13.

The fourteenth bus sub-network (4l) of the third hierarchy level is also connected to the first first bus subscriber of the second hierarchy level of the twelfth bus sub-network (7e). Its first additional bus participant (13) is connected to a second bus participant (2), followed by another bus participant (3), etc. Its last additional bus participant (12) closes the chain of bus participants fourteenth bus subnetwork (4l) of the third hierarchy level. The fourteenth bus subnetwork (4l) has bus subnetwork number 14.

The fifteenth bus sub-network (4n) of the third hierarchy level is connected to the fourth first bus subscriber of the first hierarchy level of the third bus sub-network (7f). Its first additional bus participant (13) is connected to a second bus participant (2), followed by another bus participant (3), etc. Its last additional bus participant (12) closes the chain of bus participants fifteenth bus subnetwork (4n) of the third hierarchy level. The fifteenth bus subnetwork (4n) has bus subnetwork number 15.

The sixteenth bus sub-network (4o) of the third hierarchy level is also connected to the fourth first bus subscriber of the first hierarchy level of the third bus sub-network (7f). Its first additional bus participant (13) is connected to a second bus participant (2), followed by another bus participant (3), etc. Its last additional bus participant (12) closes the chain of bus participants sixteenth bus subnetwork (4o) of the third hierarchy level. The sixteenth bus subnetwork (40) has bus subnetwork number 16.

The seventeenth bus sub-network (4p) of the third hierarchy level is connected to the fifth first bus subscriber of the first hierarchy level of the third bus sub-network (7g). Its first further bus subscriber (13) is connected to a second bus subscriber (2), followed by a last further bus subscriber (12), which is the chain of bus subscribers of the seventeenth bus sub-network (4p) of the third Hierarchy level completes. The seventeenth bus subnetwork (4p) has bus subnetwork number 17.

The eighteenth bus sub-network (4q) of the third hierarchy level is connected to the sixth first bus subscriber of the first hierarchy level of the third bus sub-network (7h). Its first further bus subscriber (13) is connected to a second bus subscriber (2), followed by a last further bus subscriber (12), which forms the chain of bus subscribers of the eighteenth bus subnetwork (4q) of the third Hierarchy level completes. The eighteenth bus subnetwork (4q) has bus subnetwork number 18.

The nineteenth bus sub-network (4r) of the third hierarchy level is also connected to the sixth first bus subscriber of the first hierarchy level of the third bus sub-network (7h). Its first additional bus subscriber (13) is connected to a last additional bus subscriber (12), which completes the chain of bus subscribers of the nineteenth bus subnetwork (4r) of the third hierarchy level. The nineteenth bus subnetwork (4r) has bus subnetwork number 19.

The bus network (5) is now addressed in such a way that the bus participants each have their bus position in the nineteen bus sub-networks (4a to 4s) of the different hierarchy levels notice. This can be caused, for example, by the switch-on process, a detected error and/or a broadcast command from a higher-level first bus participant.

The first bus network address is generated for itself by the highest first bus participant (14). This then generates the first bus sub-network number for the first bus sub-network (4a) and transmits the number of recognized bus sub-networks, i.e. 1, to said first bus sub-network. Its first bus subscriber (13) generates its bus network address based on this information, bus sub-network number and bus position in its bus sub-network (4a). It then passes on the bus subnetwork number to the downstream second bus participant (2) if it has not already received this number via broadcast from the associated first bus participant (14). This causes this second bus participant to generate its bus network address and so on until the last bus participant (12) has generated its address. This reports the bus sub-network number and the complete address assignment to the first bus subscriber (14), whereupon, if additional bus sub-networks are present, the bus sub-network number is increased by a predetermined amount and the address is assigned in the next bus sub-network, the second bus -Subnetwork (4b) begins. In contrast to the first and second bus subnetworks (4a, 4b), the third bus subnetwork (4c) is the highest bus subnetwork hierarchy level of an entire subtree. If the address assignment process reaches this bus sub-network (4c), then the bus addresses of all first bus participants (7a, 7b, 7d, 7f, 7g, 7h) of this third bus sub-network (4c) are preferably first transmitted through these first bus sub-networks (4c). Participants (7a, 7b, 7d, 7f, 7g 7h) determined as previously described. The highest first bus participant (14) then causes these first bus participants (7a, 7b, 7d, 7f, 7g, 7h) to contact the bus participants of their connected bus subnetworks of the second hierarchy level (4d, 4s, 4k, 4n, 4o, 4p, 4q, 4r) to determine the address. This process preferably begins again with the first bus participant (7a) closest to the highest first bus participant (14), followed by the next first bus participant (7b), etc. until the process begins with the last first bus participant ( 7h) of this bus subnetwork (4c) of the first hierarchy level ends. The address assignment in the connected bus subnetworks (4d, 4h, 4i, 4j) of the first first bus subscriber (7a) of the third bus subnetwork (4c) is again hierarchized first in the second and then in the third hierarchy level. With each fully addressed bus subnetwork, the associated first bus subscriber increases the bus subnetwork number until all of its connected bus subnetworks are fully addressed and then passes this bus subnetwork number to the higher-level first bus subscriber or a subsequent bus subnetwork. Participants in the bus subnetwork of their hierarchy level continue.

6 shows the network 5 with an additional twentieth bus subnetwork (4t`) between the fourth first bus subscriber (7f) of the third bus subnetwork (4c) of the first hierarchy level and the first first bus subscriber (7e) of the twelfth bus subnetwork (4k) the second level of the hierarchy. In the course of determining the bus network addresses, for example, the fourth first bus subscriber (7f) of the third bus subnetwork (4c) of the first hierarchy level determines that the bus subscribers of the twentieth bus subnetwork (4t`) already have a bus address, namely one of the twelfth bus subnetwork (4k). It is assumed here that the bus address assignment in a bus subnetwork always runs from the first (13) to the last bus participant (12) of the respective bus subnetwork. As explained, other methods are also possible. In this respect, this is just an example, but it can also be used analogously for the other bus position determination methods. If the fourth first bus subscriber (7f) of the third bus subnetwork (4c) of the first hierarchy level has determined that the additional twentieth bus subnetwork is redundant, it will shut it down until further notice. However, this additional bus subnetwork may be necessary, particularly in applications with increased security requirements, in order to be able to reach the relevant bus participants even if subtrees of the bus network fail. The method presented here is therefore suitable even for networks that are not organized as a tree, e.g 3 to be able to create a tree structure.

The special thing about such a bus network (5) is that it actually has no physical topology in the sense that the bus network (5) at least partially has the topology of a directed cycle-free graph without multiple edges, since it has additional buses -Subnetworks (4t`). By deactivating these additional bus subnetworks (4t`) after determining the bus addresses, such a topology is created again at a logical level. In some cases it may make sense to deactivate the twentieth bus subnetwork (4t`) and deactivate another bus subnetwork, in this case for example the twelfth bus subnetwork (4k). After the respective bus addresses of the bus participants (1, 7, 7a-7k, 10, 11, 12, 13, 14) have been determined by them and after the additional bus subnetworks (4t`) have been deactivated at least temporarily The proposed bus network (5) is a logical one Topology such that the bus network (5) at least partially has the topology of a directed cycle-free graph without multiple edges.

Claims (1)

Bus network (5), a. wherein the bus network (5) comprises at least one bus node, i.e. at least one first bus subscriber (7a-7k, 14), which is connected to at least one serial bus sub-network (4a-4s), and b. wherein the serial bus sub-network (4a-4s) is a serial bus sub-network (4a-4s) of the bus network (5) and c. wherein the serial bus subnetwork (4a-4s) comprises a further bus subscriber (3, 12) and d. wherein the serial bus subnetwork (4a-4s) comprises at least one second bus subscriber (2), and i. wherein the further bus subscriber (3, 12) only communicates via the second bus subscriber (2) with a first bus subscriber (7a-7k, 14) in the serial bus sub-network (4a-4s) of the bus network ( 5) is connected and ii. wherein the second bus subscriber (2) is set up to carry out a method to determine the bus position of the second bus subscriber (2) within the serial bus subnetwork (4a-4s) relative to the first bus subscriber (7a -7k, 14), which is assigned to the serial bus subnetwork (4a-4s) as this first bus subscriber (7a-7k, 14), to be clearly determined and iii. wherein in the method a bus subscriber (13) receives bus position 1 if it is closest to this first bus subscriber (7a-7k, 14) or iv. wherein in the method the bus subscriber (12) receives bus position 1 if he is the last other bus subscriber (12), and v. wherein the second bus participant (2) holds information, a look-up table, and/or algorithms or receives it from this first bus participant (7a-7k, 14), which determines the said determined bus position within the Link the serial bus subnetwork (4a-4s) with a logical bus network address within the bus network (5) and vi. that the second bus participant (2) determines the logical bus network address of the second bus participant (2) within the bus network (5) based on said information and/or said algorithm, vii. wherein the second bus subscriber (2) uses at least one sub-device of the second bus subscriber (2) to carry out the method which determines the logical bus network address of the second bus subscriber (2) based on said information and/or said algorithm. determined within a bus network (5) and characterized , e. that the bus network (5), at least in one sub-network, at least temporarily does not have a physical topology of a directed cycle-free graph without multiple edges and f. that it has additional bus sub-networks (4t`) within this sub-network of the bus network (5), which are at least temporarily deactivated after the logical bus network addresses have been determined, and g. that the bus network (5) and / or said sub-network of the bus network (5) after determining the respective logical bus network addresses of the bus participants (7a-7k, 2, 12, 13, 14) by the same and after the at least temporary deactivation of the additional bus subnetworks (4t'), at least partially has a logical topology of a directed cycle-free graph without multiple edges.

Images