AU2005332281A1 - Capability mapping architecture - Google Patents

Description

WO 2006/125243 PCT/AU2005/000735 1 CAPABILITY MAPPING ARCHITECTURE FIELD OF THE INVENTION The present invention relates to system mapping architectures. BACKGROUND OF THE INVENTION 5 In the operation of large complex systems, failure conditions can occur where alternative modes of operation need to come into effect. A failure of one part of a system can have a knock-on effect on the operation of quite remote parts of the system or on the system as a whole. The need to identify alternative modes of operation can be critical where the operation of the system is necessary 10 in terms of safety, the need to maintain capability, or the need to maintain operations. During failure conditions, organisations typically rely upon system experts to assess the current system state and provide an assessment of what can be achieved or not achieved with the remaining system and whether alternative 15 means are available. However, where a system is a complex arrangement of interrelated microsystems and/or a hierarchical system structure, the system assessment may require individual assessments of each microsystem and/or each level of a hierarchical system. This can prove to be an inefficient and slow process requiring individual reports to be filed and collated for each microsystem 20 or system level. Expert systems are known for monitoring or simulating system operations. Expert systems are typically based upon a database of expert knowledge. When, for example, a failure condition occurs in a system, an expert system will provide solutions or alternatives for overcoming the failure. Essentially, an expert system 25 can provide what should be done. However, known expert systems do not consider what can be done. This is a question which requires knowledge of the capabilities of a system. It is an object of the present invention to provide a way of readily determining the operating capabilities of an actual or simulated system. 30 It is a further preferred object of the present invention to readily assess how a failed capability can be corrected for. It is a further preferred object of the present invention to readily determine alternative ways of maintaining a capability.

