Add fault tree structure based on Jarik's AttackTree

analysis/FaultTree/BasicEvent.java

+package FaultTree;
+
+import java.util.ArrayList;
+
+public class BasicEvent implements FaultTree {
+    public int ID;
+    public String name;
+    public int order;
+
+    private ArrayList<IntermediateEvent> parents;
+
+    public BasicEvent(int ID, String name, int order) {
+        this.ID = ID;
+        this.name = name;
+        this.order = order;
+        this.parents = new ArrayList<>();
+    }
+
+    /**
+     * Get name of the Leaf
+     * @return name of the leaf
+     */
+    public String getName() {
+        return "\"" + name + "-" + ID + "\"";
+    }
+
+    /**
+     * Get ID of the Leaf
+     * @return ID of the Leaf
+     */
+    public int getID() {
+        return ID;
+    }
+
+    /**
+     * Get unique name for the Leaf
+     * @return unique name for the Leaf
+     */
+    public String getUniqueName() {
+        return "\"" + name + "-" + ID + "\"";
+    }
+
+    /**
+     * Add parent to the Leaf.
+     * @param parent parent of the leaf
+     */
+    public void addParent(IntermediateEvent parent) {
+        this.parents.add(parent);
+    }
+
+    /**
+     * Get parents of the Leaf
+     * @return parents of th eLeaf
+     */
+    public ArrayList<IntermediateEvent> getParents() {
+        return parents;
+    }
+
+    public int getOrder() {
+        return order;
+    }
+
+    public void setOrder(int order) {
+        this.order = order;
+    }
+
+    /**
+     * Create a copy of the Leaf
+     * @return copy of the Leaf
+     */
+    public FaultTree copy() {
+        return new BasicEvent(ID, name, order);
+    }
+}

analysis/FaultTree/FaultTree.java

+package FaultTree;
+
+import java.util.ArrayList;
+
+public interface FaultTree {
+    int getID();
+    String getName();
+    String getUniqueName();
+    void addParent(IntermediateEvent parent);
+    ArrayList<IntermediateEvent> getParents();
+    FaultTree copy();
+}

analysis/FaultTree/IntermediateEvent.java

+package FaultTree;
+
+import java.util.ArrayList;
+
+public class IntermediateEvent implements FaultTree {
+    public int ID;
+    public Type type;
+    public String name;
+    public FaultTree left;
+    public FaultTree right;
+
+    private ArrayList<IntermediateEvent> parents;
+
+    public IntermediateEvent(int ID, String name, Type type, FaultTree left, FaultTree right) {
+        this.ID = ID;
+        this.name = name;
+        this.type = type;
+
+        this.left = left;
+        this.left.addParent(this);
+
+        this.right = right;
+        this.right.addParent(this);
+
+        this.parents = new ArrayList<>();
+    }
+
+    /**
+     * Get a name of the IntermediateEvent
+     * @return name of the IntermediateEvent
+     */
+    public String getName() {
+        return "\"" + name + "-" + type + "\"";
+    }
+
+    /**
+     * Get a unique name for the IntermediateEvent including ID
+     * @return unique name of the IntermediateEvent
+     */
+    public String getUniqueName() {
+        return "\"" + name + "-" + type + "-" + ID + "\"";
+    }
+
+    /**
+     * Get the ID of the IntermediateEvent
+     * @return ID of the IntermediateEvent
+     */
+    public int getID() {
+        return ID;
+    }
+
+    /**
+     * Get parents of the IntermediateEvent
+     * @return list of parents of the IntermediateEvent
+     */
+    public ArrayList<IntermediateEvent> getParents() {
+        return parents;
+    }
+
+    /**
+     * Add a parent to the IntermediateEvent. Used in construction.
+     * @param parent, parent to add
+     */
+    public void addParent(IntermediateEvent parent) {
+        this.parents.add(parent);
+    }
+
+    /**
+     * Creates a copy of the IntermediateEvent
+     * @return copy of the IntermediateEvent
+     */
+    public FaultTree copy() {
+        return new IntermediateEvent(ID, name, type, left.copy(), right.copy());
+    }
+}

analysis/FaultTree/Type.java

+package FaultTree;
+
+public enum Type {
+    Or,
+    And
+}