diff --git a/README.html b/README.html
index abfcd956b2ebdcbad1d9b81087916e31b4421d36..627b87f7dadf9c0b3444afe7eac2fc23f4fc0c33 100644
--- a/README.html
+++ b/README.html
@@ -9,6 +9,7 @@
 </head>
 <body>
 <h1 id="artifacts-for-continuous-model-validation-using-reference-attribute-grammars">Artifacts for &quot;Continuous Model Validation Using Reference Attribute Grammars&quot;</h1>
+<p><em>Note: please use the HTML version of this README.</em></p>
 <h3 id="authors">Authors</h3>
 <ul>
 <li>Johannes Mey <a href="mailto:johannes.mey@tu-dresden.de">johannes.mey@tu-dresden.de</a></li>
@@ -22,16 +23,16 @@
 <li>Uwe Aßmann <a href="mailto:uwe.assmann@tu-dresden.de">uwe.assmann@tu-dresden.de</a></li>
 </ul>
 <h3 id="introduction">Introduction</h3>
-<p>The paper discusses the utilization of reference attribute grammars (RAGs) for model validation and presents two specific contributions. First, the differences between models and trees specified by reference attribute grammars, specifically non-containment references, are discussed and a manual, yet optimised method to efficiently overcome these differences is presented. Secondly, an extension of RAG grammar specifications is proposed to model noncontainment references automatically. The proposed modelling techniques are compared to state-of-the-art modelling tools utilizing a benchmarking framwork for continuous model validation, the <em>Train Benchmark</em>.</p>
+<p>The paper discusses the utilization of reference attribute grammars (RAGs) for model validation and presents two specific contributions. First, the differences between models and trees specified by reference attribute grammars, specifically non-containment references, are discussed and a manual, yet optimised method to efficiently overcome these differences is presented. Secondly, an extension of RAG grammar specifications is proposed to model non-containment references automatically. The proposed modelling techniques are compared to state-of-the-art modelling tools utilizing a benchmarking framework for continuous model validation, the <em>Train Benchmark</em>.</p>
 <h3 id="structure-of-the-supplementary-artifacts">Structure of the Supplementary Artifacts</h3>
 <p>The artifacts are structured in three parts:</p>
 <ul>
-<li>Full collection of all measurement data and diagrams mentioned in the paper</li>
+<li>A standalone example of the non-containment references preprocessor</li>
 <li>Benchmark code to reproduce the measurements, including all relevant source codes</li>
-<li>A standalone example of non-containment references preprocessor</li>
+<li>Full collection of all measurement data and diagrams mentioned in the paper</li>
 </ul>
 <h3 id="general-remarks-on-the-presented-listings-and-measurements">General Remarks on the presented Listings and Measurements</h3>
-<p>For reasons of readability and simplicity, there are some minor differences in naming in the source codes and the measured resuting data. Most importantly, the names of the three presented JastAdd implementation variants are different in the code and the diagrams.</p>
+<p>For reasons of readability and simplicity, there are some minor differences in naming in the source codes and the measured resulting data. Most importantly, the names of the three presented JastAdd implementation variants are different in the code and the diagrams.</p>
 <p>The following table shows the relation of the terminology used in the paper and in the code.</p>
 <table>
 <colgroup>
@@ -65,7 +66,7 @@
 </tbody>
 </table>
 <h2 id="the-grammar-extension-preprocessor-relast">The Grammar Extension Preprocessor <code>RelAst</code></h2>
-<p>To transform the grammar extension we provide a preprocessor for JastAdd This preprocessor including its source code is provided in the <code>preprocessor</code> subdirectory.</p>
+<p>To transform the grammar extension we provide a preprocessor for JastAdd. This preprocessor including its source code is provided in the <code>preprocessor</code> subdirectory.</p>
 <p>Its usage is: - Run preprocessor on train benchmark (output written to standard output):<br />
 - <code>cat examples/TrainBenchmark.relast</code> - <code>java -jar relast-compiler.jar examples/TrainBenchmark.relast</code></p>
 <ul>
