diff --git a/.gitignore b/.gitignore
new file mode 100644
index 0000000..ae3c172
--- /dev/null
+++ b/.gitignore
@@ -0,0 +1 @@
+/bin/
diff --git a/AlgebraicDataflowArchitectureModel/src/algorithm/DerivingStorageResources.java b/AlgebraicDataflowArchitectureModel/src/algorithm/DerivingStorageResources.java
new file mode 100644
index 0000000..70f2248
--- /dev/null
+++ b/AlgebraicDataflowArchitectureModel/src/algorithm/DerivingStorageResources.java
@@ -0,0 +1,5 @@
+package algorithm;
+
+public class DerivingStorageResources {
+
+}
diff --git a/AlgebraicDataflowArchitectureModel/src/algorithm/GraphGenerate.java b/AlgebraicDataflowArchitectureModel/src/algorithm/GraphGenerate.java
new file mode 100644
index 0000000..d3a27cb
--- /dev/null
+++ b/AlgebraicDataflowArchitectureModel/src/algorithm/GraphGenerate.java
@@ -0,0 +1,5 @@
+package algorithm;
+
+public class GraphGenerate {
+
+}
diff --git a/AlgebraicDataflowArchitectureModel/src/algorithm/UpdateConflictCheck.java b/AlgebraicDataflowArchitectureModel/src/algorithm/UpdateConflictCheck.java
new file mode 100644
index 0000000..014b2a4
--- /dev/null
+++ b/AlgebraicDataflowArchitectureModel/src/algorithm/UpdateConflictCheck.java
@@ -0,0 +1,24 @@
+package algorithm;
+
+import models.*;
+import models.dataFlowModel.DataFlowModel;
+
+public class UpdateConflictCheck {
+	DataFlowModel graph = new DataFlowModel();
+
+	void setup(DataFlowModel graph) {
+		this.graph = graph;
+	}
+
+	boolean check() {
+		boolean result = false;
+		for (Node node : graph.getResourceDependencyGraph().getNodes()) {
+			if (node.getInEdges().size() > 1)
+				result = true;
+		}
+		for (Node node : graph.getResourceDependencyGraph().getNodes()) {
+			
+		}
+		return result;
+	}
+}