fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
LoLA compared to other tools («Known» models, ReachabilityCardinality)
Last Updated
June 26, 2018

Introduction

This page presents how LoLA do cope efficiently with the ReachabilityCardinality examination face to the other participating tools. In this page, we consider «Known» models.

The next sections will show chart comparing performances in terms of both memory and execution time.The x-axis corresponds to the challenging tool where the y-axes represents LoLA' performances. Thus, points below the diagonal of a chart denote comparisons favorables to the tool while others corresponds to situations where the challenging tool performs better.

You might also find plots out of the range that denote the case were at least one tool could not answer appropriately (error, time-out, could not compute or did not competed).

LoLA versus LTSMin

Some statistics are displayed below, based on 1616 runs (808 for LoLA and 808 for LTSMin, so there are 808 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing LoLA to LTSMin are shown (you may click on one graph to enlarge it).

Statistics on the executions
  LoLA LTSMin Both tools   LoLA LTSMin
All computed OK 146 6 229   Smallest Memory Footprint
LoLA = LTSMin 0 Times tool wins 717 57
LoLA > LTSMin 336   Shortest Execution Time
LoLA < LTSMin 57 Times tool wins 557 217
Do not compete 0 180 0
Error detected 1 0 0  
Cannot Compute + Time-out 39 0 0


On the chart below, denote cases where the two tools did computed all results without error, denote cases where the two tool did computed the same number of values (but not al values in the examination), denote cases where LoLA computed more values than LTSMin, denote cases where LoLA computed less values than LTSMin, denote the cases where at least one tool did not competed, denote the cases where at least one tool computed a bad value and denote the cases where at least one tool stated it could not compute a result or timed-out.

LoLA wins when points are below the diagonal, LTSMin wins when points are above the diagonal.

memory chart time chart

LoLA versus Tapaal

Some statistics are displayed below, based on 1616 runs (808 for LoLA and 808 for Tapaal, so there are 808 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing LoLA to Tapaal are shown (you may click on one graph to enlarge it).

Statistics on the executions
  LoLA Tapaal Both tools   LoLA Tapaal
All computed OK 0 37 519   Smallest Memory Footprint
LoLA = Tapaal 27 Times tool wins 307 498
LoLA > Tapaal 38   Shortest Execution Time
LoLA < Tapaal 184 Times tool wins 259 546
Do not compete 0 0 0
Error detected 1 0 0  
Cannot Compute + Time-out 36 0 3


On the chart below, denote cases where the two tools did computed all results without error, denote cases where the two tool did computed the same number of values (but not al values in the examination), denote cases where LoLA computed more values than Tapaal, denote cases where LoLA computed less values than Tapaal, denote the cases where at least one tool did not competed, denote the cases where at least one tool computed a bad value and denote the cases where at least one tool stated it could not compute a result or timed-out.

LoLA wins when points are below the diagonal, Tapaal wins when points are above the diagonal.

memory chart time chart

LoLA versus M4M.full

Some statistics are displayed below, based on 1616 runs (808 for LoLA and 808 for M4M.full, so there are 808 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing LoLA to M4M.full are shown (you may click on one graph to enlarge it).

Statistics on the executions
  LoLA M4M.full Both tools   LoLA M4M.full
All computed OK 337 4 294   Smallest Memory Footprint
LoLA = M4M.full 20 Times tool wins 732 40
LoLA > M4M.full 74   Shortest Execution Time
LoLA < M4M.full 43 Times tool wins 576 196
Do not compete 0 0 0
Error detected 1 0 0  
Cannot Compute + Time-out 3 337 36


On the chart below, denote cases where the two tools did computed all results without error, denote cases where the two tool did computed the same number of values (but not al values in the examination), denote cases where LoLA computed more values than M4M.full, denote cases where LoLA computed less values than M4M.full, denote the cases where at least one tool did not competed, denote the cases where at least one tool computed a bad value and denote the cases where at least one tool stated it could not compute a result or timed-out.

LoLA wins when points are below the diagonal, M4M.full wins when points are above the diagonal.

memory chart time chart

LoLA versus M4M.struct

Some statistics are displayed below, based on 1616 runs (808 for LoLA and 808 for M4M.struct, so there are 808 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing LoLA to M4M.struct are shown (you may click on one graph to enlarge it).

Statistics on the executions
  LoLA M4M.struct Both tools   LoLA M4M.struct
All computed OK 257 15 301   Smallest Memory Footprint
LoLA = M4M.struct 20 Times tool wins 721 62
LoLA > M4M.struct 141   Shortest Execution Time
LoLA < M4M.struct 49 Times tool wins 563 220
Do not compete 0 0 0
Error detected 1 0 0  
Cannot Compute + Time-out 14 257 25


On the chart below, denote cases where the two tools did computed all results without error, denote cases where the two tool did computed the same number of values (but not al values in the examination), denote cases where LoLA computed more values than M4M.struct, denote cases where LoLA computed less values than M4M.struct, denote the cases where at least one tool did not competed, denote the cases where at least one tool computed a bad value and denote the cases where at least one tool stated it could not compute a result or timed-out.

LoLA wins when points are below the diagonal, M4M.struct wins when points are above the diagonal.

memory chart time chart

LoLA versus ITS-Tools

Some statistics are displayed below, based on 1616 runs (808 for LoLA and 808 for ITS-Tools, so there are 808 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing LoLA to ITS-Tools are shown (you may click on one graph to enlarge it).

Statistics on the executions
  LoLA ITS-Tools Both tools   LoLA ITS-Tools
All computed OK 83 16 342   Smallest Memory Footprint
LoLA = ITS-Tools 3 Times tool wins 738 46
LoLA > ITS-Tools 258   Shortest Execution Time
LoLA < ITS-Tools 82 Times tool wins 502 282
Do not compete 0 0 0
Error detected 1 0 0  
Cannot Compute + Time-out 15 83 24


On the chart below, denote cases where the two tools did computed all results without error, denote cases where the two tool did computed the same number of values (but not al values in the examination), denote cases where LoLA computed more values than ITS-Tools, denote cases where LoLA computed less values than ITS-Tools, denote the cases where at least one tool did not competed, denote the cases where at least one tool computed a bad value and denote the cases where at least one tool stated it could not compute a result or timed-out.

LoLA wins when points are below the diagonal, ITS-Tools wins when points are above the diagonal.

memory chart time chart

LoLA versus ITS-Tools.L

Some statistics are displayed below, based on 1616 runs (808 for LoLA and 808 for ITS-Tools.L, so there are 808 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing LoLA to ITS-Tools.L are shown (you may click on one graph to enlarge it).

Statistics on the executions
  LoLA ITS-Tools.L Both tools   LoLA ITS-Tools.L
All computed OK 80 16 337   Smallest Memory Footprint
LoLA = ITS-Tools.L 2 Times tool wins 738 46
LoLA > ITS-Tools.L 269   Shortest Execution Time
LoLA < ITS-Tools.L 80 Times tool wins 509 275
Do not compete 0 0 0
Error detected 1 0 0  
Cannot Compute + Time-out 15 80 24


On the chart below, denote cases where the two tools did computed all results without error, denote cases where the two tool did computed the same number of values (but not al values in the examination), denote cases where LoLA computed more values than ITS-Tools.L, denote cases where LoLA computed less values than ITS-Tools.L, denote the cases where at least one tool did not competed, denote the cases where at least one tool computed a bad value and denote the cases where at least one tool stated it could not compute a result or timed-out.

LoLA wins when points are below the diagonal, ITS-Tools.L wins when points are above the diagonal.

memory chart time chart

LoLA versus GreatSPN

Some statistics are displayed below, based on 1616 runs (808 for LoLA and 808 for GreatSPN, so there are 808 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing LoLA to GreatSPN are shown (you may click on one graph to enlarge it).

Statistics on the executions
  LoLA GreatSPN Both tools   LoLA GreatSPN
All computed OK 474 0 225   Smallest Memory Footprint
LoLA = GreatSPN 2 Times tool wins 689 79
LoLA > GreatSPN 22   Shortest Execution Time
LoLA < GreatSPN 45 Times tool wins 628 140
Do not compete 0 0 0
Error detected 1 0 0  
Cannot Compute + Time-out 0 475 39


On the chart below, denote cases where the two tools did computed all results without error, denote cases where the two tool did computed the same number of values (but not al values in the examination), denote cases where LoLA computed more values than GreatSPN, denote cases where LoLA computed less values than GreatSPN, denote the cases where at least one tool did not competed, denote the cases where at least one tool computed a bad value and denote the cases where at least one tool stated it could not compute a result or timed-out.

LoLA wins when points are below the diagonal, GreatSPN wins when points are above the diagonal.

memory chart time chart

LoLA versus Irma.full

Some statistics are displayed below, based on 1616 runs (808 for LoLA and 808 for Irma.full, so there are 808 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing LoLA to Irma.full are shown (you may click on one graph to enlarge it).

Statistics on the executions
  LoLA Irma.full Both tools   LoLA Irma.full
All computed OK 226 21 321   Smallest Memory Footprint
LoLA = Irma.full 35 Times tool wins 692 97
LoLA > Irma.full 115   Shortest Execution Time
LoLA < Irma.full 71 Times tool wins 461 328
Do not compete 0 0 0
Error detected 1 0 0  
Cannot Compute + Time-out 20 226 19


On the chart below, denote cases where the two tools did computed all results without error, denote cases where the two tool did computed the same number of values (but not al values in the examination), denote cases where LoLA computed more values than Irma.full, denote cases where LoLA computed less values than Irma.full, denote the cases where at least one tool did not competed, denote the cases where at least one tool computed a bad value and denote the cases where at least one tool stated it could not compute a result or timed-out.

LoLA wins when points are below the diagonal, Irma.full wins when points are above the diagonal.

memory chart time chart

LoLA versus Irma.struct

Some statistics are displayed below, based on 1616 runs (808 for LoLA and 808 for Irma.struct, so there are 808 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing LoLA to Irma.struct are shown (you may click on one graph to enlarge it).

Statistics on the executions
  LoLA Irma.struct Both tools   LoLA Irma.struct
All computed OK 222 21 321   Smallest Memory Footprint
LoLA = Irma.struct 35 Times tool wins 694 95
LoLA > Irma.struct 119   Shortest Execution Time
LoLA < Irma.struct 71 Times tool wins 456 333
Do not compete 0 0 0
Error detected 1 0 0  
Cannot Compute + Time-out 20 222 19


On the chart below, denote cases where the two tools did computed all results without error, denote cases where the two tool did computed the same number of values (but not al values in the examination), denote cases where LoLA computed more values than Irma.struct, denote cases where LoLA computed less values than Irma.struct, denote the cases where at least one tool did not competed, denote the cases where at least one tool computed a bad value and denote the cases where at least one tool stated it could not compute a result or timed-out.

LoLA wins when points are below the diagonal, Irma.struct wins when points are above the diagonal.

memory chart time chart