@@ -89,11 +90,11 @@
 <li><strong>Input Data:</strong> There are two types of input data used in the benchmark, the <code>inject</code> and the <code>repair</code> data set. The former contains <em>valid</em> models, i.e., models, which do not contain any of the faults that are supposed to be found by the presented queries. The latter, <code>repair</code>, contains models already containing faults.</li>
 <li><strong>Queries:</strong> The queries are used to find the aforementioned faults. For each fault, there are two queries: <em>repair</em>, to find the fault, and <em>inject</em>, to find places where a fault can be injected.</li>
 <li><strong>Transformations:</strong> The transformations performed by the benchmark are, again, two sets: <em>inject</em> and <em>repair</em> transformations.</li>
-<li><strong>Transformation Strategies:</strong> The benchmark does not perform the operation on all matches. The strategy <em>fixed</em> performs the transformation on a given number of matches, while the <em>proportional</em> strategy performes them on a given percentage of all matches.</li>
+<li><strong>Transformation Strategies:</strong> The benchmark does not perform the operation on all matches. The strategy <em>fixed</em> performs the transformation on a given number of matches, while the <em>proportional</em> strategy performs them on a given percentage of all matches.</li>
 </ol>
 <p>These settings are defined in a <em>benchmark scenario</em>, which can be edited before running the benchmark.</p>
 <h3 id="measurement-data">Measurement Data</h3>
-<p>The result data are stored in the directory <a href="paper-results/" class="uri">paper-results/</a>. This directory contains two subdirectories</p>
+<p>The result data is stored in the directory <a href="paper-results/" class="uri">paper-results/</a>. This directory contains two subdirectories:</p>
 <ul>
 <li><a href="paper-results/measurements">measurements</a> contains two directories. The <a href="paper-results/measurements/inject">inject</a> subdirectory contains the measurements for the <em>inject</em> scenario, which is also included in <a href="paper-results/measurements/inject/BenchmarkScript.groovy">inject/BenchmarkScript.groovy</a>. The <a href="paper-results/measurements/repair">repair</a> subdirectory contains the same data for the <em>repair</em> scenario in <a href="paper-results/measurements/repair/BenchmarkScript.groovy">repair/BenchmarkScript.groovy</a>. Both directories contain files with time measurement data (starting with <code>times</code>) and the numbers of matches (starting with <code>matches</code>). Each file name contains information on the tool used, the query, and the size of the model.</li>
 <li><a href="paper-results/diagrams">diagrams</a> contains the same subdirectories, both containing diagrams with the respective measurements. The diagrams are generated from the same data as in the paper, but enlarged for better readability. In particular, the six diagrams presented in the paper are
@@ -109,8 +110,8 @@
 <p><strong>Please Note:</strong> The measurements were conducted using a timeout for the whole run. If a run was not completed, no individual times of the steps appear in the measurements and diagrams. Thus, some tools do not have measurements for all problem sizes.</p>
 <h3 id="the-source-code">The Source Code</h3>
 <p>For this publication, we tried to modify the source code of the benchmark itself as little as possible. Therefore, unfortunately, the code base is rather large and confusing. The following section tries to point to the parts relevant for this paper.</p>
-<p>The benchmark is structures in modules, some of which form the code of the benchmark, some are provided by the contesting tools, and some are related to required model serializations. There are some naming conventions: - Tool-related modules are in directories starting with <code>trainbenchmark-tool</code>. - Model serialization-related modules start with <code>trainbenchmark-generator</code>. - All other modules are core modules of the bechmark.</p>
-<p>Since the JastAdd-based solutions use a preprocessor to generate Java files, for the presented variant, it is even more compolicated. Each JastAdd configuraration must be presented to the benchmark as a separate tool. Thus there are two directories for each variant, one for the bacht processing mode and one for the incremental mode. Because these two modes share almost all the source code, a third directory is used to store this shared code. Finally, there is a directory for code shared between all JastAdd variants. These are the important directories:</p>
+<p>The benchmark is structured in modules, some of which form the code of the benchmark, some are provided by the contesting tools, and some are related to required model serializations. There are some naming conventions: - Tool-related modules are in directories starting with <code>trainbenchmark-tool</code>. - Model serialization-related modules start with <code>trainbenchmark-generator</code>. - All other modules are core modules of the bechmark.</p>
+<p>The JastAdd-based solutions use a preprocessor to generate Java files, for the presented variant. Each JastAdd configuraration must be presented to the benchmark as a separate tool. Thus there are two directories for each variant, one for the batch processing mode and one for the incremental mode. Because these two modes share almost all the source code, a third directory is used to store this shared code. Finally, there is a directory for code shared between all JastAdd variants. These are the important directories:</p>
 <ul>
 <li><a href="trainbenchmark/trainbenchmark-tool-jastadd-namelookup-base">JastAdd with Name Lookup</a>
 <ul>
