Testing git

report.tex

@@ -162,6 +162,11 @@ This implementation aims to provide
 The implementation aims to stay as close as possible to the mathematical model,
 while still providing quite efficient operations.
 
+As we do not handle non-determinism, an event structure can be easily
+represented as a DAG in memory. The actual representation that was chosen is a
+set of nodes, each containing (as well as a few other information) a list of
+incoming and outgoing edges.
+
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%
 
 \bibliography{biblio}