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

Introduction

This page presents how LoLA do cope efficiently with the LTLCardinality 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 4 215   Smallest Memory Footprint
LoLA = LTSMin 65 Times tool wins 586 186
LoLA > LTSMin 222   Shortest Execution Time
LoLA < LTSMin 120 Times tool wins 414 358
Do not compete 0 180 0
Error detected 0 0 2  
Cannot Compute + Time-out 38 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 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 262 17 154   Smallest Memory Footprint
LoLA = M4M.full 58 Times tool wins 606 179
LoLA > M4M.full 254   Shortest Execution Time
LoLA < M4M.full 40 Times tool wins 475 310
Do not compete 0 20 0
Error detected 2 0 0  
Cannot Compute + Time-out 18 245 20


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 222 15 161   Smallest Memory Footprint
LoLA = M4M.struct 66 Times tool wins 591 192
LoLA > M4M.struct 276   Shortest Execution Time
LoLA < M4M.struct 43 Times tool wins 444 339
Do not compete 0 0 0
Error detected 2 0 0  
Cannot Compute + Time-out 15 224 23


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 91 7 271   Smallest Memory Footprint
LoLA = ITS-Tools 30 Times tool wins 652 123
LoLA > ITS-Tools 257   Shortest Execution Time
LoLA < ITS-Tools 119 Times tool wins 515 260
Do not compete 0 0 0
Error detected 2 2 0  
Cannot Compute + Time-out 5 89 33


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 86 8 266   Smallest Memory Footprint
LoLA = ITS-Tools.L 33 Times tool wins 650 126
LoLA > ITS-Tools.L 267   Shortest Execution Time
LoLA < ITS-Tools.L 116 Times tool wins 503 273
Do not compete 0 0 0
Error detected 2 2 0  
Cannot Compute + Time-out 6 84 32


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 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 246 16 165   Smallest Memory Footprint
LoLA = Irma.full 59 Times tool wins 589 195
LoLA > Irma.full 237   Shortest Execution Time
LoLA < Irma.full 61 Times tool wins 455 329
Do not compete 0 0 0
Error detected 2 0 0  
Cannot Compute + Time-out 16 248 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 245 16 166   Smallest Memory Footprint
LoLA = Irma.struct 61 Times tool wins 598 186
LoLA > Irma.struct 235   Shortest Execution Time
LoLA < Irma.struct 61 Times tool wins 458 326
Do not compete 0 0 0
Error detected 2 0 0  
Cannot Compute + Time-out 16 247 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