@@ -133,7 +134,7 @@
 <li><a href="trainbenchmark/trainbenchmark-tool-jastadd-base">Common JastAdd Code</a></li>
 </ul>
 <h3 id="reproducing-the-measurements">Reproducing the Measurements</h3>
-<p><strong>Please Note: Reproducing the graphs as presented in the paper and supplied here takes a very long time depending on the utilized hardware. It is strongly suggested to run the benchmark with a smaller maximum problem size, less repetitions, and a shorter timeout.</strong> Most results of the benchmark are observable with more restricted setup as well. In the following, we will provide a suggested way to run the benchmark in different sizes.</p>
+<p><strong>Please Note: Reproducing the graphs as presented in the paper and supplied here takes a very long time depending on the utilized hardware. It is strongly suggested to run the benchmark with a smaller maximum problem size, less repetitions, and a shorter timeout.</strong> Most results of the benchmark are observable with more restricted setup as well. In the following, we will provide a suggested way to run the benchmark in different sizes. Note that running the benchmark requires a significant amount of disk space (up to 10GB when running the full benchmark).</p>
 <p>To reproduce the measurements, there are several options. We provide a prepared Docker image that can be run directly. Alternatively, it is, on course, also possible to simply run the provided gradle build scripts. However, since there are some software requirements imposed by the benchmark, particularly for creating the diagrams using R. We stronly suggest running the Docker variant.</p>
 <h4 id="running-the-benchmark-with-docker">Running the Benchmark with Docker</h4>
 <h5 id="loading-the-docker-image">Loading the Docker Image</h5>
@@ -145,6 +146,7 @@
 <ul>
 <li>Unpack the provided archive and open a terminal in the extracted directory</li>
 <li><code>docker load --input trainbenchmark-docker.tar</code></li>
+<li><code>docker run -it trainbenchmark</code></li>
 </ul></li>
 </ul></li>
 <li>Variant 2: Build the docker image from the provided Dockerfile
@@ -154,13 +156,15 @@
 <ul>
 <li>Unpack the provided archive and open a terminal in the extracted directory</li>
 <li><code>docker build -t trainbenchmark .</code></li>
-<li><code>docker run -it trainbenchmark</code></li>
 </ul></li>
 </ul></li>
 </ul>
 <h5 id="running-the-docker-image">Running the Docker Image</h5>
 <ul>
-<li><code>docker run -it trainbenchmark</code> To make the results available outside the container, run <code>docker run -it -v &quot;$PWD&quot;/docker-results:/trainbenchmark/results:Z -v &quot;$PWD&quot;/docker-diagrams:/trainbenchmark/diagrams:Z trainbenchmark</code></li>
+<li><code>docker run -it trainbenchmark</code>
+<ul>
+<li>To make the results available outside the container, run <code>docker run -it -v &quot;$PWD&quot;/docker-results:/trainbenchmark/results:Z -v &quot;$PWD&quot;/docker-diagrams:/trainbenchmark/diagrams:Z trainbenchmark</code></li>
+</ul></li>
 <li>A command prompt is opened and some information is displayed</li>
 <li>Follow the instructions below</li>
 </ul>
@@ -174,11 +178,13 @@
 </ul></li>
 <li>For running a custom run,
 <ul>
