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

Introduction

This page presents how LoLA do cope efficiently with the CTLCardinality 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 13 123   Smallest Memory Footprint
LoLA = LTSMin 3 Times tool wins 569 204
LoLA > LTSMin 394   Shortest Execution Time
LoLA < LTSMin 94 Times tool wins 485 288
Do not compete 0 181 0
Error detected 5 0 0  
Cannot Compute + Time-out 43 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 35 206   Smallest Memory Footprint
LoLA = Tapaal 91 Times tool wins 573 222
LoLA > Tapaal 100   Shortest Execution Time
LoLA < Tapaal 363 Times tool wins 396 399
Do not compete 0 0 0
Error detected 5 0 0  
Cannot Compute + Time-out 30 0 13


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 257 25 55   Smallest Memory Footprint
LoLA = M4M.full 25 Times tool wins 574 211
LoLA > M4M.full 390   Shortest Execution Time
LoLA < M4M.full 33 Times tool wins 384 401
Do not compete 0 0 0
Error detected 5 4 0  
Cannot Compute + Time-out 21 254 22


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 360 22 67   Smallest Memory Footprint
LoLA = M4M.struct 19 Times tool wins 623 159
LoLA > M4M.struct 276   Shortest Execution Time
LoLA < M4M.struct 38 Times tool wins 482 300
Do not compete 0 0 0
Error detected 5 3 0  
Cannot Compute + Time-out 18 358 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 385 11 153   Smallest Memory Footprint
LoLA = ITS-Tools 2 Times tool wins 685 86
LoLA > ITS-Tools 100   Shortest Execution Time
LoLA < ITS-Tools 120 Times tool wins 534 237
Do not compete 0 0 0
Error detected 5 0 0  
Cannot Compute + Time-out 7 386 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 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 399 11 152   Smallest Memory Footprint
LoLA = ITS-Tools.L 2 Times tool wins 684 87
LoLA > ITS-Tools.L 93   Shortest Execution Time
LoLA < ITS-Tools.L 114 Times tool wins 539 232
Do not compete 0 0 0
Error detected 5 0 0  
Cannot Compute + Time-out 7 400 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 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 470 3 152   Smallest Memory Footprint
LoLA = GreatSPN 2 Times tool wins 603 160
LoLA > GreatSPN 18   Shortest Execution Time
LoLA < GreatSPN 118 Times tool wins 559 204
Do not compete 0 0 0
Error detected 5 0 0  
Cannot Compute + Time-out 0 472 43


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 235 25 75   Smallest Memory Footprint
LoLA = Irma.full 26 Times tool wins 555 230
LoLA > Irma.full 331   Shortest Execution Time
LoLA < Irma.full 93 Times tool wins 351 434
Do not compete 0 0 0
Error detected 5 0 0  
Cannot Compute + Time-out 21 236 22


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 235 25 76   Smallest Memory Footprint
LoLA = Irma.struct 27 Times tool wins 561 224
LoLA > Irma.struct 329   Shortest Execution Time
LoLA < Irma.struct 93 Times tool wins 354 431
Do not compete 0 0 0
Error detected 5 0 0  
Cannot Compute + Time-out 21 236 22


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