fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Irma.full compared to other tools («Surprise» 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 «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 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 278 runs (139 for Irma.full 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 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 0 139 0   Smallest Memory Footprint
Irma.full = LTSMin 0 Times tool wins 0 139
Irma.full > LTSMin 0   Shortest Execution Time
Irma.full < LTSMin 0 Times tool wins 0 139
Do not compete 0 0 0
Error detected 0 0 0  
Cannot Compute + Time-out 139 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 278 runs (139 for Irma.full and 139 for LoLA, 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 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 0 135 0   Smallest Memory Footprint
Irma.full = LoLA 0 Times tool wins 0 135
Irma.full > LoLA 0   Shortest Execution Time
Irma.full < LoLA 0 Times tool wins 0 135
Do not compete 0 0 0
Error detected 0 3 0  
Cannot Compute + Time-out 138 0 1


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


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 278 runs (139 for Irma.full 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 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 0 0 0   Smallest Memory Footprint
Irma.full = M4M.struct 0 Times tool wins 0 0
Irma.full > M4M.struct 0   Shortest Execution Time
Irma.full < M4M.struct 0 Times tool wins 0 0
Do not compete 0 0 0
Error detected 0 0 0  
Cannot Compute + Time-out 0 0 139


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 278 runs (139 for Irma.full 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 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 0 102 0   Smallest Memory Footprint
Irma.full = ITS-Tools 0 Times tool wins 0 102
Irma.full > ITS-Tools 0   Shortest Execution Time
Irma.full < ITS-Tools 0 Times tool wins 0 102
Do not compete 0 0 0
Error detected 0 0 0  
Cannot Compute + Time-out 102 0 37


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 278 runs (139 for Irma.full 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 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 0 104 0   Smallest Memory Footprint
Irma.full = ITS-Tools.L 0 Times tool wins 0 104
Irma.full > ITS-Tools.L 0   Shortest Execution Time
Irma.full < ITS-Tools.L 0 Times tool wins 0 104
Do not compete 0 0 0
Error detected 0 0 0  
Cannot Compute + Time-out 104 0 35


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


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