-<li>run <code>./gradlew preprocess</code> to generate the</li>
+<li>run <code>./gradlew preprocess</code> to generate the grammar from the extended grammar specification</li>
 <li>run <code>./gradlew build shadowJar -x test</code></li>
 <li>run <code>./gradlew initScripts</code></li>
-<li>configure the scripts either by running <code>./scripts/configure.sh 1 &lt;MAXSIZE&gt; &lt;TIMEOUT in s&gt; &lt;REPETITIONS&gt;</code> Where MAXSIZE is one of 2,4,8,16,32,64,128,256,512,1024. The larger sizes use <strong>a lot of</strong> disk space!</li>
-<li><em>Alternatively</em>, run ``</li>
+<li>configure the scripts by running <code>./scripts/configure.sh 1 &lt;MAXSIZE&gt; &lt;TIMEOUT in s&gt; &lt;REPETITIONS&gt;</code>
+<ul>
+<li>Where MAXSIZE is one of 2,4,8,16,32,64,128,256,512,1024. The larger sizes use <strong>a lot of</strong> disk space!</li>
+</ul></li>
 <li>run <code>./gradlew initScripts</code></li>
 <li>run <code>./gradlew generate</code></li>
 <li>run the benchmark
@@ -188,9 +194,9 @@
 </ul></li>
 <li>Plot the diagrams for the current run: <code>./gradlew plotIndividual</code></li>
 </ul></li>
-<li>The resulting data are in the <code>results</code> and the <code>diagrams</code> folder
+<li>The resulting data and diagrams is placed in the <code>results</code> and the <code>diagrams</code> folder
 <ul>
-<li>When running with docker, the data are also in <code>docker-results</code> and <code>docker-diagrams</code> on the host machine.</li>
+<li>When running with docker, the data is also in <code>docker-results</code> and <code>docker-diagrams</code> on the host machine.</li>
 </ul></li>
 </ul>
 </body>
diff --git a/README.md b/README.md
index 3e19f139bd2a3e32a735ed4b36c4ea638b2288c1..c384ff4eb5a1173f67ed502d1bd48a99009436c1 100644
--- a/README.md
+++ b/README.md
@@ -1,5 +1,9 @@
 # Artifacts for "Continuous Model Validation Using Reference Attribute Grammars"
 
+
+*Note: please use the HTML version of this README.*
+
+
 ### Authors
 
 - Johannes Mey <johannes.mey@tu-dresden.de>
@@ -17,20 +21,20 @@
 
 The paper discusses the utilization of reference attribute grammars (RAGs) for model validation and presents two specific contributions.
 First, the differences between models and trees specified by reference attribute grammars, specifically non-containment references, are discussed and a manual, yet optimised method to efficiently overcome these differences is presented.
-Secondly, an extension of RAG grammar specifications is proposed to model noncontainment references automatically.
+Secondly, an extension of RAG grammar specifications is proposed to model non-containment references automatically.
 The proposed modelling techniques are compared to state-of-the-art modelling tools utilizing a benchmarking framework for continuous model validation, the *Train Benchmark*.
 
 ### Structure of the Supplementary Artifacts
 
 The artifacts are structured in three parts:
 
-- Full collection of all measurement data and diagrams mentioned in the paper
+- A standalone example of the non-containment references preprocessor
 - Benchmark code to reproduce the measurements, including all relevant source codes
-- A standalone example of non-containment references preprocessor
+- Full collection of all measurement data and diagrams mentioned in the paper
 
 ### General Remarks on the presented Listings and Measurements
 
-For reasons of readability and simplicity, there are some minor differences in naming in the source codes and the measured resuting data.
+For reasons of readability and simplicity, there are some minor differences in naming in the source codes and the measured resulting data.
 Most importantly, the names of the three presented JastAdd implementation variants are different in the code and the diagrams.
 
 The following table shows the relation of the terminology used in the paper and in the code.
@@ -47,7 +51,7 @@ The following table shows the relation of the terminology used in the paper and
 
 ## The Grammar Extension Preprocessor `RelAst`
 
-To transform the grammar extension we provide a preprocessor for JastAdd
+To transform the grammar extension we provide a preprocessor for JastAdd.
 This preprocessor including its source code is provided in the `preprocessor` subdirectory.
 
 Its usage is:
