Abstract: An application includes: a programming model including a service provider, first components, second components, and sinks communicating via messages. Each of the second components is assigned a unique capability. A given one of the first components routes a message from the given first component to second component(s) and then to a sink. Each of the second component(s) sends the message to the service provider. The service provider creates a token corresponding at least to a received message and a unique capability assigned to an associated one of the second component(s) and sends the token to the associated one of the second component(s). The selected sink receives the message and a token corresponding to each of the second component(s), verifies each received token, and either accepts the message if each of the received tokens is verified or ignores the message if at least one of the received tokens is not verified.

Abstract: An application includes: a programming model including a service provider, first components, second components, and sinks communicating via messages. Each of the second components is assigned a unique capability. A given one of the first components routes a message from the given first component to second component(s) and then to a sink. Each of the second component(s) sends the message to the service provider. The service provider creates a token corresponding at least to a received message and a unique capability assigned to an associated one of the second component(s) and sends the token to the associated one of the second component(s). The selected sink receives the message and a token corresponding to each of the second component(s), verifies each received token, and either accepts the message if each of the received tokens is verified or ignores the message if at least one of the received tokens is not verified.

Abstract: An application includes: a programming model including a service provider, first components, second components, and sinks communicating via messages. Each of the second components is assigned a unique capability. A given one of the first components routes a message from the given first component to second component(s) and then to a sink. Each of the second component(s) sends the message to the service provider. The service provider creates a token corresponding at least to a received message and a unique capability assigned to an associated one of the second component(s) and sends the token to the associated one of the second component(s). The selected sink receives the message and a token corresponding to each of the second component(s), verifies each received token, and either accepts the message if each of the received tokens is verified or ignores the message if at least one of the received tokens is not verified.

Abstract: An application includes: a programming model including a service provider, first components, second components, and sinks communicating via messages. Each of the second components is assigned a unique capability. A given one of the first components routes a message from the given first component to second component(s) and then to a sink. Each of the second component(s) sends the message to the service provider. The service provider creates a token corresponding at least to a received message and a unique capability assigned to an associated one of the second component(s) and sends the token to the associated one of the second component(s). The selected sink receives the message and a token corresponding to each of the second component(s), verifies each received token, and either accepts the message if each of the received tokens is verified or ignores the message if at least one of the received tokens is not verified.

Abstract: Disclosed is a method of and a system for establishing a logical-model based understanding of a legacy application. The method comprises the steps of providing a physical data model of the legacy application, said physical data model having a plurality of physical elements; establishing a logical data model for the legacy application, said logical data model having a plurality of logical model elements; and establishing links between said logical model elements and said physical elements. One of said physical or logical elements is selected, and said links are used to identify all of the physical or logical elements that are linked to said selected one of said elements.

Abstract: Disclosed is a method of and a system for establishing a logical-model based understanding of a legacy application. The method comprises the steps of providing a physical data model of the legacy application, said physical data model having a plurality of physical elements; establishing a logical data model for the legacy application, said logical data model having a plurality of logical model elements; and establishing links between said logical model elements and said physical elements. One of said physical or logical elements is selected, and said links are used to identify all of the physical or logical elements that are linked to said selected one of said elements.

Abstract: Disclosed is a method of and a system for establishing a logical-model based understanding of a legacy application. The method comprises the steps of providing a physical data model of the legacy application, said physical data model having a plurality of physical elements; establishing a logical data model for the legacy application, said logical data model having a plurality of logical model elements; and establishing links between said logical model elements and said physical elements. One of said physical or logical elements is selected, and said links are used to identify all of the physical or logical elements that are linked to said selected one of said elements.

Abstract: Given a class hierarchy (a collection of classes and inheritance relations among them) and a program P that uses the hierarchy, a slice of the class hierarchy is computed with respect to the program by eliminating from the hierarchy those data members, member functions, classes, and inheritance relations that are unnecessary for ensuring that the semantics of P is maintained.

Abstract: An efficient program analysis method is provided for lazily decomposing aggregates (such as records and arrays) into simpler components based on the access patterns specific to a given program. This process allows us both to identify implicit aggregate structure not evident from declarative information in the program, and to simplify the representation of declared aggregates when references are made only to a subset of their components. The method can be exploited to yield: (i) a fast type analysis method applicable to program maintenance applications (such as date usage inference for the Year 2000 problem); and (ii) an efficient method for atomization of aggregates. More specifically, aggregate atomization decomposes all of the data that can be manipulated by the program into a set of disjoint atoms such that each data reference can be modeled as one or more references to atoms without loss of semantic information.

