fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
LoLA compared to other tools (
Last Updated
June 26, 2018

Introduction

This page presents how LoLA do cope efficiently with the ReachabilityDeadlock examination face to the other participating tools. In this page, we consider «Surprise» 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 278 runs (139 for LoLA and 139 for LTSMin, so there are 139 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 65 7 28   Smallest Memory Footprint
LoLA = LTSMin 0 Times tool wins 95 20
LoLA > LTSMin 15   Shortest Execution Time
LoLA < LTSMin 0 Times tool wins 103 12
Do not compete 0 0 0
Error detected 0 0 0  
Cannot Compute + Time-out 7 65 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 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 278 runs (139 for LoLA and 139 for Tapaal, so there are 139 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 3 10 105   Smallest Memory Footprint
LoLA = Tapaal 0 Times tool wins 42 76
LoLA > Tapaal 0   Shortest Execution Time
LoLA < Tapaal 0 Times tool wins 102 16
Do not compete 0 0 0
Error detected 0 0 0  
Cannot Compute + Time-out 10 3 21


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 278 runs (139 for LoLA and 139 for M4M.full, so there are 139 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 108 0 0   Smallest Memory Footprint
LoLA = M4M.full 0 Times tool wins 108 0
LoLA > M4M.full 0   Shortest Execution Time
LoLA < M4M.full 0 Times tool wins 108 0
Do not compete 0 0 0
Error detected 0 0 0  
Cannot Compute + Time-out 0 108 31


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 278 runs (139 for LoLA and 139 for M4M.struct, so there are 139 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 108 0 0   Smallest Memory Footprint
LoLA = M4M.struct 0 Times tool wins 108 0
LoLA > M4M.struct 0   Shortest Execution Time
LoLA < M4M.struct 0 Times tool wins 108 0
Do not compete 0 0 0
Error detected 0 0 0  
Cannot Compute + Time-out 0 108 31


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 278 runs (139 for LoLA and 139 for ITS-Tools, so there are 139 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 33 13 75   Smallest Memory Footprint
LoLA = ITS-Tools 0 Times tool wins 108 13
LoLA > ITS-Tools 0   Shortest Execution Time
LoLA < ITS-Tools 0 Times tool wins 108 13
Do not compete 0 0 0
Error detected 0 0 0  
Cannot Compute + Time-out 13 33 18


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 278 runs (139 for LoLA and 139 for ITS-Tools.L, so there are 139 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 19 13 89   Smallest Memory Footprint
LoLA = ITS-Tools.L 0 Times tool wins 108 13
LoLA > ITS-Tools.L 0   Shortest Execution Time
LoLA < ITS-Tools.L 0 Times tool wins 108 13
Do not compete 0 0 0
Error detected 0 0 0  
Cannot Compute + Time-out 13 19 18


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 278 runs (139 for LoLA and 139 for GreatSPN, so there are 139 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 76 5 32   Smallest Memory Footprint
LoLA = GreatSPN 0 Times tool wins 105 8
LoLA > GreatSPN 0   Shortest Execution Time
LoLA < GreatSPN 0 Times tool wins 108 5
Do not compete 0 0 0
Error detected 0 0 0  
Cannot Compute + Time-out 5 76 26


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 278 runs (139 for LoLA and 139 for Irma.full, so there are 139 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 108 0 0   Smallest Memory Footprint
LoLA = Irma.full 0 Times tool wins 108 0
LoLA > Irma.full 0   Shortest Execution Time
LoLA < Irma.full 0 Times tool wins 108 0
Do not compete 0 0 0
Error detected 0 0 0  
Cannot Compute + Time-out 0 108 31


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 278 runs (139 for LoLA and 139 for Irma.struct, so there are 139 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 108 0 0   Smallest Memory Footprint
LoLA = Irma.struct 0 Times tool wins 108 0
LoLA > Irma.struct 0   Shortest Execution Time
LoLA < Irma.struct 0 Times tool wins 108 0
Do not compete 0 0 0
Error detected 0 0 0  
Cannot Compute + Time-out 0 108 31


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