@@ -78,15 +82,15 @@ The benchmark is able to measure different scenarios specified by configurations
 2. **Queries:** The queries are used to find the aforementioned faults. For each fault, there are two queries: *repair*, to find the fault, and *inject*, to find places where a fault can be injected.
 3. **Transformations:** The transformations performed by the benchmark are, again, two sets: *inject* and *repair* transformations.
 4. **Transformation Strategies:** The benchmark does not perform the operation on all matches.
-   The strategy *fixed* performs the transformation on a given number of matches, while the *proportional* strategy performes them on a given percentage of all matches.
+   The strategy *fixed* performs the transformation on a given number of matches, while the *proportional* strategy performs them on a given percentage of all matches.
 
 These settings are defined in a *benchmark scenario*, which can be edited before running the benchmark.
 
 
 ### Measurement Data
 
-The result data are stored in the directory [paper-results/](paper-results/).
-This directory contains two subdirectories
+The result data is stored in the directory [paper-results/](paper-results/).
+This directory contains two subdirectories:
 
 - [measurements](paper-results/measurements) contains two directories.
   The [inject](paper-results/measurements/inject) subdirectory contains the measurements for the *inject* scenario, which is also included in [inject/BenchmarkScript.groovy](paper-results/measurements/inject/BenchmarkScript.groovy).
@@ -111,7 +115,7 @@ This directory contains two subdirectories
 For this publication, we tried to modify the source code of the benchmark itself as little as possible.
 Therefore, unfortunately, the code base is rather large and confusing. The following section tries to point to the parts relevant for this paper.
 
-The benchmark is structures in modules, some of which form the code of the benchmark, some are provided by the contesting tools, and some are related to required model serializations.
+The benchmark is structured in modules, some of which form the code of the benchmark, some are provided by the contesting tools, and some are related to required model serializations.
 There are some naming conventions:
 - Tool-related modules are in directories starting with `trainbenchmark-tool`.
 - Model serialization-related modules start with `trainbenchmark-generator`.
@@ -175,10 +179,10 @@ However, since there are some software requirements imposed by the benchmark, pa
     - `./run_medium`
     - `./run_full`
 - For running a custom run,
-    - run `./gradlew preprocess` to generate the 
+    - run `./gradlew preprocess` to generate the grammar from the extended grammar specification
     - run `./gradlew build shadowJar -x test`
     - run `./gradlew initScripts`
-    - configure the scripts either by running `./scripts/configure.sh 1 <MAXSIZE> <TIMEOUT in s> <REPETITIONS>`
+    - configure the scripts by running `./scripts/configure.sh 1 <MAXSIZE> <TIMEOUT in s> <REPETITIONS>`
         - Where MAXSIZE is one of 2,4,8,16,32,64,128,256,512,1024. The larger sizes use **a lot of** disk space!
     - run `./gradlew initScripts`
     - run `./gradlew generate`
@@ -187,5 +191,5 @@ However, since there are some software requirements imposed by the benchmark, pa
         - run `./gradlew individualRepairBenchmark` for the *repair* scenarios
     - Plot the diagrams for the current run: `./gradlew plotIndividual`
 
