spot/bench/stutter/README
Alexandre Duret-Lutz bd414d4d4c bench/stutter: Update
* bench/stutter/stutter_invariance_randomgraph.cc: Update to recent
changes.  If an algorithm took more that 30s on an average for a set of
parameters, avoid running it with more states.  Take the density and
ap count as parameter.  Output all the algorithms on the same line.
Add additional statistics about automata.
* bench/stutter/stutter_invariance_formulas.cc: Update to recent
changes.  Output all the algorithms on the same line.
Add additional statistics about automata.
* bench/stutter/stutter_bench.sh: Use a Makefile to manage concurrency.
* bench/stutter/README: Update.
2015-02-11 11:39:43 +01:00

20 lines
647 B
Text

This benchmark measures the performance of different algorithms to
check if property (expressed as a formula or as a deterministic TGBA)
is stutter-invariant. When the benchmark is run on formulas, the
translation time is not included in the measured time.
To reproduce the benchmark is to run
% ./stutter_bench.sh -j8
to create bench_formulas.csv and bench_randgraph.csv.
(Adjust -j8 to the number of cores you have.)
Then explore these data the provided ipython notebook
% ipython notebook --pylab=inline stutter.ipynb
The time in bench_formulas.csv is reported in microseconds, while the
time in bench_randgraph.csv is in seconds.