fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
LTSMin+red compared to other tools («Surprise» models, UpperBounds)
Last Updated
July 7, 2024

Introduction

This page presents how LTSMin+red do cope efficiently with the UpperBounds 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 LTSMin+red' 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).

LTSMin+red versus GreatSPN+red

Some statistics are displayed below, based on 208 runs (104 for LTSMin+red and 104 for GreatSPN+red, so there are 104 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing LTSMin+red to GreatSPN+red are shown (you may click on one graph to enlarge it).

Statistics on the executions
  LTSMin+red GreatSPN+red Both tools   LTSMin+red GreatSPN+red
All computed OK 0 0 79   Smallest Memory Footprint
LTSMin+red = GreatSPN+red 0 Times tool wins 41 43
LTSMin+red > GreatSPN+red 0   Shortest Execution Time
LTSMin+red < GreatSPN+red 5 Times tool wins 46 38
Do not compete 0 0 0
Error detected 0 0 20  
Cannot Compute + Time-out 0 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 LTSMin+red computed more values than GreatSPN+red, denote cases where LTSMin+red computed less values than GreatSPN+red, 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.

LTSMin+red wins when points are below the diagonal, GreatSPN+red wins when points are above the diagonal.

memory chart time chart

LTSMin+red versus ITS-Tools

Some statistics are displayed below, based on 208 runs (104 for LTSMin+red and 104 for ITS-Tools, so there are 104 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing LTSMin+red to ITS-Tools are shown (you may click on one graph to enlarge it).

Statistics on the executions
  LTSMin+red ITS-Tools Both tools   LTSMin+red ITS-Tools
All computed OK 0 0 79   Smallest Memory Footprint
LTSMin+red = ITS-Tools 0 Times tool wins 45 39
LTSMin+red > ITS-Tools 0   Shortest Execution Time
LTSMin+red < ITS-Tools 5 Times tool wins 45 39
Do not compete 0 0 0
Error detected 0 0 20  
Cannot Compute + Time-out 0 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 LTSMin+red computed more values than ITS-Tools, denote cases where LTSMin+red 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.

LTSMin+red wins when points are below the diagonal, ITS-Tools wins when points are above the diagonal.

memory chart time chart

LTSMin+red versus LoLA

Some statistics are displayed below, based on 208 runs (104 for LTSMin+red and 104 for LoLA, so there are 104 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing LTSMin+red to LoLA are shown (you may click on one graph to enlarge it).

Statistics on the executions
  LTSMin+red LoLA Both tools   LTSMin+red LoLA
All computed OK 21 4 43   Smallest Memory Footprint
LTSMin+red = LoLA 0 Times tool wins 49 39
LTSMin+red > LoLA 19   Shortest Execution Time
LTSMin+red < LoLA 1 Times tool wins 52 36
Do not compete 0 0 0
Error detected 12 10 8  
Cannot Compute + Time-out 0 19 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 LTSMin+red computed more values than LoLA, denote cases where LTSMin+red 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.

LTSMin+red wins when points are below the diagonal, LoLA wins when points are above the diagonal.

memory chart time chart

LTSMin+red versus Tapaal

Some statistics are displayed below, based on 208 runs (104 for LTSMin+red and 104 for Tapaal, so there are 104 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing LTSMin+red to Tapaal are shown (you may click on one graph to enlarge it).

Statistics on the executions
  LTSMin+red Tapaal Both tools   LTSMin+red Tapaal
All computed OK 0 7 69   Smallest Memory Footprint
LTSMin+red = Tapaal 0 Times tool wins 14 77
LTSMin+red > Tapaal 10   Shortest Execution Time
LTSMin+red < Tapaal 5 Times tool wins 30 61
Do not compete 0 0 0
Error detected 7 0 13  
Cannot Compute + Time-out 0 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 LTSMin+red computed more values than Tapaal, denote cases where LTSMin+red 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.

LTSMin+red wins when points are below the diagonal, Tapaal wins when points are above the diagonal.

memory chart time chart

LTSMin+red versus 2023-gold

Some statistics are displayed below, based on 208 runs (104 for LTSMin+red and 104 for 2023-gold, so there are 104 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing LTSMin+red to 2023-gold are shown (you may click on one graph to enlarge it).

Statistics on the executions
  LTSMin+red 2023-gold Both tools   LTSMin+red 2023-gold
All computed OK 0 0 79   Smallest Memory Footprint
LTSMin+red = 2023-gold 0 Times tool wins 32 52
LTSMin+red > 2023-gold 0   Shortest Execution Time
LTSMin+red < 2023-gold 5 Times tool wins 36 48
Do not compete 0 0 0
Error detected 0 0 20  
Cannot Compute + Time-out 0 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 LTSMin+red computed more values than 2023-gold, denote cases where LTSMin+red computed less values than 2023-gold, 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.

LTSMin+red wins when points are below the diagonal, 2023-gold wins when points are above the diagonal.

memory chart time chart

LTSMin+red versus BVT-2024

Some statistics are displayed below, based on 208 runs (104 for LTSMin+red and 104 for BVT-2024, so there are 104 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing LTSMin+red to BVT-2024 are shown (you may click on one graph to enlarge it).

Important: here, LTSMin+red is compared to BVT-2024. It is a good way to check how LTSMin+red compete in terms of resource consomption with the best tools (even virtual). When LTSMin+red is best, the corresponding plots are on the diagonal of the scatter plots chart.

Statistics on the executions
  LTSMin+red BVT-2024 Both tools   LTSMin+red BVT-2024
All computed OK 0 0 79   Smallest Memory Footprint
LTSMin+red = BVT-2024 0 Times tool wins 0 84
LTSMin+red > BVT-2024 0   Shortest Execution Time
LTSMin+red < BVT-2024 5 Times tool wins 0 84
Do not compete 0 0 0
Error detected 0 0 20  
Cannot Compute + Time-out 0 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 LTSMin+red computed more values than BVT-2024, denote cases where LTSMin+red computed less values than BVT-2024, 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.

LTSMin+red wins when points are below the diagonal, BVT-2024 wins when points are above the diagonal.

memory chart time chart

LTSMin+red versus GreatSPN

Some statistics are displayed below, based on 208 runs (104 for LTSMin+red and 104 for GreatSPN, so there are 104 plots on each of the two charts). Each execution was allowed 1 hour and 16 GByte of memory. Then performance charts comparing LTSMin+red to GreatSPN are shown (you may click on one graph to enlarge it).

Statistics on the executions
  LTSMin+red GreatSPN Both tools   LTSMin+red GreatSPN
All computed OK 4 0 75   Smallest Memory Footprint
LTSMin+red = GreatSPN 0 Times tool wins 26 58
LTSMin+red > GreatSPN 0   Shortest Execution Time
LTSMin+red < GreatSPN 5 Times tool wins 22 62
Do not compete 0 0 0
Error detected 19 0 1  
Cannot Compute + Time-out 0 23 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 LTSMin+red computed more values than GreatSPN, denote cases where LTSMin+red 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.

LTSMin+red wins when points are below the diagonal, GreatSPN wins when points are above the diagonal.

memory chart time chart