-- The resulting data are in the `results` and the `diagrams` folder
-    - When running with docker, the data are also in `docker-results` and `docker-diagrams` on the host machine.
+- The resulting data and diagrams is placed in the `results` and the `diagrams` folder
+    - When running with docker, the data is also in `docker-results` and `docker-diagrams` on the host machine.
diff --git a/README.txt b/README.txt
new file mode 100644
index 0000000000000000000000000000000000000000..c384ff4eb5a1173f67ed502d1bd48a99009436c1
--- /dev/null
+++ b/README.txt
@@ -0,0 +1,195 @@
+# Artifacts for "Continuous Model Validation Using Reference Attribute Grammars"
+
+
+*Note: please use the HTML version of this README.*
+
+
+### Authors
+
+- Johannes Mey <johannes.mey@tu-dresden.de>
+- Carl Mai <carl.mai@tu-dresden.de>
+- René Schöne <rene.schoene@tu-dresden.de>
+- Görel Hedin <gorel.hedin@cs.lth.se>
+- Emma Söderberg <emma.soderberg@cs.lth.se>
+- Thomas Kühn <thomas.kuehn3@tu-dresden.de>
+- Niklas Fors <niklas.fors@cs.lth.se>
+- Jesper Öqvist <jesper.oqvist@cs.lth.se>
+- Uwe Aßmann <uwe.assmann@tu-dresden.de>
+
+
+### Introduction
+
+The paper discusses the utilization of reference attribute grammars (RAGs) for model validation and presents two specific contributions.
+First, the differences between models and trees specified by reference attribute grammars, specifically non-containment references, are discussed and a manual, yet optimised method to efficiently overcome these differences is presented.
+Secondly, an extension of RAG grammar specifications is proposed to model non-containment references automatically.
+The proposed modelling techniques are compared to state-of-the-art modelling tools utilizing a benchmarking framework for continuous model validation, the *Train Benchmark*.
+
+### Structure of the Supplementary Artifacts
+
+The artifacts are structured in three parts:
+
+- A standalone example of the non-containment references preprocessor
+- Benchmark code to reproduce the measurements, including all relevant source codes
+- Full collection of all measurement data and diagrams mentioned in the paper
+
+### General Remarks on the presented Listings and Measurements
+
+For reasons of readability and simplicity, there are some minor differences in naming in the source codes and the measured resulting data.
+Most importantly, the names of the three presented JastAdd implementation variants are different in the code and the diagrams.
+
+The following table shows the relation of the terminology used in the paper and in the code.
+
++-----------------------+-----------------------------+----------------------------+
+| Name used in Paper    | Name used in result data    | Name used in source code   |
++=======================+=============================+============================+
+| Name Lookup           | Jastadd (Name Lookup)       | jastadd-namelookup         |     
++-----------------------+-----------------------------+----------------------------+
+| Intrinsic References  | Jastadd (Optimized)         | jastadd-optimized          |
++-----------------------+-----------------------------+----------------------------+
+| Grammar Extension     | Jastadd (Specialized)       | jastadd-specialized        |
++-----------------------+-----------------------------+----------------------------+
+
+## The Grammar Extension Preprocessor `RelAst`
+
+To transform the grammar extension we provide a preprocessor for JastAdd.
+This preprocessor including its source code is provided in the `preprocessor` subdirectory.
+
+Its usage is:
+- Run preprocessor on train benchmark (output written to standard output):  
+    - `cat examples/TrainBenchmark.relast`
+    - `java -jar relast-compiler.jar examples/TrainBenchmark.relast`
+    
+- Run preprocessor and write output to files:
+    - `java -jar relast-compiler.jar examples/TrainBenchmark.relast --file`
+    - `cat examples/TrainBenchmarkGen.ast`
+    - `cat examples/TrainBenchmarkGen.jadd`
+ 
+- Run preprocessor and write output to files (with a different list class):
+    - `java -jar relast-compiler.jar examples/TrainBenchmark.relast --listClass=MyListClass --file`
+    - `cat examples/TrainBenchmarkGen.ast`
+    - `cat examples/TrainBenchmarkGen.jadd`
+
+
+## The Train Benchmark
+
+### Structure of the Train Benchmark
+
+The benchmark is able to measure different scenarios specified by configurations with several kinds of parameters:
+
+1. **Input Data:** There are two types of input data used in the benchmark, the ``inject`` and the ``repair`` data set.
+   The former contains *valid* models, i.e., models, which do not contain any of the faults that are supposed to be found by the presented queries.
+   The latter, `repair`, contains models already containing faults.
+2. **Queries:** The queries are used to find the aforementioned faults. For each fault, there are two queries: *repair*, to find the fault, and *inject*, to find places where a fault can be injected.
+3. **Transformations:** The transformations performed by the benchmark are, again, two sets: *inject* and *repair* transformations.
+4. **Transformation Strategies:** The benchmark does not perform the operation on all matches.
+   The strategy *fixed* performs the transformation on a given number of matches, while the *proportional* strategy performs them on a given percentage of all matches.
+
+These settings are defined in a *benchmark scenario*, which can be edited before running the benchmark.
+
+
+### Measurement Data
+
+The result data is stored in the directory [paper-results/](paper-results/).
+This directory contains two subdirectories:
+
+- [measurements](paper-results/measurements) contains two directories.
+  The [inject](paper-results/measurements/inject) subdirectory contains the measurements for the *inject* scenario, which is also included in [inject/BenchmarkScript.groovy](paper-results/measurements/inject/BenchmarkScript.groovy).
+  The [repair](paper-results/measurements/repair) subdirectory contains the same data for the *repair* scenario in [repair/BenchmarkScript.groovy](paper-results/measurements/repair/BenchmarkScript.groovy).
+  Both directories contain files with time measurement data (starting with `times`) and the numbers of matches (starting with `matches`).
+  Each file name contains information on the tool used, the query, and the size of the model.
+- [diagrams](paper-results/diagrams) contains the same subdirectories, both containing diagrams with the respective measurements.
+  The diagrams are generated from the same data as in the paper, but enlarged for better readability.
+  In particular, the six diagrams presented in the paper are
+    - [Fig. 7a. Read and Check for RouteSensor (repair)](paper-results/diagrams/repair/Read-and-Check-RouteSensor.pdf)
+    - [Fig. 7b. Read and Check for ConnectedSegments (repair)](paper-results/diagrams/repair/Read-and-Check-ConnectedSegments.pdf)
+    - [Fig. 7c. Transformation and Recheck for RouteSensor (inject)](paper-results/diagrams/inject/Transformation-and-Recheck-RouteSensor.pdf)
+    - [Fig. 7d. Transformation and Recheck for ConnectedSegments (inject)](paper-results/diagrams/inject/Transformation-and-Recheck-ConnectedSegments.pdf)
+    - [Fig. 7e. Transformation and Recheck for RouteSensor (repair)](paper-results/diagrams/repair/Transformation-and-Recheck-RouteSensor.pdf)
+    - [Fig. 7f. Transformation and Recheck for ConnectedSegments (repair)](paper-results/diagrams/repair/Transformation-and-Recheck-ConnectedSegments.pdf)
+
+**Please Note:** The measurements were conducted using a timeout for the whole run. If a run was not completed, no individual times of the steps appear in the measurements and diagrams. Thus, some tools do not have measurements for all problem sizes.
+
+
+### The Source Code
+
+For this publication, we tried to modify the source code of the benchmark itself as little as possible.
+Therefore, unfortunately, the code base is rather large and confusing. The following section tries to point to the parts relevant for this paper.
+
+The benchmark is structured in modules, some of which form the code of the benchmark, some are provided by the contesting tools, and some are related to required model serializations.
+There are some naming conventions:
+- Tool-related modules are in directories starting with `trainbenchmark-tool`.
+- Model serialization-related modules start with `trainbenchmark-generator`.
+- All other modules are core modules of the bechmark.
+
+The JastAdd-based solutions use a preprocessor to generate Java files, for the presented variant.
+Each JastAdd configuraration must be presented to the benchmark as a separate tool. Thus there are two directories for each variant, one for the batch processing mode and one for the incremental mode.
+Because these two modes share almost all the source code, a third directory is used to store this shared code.
+Finally, there is a directory for code shared between all JastAdd variants.
+These are the important directories:
+
+- [JastAdd with Name Lookup](trainbenchmark/trainbenchmark-tool-jastadd-namelookup-base)
+    - [Grammar](trainbenchmark/trainbenchmark-tool-jastadd-namelookup-base/src/main/jastadd/train.ast)
+    - [Queries](trainbenchmark/trainbenchmark-tool-jastadd-namelookup-base/src/main/jastadd/queries)
+    - [Transformations](trainbenchmark/trainbenchmark-tool-jastadd-namelookup-base/src/main/java/de/tudresden/inf/st/train/jastadd/transformations)
+- [JastAdd with Intrinsic References](trainbenchmark/trainbenchmark-tool-jastadd-optimized-base)
+    - [Grammar](trainbenchmark/trainbenchmark-tool-jastadd-optimized-base/src/main/jastadd/train.ast)
+    - [Queries](trainbenchmark/trainbenchmark-tool-jastadd-optimized-base/src/main/jastadd/queries)
+    - [Transformations](trainbenchmark/trainbenchmark-tool-jastadd-optimized-base/src/main/java/de/tudresden/inf/st/train/jastadd/transformations)
+- [JastAdd with Grammar Extension](trainbenchmark/trainbenchmark-tool-jastadd-specialized-base)
+    - [(Extended) Grammar](trainbenchmark/trainbenchmark-tool-jastadd-specialized-base/src/main/jastadd/Train.relast)
+    - [Queries](trainbenchmark/trainbenchmark-tool-jastadd-specialized-base/src/main/jastadd/queries)
+    - [Transformations](trainbenchmark/trainbenchmark-tool-jastadd-specialized-base/src/main/java/de/tudresden/inf/st/train/jastadd/transformations)
+- [Common JastAdd Code](trainbenchmark/trainbenchmark-tool-jastadd-base)
+
+### Reproducing the Measurements
+
+**Please Note: Reproducing the graphs as presented in the paper and supplied here takes a very long time depending on the utilized hardware. It is strongly suggested to run the benchmark with a smaller maximum problem size, less repetitions, and a shorter timeout.** Most results of the benchmark are observable with more restricted setup as well. In the following, we will provide a suggested way to run the benchmark in different sizes. Note that running the benchmark requires a significant amount of disk space (up to 10GB when running the full benchmark).
+
+To reproduce the measurements, there are several options. We provide a prepared Docker image that can be run directly.
+Alternatively, it is, on course, also possible to simply run the provided gradle build scripts.
+However, since there are some software requirements imposed by the benchmark, particularly for creating the diagrams using R. We stronly suggest running the Docker variant.
+
+#### Running the Benchmark with Docker
+
+##### Loading the Docker Image
+
+- Variant 1 (recommended): Load the provided docker image
+    - Prerequisites: An installation of Docker in the `PATH`
+    - Steps:
+        - Unpack the provided archive and open a terminal in the extracted directory
+        - `docker load --input trainbenchmark-docker.tar`
+        - `docker run -it trainbenchmark`
+- Variant 2: Build the docker image from the provided Dockerfile
+    - Prerequisites: An installation of Docker in the `PATH`
+    - Steps:
+        - Unpack the provided archive and open a terminal in the extracted directory
+        - `docker build -t trainbenchmark .`
+
+##### Running the Docker Image
+
+- `docker run -it trainbenchmark`
+    - To make the results available outside the container, run `docker run -it -v "$PWD"/docker-results:/trainbenchmark/results:Z -v "$PWD"/docker-diagrams:/trainbenchmark/diagrams:Z trainbenchmark`
+- A command prompt is opened and some information is displayed
+- Follow the instructions below
+
+#### Running the Benchmark directly
+
+- For running a standard run,
+    - `./run_small`
+    - `./run_medium`
+    - `./run_full`
+- For running a custom run,
+    - run `./gradlew preprocess` to generate the grammar from the extended grammar specification
+    - run `./gradlew build shadowJar -x test`
+    - run `./gradlew initScripts`
+    - configure the scripts by running `./scripts/configure.sh 1 <MAXSIZE> <TIMEOUT in s> <REPETITIONS>`
+        - Where MAXSIZE is one of 2,4,8,16,32,64,128,256,512,1024. The larger sizes use **a lot of** disk space!
+    - run `./gradlew initScripts`
+    - run `./gradlew generate`
+    - run the benchmark
+        - run `./gradlew individualInjectBenchmark` for the *inject* scenarios
+        - run `./gradlew individualRepairBenchmark` for the *repair* scenarios
+    - Plot the diagrams for the current run: `./gradlew plotIndividual`
+
+- The resulting data and diagrams is placed in the `results` and the `diagrams` folder
+    - When running with docker, the data is also in `docker-results` and `docker-diagrams` on the host machine.