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

Introduction

This page presents how Irma.full 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 Irma.full' 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).

Irma.full versus LTSMin

Some statistics are displayed below, based on 1616 runs (808 for Irma.full 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 Irma.full to LTSMin are shown (you may click on one graph to enlarge it).

Statistics on the executions
  Irma.full LTSMin Both tools   Irma.full LTSMin
All computed OK 119 207 135   Smallest Memory Footprint
Irma.full = LTSMin 38 Times tool wins 341 404
Irma.full > LTSMin 68   Shortest Execution Time
Irma.full < LTSMin 178 Times tool wins 262 483
Do not compete 0 180 0
Error detected 0 2 0  
Cannot Compute + Time-out 270 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 Irma.full computed more values than LTSMin, denote cases where Irma.full 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.

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

memory chart time chart

Irma.full versus LoLA

Some statistics are displayed below, based on 1616 runs (808 for Irma.full and 808 for LoLA, 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 Irma.full to LoLA are shown (you may click on one graph to enlarge it).

Statistics on the executions
  Irma.full LoLA Both tools   Irma.full LoLA
All computed OK 16 246 165   Smallest Memory Footprint
Irma.full = LoLA 59 Times tool wins 195 589
Irma.full > LoLA 61   Shortest Execution Time
Irma.full < LoLA 237 Times tool wins 329 455
Do not compete 0 0 0
Error detected 0 2 0  
Cannot Compute + Time-out 248 16 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 Irma.full computed more values than LoLA, denote cases where Irma.full computed less values than LoLA, 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.

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

memory chart time chart

Irma.full versus M4M.full

Some statistics are displayed below, based on 1616 runs (808 for Irma.full 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 Irma.full to M4M.full are shown (you may click on one graph to enlarge it).

Statistics on the executions
  Irma.full M4M.full Both tools   Irma.full M4M.full
All computed OK 41 26 164   Smallest Memory Footprint
Irma.full = M4M.full 286 Times tool wins 293 271
Irma.full > M4M.full 42   Shortest Execution Time
Irma.full < M4M.full 5 Times tool wins 319 245
Do not compete 0 20 0
Error detected 0 0 0  
Cannot Compute + Time-out 28 23 242


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 Irma.full computed more values than M4M.full, denote cases where Irma.full 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.

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

memory chart time chart

Irma.full versus M4M.struct

Some statistics are displayed below, based on 1616 runs (808 for Irma.full 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 Irma.full to M4M.struct are shown (you may click on one graph to enlarge it).

Statistics on the executions
  Irma.full M4M.struct Both tools   Irma.full M4M.struct
All computed OK 3 26 172   Smallest Memory Footprint
Irma.full = M4M.struct 309 Times tool wins 278 286
Irma.full > M4M.struct 41   Shortest Execution Time
Irma.full < M4M.struct 13 Times tool wins 301 263
Do not compete 0 0 0
Error detected 0 0 0  
Cannot Compute + Time-out 26 3 244


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 Irma.full computed more values than M4M.struct, denote cases where Irma.full 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.

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

memory chart time chart

Irma.full versus ITS-Tools

Some statistics are displayed below, based on 1616 runs (808 for Irma.full 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 Irma.full to ITS-Tools are shown (you may click on one graph to enlarge it).

Statistics on the executions
  Irma.full ITS-Tools Both tools   Irma.full ITS-Tools
All computed OK 90 236 172   Smallest Memory Footprint
Irma.full = ITS-Tools 26 Times tool wins 449 325
Irma.full > ITS-Tools 97   Shortest Execution Time
Irma.full < ITS-Tools 153 Times tool wins 323 451
Do not compete 0 0 0
Error detected 0 2 0  
Cannot Compute + Time-out 237 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 Irma.full computed more values than ITS-Tools, denote cases where Irma.full 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.

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

memory chart time chart

Irma.full versus ITS-Tools.L

Some statistics are displayed below, based on 1616 runs (808 for Irma.full 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 Irma.full to ITS-Tools.L are shown (you may click on one graph to enlarge it).

Statistics on the executions
  Irma.full ITS-Tools.L Both tools   Irma.full ITS-Tools.L
All computed OK 86 238 166   Smallest Memory Footprint
Irma.full = ITS-Tools.L 23 Times tool wins 449 327
Irma.full > ITS-Tools.L 110   Shortest Execution Time
Irma.full < ITS-Tools.L 153 Times tool wins 323 453
Do not compete 0 0 0
Error detected 0 2 0  
Cannot Compute + Time-out 239 85 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 Irma.full computed more values than ITS-Tools.L, denote cases where Irma.full 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.

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

memory chart time chart

Irma.full versus Irma.struct

Some statistics are displayed below, based on 1616 runs (808 for Irma.full 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 Irma.full to Irma.struct are shown (you may click on one graph to enlarge it).

Statistics on the executions
  Irma.full Irma.struct Both tools   Irma.full Irma.struct
All computed OK 0 1 208   Smallest Memory Footprint
Irma.full = Irma.struct 321 Times tool wins 256 283
Irma.full > Irma.struct 2   Shortest Execution Time
Irma.full < Irma.struct 7 Times tool wins 274 265
Do not compete 0 0 0
Error detected 0 0 0  
Cannot Compute + Time-out 1 0 269


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 Irma.full computed more values than Irma.struct, denote cases where Irma.full 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.

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

memory chart time chart