Repeatability Evaluation package for the ARCH2018 Competition
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Type Name Latest commit message Commit time
Failed to load latest commit information.


🏆 🤓 The Most Promising Research Award of the ARCH 2018 Friendly Competition was given to JuliaReach for the results obtained in the ARCH2018_RE, see the announcement here.

📰 🏁 The paper with the results of the RE is now available online, ARCH-COMP18 Category Report: Continuous and Hybrid Systems with Linear Continuous Dynamics. Matthias Althoff, Stanley Bak, Xin Chen, Chuchu Fan, Marcelo Forets, Goran Frehse, Niklas Kochdumper, Yangge Li, Sayan Mitra, Rajarshi Ray, Christian Schilling and Stefan Schupp (2018) ARCH18. 5th International Workshop on Applied Verification of Continuous and Hybrid Systems, 54: 23–52. doi: 10.29007/73mb. Packages: Reachability.jl.

This is the readme file of the ARCH2018 Repeatibility Evaluation (RE) package. Instructions are provided for installing and running the benchmarks.

Note. ARCH18_RE.jl is just a "wrapper" module for running the benchmarks of this RE. The actual algorithms belong to the package Reachability.jl.


This year we have considered purely continuous models only. These are:

  • International Space Station (ISS) alias SpaceStation.
  • Building model alias Building.

Overview. To install and run the benchmarks, basically these three steps are needed:

  1. Download and install Julia using the official download links.
  2. Download Reachability.jl and its dependencies. For that purpose we provide the script
  3. Run the benchmarks and obtain results. For that purpose we provide the script The results are saved in the file

Below we explain these steps in some detail. A section on known issues is given in the end. If you still have problems or questions, do contact us in our gitter channel or via email.

About JuliaReach

JuliaReach is a software framework for reachability computations of dynamical systems, available at the JuliaReach github project website. It is written in Julia, a modern high-level language for scientific computing. Currently JuliaReach can handle continuous affine systems. The reachability algorithm uses a block decomposition technique presented in DBLP:conf/hybrid/BogomolovFFVPS18. Here we partition the state space, project the initial states to subspaces, and propagate these low-dimensional sets in time. This allows us to perform otherwise expensive set operations in low dimensions. Furthermore, if the output does not depend on all dimensions, we can effectively skip the reach set computation for the respective dimensions. In the evaluation we used two-dimensional blocks, for which our implementation supports epsilon-close approximation; for box approximation we can handle arbitrary partitions. For the set computations we use the LazySets library, which is also part of the JuliaReach framework. LazySets exploits the principle of lazy (on-demand) evaluation and uses support functions to represent lazy sets. JuliaReach also comes with SX, a parser for SX (SpaceEx format) model files. For next year we plan to add support for hybrid dynamics, which will require a careful balance between low- and high-dimensional computations and adaptive choice of the partition.


This package requires Julia v0.6.x. Refer to the official documentation on how to install and run Julia in your system.

Once you have installed Julia, you should be able to open it in a terminal (shell) with the command julia, and see the welcome message similar to

$ julia
   _       _ _(_)_     |  A fresh approach to technical computing
  (_)     | (_) (_)    |  Documentation:

   _ _   _| |_  __ _   |  Type "?help" for help.
  | | | | | | |/ _` |  |
  | | |_| | | | (_| |  |  Version 0.6.1 (2017-10-24 22:15 UTC)
 _/ |\__'_|_|_|\__'_|  |  Official release
|__/                   |  x86_64-apple-darwin14.5.0


To install the reachability API we provide the shell script contained in this folder. Execute the script with the command:

$ ./

Note. The script evaluates the following commands in your Julia installation:

julia> Pkg.clone("")
julia> Pkg.clone("")

Since Reachability.jl has several dependencies and the other packages also have their dependencies, this whole process will take between 5-20 minutes in a fresh Julia installation.

Running the benchmarks

To run and get the benchmark results in the file, execute the Julia script run.julia with the command:

$ julia --color=yes run.jl

The file is saved in your current working directory.

Note. To obtain statistically meaningful performance measures, each reachability computation is performed several times. The script can take several minutes.

In the results tables, the reported time is the minimum time in seconds for each safety property check. Other statistics such as mean and max values can be found by looking at the entries of the results structure.

For more advanced testing settings we refer to the official BenchmarkTools documentation.


  1. To be able to run the shell script, you may have to give the appropriate permissions. In Linux and MacOS systems this is done with the command:

    $ chmod 744
  2. If running one scripts give failures, try running it a second time.

  3. See also the installation instructions of the LazySets.jl library.

  4. If you still have trouble, don't hesitate to contact us in our gitter channel.