Abstract: Given a class hierarchy (a collection of classes and inheritance relations among them) and a program P that uses the hierarchy, a slice of the class hierarchy is computed with respect to the program by eliminating from the hierarchy those data members, member functions, classes, and inheritance relations that are unnecessary for ensuring that the semantics of P is maintained.

Abstract: A stepper motor (40) is used to position the pump rack (32A) via a preloaded compliant linkage (52,54,56) in a fuel injection pump (18), thereby exercising control over the end of injection event in response to various engine operating parameters. One part (52) of the compliant linkage (52,54,56) is engaged with the output shaft (46) of the stepper motor (40). The stop (96) is provided at the zero throttle position of the engaged part (52) of the linkage (52,54,56), at the exteme distal end of its positional range. A position sensor (100) is located at a predetermined reference position away from the stop (96) to provide a signal indicative of the engaged part (52) being at that position. When the stepper motor (40) is advanced to move the engaged part (52) away from the stop (96), the pulse count to the stepper motor is rereferenced when the reference position is reached.

Abstract: In the disclosed motor, a stator and a rotor are movable relative to each other about a common axis. The stator has stator poles with radially directed stator teeth arranged in a circle around the axis and the rotor includes a first axial portion and a second axial portion with a permanent magnet located between them. The first portion has a plurality of rotor teeth extending axially along the periphery of the first portion and the second portion has a substantially cylindrical surface.

Abstract: A stepping motor with toothed stator poles and two sets of oppositely magnetized rotor teeth has its stator poles energized by a driver which responds to input pulses to successively deenergize alternate poles and keep them deenergized and then successively reenergize the alternate poles in the opposite direction. Thereafter the driver successively deenergizes the poles intermediate the alternate poles and keeps them deenergized until all intermediate poles are deenergized and then successively reenergizes the intermediate poles in the other direction until all the intermediate poles are reenergized. This drives the rotor in fractional steps. For larger fractional steps, larger numbers of poles are deenergized in response to each pulse. For even larger fractions the deenergization process is eliminated.

Abstract: In the disclosed system, the stator of a motor is provided with a plurality of radially directed stator poles, each having stator teeth arranged in a circle around an axis, and includes permanently magnetized rotor teeth facing the poles. The number of poles on the stator is sixteen at regular intervals of 221/2 degrees, each having teeth offset from the teeth on the poles 90 degrees therefrom by one full pitch and offset from the teeth on adjacent poles by one-quarter pitch. According to an embodiment, the coils are energized digitally to move the rotor at one-half, one-quarter, one-eighth, one-sixteenth, and one-thirty second steps. According to another embodiment, the poles are spaced and shaped to permit large preformed windings to be mounted thereon.

Abstract: A stepping motor with toothed stator poles and two sets of oppositely magnetized rotor teeth has its stator poles energized by a driver which responds to input pulses to successively deenergize alternate poles and keep them deenergized and then successively reenergize the alternate poles in the opposite direction. Thereafter the driver successively deenergizes the poles intermediate the alternate poles and keeps them deenergized until all intermediate poles are deenergized and then successively reenergizes the intermediate poles in the other direction until all the intermediate poles are reenergized. This drives the rotor in fractional steps. For larger fractional steps, larger numbers of poles are deenergized in response to each pulse. For even larger fractions the deenergization process is eliminated.

Abstract: In the disclosed motor, teeth on winding-energized stator poles project radially toward equally-pitched radially projecting rotor teeth energized by a permanent magnet. The pitches of the teeth on each stator pole vary but have an average pitch approximately equal to the pitch of the rotor teeth.

Abstract: Longitudinally extending radially-projecting and peripherally-spaced teeth on a stator member and rotor member of a synchronous electric motor, whose rotor member is magnetized by a permanent magnet, are skewed relative to each other. The overall peripheral distance of each tooth on one member is equal to or less than the space between the overall peripheral distances of the teeth on the other member. According to one embodiment the rotor teeth are skewed relative to the rotor axis and the stator teeth parallel thereto.

Abstract: The rotor structure of a synchronous inductor motor, such as a stepping motor, is of a compact, simplified and high-efficiency construction consisting essentially of wholly planar annular laminations which include stacks of thin externally-toothed elements bonded together and with relatively thin axially-magnetized annular washer material extending radially from a relatively large central shaft fully to the roots of the stack teeth.