Source: http://www.google.com/patents/US20030217252?ie=ISO-8859-1
Timestamp: 2015-03-05 19:20:03
Document Index: 655575106

Matched Legal Cases: ['arts 302', 'arts 306', 'arts 316', 'art 402', 'art 404', 'art 404', 'art 402', 'art 402', 'art 406', 'art 402', 'art 406', 'art 406', 'art 402', 'art 414', 'art 406', 'arts 408', 'arts 408', 'arts 408', 'arts 402', 'arts 402', 'art 408', 'arts 504', 'arts 504', 'art 508', 'art 510', 'art 512', 'arts 514', 'arts 306', 'arts 1308', 'arts 1314', 'art 1308', 'art 1310', 'art 1312', 'art 1314', 'art 1316', 'art 1318', 'art 1308', 'art 1308', 'art 1310', 'art 1312', 'art 1314', 'art 1316', 'art 1318', 'art 1308', 'art 1308', 'arts 1314']

Patent US20030217252 - Method and apparatus for maintaining and configuring systems - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inAdvanced Patent SearchPatentsThe invention provides the ability to interactively select and configure a product among a set of related products based on availability and compatibility of features and options. It does not impose an order in the selection of products, features or options; only valid selections can be made at any time....http://www.google.com/patents/US20030217252?utm_source=gb-gplus-sharePatent US20030217252 - Method and apparatus for maintaining and configuring systemsAdvanced Patent SearchPublication numberUS20030217252 A1Publication typeApplicationApplication numberUS 10/167,989Publication dateNov 20, 2003Filing dateJun 11, 2002Priority dateOct 3, 1998Also published asUS7844919Publication number10167989, 167989, US 2003/0217252 A1, US 2003/217252 A1, US 20030217252 A1, US 20030217252A1, US 2003217252 A1, US 2003217252A1, US-A1-20030217252, US-A1-2003217252, US2003/0217252A1, US2003/217252A1, US20030217252 A1, US20030217252A1, US2003217252 A1, US2003217252A1InventorsNeeraj Gupta, Venky Veeraraghavan, Ajay AgarwalOriginal AssigneeNeeraj Gupta, Venky Veeraraghavan, Ajay AgarwalExport CitationBiBTeX, EndNote, RefManReferenced by (5), Classifications (8) External Links: USPTO, USPTO Assignment, EspacenetMethod and apparatus for maintaining and configuring systems
US 20030217252 A1Abstract
The invention provides the ability to interactively select and configure a product among a set of related products based on availability and compatibility of features and options. It does not impose an order in the selection of products, features or options; only valid selections can be made at any time. To create an electronic representation of the product information to achieve the above goal, the invention provides a framework for defining a systems by defining the components of the system using elements contained in a parts catalog and defining relationships between the components of a system. A configuration system validates a configuration using the system definition, the current state of the configuration and user input. Images(25) Claims(59)
1. A method of configuring a system comprising the steps of: generating a definition for said system, said definition containing one or more elements and being conveyed graphically using a set of product relationships; generating a set of relationships between said one or more elements, said set of relationships being conveyed graphically using a set of part relationships; and configuring said system using said definition and said set of relationships. 2. The method of claim 1 wherein said step of configuring further comprises the steps of: receiving input from a configuration user; validating said input based on said definition, said set of relationships, and a current configuration state; and identifying a set of valid configuration options using said definition, said set of relationships and said current configuration state. 3. The method of claim 2 wherein said step of identifying further comprises the steps of: determining whether a relationship in said set of relationships is active; modifying said configuration to satisfy said active relationship when it is determined that a modification is needed; making said relationship notActivateable when it is determined that said relationship is not active and the activation of said relationship would render the configuration invalid. 4. The method of claim 3 wherein said step of determining whether a relationship is active further comprises the step of determining whether the elements specified in the left-hand side of said relationship are present in said configuration. 5. The method of claim 4 wherein said step of determining whether the elements specified in the left-hand side of said relationship are present in said configuration further comprises the step of performing a bit-level comparison of the bits corresponding to the elements in said left-hand side of the relationship with a �selected� bit vector. 6. The method of claim 3 wherein said relationship is an includes relationship, said step of modifying further comprises the step of including in said configuration elements identified in a right-hand side of said relationship. 7. The method of claim 3 wherein said relationship is an excludes relationship, said step of modifying further comprises the step of marking said elements identified in the right-hand side of said relationship as excluded and notSelectable. 8. The method of claim 3 wherein said relationship is a removes relationship, said step of modifying further comprises the step of removing said elements identified in the right-hand side of said relationship from said configuration. 9. The method of claim 3 wherein said relationship is a requires choice relationship, said step of modifying further comprises the steps of: determining whether a plurality of elements identified in a right-hand side of said relationship are present in said configuration such that said relationship is satisfied; modifying said configuration to satisfy said requires choice relationship when it is determined that only one path exists to satisfy said relationship and said relationship is not already satisfied. 10. The method of claim 3 wherein said step of making said relationship notActivateable further comprises the step of marking one or more elements in said left-hand side of said relationship as notselectable. 11. The method of claim 2 wherein said definition, each of said set of relationships, and said current configuration state are expressed as bit vectors having bits that correspond to elements. 12. The method of claim 2 wherein said step of validating further comprises the step of determining whether the relationships other than those marked notActivateable in said set of relationships can be satisfied. 13. The method of claim 2 wherein said step of generating a definition selects said one or more elements for inclusion in said definition, said input is made without regard for the order in which said one ore more elements are selected for said definition. 14. The method of claim 2 wherein said configuration state identifies a set of selected elements and a set of selectable elements for said system, said input capable of selecting any member of said set of selectable elements and being made despite the order in which members of said set of selected elements were selected. 15. The method of claim 1 wherein a parts catalog is used to store information associated with said one or more elements, said information including an identifier and description. 16. A method for defining a system that can be configured comprising the steps of: identifying an element of said system; specifying said element as an included element when said element is automatically included in the configuration; specifying said element as an optional element when said element is not a necessary component of said system; specifying said element as a required choice when said element is a group that contains one or more members from which to choose. 17. The method of claim 16 wherein said element is a member of a first element set said first element set containing one or more elements, said method further comprising the steps of: identifying a second element set of said system, said second element set containing one or more elements; and specifying a relationship between said first element set and said second element set. 18. The method of claim 17 wherein said step of specifying further comprises the steps of: specifying that said second element set is to be included in said system when said first element set is present in said system; specifying that said second element set is to be excluded from said system when said first element set is present in said system; and specifying that said second element set is to be removed from said system when said first element set is present in said system; 19. The method of claim 16 further comprising the steps of: specifying a group of elements; specifying a relationship between said first element set and said group of elements such that one or more elements in said group of elements must be chosen when said first element set is present in said system. 20. An article of manufacture comprising: a computer usable medium having computer readable program code embodied therein for configuring a system comprising: computer readable program code configured to cause a computer to generate a definition for said system, said definition containing one or more elements and being conveyed graphically using a set of product relationships; computer readable program code configured to cause a computer to generate a s et of relationships between said one or more elements, said set of relationships being conveyed graphically using a set of part relationships; and computer readable program code configured to cause a computer to configure said system using said definition and said set of relationships. 21. The article of manufacture of claim 20 wherein said computer readable program code configured to cause a computer to configure further comprises: computer readable program code configured to cause a computer to receive input from a configuration user; computer readable program code configured to cause a computer to validate said input based on said definition, said set of relationships, and a current configuration state; and computer readable program code configured to cause a computer to identify a set of valid configuration options using said definition, said set of relationships and a current configuration state. 22. The article of manufacture of claim 21 wherein said computer readable program code configured to cause a computer to identify further comprises: computer readable program code configured to cause a computer to determine whether a relationship in said set of relationships is active; computer readable program code configured to cause a computer to modify said configuration to satisfy said active relationship when it is determined that a modification is needed; computer readable program code configured to cause a computer to make said relationship notActivateable when it is determined that said relationship is not active and the activation of said relationship would render the configuration invalid. 23. The article of manufacture of claim 22 wherein said computer readable program code configured to cause a computer to determine whether a relationship is active further comprises computer readable program code configured to cause a computer to determine whether the elements specified in the left-hand side of said relationship are present in said configuration. 24. The article of manufacture of claim 23 wherein said computer readable program code configured to cause a computer to determine whether the elements specified in the left-hand side of said relationship are present in said configuration further comprises computer readable program code configured to cause a computer to perform a bit-level comparison of the bits corresponding to the elements in said left-hand side of the relationship with a �selected� bit-vector. 25. The article of manufacture of claim 22 wherein said relationship is an includes relationship, said computer readable program code configured to cause a computer to modify further comprises computer readable program code configured to cause a computer to include in said configuration elements identified in a right-hand side of said relationship. 26. The article of manufacture of claim 22 wherein said relationship is an excludes relationship, said computer readable program code configured to cause a computer to modify further comprises computer readable program code configured to cause a computer to mark said elements identified in the right-hand side of said relationship as excluded and notSelectable. 27. The article of manufacture of claim 22 wherein said relationship is a removes relationship, said computer readable program code configured to cause a computer to modify further comprises computer readable program code configured to cause a computer to remove said elements identified in the right-hand side of said relationship from said configuration. 28. The article of manufacture of claim 22 wherein said relationship is a requires choice relationship, said computer readable program code configured to cause a computer to modify further comprises: computer readable program code configured to cause a computer to determine whether a plurality of elements identified in a right-hand side of said relationship are present in said configuration such that said relationship is satisfied; computer readable program code configured to cause a computer to modify said configuration to satisfy said requires choice relationship when it is determined that only one path exists to satisfy said relationship and said relationship is not already satisfied. 29. The article of manufacture of claim 22 wherein said computer readable program code configured to cause a computer to make said relationship notActivateable further comprises computer readable program code configured to cause a computer to mark one or more elements in said left-hand side of said relationship as notSelectable. 30. The article of manufacture of claim 21 wherein said definition, each of said set of relationships, and said current configuration state are expressed as bit vectors having bits that correspond to elements. 31. The article of manufacture of claim 21 wherein said code configured to cause a computer to validate further comprises program code configured to cause a computer to determine whether the relationships other than those marked notActivateable in said set of relationships can be satisfied. 32. The article of manufacture of claim 21 wherein said code configured to cause a computer to generate a definition selects said one or more elements for inclusion in said definition, said input is made without regard for the order in which said one ore more elements are selected for said definition. 33. The article of manufacture of claim 21 wherein said configuration state identifies a set of selected elements and a set of selectable elements for said system, said input capable of selecting any member of said set of selectable elements and being made despite the order in which members of said set of selected elements were selected. 34. The article of manufacture of claim 17 wherein a parts catalog is used to store information associated with said one or more elements, said information including an identifier and description. 35. An article of manufacture comprising a computer usable medium having computer readable program code embodied therein for defining a system that can be configured comprising: computer readable program code configured to cause a computer to identify an element of said system; computer readable program code configured to cause a computer to specify said element as an included element when said element is automatically included in the configuration; computer readable program code configured to cause a computer to specify said element as an optional element when said element is not a necessary component of said system; computer readable program code configured to cause a computer to specify said element as a required choice when said element is a group that contains one or more members from which to choose. 36. The article of manufacture of claim 35 wherein said element is a member of a first element set said first element set containing one or more elements, said article of manufacture further comprising: computer readable program code configured to cause a computer to identify a second element set of said system, said second element set containing one or more elements; and computer readable program code configured to cause a computer to specify a relationship between said first element set and said second element set. 37. The article of manufacture of claim 36 wherein said computer readable program code configured to cause a computer to specify further comprises: computer readable program code configured to cause a computer to specify that said second element set is to be included in said system when said first element set is present in said system; computer readable program code configured to cause a computer to specify that said second element set is to be excluded from said system when said first element set is present in said system; and computer readable program code configured to cause a computer to specify that said second element set is to be removed from said system when said first element set is present in said system; 38. The article of manufacture of claim 35 further comprising: computer readable program code configured to cause a computer to specify a group of elements; computer readable program code configured to cause a computer to specify a relationship between said first element set and said group of elements such that one or more elements in said group of elements must be chosen when said first element set is present in said system. 39. A method of configuring a system comprising the steps of: translating a system definition from an external representation comprising a set of intuitive relationships between components of said system definition into an internal representation comprising a set of internal relationships; validating configuration input using said internal representation; and modifying a configuration state based on said user input. 40. The method of claim 39 wherein said step of translating further comprises the step of: removing a plurality of hierarchical levels from said external representation such that said internal representation is a single level. 41. The method of claim 40 wherein said step of translating further comprises the step of: creating a set of relationships based on said hierarchical levels, each one in said set of relationships having a first set of components and a second set of components and a relationship operator. 42. The method of claim 41 wherein said relationship operator is chosen from the operators include, exclude, remove, and requires choice. 43. The method of claim 39 wherein each of said internal relationships has a left-hand side, a relationship operator and a right-hand side, said step of translating further comprises the steps of: determining whether a group of components exists on said left-hand side of one of said internal relationships; performing the following steps when a group of components exist on said left-hand side: creating a new component for said group; and creating a new relationship for each component of said group of components such that each component will include said new component. 44. The method of claim 39 wherein a type of said internal relationships is an include relationship, said include relationship identifies a second set of components that are included in said system when all of a first set of components exist in said system, said step of translating further comprises the steps of: determining whether a subset of the union of said first and second sets of components in a first includes relationship comprises a first set of components in a second includes relationship; and generating a combined includes relationship, said combined relationship comprises said first set of components of said first includes relationship and said second set of components from said first and second includes relationships when said subset of the union of said first and second sets of components in said first includes relationship comprises a first set of components in a second includes relationship. 45. The method of claim 39 wherein a type of said internal relationships is a requires choice relationship, said requires choice relationship identifies a second set of components from which a number of components must be chosen when a first set of components exist in said system definition, said step of translating further comprises the steps of: determining whether a second set of components of a second requires choice relationship is a proper subset of a second set of components of a first requires choice relationship: performing the following steps when said condition exists: creating a new relationship such that said new relationship excludes a second set of components of said new relationship when a first set of components of said new relationship is selected, said new relationship's first set of components is the union of the first set of components of said first and second requires choice relationships and said new relationship's second set of components is the difference of the second set of components of said first and second requires choice relationship. 46. The method of claim 39 wherein a type of said internal relationships is an includes relationship, said includes relationship identifies a second set of components that are included in said system when all of a first set of components exist in said system, said step of translating further comprises the steps of: determining whether the second set of components of an includes relationship are contained in a first set of components of another internal relationship; replacing said second set of components of said includes relationship in said another internal relationship with said first set of components of said includes relationship when said second set of components of an includes relationship are contained in a first set of components of another internal relationship. 47. The method of claim 39 said internal representation comprises multiple types of relationships, each type of relationship having a first and second set of components and an operation, said operation is performed on said second set of components when said first set of components exist in said system. 48. The method of claim 47 wherein said step of translating further comprises the steps of: determining whether a first and second relationship are the same type of relationship; performing the following steps when they are the same type: determining whether the first relationship's first set of components is a proper subset of the second relationship's first set of components; removing the first relationship's second set of components that exist from the second relationship's second set of components when said proper subset exists; removing said second relationship when said second relationship's second set of components is an empty set. 49. The method of claim 47 wherein said step of validating further comprises the steps of: determining whether a component selected by said configuration input is selectable; and invalidating said configuration input when said component is not selectable. 50. The method of claim 49 wherein said one of said internal relationships is an includes relationship, said includes relationship causing a second set of components to be included in said system when all members of a first set of components exist in said system, said second step of determining further comprises the step of: determining whether any member of the second set of components cannot be included in said system. 51. The method of claim 49 wherein said one of said internal relationships is an excludes relationship, said excludes relationship causing a second set of components to be excluded from said system when all members of a first set of components exist in said system, said second step of determining further comprises the step of: determining whether any member of the second set of components already exists in said system. 52. The method of claim 49 wherein said one of said internal relationships is an removes relationship, said removes relationship causing a second set of components to be removed from said system when all members of a first set of components exist in said system, said second step of determining further comprises the step of: determining whether any member of the second set of components has been selected for inclusion in said system by a configuration user. 53. The method of claim 49 wherein said one of said internal relationships is a requires choice relationship, said requires choice relationship requiring a selection of a number of members of a second set of components when all members of a first set of components exist in said system, said second step of determining further comprises the step of: determining whether said number of members of said second set of components cannot be selected for addition to said system. 54. The method of claim 47 wherein said step of modifying further comprises the steps of: determining whether the performance of said operation of one of said internal relationships would result in an invalid configuration; causing said one of said internal relationships to become inactivateable. 55. The method of claim 54 wherein said step of causing further comprises the step of excluding the last remaining member of said first set of components such that said last remaining member cannot be added to said system, said last remaining member being the only member of said first set of components that has not already been selected. 56. The method of claim 39 wherein said step of translating further comprises the step of: mapping said intuitive relationships of said external representation into a set of relationships in said internal representation. 57. The method of claim 39 wherein said internal representation is stored as a set of bit vectors wherein each bit vector includes a bit that corresponds to one of said components of said system definition, the impact of changing the number of said components of said system definition thereby being minimal. 58. Tne method of claim 57 wherein said step of validating comprising a plurality of bit-level operations. 59. The method of claim 39 wherein said step of modifying further comprises the step of updating said configuration state to represent which of said components of said system definition are selectable, selected, included, and excluded.
BACKGROUND OF THE INVENTION [0001] 1. Field of the Invention [0002] This invention relates to maintaining and configuring systems. [0003] 2. Background Art [0004] A system is comprised of components. Before a system can be built the components of the system must be identified. To configure a system, a user must select the parts to include in the system. Typically, one who is knowledgeable about a system and its components defines the system. Thus, for example, an automobile salesperson assists an automobile buyer in t determining the type and features of the automobile. The salesperson understands the features and options that are available to create a valid configuration. Some features and options cannot be combined. The selection of some features caused other features to be unavailable, etc. It would otherwise be difficult for the buyer to identify all of the features and options available on the automobile that can be combined to create a valid configuration. [0005] Computer systems have been developed to assist one in configuring a system. However, these systems use a configuration language to define a system. Like a programming language, a configuration language uses a syntax that must be understood by a user who is maintaining the data (i.e., a data maintainer). To use one of these configuration systems, it is necessary for a data maintainer to understand the configuration language. This limits the number of users who are able to use the configuration systems. That is, the level of sophistication needed to communicate with the configuration system (through a configuration language) results in less sophisticated users being unable to use the system. [0006] In addition, configuration systems impose a flow or ordering to the user operations. For example, a user is required to remove components from the system in reverse of the order in which they were chosen. Thus, a user may be forced to remove components that the user wants to keep in the configuration to remove an unwanted component. A novice user may have perform many removal operations before achieving an acceptable configuration. If the novice user is required to remove components in a preset order, the user can become frustrated or confused and abort the configuration process. [0007] These systems are designed for a more sophisticated user that has knowledge of the system that is being configured as well as the configuration system used to configure the system. A end user such as an automobile shopper would have difficulty using these systems. [0008] Further, to use these systems a user must be trained to understand the configuration language. Thus, a user who otherwise has knowledge of the systems that are being configured must undergo training to be able to use these configuration systems to configure systems. This leads to increased expenditures such as for training. SUMMARY OF THE INVENTION [0009] The invention provides the ability to interactively select and configure a product among a set of related products based on availability and compatibility of features and options. It does not impose an order in the selection of products, features or options; only valid selections can be made at any time. To create an electronic representation of the product information to achieve the above goal, the invention provides a framework for defining a product line. [0010] A product line is defined as a set of related products. A product line has a set of products that contain parts, or components. Parts used to define a product are selected from a parts catalog. Parts in a product definition are related or classified as: included (parts that are included by default), required choices (a choice among a group of parts that must be made to achieve a valid configuration), optional (parts that can be optionally included in the configuration). [0011] Relationships can be defined between the parts in a product definition. A relationship relates a first set of parts with a second set of parts. A set can include multiple parts. The incorporation of parts in a set can be arbitrary. That is, a multi-part set can contain parts that are otherwise unrelated. For example, a set can contain parts such as an engine, sun roof and a color. These parts seem to be unrelated, however, it is possible to combine them into a relationship set for purposes of forming a relationship using the present invention. [0012] Preferably, the part relationships are: included, excluded, removed, and requires choice. An included part is included automatically. A part is excluded from the configuration when its inclusion would result in an invalid configuration. A part may be removed when another part is added. Thus, when a first part exists in the configuration and a second part is added, the first part is removed from the configuration. The requires choice relationship is used to allow a set of choices to be made from a group of parts. The number of parts chosen is limited to a valid bounds specification. The relations that are created between parts within a product are enforced only on that particular product. However, if some part-to-part relationships are to be enforced on all products within a product line, then the relations are generated once and enforced for all products. [0013] A maintenance system is used to define a product. Using the maintenance system, a product can be defined using the product classifications and the part relationships. A graphical user interface (GUI) is used to allow the user to interactively generate a definition. Instead of configuration languages, GUI operations such as drag and drop and selection operations can be used to specify a definition. The notions of included, optional and required choice are easily comprehensible to a user. Further, the idea that parts have interrelationships is also easily understood. Thus, a product can be defined without having to learn a complicated configuration language. [0014] A configuration system is used to configure a system using a definition created by the maintenance system. The configuration system ensures that the current configuration state is always valid. The user can select and unselect parts in any order. When user input is received, the configuration system validates the input based on the current state of the configuration. In addition, the configuration system identifies selections that could cause a valid configuration to become invalid. The configuration removes these selections from the set of possible selections so that the user does not make an invalid selection. [0015] The configuration system evaluates the current state of a configuration based on the product definition, part relationships and state information. After receipt of input from a user, the configuration system evaluates relationships in both the forward and backward direction. Forward and backward evaluations can result in the addition or deletion of elements from the configuration. [0016] The invention uses both an external and internal representation of a definition or definitions. A translation mechanism is used translate an external representation into an internal representation. The external representation uses a conceptually understandable set of relationships for defining a system and the relationships between the components of the system. The invention takes the definition created by a user and supplements and compresses the definition when necessary to create an internal representation. The internal representation is used during configuration to initialize and validate a configuration based on user input. [0017] During configuration, the invention maintains runtime information that is stored in tables and vectors. To achieve greater processing efficiency, the systems represents elements in a configuration (e.g., product, part, and group) as a bit in a bit vector. Thus, for example, a vector has a length that is equal to the total number of elements. An element's bit can be set or reset to specify the state of the element in the current configuration. For example, a user vector can be used that specifies for each element whether the element has been selected by the user during the configuration. In addition, excluded and removed vectors identify whether an element is excluded or removed (respectively) from a configuration. Vectors can be used to identify whether an element 1) has been selected (by the user or the configuration system), 2) is selectable, and 3) notSelectable. [0018] Tables contain element relationships. A table is used to represent the includes, excludes, removes, and requires choice relationships, for example. Each table has a left-hand side and a right-hand side that corresponds to the left-hand and right-hand sides of a relationship. In each case, the left-hand side is a bit vector that contains bits that correspond to elements. The includes, excludes and removes tables contain a bit vector in the right-hand side that represents configuration elements. The right-hand side of the requires choice table is a pointer that points to an entry in a group table. The group table entry is a bit vector that identifies the elements that are contained in the group from which a choice is to be made. The right-hand side of a requires choice table entry further includes minimum and maximum designations. Minimum and maximum values identify the minimum and maximum number of group members that are to be selected to satisfy a requires group relationship. [0019] A bit vector implementation of relationships and internal runtime state allows for fast and efficient computation of relationship based configuration. A comparison of bits can be performed in one machine instruction in most cases. BRIEF DESCRIPTION OF THE DRAWINGS [0020]FIG. 1 provides an illustration of a computer system that can be used with the invention according to an embodiment of the invention. [0021]FIG. 2 provides an overview of the maintenance and configuration systems according to an embodiment of the invention. [0022]FIG. 3 illustrates examples of elements in a parts catalog according to an embodiment of the invention. [0023]FIG. 4 illustrates relationships between parts according to an embodiment of the invention. [0024]FIG. 5 provides an example of product classifications according to an embodiment of the invention. [0025]FIG. 6 provides an example of a GUI screen used in maintenance system 202 according to an embodiment of the present invention. [0026]FIG. 7 provides an block diagram illustrating the conversion process according to one embodiment of the invention. [0027] FIGS. 8A-8B illustrate components of internal representation 706 according to an embodiment of the invention. [0028]FIG. 9 provides a process flow for processing a user selection according to an embodiment of the invention. [0029]FIG. 10 provides an example of a relationship evaluation process flow according to an embodiment of the invention. [0030]FIG. 11 provides an example of an unselect item process flow according to an embodiment of the invention. [0031]FIG. 12 provides a flow for translation processing according to an embodiment of the invention. [0032] FIGS. 13A-13B provide an illustration of groups and nested groups according to an embodiment of the invention. [0033] FIGS. 14A-14B provide an includes chain process flow according to an embodiment of the invention. [0034] FIGS. 15A-15B provides an example of a subgroup excludes process flow according to an embodiment of the invention. [0035] FIGS. 16A-16C provide an example of a relationship factorization process flow according to an embodiment of the invention. [0036] FIGS. 17A-17B provide an illustration of a relationship compression process flow according to an embodiment of the invention. DETAILED DESCRIPTION OF THE INVENTION [0037] A method and apparatus for maintaining and configuring systems is described. In the following description, numerous specific details are set forth in order to provide a more thorough description of the present invention. It will be apparent, however, to one skilled in the art, that the present invention may be practiced without these specific details. In other instances, well-known features have not been described in detail so as not to obscure the invention. [0038] The present invention can be implemented on a general purpose computer such as illustrated in FIG. 1. A keyboard 110 and mouse 111 are coupled to a bidirectional system bus 118. The keyboard and mouse are for introducing user input to the computer system and communicating that user input to CPU 113. The computer system of FIG. 1 also includes a video memory 114, main memory 115 and mass storage 112, all coupled to bi-directional system bus 118 along with keyboard 110, mouse 111 and CPU 113. The mass storage 112 may include both fixed and removable media, such as magnetic, optical or magnetic optical storage systems or any other available mass storage technology. Bus 118 may contain, for example, 32 address lines for addressing video memory 114 or main memory 115. The system bus 118 also includes, for example, a 32-bit DATA bus for transferring DATA between and among the components, such as CPU 113, main memory 115, video memory 114 and mass storage 112. Alternatively, multiplex DATA/address lines may be used instead of separate DATA and address lines. [0039] In the preferred embodiment of this invention, the CPU 113 is a 32-bit microprocessor manufactured by Motorola, such as the 680�0 processor or a microprocessor manufactured by Intel, such as the 80�86, or Pentium processor. However, any other suitable microprocessor or microcomputer may be utilized. Main memory 115 is comprised of dynamic random access memory (DRAM). Video memory 114 is a dual-ported video random access memory. One port of the video memory 114 is coupled to video amplifier 116. The video amplifier 116 is used to drive the cathode ray tube (CRT) raster monitor 117. Video amplifier 116 is well known in the art and may be implemented by any suitable means. This circuitry converts pixel DATA stored in video memory 114 to a raster signal suitable for use by monitor 117. Monitor 117 is a type of monitor suitable for displaying graphic images. [0040] The computer system described above is for purposes of example only. The present invention may be implemented in any type of computer system or programming or processing environment. [0041] The invention maintains and configures systems. The invention eliminates the need for a user to learn a configuration language or write code to maintain and/or configure a system. A user interface uses various operations such as drag and drop and item selection to define a product, for example. Elements that comprise a definition (e.g., of a product) can be added or removed in any order. No order is imposed on the user. There is no requirement, for example, that the user remove parts of a product in the order in which they were added. No fixed flow or order is required to edit a given product. [0042] A definition includes an identification of the components that comprise the definition and the interrelationships between the components. The interrelationships are conceptually easy for the user to understand. The same relationships are used to define and configure any system. An external representation that includes these relationships allows a user to view and maintain the definition. The external representation is translated into an internal representation that is designed to decrease processing time and increase response time. [0043] In addition, during a configuration session, the invention is capable of allowing a user to select or unselect configuration items without imposing a flow on the user. There is no order imposed on the user in terms of the sequence in which items are selected for the configuration or unselected from the configuration. For example, it is not necessary to select a product before choosing options. The invention can identify the products that are still available based on the options that have already been selected. Further, a user can unselect an item (e.g., delete the item from the configuration) without regard to the order in which it was selected (e.g., added to the configuration). [0044] Examples of systems that can be maintained or configured using the invention include automobiles, computers, time clock machines, and shoes. Terms such as part, product line, parts catalog, and product are used herein for illustration purposes. It should be apparent that this invention can be used to configure systems that are not limited to products and product lines, etc. [0045]FIG. 2 provides an overview of the maintenance and configuration systems according to an embodiment of the invention. Maintenance system 202 maintains a parts catalog 204, parts relationships 206 and product definitions 208. Maintenance system 202 uses a user interface that includes the ability to add items to parts catalog 204 and specify part relationships 206 and product definitions 208. The user interface displays a set of hierarchies that provide a conceptually easier way of viewing a definition. The invention maps the set of hierarchies (an external representation) to an internal representation. [0046] The internal representation is used by configuration system 212 to maintain and configure systems based on user input. Configuration system 212 provides the ability to specify a product. Configuration system 212 verifies the product specification. Using configuration system 212, a user can interactively select and configure a product among a set of related products based on availability and compatibility of features and options. It does not impose an order in the selection of products, features or options. The configuration system 212 allows the user to only make valid selections. However, selections can be made in any order. [0047] Parts catalog 204 consists of parts that are components of products. Similar parts are grouped together to form a part hierarchy. Easy maintenance of relationships is achieved by the hierarchy. For example, when a group of parts is assigned a behavior, all the members inherit that behavior automatically. FIG. 3 illustrates examples of elements in a parts catalog according to an embodiment of the invention. Referring to FIG. 3, a parts catalog (e.g., parts catalog 204) contains parts 302-310, 316, and 318. A parts catalog can also contain a group of parts such as group 312. Group 312 contains parts 306-310. A group can contain other groups. For example, group 314 contains group 312 and parts 316-318. Behavior assigned to elements of group 314 is inherited by members of group 312. [0048] Part-to-part relationships can be created between parts within a product. Relationships are defined between a first set of parts and a second set of parts. During configuration, when all of the members of the first set of parts are selected, the relationship between the two sets is enforced on the parts in the second set. In the preferred embodiment, there are four kinds of relationships between parts: requires choice, includes, can't work with (or excluded), and removes. FIG. 4 illustrates relationships between parts according to an embodiment of the invention. [0049] Part 402 includes part 404. The includes relation causes a set of parts in a second set (e.g., part 404) to be included in the configuration when a first set of parts (e.g., part 402) is selected. For example, a luxury package includes a CD player; when the luxury package is selected, a CD player is included in the configuration. The can't work with (or excluded) relation ensures that a set of parts from a second set are never in the same configuration as parts in the first set. For example, part 402 (e.g., sun roof) can't work with part 406 (e.g., a roof-top antenna). When part 402 is selected, part 406 cannot be selected. Part 406 is excluded such that it cannot be selected. [0050] When part 402 is selected, part 414 is removed from the configuration. The removes relation causes items that are included in a second set of to be removed from the configuration when the left side is selected. For example, when a high end stereo is selected the standard stereo is removed from the configuration. [0051] The requires choice relation recognizes that a choice (between a minimum and maximum number) has to be made between a second set of parts (or members of a group) to ensure a valid configuration when the parts in a first set are selected. Part 406 (e.g., climate control feature) requires that a choice be made among parts 408-410 (e.g., 1 zone A/C or 2 zone A/C). A requires choice relationship requires that a number of items be selected based on minimum and maximum values from the right-hand side of the relationship to satisfy the relationship. [0052] Parts 408 and 410 can be combined to form group 416. Group 416 can be defined by the user. If the user does not define group 416, the invention preferably creates group 416 to contain parts 408 and 410. Thus, when two or more parts are defined on the right-hand side of a requires choice relationship, the invention preferably creates a group that contains these parts. The requires choice then becomes a requires choice on the group (e.g., group 416). [0053] Parts are used to illustrate relationships in FIG. 4. However, a relationship can contain groups. To illustrate, a group of parts can be substituted wherever a part is used in the illustration. Thus, for example, parts 402, 404, 406, 408, 410, and 414 can each be replaced by a group of parts. Thus, for example, if parts 402 and 404 are replaced by groups (e.g., groups 402 and 404, respectively), when the members of group 402 are selected, the members in group 406 are included in the configuration. To further illustrate, part 408 can be replaced by group 408. In that instance, group 408 is a member of group 416. A hierarchy of groups (e.g., group 408 contained within group 416) can be used in a relationship. [0054] Parts can be combined to form an arbitrary grouping. Thus, it is not necessary to combine parts in a group based on a logical or intuitive relationship between the parts in the group. For example, a group can contain an engine, a color, and a sun roof. [0055] The relations that are created between parts within a product are enforced only on that particular product. However, if some part-to-part relationships are to be enforced on all products within a product line, then the relations are created once and are enforced for all products. These relationships are referred to as global relationships. [0056] A product includes zero or more elements of parts catalog 204. Product definition 208 (see FIG. 2) is generate by populating it with its component parts. Product definition 208 is generated by population of a product with its component parts. The parts within a product are classified as one of three different types: included parts, required choices, or optional parts. A part that is not classified as one of these types is assumed to be unavailable in that product. FIG. 5 provides an example of product classifications according to an embodiment of the invention. [0057] An included part is a part that is included in a product by default. For example, parts 504 and 506 are automatically included in product 502 for example, when a configuration user chooses the product definition product 502, the parts 504 and 506 are automatically included in the configuration. A required choices classification specifies that a choice among a group of parts has to be made to create a valid product configuration. For example, product 502 (e.g., automobile) can include a color group 518 containing red (part 508), green (part 510) and blue (part 512) that is a required choice. In configuring a product, the user must choose a color in this group to create a valid product configuration. Parts 514 and 516 are optional parts. An optional part is not required for a valid configuration. [0058] A product line is defined as a set of related products. The invention provides the framework for defining a product line. To define a product line: all parts (components) in the product line are entered into parts catalog 204. An instance in products definition 208 is created that identifies parts from parts catalog 204 that are assigned to a product. Part relationships 206 can also be defined for the product. [0059] Maintenance System [0060] Parts catalog 204, part relationships 206, and product definition 208 are created and maintained using maintenance system 202. While any method can be used for creation and maintenance, a graphical user interface (GUI) is preferably used. A text editor could also be used for data entry, for example. FIG. 6 provides an example of a GUI screen used in maintenance system 202 according to an embodiment of the present invention. One who uses the GUI screen (a maintainer) can define a product (e.g., an automobile). A product definition is used by a configuration user to configure a system defined in maintenance system 202. Parts catalog 204 uses a database or other type of storage and retrieval capability, for example, to store information about its parts (e.g., part number, description, price, etc.). [0061] The GUI screen of FIG. 6 is divided into a product definition section 650 and a part relationship definition section 652. Pane 602 displays elements from parts catalog 204. Panes 604, 606, 608 are used to define a product. Panes 604, 606, and 608 represent classifications or product relationships. Panes 610 and 614 and relationship 612 are used to define part relationships. [0062] A user can drag elements from pane 602 to panes 604-608 to define a product. For example, to include Part B in the product definition, Part B is dragged from pane 602 to pane 604. Alternatively, to drag parts B, C, D, and E, group A can be dragged from pane 602 to pane 604. Group A and its component parts (parts B, C, D, and E) are thereby included in the product definition. Similarly, a user can specify that a configuration user must choose a part from a group, e.g., Group I, by dragging one or more parts or a group into pane 606. An optional part or group can be identified by dragging an element, e.g., Group L, into pane 608. If an element from pane 602 is not moved to one of panes 604-608 it is assumed that the maintainer wants to exclude that element from the product that is being defined. The product-level relationships or classifications (or types) illustrated in FIG. 5 can be defined using panes 604-608. [0063] A subset of the product-level relationships map to a subset of the part relationships. For example, the include and requires choice product-level relationships map to the same named part relationships (as defined in FIG. 4 and shown in relationships 612). Minimum and maximum values set for a requires choice product-level relationship map to the minimum and maximum values of a requires choice part relationship. Elements that are not dragged into one of panes 604, 606 or 608 are considered to be excluded. [0064] In addition to defining the elements (and their types) that comprise the product, the maintainer can specify relationships between parts of the product. Panes 610 and 614 and relationship 612 are used to define relationships between parts. The maintainer can drag an element (or elements) from pane 602 into pane 610. For example, the user can drag Part N from pane 602 into pane 610. The element(s) dragged into pane 610 are referred to as the left-hand side of the relationship. The element (or elements) from pane 602 that is related to the left-hand element(s) is dragged into pane 614. The element(s) dragged into pane 614 are referred to as the right-hand side of the relationship. For example, the user can drag Part K from pane 602 to pane 614. [0065] To identify the type of relationship that exists between the left-hand side and right-hand side elements, the maintainer chooses one of the four part-to-part relationships from relationship 612. For example, if the maintainer chooses the includes relationship, the right-hand side elements are included in the product when a configuration user selects the left-hand side element(s). Thus, for example, Part N includes Part K. When Part N is chosen by a configuration user, Part K is automatically included in the configuration. [0066] When the maintainer completes the product definition using the GUI screen, the product definition is saved (e.g., in parts definition 208). The product definition can then be used by a configuration user in configuration system 212. [0067] External and Internal Representations [0068] The GUI screen of FIG. 6 illustrates a view of a product as seen by a user (e.g., maintainer and configuration user). A view of the product that is seen by a user is referred to as the external representation. A user sees a product or product definition from a conceptual level that is easy to understand. The user does not need to express a definition or configuration using a language that has a syntax that is foreign to the user. A GUI having graphical selections and operations is preferably used to allow the user to see the external representation. The external representation uses terminology that is familiar or intuitive to the maintainer. For example, an include product relationship defines elements that can be included in a product. [0069] An external representation seen by the user is translated into an internal representation that can be used by the invention to process user input. FIG. 7 provides a block diagram illustrating the conversion process according to one embodiment of the invention. Compiler 704 is used to perform the conversion. Compiler 704 generates internal representation 706 from external representation 702. [0070] External representation 702 is the representation of a product definition that is created using the maintenance system of the invention. External representation 702 provides a graphical representation of a system definition, its components and their interrelationships. FIG. 6 can be used to display external representation 702. External representation 702 can include a multi-level hierarchy of parts that help to define the product at a conceptual level. The hierarchies are not required to drive a configuration session, however. Therefore, compiler 704 flattens out the hierarchies. A set of relationships is generated using external representation 702 during a translation process. [0071] The set of relationships generated for a system definition by compiler 704 comprise internal representation 706. Internal representation 706 is generated from external representation 702 and can be used to control a configuration session. In addition to internal representation 706, a configuration state is used during the configuration session. FIGS. 8A-SB illustrate components of internal representation 706 and the configuration state according to an embodiment of the invention. [0072] Referring to FIG. 5A, vector 802 provides an example of a vector used to store state information. Vector 802 is comprised of bits. A set of p bits is used to represent the products that are known to maintenance system 202 and configuration system 212. Each bit of the P bits corresponds to a product. A set of N bits is used to represent the parts. Each bit in the N-bit set corresponds to a part in parts catalog 204, for example. Vector 802 is therefore P+N bits in length. [0073] Vectors 804-810 provides implementation examples of vector 802. Vectors 804-810 are maintained by configuration system 212 in a configuration session. Vector 804 is a user vector that contains the set of elements that are selected by the user. Vector 804 is referred to as the user vector, or uVec. The set of elements that are included in the configuration by the configuration system (e.g., an item that is automatically included when the user selects the left-hand in an includes relationship) is contained in included vector 806, or iVec. Removed vector 808, or rVec, contains the elements that are removed from the configuration by configuration system 212. Elements excluded from the configuration by configuration system 212 are identified in excluded vector 810, or xVec. [0074] Each element that can be used to configure a system has a bit in these vectors. When an element is included, excluded, removed (or deleted), or selected, the corresponding bit in the appropriate vector (iVec, xVec, rVec, or uVec) is set. The use of vectors to represent elements results in increased efficiency in processing. Bit-wise operations can then be used during processing. For example, it is possible to determine whether a group of elements have been selected by the user by performing a bit comparison using the uVec. The increased efficiency results in optimal response times that are necessary for an interactive system such as is preferred for configuration system 212. The bit vector implementation used by the invention allows for fast and efficient computation of runtime algorithms. A bit vector implementation of relationships and internal runtime state allows for fast and efficient computation of relationship based configuration. [0075] Another vector that contains state information is required groups vector 812, or rgVec. The rgVec contains a bit for each of the required groups specified for a product. As previously discussed, the maintainer can include a required group in a product definition by dragging a group from pane 602 to pane 606, for example (see FIG. 6). The number of bits in rgVec can differ from the number of bits in vectors 802-810. Tne number of bits contained in rgVec corresponds to the total number of required groups defined for a product. Each bit in rgVec is set to indicate that it has not yet been satisfied. It is unset (set to zero) when a required group has been satisfied. Thus, when a user attempts to accept a configuration, configuration system 212 can determine whether all of the required choices have been satisfied. [0076] In addition to these vectors, additional vectors are used to determine a current state. The current state is defined by three types of state information that track the state of parts in the configuration. The current state is visible to the user. The three state types are: selected, selectable, and notSelectable. The selected state identifies all of the parts that are currently included in the configuration. The selectable state identifies the parts that are not in the configuration but that can be selected by the user for the configuration. The notSelectable state identifies the parts that are not in the configuration and cannot be selected by the user. Configuration system 212 ensures that only parts that can form a valid configuration are selectable; those that cannot are notSelectable. [0077] The uVec, iVec, xVec, and rVec vectors can be used to generate the three visible states. The states are dynamic and can change based on user input. The following provides definitions using the formulae that can be used to generate the three visible states (+ is union and − is difference): [0078] Selected=(uVec+iVec)−rVec [0079] NotSelectable=xVec+rVec [0080] Selectable=[AZZItens]−Selected−NotSeZectable [0081] Computation of the visible state using C++, for example, can be accomplished using the following C++ code (the syntax assumes appropriate bit-wise operator overloads for the given operations): [0082] SelectedVec=(uVec\iVec) & �rVec [0083] NotSelectableVec=xVec\rVec [0084] SelectableVec=�(SelectedVec\NotSelectableVec) [0085] The selected state is the union of the elements selected by the user or automatically included in the configuration minus the elements removed by configuration system 212. The notSeletable state is the union of the elements that are excluded or removed. The selectable state is the set of all elements minus the elements already selected and the elements that cannot be selected. The selected, selectable, and notSelectable states can be generated from these four vectors when needed. They can be stored as vectors that have the structure of vector 802. [0086] Runtime tables are preferably used to store internal representation 706 for a configuration session. FIG. 5B provides an example of runtime tables. Runtime table 822 provides an example of a runtime table. Runtime table 822 can be used to store relationship information. Runtime table 822 has left-hand side 824 and right-hand side 826. Left-hand side 824 contains the left-hand side of a relationship (e.g., includes, removes, can't work with or excludes). The right-hand side of a relationship is stored in right-hand side 826. [0087] Table 828 provides an example of runtime table 822. Table 828 can be an includes, excludes, or removes table, for example. Left-hand side 830 contains a bit vector (i.e., �01010 . . . 0�). Right-hand side 832 contains a bit vector (i.e., �10001 . . . 1�). Each bit in bit vectors 830 and 832 corresponds to an element in parts catalog 204 or a product. For example, if the product definition is for an automobile, each �1� bit in bit vector �01010 . . . 0′ corresponds to a part in parts catalog 204 that is contained in an automobile's product definition. Zero bits indicate that the part is not included in the product definition. With reference to bit vectors, parts can be identified by the position of their corresponding bit in the bit vector. For example, the part (that corresponds with the �1� bit in the bit vector �0010� is part number three. [0088] If table 830 is an instance of an includes table, when parts designated on left-hand side 830 (e.g., part numbers two and four) are selected, configuration system 212 includes the parts designed in right-hand side 832 (e.g., part numbers one and five). Similarly, if table 830 is excludes (or can't work with) table, parts one and five are excluded from the selectable parts when parts two and four are selected. Parts one and five are removed from the configuration when parts two and four are selected. [0089] Like the includes, excludes, and removes tables, the requires choice table contains a left-hand side and a right-hand side. In one embodiment, both sides of the requires choice table contains a bit vector that corresponds to elements in parts catalog 204. Thus, for example, when selected, the part(s) identified on left-hand side 836 require a choice of a minimum and maximum number of parts from the parts contained on the right-hand side 838. [0090] Table 822 can be altered to optimize the storage and use of 20 information for a required choice table. Table 834 provides an example of an altered table 822. Preferably, however, right-hand side 838 contains a pointer to a group table (e.g., group table 840) that contains a bit vector (bit vector 842) that identifies the parts contained in the group. An advantage that the latter (altered table 822) format has over the former (unaltered table 822) is that it is only necessary to define the members of a group once. Each product definition that includes the group can point to the entry in the group table that contains the group definition. [0091] One relationship table can be used for all products per relationship type. That is, a single includes table is used for includes relationships for all of the products. Alternatively, a table can be partitioned for each product. That is, the relationships associated with a product are segregated. For example, there would be a includes relationship table for each product. This has the advantage of only having to process only those relationships that exist for the chosen product. When a product is unselected or not selectable, there is no need to process the tables associated with that product. The latter alternative is preferable because it lessens processing requirements. [0092] Configuration System [0093] Using configuration system 212, a configuration user can configure a system given a product definition (e.g., product definition 208) and part relationships associated with the product definition. Configuration system 212 accepts a configuration user's input and processes it to update the configuration based on the user's input or notify the user that the input is invalid given the current state of the configuration and the system definition. Configuration system 212 ensures that the current configuration state (determined by the product definition and order-independent user selection) is always valid. [0094] User Selection [0095] When user input is received by configuration system 212, it is processed based on the current configuration state, the product definition and the parts relationships. FIG. 9 provides a process flow for processing a user selection according to an embodiment of the invention. [0096] At step 902, the user selects item n (e.g., part) preferably using a GUI screen. At step 904 (i.e., �n selectable?�), a determination is made whether the item is selectable. Thus, for example, configuration system 212 determines whether the nth bit in the selectable state information is set. If it is not, configuration system 212 determines that the item is not selectable by the user and raises an error at step 922. Processing then continues at step 914 to update the interface (if necessary) and return control of the GUI screen to the user. Processing of the current input ends at step 916. [0097] If, however, it is determined at step 904 that the item selected by the user is selectable, processing continues at step 908 to set the nth bit in uVec 804. At step 910, the visible state information is updated as discussed above. At step 912, the relationships associated with the product definition are evaluated as discussed below. Processing continues at step 914 to update the interface (if necessary) and return control of the GUI screen to the user. Processing of the current input ends at step 916. [0098] Relationship Evaluation [0099] Relationships associated with items contained in the product definition are evaluated when user input is received. Configuration system 212 determines what relationships are active and inactive given the user input (at step 912, for example). A relationship is active when all the items on the left-hand side of the relationship are selected. A relationship is inactive until all of the parts on the left-hand side of the relationship are selected. [0100] As previously discussed, relationship tables can be used to store the left-hand and right-hand sides of a relationship. That is, a relationship can be defined as a pair of bit vectors, the lhsVec (left-hand side) and the rhsVec (right-hand side). A relationship is made active if the following expression is true: [0101] SelectedVec & lhsVec==lhsVec [0102] When a relationship is made active, updating the appropriate state vector (iVec, xVec, or rVec) becomes: [0103] stateVec|=rhsVec [0104] An active relationship causes the configuration state to be updated. When an include relationship is activated, for example, parts identified on the right-hand side of the include relationship are added to the configuration, if they are not already included. The state is changed by modifying iVec 806. A change in iVec 806 can change other state information such as the selected and selectable state information. Parts that are included as a result of the activation of the includes relation can result in a ripple effect that causes other relationships to become activated. Thus, additional state changes can occur as a result of the include relationship's activation. [0105] To further illustrate, when a requires choice relation becomes active, configuration system 212 includes and excludes items of the given group where applicable: if exactly max (maximum number of) items of the given group are selected, the engine excludes all other items in the group (added into xVec); otherwise, if less than min (minimum number of) items of the group are selected and only one valid selection path exists to make exactly min items selected, the engine includes (into iVec) the items that are needed (note that these must have been selectable items). [0106] Configuration system 212 also ensures that no relationship that will put the configuration into an invalid state can become active (for example: if b is Selected then the relationship [a] can't work with [b] should not be active). If a relationship will make a configuration invalid, it is made notActivateable. For example, a relation should be made notActivateable, if: [0107] 1) an includes relationship has excluded (xVEc) parts on the right-hand side; [0108] 2) a excludes (can't work with) relationship has Selected parts on the right-hand side; [0109] 3) a removes relation has user-selected (uVec) parts on the right side; or [0110] 4) a requires choice relation has a group for which between [min, max] parts can't be Selected. [0111] In addition to the relationships created by a maintainer, there are some relationships that are dynamically created or deduced at runtime. If a relation becomes notActivateable and all but one item from the left-hand side is Selected, then the unSelected item is excluded by the engine. This ensures that the relation will not become active. [0112] Configuration system 212 evaluates each relationship forward and backward. In a forward evaluation, the left-hand side of a relationship is examined to determine whether all of its parts are included in the configuration. If they are, the relationship is considered to be active. An active relationship causes the right-hand side of the relationship to then be evaluated. The evaluation is dependent on the type of relationship. An includes relationship causes the parts specified in the right-hand side to be included in the configuration specification. A removes relationship causes the right-hand side parts to be removed from the configuration. An excludes relationship cause the left-hand side parts to become notSelectable. A requires choice relationship recognizes that a choice has to be made by the user between the set of right-hand parts. [0113] In a backward evaluation, configuration system 212 determines whether a relationship if activated would result in an invalid state. If so, configuration system 212 takes steps to ensure that the relationship cannot be activated. Instead of evaluating the left-hand side first as in the case of a forward evaluation, a backward evaluation evaluates the relationship by first examining the right-hand side. If a relationship fails the backward 110 evaluation (i.e., its activation would result in an invalid state), configuration engine 212 takes steps to ensure that the relationship cannot become active. For example, if a relationship states that part A can't work with part B and part B is selected, configuration system 212 excludes part A. This ensures that part A cannot be selected and the excludes relationship cannot become active. Otherwise, a user can select part A which would result in an invalid configuration state. [0114] The invention performs a relaxation over the set of relationships. A relaxation is an iterative process that is repeated until a state that has been defined no longer changes. That is, relationship evaluation is completed when none of iVec, xVec, or rVec are modified during an iteration. The invention ensures that the relaxation process terminates by only adding bits to the state. That is, because iVec, xVec, and rVec all grow through the iteration, the relaxation process is guaranteed to terminate. [0115]FIG. 10 provides an example of a relationship evaluation process flow according to an embodiment of the invention. At step 1002, rgVec is initialized to zero. During the relationship evaluation, rgVec is regenerated. At step 1004, copies of iVec, xVec, and rVec are made. The copies are used to determine whether relaxation is finished. At step 1006, the includes table associated with the product definition is evaluated in the forward direction. Similarly, forward evaluation is performed on the excluded and removed tables. The forward evaluation performs an �or� operation with the selectedVec and a specified configuration state vector (e.g., a forward evaluation of the includes table performs an �or� operation with the selectedVec and and the iVec) when the left-hand side of the relationship is true. For example, when the items that correspond with the �1� bits in left-hand side 830 are all selected (i.e., in the selected vector), right-hand side 832 is �or'ed� with the iVec to add the items that correspond with the �1� bits in right-hand side 832 to the configuration where a forward evaluation of an includes relationship is being performed. [0116] At step 1008, a backward evaluation is performed on the relationships contained in the includes, excludes, and removed tables. In a backward evaluation of an include relationship, the xVec is examined to determine whether any right-hand side items of an include relationship are excluded. If so, selection of all of the left-hand side items would result in an invalid configuration state. Therefore, the last remaining left-hand side item (if only one remains) is excluded to cause the relationship to never become active. Thus, the relationship is rendered notActivateable. [0117] Backward evaluation of an excluded relationship examines the selectedVec. If a left-hand side item (an item that is supposed to be excluded when the relationship becomes active) is selected, selection of all of the left-hand side items would result in an invalid configuration state. To ensure against an invalid configuration state, a left-hand side item is excluded so that the relationship never becomes active (the relationship is rendered notActivateable). [0118] In the preferred embodiment, configuration system 212 cannot delete, or remove, a user-selected item. The uVec is examined in a backward evaluation of a removes relationship. If a right-hand side item is a user selected item, the selection of all of the left-hand side items would result in an invalid configuration state. To ensure against an invalid configuration state, a left-hand side item is excluded so that the relationship becomes notActivateable. [0119] At step 1010, backward and forward evaluation is performed on the requires choice table S34. In the backward evaluation, a determination is made whether a requires choice relationship should become notActivateable. For example, if it is impossible to satisfy a group, then a left-hand side item should be excluded to cause the relationship to become notActivateable. [0120] In the forward evaluation, rgVec is set and items are included or excluded where appropriate. For example, if the right-hand side items are within range (within min and max values for the required choice relationship), then the remaining right-hand side items are excluded. If the only way to make a requires choice valid is to select the items remaining on the right-hand side item, configuration system 212 includes these items. In addition, a requires choice relationship is evaluated to determine whether the right-hand side items selected are within a valid range. If not, the corresponding bit in the rgVec is set. If so, the corresponding bit in the rgVec is zeroed. [0121] The selected, selectable, and notSelectable states are updated at step 1012. At step 1014 (i.e., �change in a vector?�), a determination is made whether any of iVec, xVec, or rVec were modified during the current iteration of the relaxation process. If not, a stable state has been achieved, and processing ends at step 1016. If so, additional iterations are needed to complete the relaxation process. Processing therefore continues at step 1002 to initiate a new iteration. [0122] In evaluating relationships, it is not necessary to evaluate a relationship in either the forward or backward direction once it has become active. Also, when a relationship is notActivateable, there is no need to evaluate the relationship in the forward direction. When a relationship is notActivateable and has been excluded, there is no need to evaluate in the backward, or reverse, direction. [0123] UnseZetion [0124]FIG. 9 described processing where the user input was an item selection. Configuration system 212 also processes user input to unselect an item from the configuration. As previously discussed, an item can be unselected in any order. There is no requirement to unselect items the reverse order in which they were selected. FIG. 11 provides an example of an unselect item process flow according to an embodiment of the invention. [0125] At step 1102 (i.e., �selection in uVec?�), a determination is made whether the item that is selected for deletion was selected for inclusion in the configuration by the user. If it is determined that the item is not a user-selected item, processing continues at step 1104 to raise an error. Processing continues at step 1114 to update the GUI (if necessary) and return control to the user. Processing of the current input ends at step 1116. [0126] If it is determined at step 1102 that the item selected for unselection was selected by the user, processing continues at step 1106 to reset the bit in the uVec that corresponds to the unselected item (i.e., set the bit to zero). This unselects the item from the current configuration. At step 1108, the iVec, xVec, and rVec vectors are initialized (set to zero). Steps 1110, 1112 and 1114 correspond to steps 910, 912, and 914, respectively, of FIG. 9. Processing ends at step 1116. [0127] Translation Between Representations [0128] To ensure correct runtime behavior of the engine, a potentially incomplete user-defined set of relationships is converted into a set of complete runtime relationship tables. The external representation is translated into an internal representation. The invention maps the hierarchies contained in parts catalog 204 to relationships and maps relationships to the runtime tables, for example. [0129] As discussed above, compiler 704 performs a mapping between product-level relationships and part-level relationships. The translation process further provides the ability to translate a multi-level hierarchy to a single-level hierarchy. That is, the translation process can be used to flatten out the intuitive hierarchy created by a maintenance user using the user interface of FIG. 6, for example. FIG. 12 provides a flow for translation processing according to an embodiment of the invention. [0130] At step 1202, a set of relationships is created based on the hierarchies. Thus, for example, group 312 is translated into an requires choice relationship. That is, group 312 requires a choice between parts 306, 308, and 310. Relationships can be defined in terms of groups. An identifier (item ID) is used to identify the group. When a group appears on the left-hand side of a relationship, the group is assigned an item ID and the relationship is defined in terms of the new item ID. This process, referred to as back-linking, is performed at step 1204. [0131] At step 1206, an include chain evaluation is performed. In an include chain evaluation, all include relationship chains are fully evaluated so that a relationship contains all of the parts that are included in that part regardless of whether the included relationship is direct (e.g., mentioned in the includes relationship) or indirect (mentioned in another includes relationship that contains an included part on the right-hand side). [0132] At step 1208, subgroup excludes are evaluated. In this process, active requires choice relationships are evaluated where one relationship's right-hand side is a subset of another relationship's right-hand side. In this case, if both relationships are active, the right-hand side parts that are not within the subset are excluded. Relationship factorization is performed at step 1210. Relationship factorizing can create new relationships that ensure proper runtime behavior when more than one item is selected during some iteration. [0133] Removing redundancy in relations may cause some relations to become unnecessary. A relation becomes unnecessary when it contains no items on its right side. Redundant relationships are removed at step 1212. Processing ends at step 1214. [0134] Back-Linking [0135] Relationships can be defined in terms of groups. When a group appears on the left-hand side of a relationship, the group is assigned an item ID and behaves as a normal item (e.g., part) and the relationship is defined in terms of this new item ID. A relationship is defined for each item in the group: [0136] item includes item ID (of the group) [0137] It is only necessary to create this relationship once per group, regardless of how many times that group appears on the left side of a relationship. Back-Linking can be used to generate relationships in nested groups. FIGS. 13A-13B provide an illustration of groups and nested groups according to an embodiment of the invention. Group 1302 contains two items (groups 1304 and 1306) that are nested within group 1302. Notation is provided for a group to specify the minimum and maximum bounds for a group. For example, the notation �(0,1)� indicates that between zero and one items in group 1302 are to be chosen. [0138] The items contained in group 1302 are also groups that contain multiple items. Groups 1304 and 1306 are nested within group 1302. Two or three of parts 1308-1312 can be chosen from Group 1304. Zero to three of parts 1314-1318 can be chosen from Group 1306. [0139] The invention creates a metapart for these groups (groups 1302-1306). Relationships are then created between the groups and their members such that items are back-linked to their parents. FIG. 13B provides an illustration of metaparts for the groups and nested group of FIG. 13A according to an embodiment of the invention. Groups 1302′-1306′ are metaparts for groups 1302-1306, respectively. Relationships can be generated using these metaparts as follows: [0140] Group 1302′ requires choice [Group 1304′, Group 1306′] 0,1 [0141] Group 1304′ requires choice [part 1308, part 1310, part 1312] 2,3 [0142] Group 1306′ requires choice [part 1314, part 1316, part 1318] 0,3 [0143] The metapart is used internally; it is unnecessary for a user to be aware of them. Using back-linking, relationships can be generated such that an item (e.g., part 1308) links back to its predecessor(s) (e.g., nested group, group 1302). The following new relationships can be created for the examples of FIGS. 13A-13B: [0144] Group 1304′ includes Group 1302′
[0145] Group 1306′ includes Group 1302′
[0146] Part 1308 includes Group 1304′
[0147] Part 1310 includes Group 1304′
[0148] Part 1312 includes Group 1304′
[0149] Part 1314 includes Group 1306′
[0150] Part 1316 includes Group 1306′
[0151] Part 1318 includes Group 1306′
[0152] When a user selects part 1308, part 1308 includes group 1304′. Group 1304′ is added to the configuration. Further, group 1304′ includes group 1302′ thereby including group 1302′. When group 1302′ is included in the configuration, it activates the relationship that requires a choice between groups 1304′ and 1306′. Since group 1304′ is already selected, group 1306′ can be excluded. When group 1306′ is excluded, parts 1314-1318 are excluded when the newly generated relationships are evaluated in the reverse (backward) direction. Further, the bounds specified by group 1304 are also enforced using these relationships. [0153] As discussed above, a requires choice relationship can be defined at the product level. A product can require a choice between items in a group. The product-level requires choice relationship is treated similarly to that of a requires choice part-level relationship. [0154] Include Chains [0155] In an include chain evaluation, all include relationship chains are fully evaluated so that a relationship can be generated that contains all of the parts that are included regardless of whether the relationship is direct (e.g., the included parts mentioned in the includes relationship) or indirect (a part is mentioned in another includes relationship that contain an included part on the right-hand side). For example, the following relationships exists in the external representation: [0156] a includes b and c [0157] b includes d [0158] d and c includes e [0159] An include chain exists that starts with a. The first relationship indicates that a includes b and c. Based on the second and third relationships, b and c include other parts. Based on all of the relationships, a includes b, c, d, and e. Include chain evaluation expands these relationships into the following relationships: [0160] a includes b and c and d and e [0161] b includes d [0162] d and c includes e [0163] It is not necessary to generate additional relationships to perform includes chain evaluation. Preferably, includes chain evaluation can modify an existing relationship to include both direct and indirect includes relationships. Each includes relationship can be evaluated against all other includes relationships to determine whether its right-hand side should be modified to include both direct and indirect includes relationships. Once all of the includes relationships have been evaluated, a new right-hand side value can be generated based on the evaluation. FIGS. 14A-14B provide an includes chain process flow according to an embodiment of the invention. [0164] At step 1402 (i.e., �all include rels. processed?�), a determination is made whether all of the includes relationships have been processed. If other includes relationships remain to be processed, processing continues at step 1408 to get the next includes relationship, r. At step 1410, a temporary vector, temp, is created that is the result of an �or� operation between the left-hand and right-hand sides of r. Another temporary vector, tempsave, is created that is set to the value of temp at step 1412. At step 1414 (i.e., �all rels. compared?�), a determination is made whether all of the other includes relationships have been evaluated against r. If not, processing continues at step 1418 to get another relationship, r2. At step 1420 (i.e., �temp hits r2?�), a determination is made whether any of the items contained in temp are also contained in r2. If not, processing continues at step 1414 to process any remaining relationships against r. If so, processing continues at step 1422 to perform a �or� operation between temp and the right-hand side of r2 to add the right-hand side of r2 to the temp vector. [0165] If it is determined, at step 1414, that all of the relationships r2 have been evaluated for r, processing continues at step 1416. At step 1416 (i.e., �temp=tempsave?�), a determination is made whether any items were added to the temp vector. If not, there are no indirect includes and processing continues at step 1424 to reset r2 and processing continues at step 1414 to process any remaining relationships against this relationship. If so, processing continues at step 1404 to modify the right-hand side of r to include the items contained in the temp vector minus the items contained in the left-hand side of r. Processing continues at step 1402 to process any remaining relationships. [0166] If it is determined at step 1402 (i.e., all include rels. processed?�) that all of the includes relationships have been evaluated for include chains, processing ends at step 1404. [0167] Subgroup Excludes [0168] The subgroup excludes evaluation is performed on requires choice relationships. Assume a requires choice relationship points to a group (A) that is a complete subgroup of a group (B) of another requires choice relationship. If B has a max of 1 and both relationships are made active, the items in B that are not in A, Q, cannot be chosen. If a pairwise comparison of requires choice relationships yields such cases, a relationship such as the following is generated: [0169] [union of left sides of both relationships] can't work with Q [0170] For example, assume that the following relationships have been defined: [0171] a b requires choice [x, y, z] (0,1) [0172] d requires choice [x, y] (0,2) [0173] The second relationship contains a group that is a subgroup of the first relationship. When both relationships are active, the non-subset is excluded. This avoids the case where a user selects a, b, and d and the relationship evaluations do not exclude the items not included in both groups (the non-subset). The invention combines these relationships and creates an excludes relationship. The excludes relationship for the above example is as follows: [0174] a b d excludes z [0175] FIGS. 15A-15B provides an example of a subgroup excludes process flow according to an embodiment of the invention. At step 1502 (i.e., �all rels. processed?�), a determination is made whether all of the requires choice relationships have been processed. If so, processing ends at step 1504. If not, processing continues at step 1506 to get the next relationship, r. At step 1507 (i.e., �r.rhs.max=1?�), a determination is made whether the maximum value for the relationship is equal to one. If not, processing continues at step 1502 to process any remaining relationships. If so, processing continues at step 1508. At step 1508 (i.e., �all rels. compared?�), a determination is made whether all of the other requires choice relationships have been processed against r. If so, processing continues at step 1502 to process another requires choice relationship. [0176] If not, processing continues at step 1510 to get another relationship, r2. At step 1512 (i.e., �r=r2?�), a determination is made whether the two relationships are equal. If so, processing continues at step 1508 to process any remaining requires choice relationships against the current r. If r and r2 are not equal, processing continues at 1514. At step 1514 (i.e., �r2.grp subset of r.grp?�), a determination is made whether the right-hand side of r2 is a subset of the right-hand side of r. If not, processing continues at step 1508 to process any remaining requires choice relationships against the current r. If so, processing continues at step 1516 to create an exclude relationship where the left-hand side is the union of the left-hand side of r and r2 and the right-hand side is the non-subset of the right-hand side of the two relationships. Processing continues at step 1508 to process any remaining requires choice relationships against the current r. [0177] Relationship Factorization [0178] The invention assumes that one item on the left side of a relationship is preferably selected during any iteration. However, the includes and requires choice relationships may cause additional items to become selected (e.g., selected by the system). Factorizing of relationships can create new relationships to ensure proper runtime behavior when more than one item is selected during some iteration. [0179] Factorization causes a relationship to be created where a relationship has items on the left-hand side that also appear on the right-hand side of an includes relationship. The new relationship represents the common factorization of both relationships. For example, where the following two relationships exist: [0180] [a] includes [b and c]
[0181] [b and c and d and e] can't work with [x and y]
[0182] the following relationship is created: [0183] [a and d and e] can't work with [x and y]
[0184] The invention uses a technique in factorization that avoids combinatorial explosion. Relationships are created during factorization when they add value. The invention identifies value where the new relationship: [0185] 1. replaces more than one item from the left-hand side; [0186] 2. has at least two different includes relationships replace at least one unique item from the left-hand side of the relationship being factorized; and [0187] 3. the two includes relationships have at least one common item in their left-hand side. [0188] FIGS. 16A-16C provide an example of a relationship factorization process flow according to an embodiment of the invention. At step 1602, each relationship is marked as �new�. At step 1604, a state variable, added, is initialized to �false�. At step 1606 (i.e., �all includes rels. processed?�), a determination is made whether all of the includes relationships have been processed. If so, processing continues at step 1608 (i.e., �added �true�?) to determine whether any new relationships were added. If not, processing ends at step 1610. If there are new relationships, processing continues at step 1609 to reset the includes relationships and processing continues at step 1604 to initialize added to �false�. [0189] If it is determined at step 1606 that all of the includes relationships have not been processed, processing continues at step 1612 to get the next includes relationship, i. At step 1613, the relationships are reset. At step 1614 (i.e., �all �new� rels. processed?�), a determination is made whether all of the relationships have been marked as �new� have been processed against i. If so, processing continues at step 1606 to process any remaining includes relationships. If not, processing continues at step 1616. [0190] At step 1616, the next relationship, r, is marked as �old�. At step 1620 (i.e., �!(r.lhs && i.rhs)?�, a determination is made whether the right-hand side of the i relationship and the left-hand side of the r relationship have any bits in common. If they do not have bits in common, processing continues at step 1614 to process any remaining relationships against the current i. If they do have bits in common, processing continues at step 1622 to generate new.lhs from the includes relationship and the left-hand side of r. Step 1622 takes out items in the right-hand side of i from left-hand side of r and adds in items that are in the left-hand side of i. At step 1624 (i.e., �new.lhs has value?�) a determination is made whether new.lhs has value. This determination can use the guidelines as specified above. [0191] If new.lhs does not have value, processing continues at step 1614 to processing any remaining relationships against i. If it does have value, processing continues at step 1626 to add a new relationship (of the type r) that uses new.lhs as the left-hand side and the right-hand side of r. The new relationship is marked as �new� at step 1628. The value of added is set to �true� at step 1630. Processing continues at step 1614 to process any remaining relationships. [0192] Relationship Compression [0193] Removing redundancy in relations may cause some relations to become unnecessary. A relation becomes unnecessary when it contains no items on its right side. If a relationship's left-hand side is a proper subset of the left-hand side of another relationship, then the first relationship is guaranteed to be active whenever the second relationship is active. If both relationships are also the same type of relationship, the common right-hand side elements can be removed from the second relationship. This can be repeated to remove all unnecessary relationships. The following relationships provide an example: [0194] [a] removes [c]
[0195] [a and b] removes [c and d]
[0196] The left-hand side of the first relationship is a proper subset of the left-hand side of the second relationship (e.g., all elements �a� in the left-hand side of the first relationship are contained in the left-hand side of the second relationship). The relationships are the same type. Therefore, the common right-hand side elements can be removed from the right-hand side of the second relationship. The following is the result after modifying the relationship: [0197] [a] removes [c]
[0198] [a and b] removes [d]
[0199] FIGS. 17A-17B provide an illustration of a relationship compression process flow according to an embodiment of the invention. At step 1702 (i.e., �all relationships in table processed?�), a determination is made whether all of the relationships in the table have been processed. If not, processing continues at step 1704 to get the next relationship, r. At step 1706 (i.e., �r processed against all other rels. in table?�), a determination is made whether the other relationships in the table have been processed against r. If so, processing continues at step 1702 to process any remaining relationships in the table as r. [0200] If it is determined at step 1706 that all of the other relationships have not been processed against r, processing continues at step 1708. Another relationship is retrieved as r2 at step 1708. At step 1710 (i.e., �r=r2?�), a determination is made whether the relationships are the same. If not, processing continues at step 1706 to process any remaining relationships against r. If so, processing continues at step 1712. At step 1712 (i.e., �r.lhs subset of r2.lhs?�), a determination is made whether the left-hand side of r is a subset of the left-hand side of r2. If the subset condition is true, processing continues at step 1714 to remove the common items out of the right-hand side of r (i.e., perform the operation r2.rhs=r2.rhs and not r.rhs). Processing continues at step 1706 to process any remaining relationships against r. [0201] If it is determined at step 1702 that all of the relationships have been processed as r, processing continues at step 1716. At step 1716 (i.e., �all relationships in table processed?�) a determination is made whether all of the relationships have been processed. If so, processing ends at step 1718. If not, processing continues at step 1720 to get another relationship as r. At step 1722 (i.e., �r.rhs=zeroes?�), a determination is made whether the right-hand side of r has been set to zero has a result of compression. If not, processing continues at step 1716 to process any remaining relationships. If so, processing continues at step 1724 to delete r from the table. Processing continues at step 1716 to process any remaining relationships. [0202] Global Relationships [0203] Global relationships can be defined that are processed for all products. Thus, it is unnecessary to redefining a relationship for all of the products. The relationship can be defined as a global relationship that is applied for every product. If, however, partitioned relationship tables are used for each product, it is necessary to evaluate the relationships in a product's partitioned relationship tables as well as the global relationships. For example, the process flows described herein that operate on relationship tables can be performed once for the product's partitioned relationship tables and once for the global relationships. [0204] Thus, a method and apparatus for maintaining and configuring systems has been provided. Referenced byCiting PatentFiling datePublication dateApplicantTitleUS7630917 *Apr 14, 2006Dec 8, 2009At&T Intellectual Property Ii, L.P.Automatic learning for mapping spoken/text descriptions of products onto available productsUS7937301Dec 7, 2009May 3, 2011At&T Intellectual Property Ii, L.P.Automatic learning for mapping spoken/text descriptions of products onto available productsUS7953779 *Oct 8, 2002May 31, 2011Trilogy Development Group, Inc.Configuration representation and modeling using configuration spacesUS8370408May 13, 2011Feb 5, 2013Versata Development Group, Inc.Configuration representation and modeling using configuration spacesUS20130054633 *Aug 23, 2011Feb 28, 2013Christian BaustRemote comparison of a maintenance configuration with an allowable configuration* Cited by examinerClassifications U.S. Classification713/1International ClassificationG06Q10/00, G06F9/00, G06F17/50Cooperative ClassificationG06F17/50, G06Q10/00European ClassificationG06F17/50, G06Q10/00RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services