SYSTEM AND METHOD FOR MODELING AND ANALYZING COMPLEX SCENARIOS
First Claim
Patent Images
1. A method of possibility tree analysis, the method comprising:
- constructing a possibility tree having a plurality of nodes, wherein at least one said node being a logic gate node, and populating said at least one logic gate node with two or more options;
solving said possibility tree, where said solving is performed by a solver module executed by a processor element, and where said solving includes;
tracking the state of at least a variable through a branch,disabling remaining nodes of said branch during the execution of said branch when a said variable of said branch meets a user defined condition,marking said branch as an invalid solution when said variable of said branch meets said user defined condition,repeating said tracking and disabling steps for a plurality of branches, andaggregating and displaying completed branches as valid tree solutions.
3 Assignments
0 Petitions
Accused Products
Abstract
An embodiment of the present invention includes a method for analyzing and solving possibility tree. A possibility tree having a plurality of programmable nodes is constructed and solved with a solver module executed by a processor element. The solver module executes the programming of said nodes, and tracks the state of at least a variable through a branch. When a variable of said branch is out of tolerance with a parameter, the solver disables remaining nodes of the branch and marks the branch as an invalid solution. The valid solutions are then aggregated and displayed as valid tree solutions.
4 Citations
20 Claims
-
1. A method of possibility tree analysis, the method comprising:
-
constructing a possibility tree having a plurality of nodes, wherein at least one said node being a logic gate node, and populating said at least one logic gate node with two or more options; solving said possibility tree, where said solving is performed by a solver module executed by a processor element, and where said solving includes; tracking the state of at least a variable through a branch, disabling remaining nodes of said branch during the execution of said branch when a said variable of said branch meets a user defined condition, marking said branch as an invalid solution when said variable of said branch meets said user defined condition, repeating said tracking and disabling steps for a plurality of branches, and aggregating and displaying completed branches as valid tree solutions. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A method of creating a dynamic possibility tree, the method comprising:
-
constructing a possibility tree having a plurality of nodes, wherein at least one said node being a logic gate node, and populating said at least one logic gate node with options; programming at least a said node to disable remaining nodes of a branch during the execution of said branch when a variable meets a user defined condition, and marking said branch having disabled nodes as an invalid solution; solving said possibility tree, where said solving is performed by a solver module executed by a processor element; and
;aggregating and displaying remaining valid branches as branch solutions. - View Dependent Claims (11, 12, 13, 14, 15, 16)
-
-
17. A method of possibility tree analysis, the method comprising:
-
constructing a possibility tree having a plurality of nodes, wherein at least one said node being programmable, and populating said at least a programmable node with at least a variable; programming at least a said programmable node with instructions for utilizing said at least a variable during the execution of said possibility tree; solving said possibility tree, where said solving is performed by a solver module executed by a processor element, and where said solving includes; tracking a path state dictionary of variables specific to a path of said possibility tree along said path, where a said programmable node is operable to create and add a variable to said path state dictionary, and is operable to modify the state of an existing said variable in said path state dictionary, comparing at least a said variable to a user defined condition as instructed within the programming of a said programmable node, disabling remaining nodes of said path during the execution of said path and marking said path as an invalid solution when a said variable of said path meets a user defined condition, repeating said tracking, comparing and disabling steps for a plurality of paths, and aggregating and displaying completed paths as valid tree solutions. - View Dependent Claims (18, 19, 20)
-
Specification