furthermore , exemplary embodiments are described for the method and device according to the present invention . these specific examples are used to explain the embodiment , but they do not limit the scope of the inventive thought . first of all , in a first exemplary embodiment , with the aid of fig1 through 3 , we shall describe the states of the fast - can controller and the associated data transmission properties , as well as their transition and the transition conditions required for this . fig1 represents the three operating states of the fast - can controller : standard can 101 , fast - can - arbitration 102 and fast - can - data 103 . in the operating state standard can 101 , it works according to the standard can protocol . in the operating state , fast - can arbitration 102 behaves like a standard can controller , but is also able to change into fast - can data state 103 . in fast - can data state 103 , it works like a standard can controller , but having a shorter bit time . after the switching - on , the controller is in fast - can arbitration mode 102 , when this is requested by the application program . otherwise , after switching - on , it is in standard can mode 101 . a change is provided in the bit length in time by a change in the scaling factor (“ prescaler ”) between the bus unit of time (“ time quantum ”) and the smallest time unit (“ minimum time quantum ”) or the oscillator clock pulse in running operation . the length of the bus time unit , and thus the length of the bits , is set thereby . the bit time segments , whose length is measured in bus time units , remain unchanged , and so do the rules for resynchronization and the position of the sample points . in the states fast - can - arbitration 102 and standard can 101 , the long bus time unit is used , and in the state fast - can - data 103 the short bus time unit . alternatively , the settings of the bit time segments could also be changed , depending on the state and the bus time unit used , which will be mentioned in greater detail in connection with fig2 . in the fast - can arbitration state 102 , for example , “ reserved bit ” ro , which in the can frame lies before data length code dlc , is sent recessively as identification . in the standard can protocol it is specified that this bit has to be sent in dominant fashion . when a fast - can controller receives this bit dominantly , it changes durably to the standard can state ( state change t 1 or t 2 ). this assures that fast - can and standard can controllers are able to be used in the same network and that then both work in the standard can protocol . another bit may also be selected as identification , for which a fixed value is specified in the standard can protocol . a fast - can controller in the state fast - can arbitration 102 , which as identification , for example , recessively receives “ reserved bit ” ro before the dlc or successfully sends it recessively , switches over , as of the sample point of this bit , to the shorter bus time unit by switching over the scaling factor , and changes to the state fast - can data 103 ( state change t 3 ). the state change may also take place using an at least approximately constant time distance or after expiration of a specified number of bus time units after the sample point . a fast - can controller in the state fast - can data 103 remains in this state until one of two conditions applies : if ( a ) or ( b ) is satisfied , the controller switches back into the state fast - can arbitration 102 ( state change t 4 ). in the range between dlc and crc delimiter , according to the can protocol there are two reasons to start an error frame : ( a1 ) the transmitter sees a bit error or ( a2 ) a receiver sees a stuff error . at the end of the possibly superposed error flag , the beginning of the error delimiter , all the controllers in the network are in state fast - can arbitration 102 . both in ( a1 ) and ( a2 ), and also in ( b ), change t 4 takes place into state fast - can arbitration 102 , and consequently the switching over of the scaling factor at the sample point at which the condition applies , or having an at least approximately constant time distance from this . the state change may also take place after the expiration of a specified number of bus time units after the sample point , for instance , at the end of phase buffer segment 2 ( compare fig2 ). fig2 describes the subdivision of each transmitted bit into bit time segments , whose length is measured in bus time units . these settings are usually configured in each bus user , and they are used to balance out signal propagation times on the bus and tolerances among the clock generators or oscillators used . in fast - can controllers according to the present invention , it may now be provided that the settings of the bit time segments be taken care of individually , depending on the state and / or the currently used bus time unit . for this , the corresponding registers in which the configuration settings are stored , are doubly provided . in the example stated , the individual segments for a bit 210 are shown at a bus time unit of 200 ns , and the segments for four successive bits 220 at a bus time unit of 50 ns . for bit 210 , the propagation time segment has a length of only one bus time unit , while phase buffer segment 1 and 2 occupy 4 bus time units each . however , in the case of each bit from 220 , the length of the propagation time segment and phase buffer segment 1 and 2 amounts to 3 bus time units each . in the states fast - can arbitration 102 and standard can 101 , the long bus time unit is used and the bit time segments correspond to those of bit 210 shown , and in state fast - can data 103 , the short bus time unit is used , and the bit time segments correspond to those of bit 220 . in particular , it may be advantageous , in the case according to the present invention , in the state fast - can data to select the propagation time segment to be as small as possible , that is , for example , only one bus time unit in length , and to select the two phase buffer segments correspondingly as large as possible , in order to be able to balance out the oscillator tolerances , which are able to become relevant particularly at the high transmission rates in the state fast - can data , as well as possible by the can resynchronization mechanism . the design of the data frames used , the ranges having different bit lengths , their dependence upon the respective state of the controller and the identification according to the present invention will be explained below , with reference to fig3 . fig3 shows the structure of a can data frame according to iso11898 - 1 in the two possible variants , the standard format and the extended format . for both variants the regions are drawn in which , according to the present invention , switching over takes place between states fast - can arbitration 102 and fast - can data 103 . shown also is the switching over of the bit length that goes along with this , as well as the corresponding change in the scaling factor . finally shown , is the position selected still in this exemplary embodiment of the identification according to the present invention , in “ reserved bit ” ro , which is transmitted before the dlc . the benefit of the method shown in the first exemplary embodiment for the data transmission rate is illustrated by the following calculation : we assume a length of the data field of 8 bytes , a data frame in the standard format having 11 - bit addressing , as well as a baud rate of 500 kbit / s . moreover , it is assumed that the scaling factor according to “ reserved bit ” ro is increased by a factor of four . in this case , the bit length , that is , according to “ reserved bit ” ro of 2 microseconds would be reduced to 0 . 5 microseconds . ignoring possible stuff bits , in this example , per data frame , 27 bits ( sof , identifier , rtr , ide , r0 , ack field , eof , intermission ) having normal bit length and 84 bits ( dlc , data , crc , crc delimiter ) having shortened bit length are transmitted , which yields an effective transmission performance of 111 bits in 96 microseconds . at the same assumed bus loading , this corresponds to a data transmission rate that is increased compared to the unmodified standard can transmission by a factor of 2 . 3 . in the case of otherwise equal conditions , if we assume an extended format having 29 bit addressing , then , per data frame , 47 bits having normal bit lengths and 84 bits having the shortened bit length are transmitted , which yields an effective transmission performance of 131 bits in 136 microseconds . at the same assumed bus loading , this corresponds to a data transmission rate that is increased compared to the normal transmission performance by a factor of 1 . 9 . one additional exemplary embodiment is shown in the following , with reference to fig4 and 5 . fig4 shows a system matrix of a ttcan network , according to iso11898 - 4 , having the base cycles and time windows described . there are time windows that are designated by “ message a ”, “ message c ”, etc ., which are available exclusively for the transmission of certain data frames , while in other time windows that are designated by “ arbitration ”, the bus access is issued by ordinary can arbitration . in the second exemplary embodiment , all data frames for which nothing else is described are treated according to the method of the first exemplary embodiment . in addition , for certain time windows fixed ahead of time that are exclusively allocated , a shortening of the bit length is undertaken , by adjusting the scaling factor even earlier , for instance , as of the sof bit and maintained , for instance , to the end of the crc field . one example of a data frame transmitted in such a modified manner is shown in fig5 . as identification for the imminent rapid transmission , for example , a reserved bit of the preceding reference message may be drawn upon . setting this bit would signal , in the case described , that the data frames , which are transmitted in the following base cycle in exclusive time windows , are transmitted in an accelerated manner already as of the sof bit and to the end of the crc field , which means at reduced bit length . in one preferred specific embodiment it is conceivable that only those exclusive data frames which are transmitted in each base cycle , that is , having repetition factor one , are additionally accelerated by the method . this case is shown in fig4 . this correlation is represented in fig4 . in the system matrix shown in exemplary fashion , the data frames designated by “ message a ” and “ message c ” would then be transmitted in an accelerated manner , according to the method explained , having a corresponding identification in the respectively preceding reference message . for the method described in the second exemplary embodiment , it is also possible to do without the identification and to establish that , in all exclusive time windows , the data frames are basically transmitted in an established range , such as between the sof bit and the end of the crc field having shortened bit length . it is for this reason that , in fig4 , the identification is marked “ optional ”. the usefulness of the method in the second exemplary embodiment shown is greater than in the first example , since the bits of arbitration and control field are rapidly transmitted within the exclusive time windows . the data transmission rate actually achieved depends at least on the proportion of the exclusive time windows and the type of addressing . a method modified compared to the method specified in iso 11898 - 1 may be required in the fast - can controller for handling of the transmission confirmation ( crc delimiter and acknowledge slot ), as is explained in greater detail in fig6 . shown in fig6 under “ a ” is the ideal sequence of the transition from the state fast - can data to fast - can arbitration at very short internal processing times and signal propagation times . the sender sends the crc delimiter as a single recessive bit , and , according to the previously described exemplary embodiments of the present invention , changes , for example , at the sample point of this crc delimiter bit or after the passing of phase buffer segment 2 , into the fast - can arbitration state . at this bit position , for instance , the receivers , too , change to the state fast - can arbitration . these state transitions t 4 having the resetting of the scaling factor are able to take place in the various bus users at times that do not match exactly , possibly because of signal propagation times or internal processing times . that is , the participating bus users , at times that do not exactly agree , set their scaling factor for the bus time unit again to the initial state . from this , different starting , time points of the next bit result for the bus users . after receipt of the crc delimiter , if its crc check was positive , each receiver sends a single dominant acknowledge bit . if this happens relatively late , because , for example , the receivers are connected at distant ends of the bus , the recessive crc delimiter bit is able to appear longer than one bit . this case is shown in fig6 under “ b ”. by the superposition of acknowledge bits , the acknowledge slot may additionally appear longer than a bit , as shown in fig6 under “ c ”. in order to balance the phase - shifted sending times of these acknowledge bits , if necessary , the handling of these bits in fast - can controllers is able to be changed to the extent that , in the state fast - can arbitration , a dominant acknowledge slot of one or two bit length , which begins after the crc delimiter , or even one bit later , is acknowledged as a valid acknowledge . because of the falling edge of the acknowledge bit , the bus users are subsequently synchronized again within the scope of the usual resynchronization mechanism . after the first bit of the crc delimiter , if the sender receives not only one but two additional recessive bits , this , to him , is an acknowledge error . after the second dominant acknowledge bit , if a third dominant bit is received , this is a format error to all . upon the acknowledge slot , as in the standard can , there follows a recessive acknowledge delimiter , which is one bit long . as in the standard can , a fast - can receiver , which has detected a crc error , will start the error frame only in the bit after the acknowledge delimiter . in summary , because of the present invention , there is a design approach for describing a method by which , in a can network , data frames are able to be transmitted in a shorter time and simultaneously essential properties of the can with regard to error detection as well as network - wide data consistency are maintained .