Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
156 words
The method of initializing a token-passing local-area network which includes a plurality of modules communicating with one another over a common bus, with each module having a unique network address, characterized b y the steps of: a) each module listening for a predetermined period of time for any transmissions of signals on the bus; b) transmitting, if no signals are heard during step a for a period of time which is a function of each module's address; c) listening after a fixed delay for a fixed period of time after terminating transmission under step b; d) the module that hears nothing in step c, transmitting tokens sequentially addressed to each network address until a token is accepted by an addressed module; and e) the module performing step d producing a fault signal and terminating initialization if the network address of a token to be transmitted in step d is that of the module performing step d.
Claim 2
Independent Claim
156 words
The method of initializing a token-passing local-area network which includes a plurality of modules communicating with one another over a common bus, with each module having a unique network address, characterized b y the steps of: a) each module listening for a predetermined period of time for any transmissions of signals on the bus; b) transmitting, if no signals are heard during step a for a period of time which is a function of each module's address; c) listening after a fixed delay for a fixed period of time after terminating transmission under step b; d) the module that hears nothing in step c, transmitting tokens sequentially addressed to each network address until a token is accepted by an addressed module; and e) the module performing step d producing a fault signal and terminating initialization if the network address of a token to be transmitted in step d is that of the module performing step d.
Claim 3
Dependent Claim
641 words
The method according to claim 1, characterized by the steps of: f) each module sensing if any signals are transmitted over a bus for a first period of time; g) each module transmitting signals, if no signals are sensed during step f, over the bus for a period of time which is a function of each module's address; h) each module after completing step g determining after a predetermined delay during a second period of time if any signals are transmitted over the bus; i) the module that does not sense any signals during step h, the initiating module, transmitting a token addressed to a module whose address is that of the transmitting module modified by one; j) the initiating module determining if the token transmitted in step i is accepted by a module to which the token is addressed; k) if the token is not accepted by the addressed module, incrementing the address of the token by one; 1) determining if the incremented address of the token equals the address of the initiating module; m) transmitting a token with the incremented address if the incremented address does not equal the address of the initiating module and determining if the token transmitted is accepted by a module; n) repeating steps k, 1 and m until a token is accepted by an addressed module or the incremented address equals the address of the initiating module; o) terminating initialization when a module accepts a token; and p) issuing an interrupt signal if the incremented address of a token equals the address of the initiating module. The method according to claim 1 or 2 used in a token-passing local-area network which can include up to 2n bits of electronic modules where "n" is an integer other than zero, with each module having its own unique n bit MY ADDRESS and the capability of forming and identifying its n bit LAST SUCCESS ADDRESS, characterized b y the steps of: f) each module sensing if any binary signals are transmitted over the bus during a first period of time; q) any module terminating initialization if it senses any signals in step f; r) each module not terminating initialization in step q transmitting binary signals over the bus for a period of time which is an inverse function of its MY ADDRESS; s) each module performing step r sensing for a third period of time after a delay for a second period of time if any binary signals are being transmitted over the bus; t) each module performing step s terminating initialization if it senses any binary signals being transmitted on the bus during said third period; u) the module not terminating initialization in step t, the initializing module, setting its LAST SUCCESS ADDRESS to equal its MY ADDRESS plus one and transmitting a token addressed to its LAST SUCCESS ADDRESS; v) the initializing module terminating initialization if the token transmitted in step u is accepted by the addressed module; w) the initializing module transmitting a token addressed to its LAST SUCCESS ADDRESS a second time if the token transmitted in step u is not accepted by the addressed module; v ! )the initializing module terminating initialization if the token transmitted in step w is accepted by the addressed module; x) the initializing module incrementing its LAST SUCCESS ADDRESS and transmitting a token addressed to its incremented LAST SUCCESS ADDRESS if the token transmitted in step w is not accepted by the addressed module; v") terminating initialization if the token transmitted in step x is accepted by the addressed module; y) repeating step x until a token is accepted by an addressed module or the incremented LAST SUCCESS ADDRESS equals its MY ADDRESS; and z) generating an alone in the ring interrupt if the incremented LAST SUCCESS ADDRESS of step x equals the initializing module's MY ADDRESS.
Claim 4
Dependent Claim
12 words
The method according to claim 3, characterized in that n = seven.
Claim 5
Dependent Claim
18 words
The method according to claim 4, characterized in that the first period of time is substantially 25 microseconds.
Claim 6
Dependent Claim
18 words
The method according to claim 5, characterized in that the second period of time is substantially four microseconds.
Claim 7
Dependent Claim
18 words
The method according to claim 6, characterized in that the third period of time is substantially 5.8 microseconds.