WO 2006/125243 PCT/AU2005/000735 2 SUMMARY OF THE INVENTION According to a first aspect of the present invention there is provided a system mapping architecture for processing and mapping operating capabilities of a system based upon an interrelationship model, said model including: 5 a plurality of objects, each object representing a component of said system or a capability of at least part of said system, wherein each object has a current state; and a plurality of sets, each set having at least one associated object and each set having a current state, wherein the current state of a set is determined by the 10 current state(s) of the object(s) associated with the set; wherein each object, which represents a capability of at least a part of said system, has at least one associated set; the current state of an object, which represents a capability of at least part of said system, being determined by the current state(s) of the associated set(s); 15 wherein each of said plurality of objects and each of said plurality of sets are recursively processed to determine the current state of each object and each set until the current state of each object and each set achieves a fixed state. Preferably, the system mapping architecture will be implemented in a computer or provided in a software package. 20 According to a second aspect of the present invention there is provided a method for providing a system mapping architecture for determining operating capabilities of a system, said method including the steps of: creating an interrelationship model, said model including: a plurality of objects, each object representing a component of said 25 system or a capability of at least part of said system, wherein each object has a current state; and a plurality of sets, each set having at least one associated object and each set having a current state, wherein the current state of a set is determined by the current state(s) of the object(s) associated with the set; 30 wherein each object, which represents a capability of at least part of said system, has at least one associated set; the current state of an object, which represents a capability of at least a part of said system, being determined by the current state(s) of the associated set(s); WO 2006/125243 PCT/AU2005/000735 3 processing each of said plurality of objects and each of said plurality of sets are to determine the current state of each object and each set; and repeating said processing step until the current state of each object and each set achieves a fixed. state. 5 The present invention provides the advantage of processing and providing the various operational capabilities of an actual or simulated system. The present invention is particularly advantageous where the system is complex involving higher and higher levels of capability, ie operational capabilities which are reliant upon other operational capabilities. 10 It is envisioned that the present invention will have particular advantageous application in large complex organisational structures, for example, the organisation of health services, defence services or emergency services. It is also envisioned that the present invention will have advantageous applications in industrial systems, for example, operational plant systems, power generation 15 systems, power distribution networks or telecommunication networks. BRIEF DESCRIPTION OF THE DRAWINGS An illustrative embodiment of the present invention will be described with reference to the accompanying drawings wherein: Fig. 1 is an Object Role Modelling (ORM) model applicable to a preferred 20 embodiment of the present invention; Fig. 2 is a flow chart of the processing of a preferred embodiment of the present invention; Fig. 3 is an example of a capability model applicable to a preferred embodiment of the present invention; 25 Fig. 4 is an example of a capability model applicable to a preferred embodiment of the present invention; Fig. 5 is an example of a capability model applicable to a preferred embodiment of the present invention; Fig. 6 is an example of a capability model applicable to a preferred 30 embodiment of the present invention; Fig. 7 is an example of a capability model applicable to a preferred embodiment of the present invention; WO 2006/125243 PCT/AU2005/000735 4 Fig. 8 is an example of a capability model, which combines the models of Figs. 3 to 7, applicable to a preferred embodiment of the present invention. DESCRIPTION OF EMBODIMENT For convenience, the present invention will herein be referred to as a 5 Capability Mapping Architecture (CMA). The CMA can be implemented on common computing platforms (eg PC, Apple, IBM, Sun, HP), utilising commonly known operating systems (eg Windows, HPUX, Solaris, Linux, BSD Unix, Mac OS) and in common programming languages (eg Visual Basic, C++, C, C#, Pascal, Java). 10 The basic CMA structure is based upon an interrelationship model such as an Object Role Modelling (ORM) model. The model is preferably implemented in a relational database. Although it will be appreciated that other implementations could be employed, for example, in a rule-based structure such as an expert system. A representation of a preferred applicable ORM model is shown in Fig. 15 1. The ORM model establishes the interrelationship between objects. An object is an abstract representation of a real-world concept or thing. In terms of the CMA, an object represents a component or a capability of a system. The ORM model also includes sets. A set represents one or more objects which are 20 required to produce a capability. The ORM model treats components and capabilities in the same way. A low level capability may be dependent upon a number of components. However, as a system becomes more complex, higher level capabilities may be dependent upon a combination of components and/or capabilities. 25 Referring to Fig. 1, each component (and capability) has a state. The state represents quantitative and/or qualitative information about the respective component (or capability). In terms of components, the type of information represented by a state may be dictated by the system or the component's role in such a system. Examples of component states may include activity state, 30 production level, capacity, event probabilities etc. A capability state, in relatively simple applications, will be an indication of whether the capability can be achieved or not. However, in more advanced applications, the capability state WO 2006/125243 PCT/AU2005/000735 5 may not be a simple binary value but represent a fraction or percentage of an optimum capability. Sets also have respective states. The state of a set is dependent upon the states of the components and/or capabilities represented by the set. 5 In Fig. 1, Component Set represents the relationship between components/capabilities and sets. This is a many to many relationship as a component/capability may be involved in more than one set, and a set may represent more than one component/capability. Capability Set represents the relationship between sets and capabilities. 10 This, again, is a many to many relationship as a set may produce more than one capability, and a capability may be derived from more than one set. In order to implement the CMA, the ORM model is processed until all the states in the model have reached a steady state. The processing involved is illustrated in Fig. 2. 15 Prior to processing, the ORM model is provided with initial states for each component, set and capability. The only states which can be truly derived from a system are the component states. The CMA assumes that the component states are fixed states. The set and capability states are set at a default state. The processing involves recursively examining each set and capability until 20 such time that there are no changes of state. In terms of examining a set, the components/capabilities represented by the set are identified in the Component Set. The states of the components/capabilities are subjected to appropriate combinational computation to derive the set state. For example, in the simple case where the states have a 25 binary value, if any of the components/capabilities in the Component Set has an inactive state then the set state is made inactive; if all of the components/capabilities in the Component Set have an active state then the set state is made active. In terms of examining a capability, the sets which provide the capability are 30 identified in the Capability Set. The states of the sets are subjected to appropriate combinational computation to derive the capability state. For example, in the simple case where the states have a binary value, if any of the sets in the Capability Set has an active state then the capability state is made WO 2006/125243 PCT/AU2005/000735 6 active; if none of the sets in the Capability Set has an active state, ie they are all inactive, then the capability state is made inactive. It will be appreciated that the states of certain sets will not be immediately determined until the states of certain capabilities are determined and vice versa. 5 It is for this reason that the processing is recursive or circular until all the states reach a steady state. The processing requires that the components have fixed states. Obviously in a real system component states also change. Therefore the CMA acts upon a snapshot of the component states of the system at a single point in time. 10 However, it is envisaged that the CMA could be adapted so that, upon a change in component state, an updated ORM model is created and the processing of the updated ORM model is instigated. In this way, a pseudo real-time CMA can be created. Preferred embodiments of implementing the CMA will now be described. 15 To assist with the description of these implementations a simple illustrative example of a system will be employed. In this system the states of the components, capabilities and sets have simple binary values, i.e. active or inactive. For this reason, Boolean algebra is readily able to be applied as the combinational computation in this system. It will be appreciated that in other 20 systems the states may not be simple binary values. For example, depending upon the system, the states may need to represent a percentage of an optimum state or even a probability value to properly assess the capabilities of the system. In such cases, Boolean algebra could clearly not apply and some other appropriate form of combinational computation would need to be applied. It is 25 expected that the selection and formulation of an appropriate combinational computation would be apparent to the person skilled in the art having regard to the particular system and capabilities to which the CMA is to be applied. For example, in a system where the states represent a probability (e.g. failure probability) the appropriate combinational computation may be statistical 30 manipulation. In other systems where the states represent production, for example, the capability state may be dependent upon the maximum or minimum states of the set(s) which produce the capability, hence, a threshold comparison may be the appropriate form of combinational computation.

WO 2006/125243 PCT/AU2005/000735 7 In Figs. 3-8, ovals represent components and capabilities, and square boxes represent sets. In Fig. 3, there is modelled an example of one particular recipe for making Creme Fraiche, the Larousse Creme Fraiche recipe. In this recipe, there are two 5 ingredients, cream and yoghurt, which equate to components. The Larousse recipe itself requires a particular combination of the ingredients; hence, this particular recipe equates to a set of the components. The Larousse recipe produces Creme Fraiche; hence, Creme Fraiche equates to the capability of the set. 10 There are other recipes known for making Creme Fraiche. These other recipes have either different ingredients or different measurements of the same ingredients. Fig. 4 models the capability of producing Creme Fraiche in accordance with four alternative recipes (sets). Creme Fraiche itself is able to be used as an ingredient for other recipes, 15 for example, Cream of Celery Soup. An example of this recipe is modelled in Fig. 5. Creme Fraiche, which was previously a capability, is now an ingredient. In terms of the ORM model, this makes no difference as capabilities and components are treated as the same. The Cream of Celery Soup recipe (set) 20 produces two possible capabilities, ie the specific "Cream of Celery Soup" or the generic "Soup". One of the other ingredients for Cream of Celery Soup is milk. Milk was also an ingredient for one of the Creme Fraiche recipes. If, for example, milk was not available (inactive state) then Creme Fraiche (capability) could still be made 25 from one of the alternative recipes (sets). However, Cream of Celery Soup (capability) could not be made as the Cream of Celery Soup recipe (set) specifically requires milk as an ingredient (component). Cream of Celery Soup can be one of many courses in a dinner plan. Fig. 6 models a particular dinner plan called a French Banquet. Fig. 7 models a more 30 generic dinner plan. Fig. 8 shows all of figs. 3-7 combined to form a complex system model. This model can be used to determine which recipes can or cannot be cooked. The model can also be used in reverse to identify the ingredients needed for a WO 2006/125243 PCT/AU2005/000735 8 recipe and whether or not those ingredients are available. For example, a user may realise that if he obtained some eggs then he would be able to make Cream of Celery Soup, since he has all the remaining ingredients. Before the CMA can be processed, the states of all the components, sets 5 and capabilities must be initially established. In the dinner example, the states of all the components would be known, ie they are available (active) or unavailable (inactive). A tabular example of the dinner components follows: Component State Almonds Active Barley Active Bay Leaf Active Biscottes Active Bouquet Garri Active Bread Active Brown Food Colour Active Butter Active Carrot Active Celery Active Chervil Active Chicken Active Cognac Active Consomme Tin Active Crayfish Active Cream Active Cucumbers Active Eggs Active Fennel Active Fish Active Flour Active French Beans Active Garlic Active WO 2006/125243 PCT/AU2005/000735 9 Leeks Active Long Grain Rice Active Madeira Active Marjoram Active Milk Active Mushrooms Active Mussels Active Olive Oil Active Onion Active Orange Active Parsley Active Peas Active Pepper Active Pig Active Potatoes Active Red Food Colour Active Saffron Active Salt Active Shallot Active Stock Active Thyme Active Tomato Paste Active Tomatoes Active Turnips Active Veal Active Water Active White Beans Active White Wine Active Wine Vinegar Active Yoghurt Active WO 2006/125243 PCT/AU2005/000735 10 A tabular example of the applicable sets follows. Initially all the set states are inactive by default. Set Component/Capability of Set Set State Bought Consumme Consumme Tin Inactive Chicken Bits Chicken Inactive Fish Bits Fish Inactive Lach Consumme Leek Brown Food Colour Inactive Carrot Eggs Leeks Madeira Parsley Pepper Red Food Colour Salt Stock Water Lach Consomme Onion Brown Food Colour Inactive Carrot Eggs Madeira Onion Parsley Pepper Red Food Colour Salt Stock Water Lach Creme Fraiche Cream Inactive Yoghurt Lach Creme Fraiche - Low Fat Cream Inactive WO 2006/125243 PCT/AU2005/000735 11 Milk Yoghurt Lach Creme Fraiche - Sour Cream Cream Inactive Sour Cream Larousse Bouillabaisse Bay Leaf Inactive Bread Fennel Fish Flour Garlic Mussels Olive Oil Onion Orange Parsley Pepper Saffron Salt Tomatoes Larousse Breton Bouillabaisse Bay Leaf Inactive Bread Butter Chervil Fennel Fish Marjoram Onion Parsley Pepper Potatoes Salt Thyme Larousse Chicken Consomme with Almonds Inactive WO 2006/125243 PCT/AU2005/000735 12 Almonds Biscottes Chicken Chicken Consomme Eggs Larousse Crayfish Bisque Bay Leaf Inactive Butter Carrot Chicken Consomme Cognac Crayfish Fish Fumet Fish Stuffing Long Grain Rice Onion Parsley Pepper Salt Thyme White Wine Larousse Crayfish Butter Bouquet Garni Inactive Butter Cognac Crayfish Fish Fumet Mirepoix Pepper Salt Tomato Paste White Wine Larousse Cream of Barley Soup Barley Inactive with Crayfish Butter Celery Crayfish Butter Creme Fraiche WO 2006/125243 PCT/AU2005/000735 13 Eggs Forcemeat Salt White stock Larousse Cream of Celery Soup Bread Inactive Butter Celery Creme Fraiche Eggs Milk Potatoes Salt Water Larousse Cream of Cucumber Butter Inactive Soup Creme Fraiche Cucumbers Flour Pepper Potatoes Salt Larousse Cream of White Bean Butter Inactive Soup with Young Vegetables Carrot Chervil Creme Fraiche Eggs French Beans Milk Parsley Peas Salt Turnips White Beans Larousse Creme Fraiche Cream Inactive WO 2006/125243 PCT/AU2005/000735 14 Yoghurt Larousse Fish Fumet Butter Inactive Fish Bones Fish Heads Mushroom Trimmings Onion Parsley Salt Shallot Thyme White Wine Larousse Forcemeat Stuffing Butter Inactive Breast Chicken Eggs Flour Pepper Salt Larousse Forcemeat Stuffing Veal Butter Inactive Fillet Eggs Flour Pepper Salt Veal Larousse Mirepoix Bay Leaf Inactive Carrot Onion Pork Belly Thyme White Wine Larousse White Stock Bouquet Garni Inactive Carrot Celery Chicken Carcass WO 2006/125243 PCT/AU2005/000735 15 Chicken Giblets Leeks Onion Salt Veal Water Mushroom Bits Mushrooms Inactive Pig Bits Pig Inactive A tabular example of the applicable capabilities follows. Initially all the capability states are inactive by default. Capability Set(s) Producing Capability Capability State Bouillabaisse Larousse Bouillabaisse Inactive Breton Bouillabaisse Larousse Breton Bouillabaisse Inactive Chicken Breast Fillet Chicken Bits Inactive Chicken Carcass Chicken Bits Inactive Chicken Consomme Bought Consomme Inactive Lach Consomme Chicken Consomme with Larousse Chicken Consomme with Inactive Almonds Almonds Chicken Drumsticks Chicken Bits Inactive Chicken Giblets Chicken Bits Inactive Chicken Neck Chicken Bits Inactive Chicken Wings Chicken Bits Inactive Crayfish Bisque Larousse Crayfish Bisque Inactive Crayfish Butter Larousse Crayfish Butter Inactive Cream of Barley Soup Larousse Cream of Barley Soup with Inactive with Crayfish Butter Crayfish Butter Cream of Celery Soup Larousse Cream of Celery Soup Inactive Cream of Cucumber Larousse Cream of Cucumber Soup Inactive WO 2006/125243 PCT/AU2005/000735 16 Soup Cream of White Bean Larousse Cream of White Bean Soup Inactive Soup with Young with Young Vegetables Vegetables Creme Fraiche Larousse Creme Fraiche Inactive Lach Creme Fraiche Lach Creme Fraiche - Low Fat Lach Creme Fraiche - Sour Cream Fish Fumet Larousse Fish Fumet Inactive Fish Stuffing Larousse Forcemeat Stuffing Breast Inactive Larousse Forcemeat Stuffing Veal Forcemeat Larousse Forcemeat Stuffing Breast Inactive Larousse Forcemeat Stuffing Veal Mirepoix Larousse Mirepoix Inactive Pork Belly Pig Bits Inactive White Stock Larousse White Stock Inactive Fish Bones Fish Bits Inactive Fish Heads Fish Bits Inactive Mushroom trimmings Mushroom Bits Inactive The following is a pseudo code which performs the CMA processing. The code iterates through the component to set lists and the set to capability lists recursively until such time that no states change. 5 continue-flag = true do while continue-flag continueflag = false for each element in Set 10 setresult = true for each matching component in the Set get component state from component list setresult = (setresult AND component state) next component WO 2006/125243 PCT/AU2005/000735 17 if set-result <> Set.State continue-flag = true Set.State = set-result End if 5 next set element for each capability in capability list capability-result = false get capability state from component list 10 for each matching set in the capability list get Set.State from set list capability-result = (capability-result OR Set.State) next set if capability-result <> capability state 15 continue-flag = true capability state = capability-result end if next capability end 20 The first part of the code processes the sets. As an illustrative example there follows the code execution for the set "Larousse Creme Fraiche" with all ingredients (components) active or true. The first time through the loop component = Cream. 25 Looking up Cream in the list we get the State = True. The setresult is logically Anded with the component state, ie True and True = True. This result is placed in setresult. The second time through the loop component = Yoghurt. Looking up Yoghurt in the list we get the state = True. 30 The setresult is logically Anded with the component state, is True and True = True. This result is placed in setresult. There are no more matching components for this set so the loop ends.

WO 2006/125243 PCT/AU2005/000735 18 The setresult, which is True, does not equal the existing set.state, which is False (or inactive). Therefore the continueflag is set to True indicating a change of state has occurred during a processing run. The set.state is set to the setresult, ie True. Thus the set state for Larousse Creme Fraiche is set as 5 active. As an illustrative comparison there follows the code execution for the set "Larousse Creme Fraiche" with one of the ingredients (components) Cream inactive or False. The first time through the loop component = Cream. 10 Looking up Cream in the list we get the State = False. The setresult is logically Anded with the component state, ie True and False = False. This result is placed in setresult. The second time through the loop component = Yoghurt. Looking up Yoghurt in the list we get the state = True. 15 The setresult is logically Anded with the component state, is False and True = False. This result is placed in setresult. There are no more matching components for this set so the loop ends. The setresult, which is False, does equal the existing set.state, which is False (or inactive). Therefore the continue-flag remains as False indicating that 20 no change of state has occurred during a processing run. The set.state is set to the setresult, ie False. Thus the set state for Larousse Creme Fraiche is set remains inactive. The second part of the code processes the capabilities. As an illustrative example there follows the code execution for the capability Creme Fraiche with all 25 sets (recipes) active or True. The capability state is stored in the component list for this capability and is by default set to inactive or false. The first matching set for Creme Fraiche is the Larousse Creme Fraiche. The set state is True. 30 The capability _result is logically ORed with the set state. The result of this will be a True due to the set state. The code will then run through the next matching sets (Lach Creme Fraiche, Lach Creme Fraiche Low Fat and Lach Creme Fraiche Sour Cream) in WO 2006/125243 PCT/AU2005/000735 19 turn. These all have True set states hence the capability-result in each case will remain True. Once all four sets for this capability have been processed then the loop ends. 5 If, at the end of the loop, the capability result had changed from that initially stored, then the continue-flag would be set as True to indicate that further processing is needed. The above pseudo code essentially results in providing the states of capabilities in the system. However, the code may be adapted to provide some 10 additional useful data. For example, in cases where a capability results in an active state, the sets which provide the active state could be identified to the CMA user. Furthermore, in cases where a capability results in an inactive state, the code may provide the means to back chain the CMA to identify the sets or components which caused the inactive capability. 15 An alternative means of implementing the above processing is to use a forward chaining inference engine, eg CLIPS engine. Each set and component attached to a set are transformed into a rule which requires each component to be active before the rule is activated. On activation, the rule creates a fact that the set is active. 20 As the system, and hence the ORM model, increase in complexity, the implementation of the CMA by a forward chaining inference engine can be more susceptible to typographical, semantic and programmatic errors. In such cases, it has been found to be preferable to utilise an automated parser, using a database, which can generate rules by transforming the relationships described in the data. 25 The data is easier to view and check when stored in a database as it can be sorted and queries can be created to check that the model is semantically correct. Furthermore, editing is easier and the database can be used to provide configuration management of the data. As an illustrative example, consider the set Larousse Forcemeat Stuffing 30 Breast. An appropriate rule would be: (default setlarousseforcemeatstuffingbreast (component butter active) WO 2006/125243 PCT/AU2005/000735 20 (component chicken active) (component eggs active) (component flour active) (component pepper active) 5 (component salt active) (assert (set Larousseforcemeatstuffing-breast active)) Each capability and each set that can provide that capability generate a 10 rule, which triggers when the set is active and the capability is not active. On activation, the rule creates a fact that the capability is active. As an illustrative example, consider the capability Forcemeat. An appropriate rule would be: 15 (default cap-larousse forcemeatstuffing-breast (set larousseforcemeatstuffing-breast active) (not (component forcemeat active)) (assert (component forcemeat active)) 20 (default cap-larousse forcemeatstuffing-veal (set larousseforcemeatstuffing-veal active) (not (component forcemeat active)) 25 (assert (component forcemeat active)) The inference engine approach is beneficial in terms of providing faster processing of capabilities in a CMA. However, the forward chaining inference engine does not, by itself, support the facility of back chaining, which, as indicated 30 before, could source the problems with failed capabilities. It is therefore preferable to incorporate a back chaining model into this implementation. The back chain model can be built by using the same data stored in the database used to create the ORM model.

WO 2006/125243 PCT/AU2005/000735 21 One approach for implementing the back chain model is to make a node structure from the data. A node list of the components/capabilities is created. Each node is a structure containing textual, type and other information. In the case of capabilities, the structure contains a list of pointers to the sets attached to 5 the capability. The sets themselves are stored in a node list. Each node in the set node list contains textual and again a list of pointers to component/capability elements making up the set. The node list is only needed in the backward direction from capability to components and, hence, is the reference to back chaining. 10 An alternative approach for implementing the back chaining model is similar to the above approach, however, using XML. The components/capabilities are stored in XML nodes. Sets too are stored in XML nodes. Each capability XML node contains a list of the set XML nodes that make up the capability. Each set XML node contains a list of component/capability 15 XML nodes that make up the set. The XML file is then interpreted into a Document Object Model (DOM), an internal representation of an. XML structure, which allows the structure to be interacted with. As discussed before, depending upon the system in question, the states 20 may include representations of different types of information and as a result the combinational computation can be different. There follows two examples to illustrate this point. Using Logistics as an example, each component of a system can be calculated as having failure probabilities. Examples of such probabilities may be 25 figures representing Mean Time Between Failure (MTBF) or Mean Time To Repair (MTTR). Logistics engineers use these figures along with spares holdings to calculate availability figures for equipment over a mission period. For example, based upon known failure rates, one can hold 5 spares and maintain 95% operational time over 3 months. 30 The CMA can be use to combine the individual component availability figure (or conversely the chance of failure) to provide a figure showing the availability of a capability. While the logistics engineer can do this calculation, the WO 2006/125243 PCT/AU2005/000735 22 CMA model can continually recalculate and reassess the calculation based upon actual data as it is happening. As an example, consider a computer network, having 3 computers and a printer, which can be connected by a switch to form a system. The following table 5 lists the probabilities of failure for each of the components over a year. Equipment (Component) Failure Probability (State) Computer A 0.11 Computer B 0.05 Computer C 0.45 Printer 0.24 Switch 0.13 In the CMA, these equipment items could be included in a set which requires all elements to be available. The probability that the set will be available 10 can be calculated by combining the probabilities of each component and subtracting the probability of both occurrences. This can be calculated as a single equation or by combining the components one by one. The following equations illustrate the latter. 15 X1 = P(Computer A) + P(Computer B) - P(Computer A).P(Computer B) 0.11 + 0.05 - (0.11).(0.05) 0.1545 X2 = P(Computer C) + X1 - P(Computer C).X1 20 0.45 + 0.1545 - (0.45).(0.1545) 0.534975 X3 = P(Printer) + X2 - P(Printer).X2 0.24 + 0.534975 - (0.24).(0.534975) 25 0.646681 P(Set) = P(Switch) + X3 - P(Switch).X3 WO 2006/125243 PCT/AU2005/000735 23 0.13 + 0.646681 - (0.13).(0.646681) 0.6926254 Therefore, there is a 69.2554% chance of the set failing during the period. 5 Consider that now the set can provide a capability as a backup call centre and that there exists another centre (set) with a similarly calculated failure probability of 0.546 chance of failure. The failure probability of this capability could now be defined as the probability that either one centre (set) is available. This can be calculated by 10 multiplication of the set probabilities, giving a 35.3% chance that a backup centre will not be available. The CMA could be used to combine production levels to combined capability production levels, in certain systems. For example, consider an electrical generator complex having a number of generators. The generators can 15 be used in different combinations depending upon demand, maintenance routines and cooling off times. In this context, a mode of operations may be achieved by using generators 1, 2 and 3. Each generator may produce 100MW of power, providing a total power of 300MW. Hotel services may require 250 MW of power. Consider that power for the 20 hotel services may provided by the above three generators, a fourth generator which can produce 280MW, or a fifth generator which can produce 260MW. In this case, the capability can show that a minimum of 260MW can be achieved if all the different power sources are available. While the present invention has been described with reference to specific 25 preferred embodiments, it will be appreciated that various modifications and changes 6ould be made to this embodiment without departing from the scope of the invention.

Claims (20)

1. A system mapping architecture for processing and mapping operating capabilities of a system based upon an interrelationship model, said model including: 5 a plurality of objects, each object representing a component of said system or a capability of at least part of said system, wherein each object has a current state; and a plurality of sets, each set having at least one associated object and each set having a current state, wherein the current state of a set is determined by the 10 current state(s) of the object(s) associated with the set; wherein each object, which represents a capability of at least part of said system, has at least one associated set; the current state of an object, which represents a capability of at least a part of said system, being determined by the current state(s) of the associated set(s); 15 wherein each of said plurality of objects and each of said plurality of sets are recursively processed to determine the current state of each object and each set until the current state of each object and each set achieves a fixed state.

2. The system mapping architecture according to claim 1, wherein for each object, which represents a capability of at least part of a system, that achieves an 20 active fixed state, the associated set(s) which provide the active fixed state are identified.

3. The system mapping architecture according to claim 1 or 2, wherein for any given object, which represents a capability of at least part of said system, the architecture can be back chained to identify any or all objects and/or sets to which 25 the given object is dependent.

4. The system mapping architecture according to any one of the preceding claims, wherein each of said plurality of objects and each of said plurality of sets are recursively processed according to rules implemented by an inference engine. WO 2006/125243 PCT/AU2005/000735 25

5. The system mapping architecture according to claim 4, wherein the inference engine is a forward and/or backward chaining inference engine.

6. The system mapping architecture according to any one of the preceding claims, wherein the interrelationship model is implemented in a relational 5 database.

7. The system mapping architecture according to any one of claims 1 to 5, wherein the interrelationship model is implemented in a rule-based structure.

8. The system mapping architecture according to claim 7, wherein said rule based structure is an expert system. 10

9. The system mapping architecture according to any one of the preceding claims, wherein said interrelationship model is an Object-Role Modelling (ORM) model.

10. A computer programmed to provide a system mapping architecture according to any one of claims 1 to 9. 15

11. A software package providing a system mapping architecture according to any one of claims 1 to 9.

12. A method for providing a system mapping architecture for determining capabilities of a system, said method including the steps of: creating an interrelationship model, said model including: 20 a plurality of objects, each object representing a component of said system or a capability of at least part of said system, wherein each object has a current state; and a plurality of sets, each set having at least one associated object and each set having a current state, wherein the current state of a set is determined by the 25 current state(s) of the object(s) associated with the set; wherein each object, which represents a capability of at least part of said system, has at least one associated set; the current state of an object, which WO 2006/125243 PCT/AU2005/000735 26 represents a capability of at least a part of said system, being determined by the current state(s) of the associated set(s); processing each of said plurality of objects and each of said plurality of sets are to determine the current state of each object and each set; and 5 repeating said processing step until the current state of each object and each set achieves a fixed state.

13. The method according to claim 12, wherein for each object, which represents a capability.of at least part of a system, that achieves an active fixed state, identifying the associated set(s) which provide the active fixed state. 10

14. The method according to claim 12 or 13, wherein for any given object, which represents a capability of at least part of said system, back chaining the architecture to identify any or all objects and/or sets to which the given object is dependent.

15. The method according to any one of claims 12 to 14, wherein said 15 processing proceeds according to rules implemented by an inference engine.

16. The method according to claim 15, wherein the inference engine is a forward chaining inference engine.

17. The method according to any one of claims 12 to 16, further including the step of implementing said interrelationship model in a relational database. 20

18. The method according to any one of claims 12 to 16, further including the step of implementing said interrelationship model in a rule-based structure.

19. The method according to claim 18, wherein said rule-based structure is an expert system.

20. The method according to any one of claims 12 to 19, wherein said 25 interrelationship model is an Object-Role Modelling (ORM) model.