tobast/L3-internship-report
1
0
Fork 0
Code Issues Pull requests Releases Wiki Activity

Testing git

Browse source
This commit is contained in:
Théophile Bastian 2016-07-18 13:18:58 +01:00
parent a7af481447
commit e5fcffe586
1 changed files with 5 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

5
report.tex
View file

@ -162,6 +162,11 @@ This implementation aims to provide
The implementation aims to stay as close as possible to the mathematical model, The implementation aims to stay as close as possible to the mathematical model,
while still providing quite efficient operations. 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} \bibliography{biblio}