fond
Model Checking Contest @ Petri Nets 2015
Bruxelles, Belgium, June 23, 2015
LTSMin compared to other tools («All» models, ReachabilityCardinality)
Last Updated
August 19, 2015

Introduction

This page presents how LTSMin do cope efficiently with the ReachabilityCardinality examination face to the other participating tools. In this page, we consider «All» models.

The next sections will show chart comparing performances in termsof both memory and execution time.The x-axis corresponds to the challenging tool where the y-axes represents LTSMin' performances. Thus, points below the diagonal of a chart denote comparisons favorables to the tool whileothers 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 versus GreatSPN-Meddly

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

Statistics on the execution
  LTSMin GreatSPN-Meddly Both tools   LTSMin GreatSPN-Meddly
Computed OK 286 156 43   Smallest Memory Footprint
Do not compete 0 228 0 Times tool wins 291 194
Error detected 264 72 29   Shortest Execution Time
Cannot Compute + Time-out 228 322 79 Times tool wins 291 194


On the chart below, denote cases where the two tools did computed a result, denote the cases where at least one tool did not competed, denote the cases where at least one tool did a mistake and denote the cases where at least one tool stated it could not compute a result or timed-out.

memory chart time chart

LTSMin versus ITS-Tools

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

Statistics on the execution
  LTSMin ITS-Tools Both tools   LTSMin ITS-Tools
Computed OK 136 302 193   Smallest Memory Footprint
Do not compete 0 0 0 Times tool wins 255 376
Error detected 101 114 192   Shortest Execution Time
Cannot Compute + Time-out 247 68 60 Times tool wins 185 446


On the chart below, denote cases where the two tools did computed a result, denote the cases where at least one tool did not competed, denote the cases where at least one tool did a mistake and denote the cases where at least one tool stated it could not compute a result or timed-out.

memory chart time chart

LTSMin versus LoLA2.0

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

Statistics on the execution
  LTSMin LoLA2.0 Both tools   LTSMin LoLA2.0
Computed OK 31 279 298   Smallest Memory Footprint
Do not compete 0 301 0 Times tool wins 88 520
Error detected 275 25 18   Shortest Execution Time
Cannot Compute + Time-out 305 6 2 Times tool wins 84 524


On the chart below, denote cases where the two tools did computed a result, denote the cases where at least one tool did not competed, denote the cases where at least one tool did a mistake and denote the cases where at least one tool stated it could not compute a result or timed-out.

memory chart time chart

LTSMin versus Marcie

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

Statistics on the execution
  LTSMin Marcie Both tools   LTSMin Marcie
Computed OK 306 171 23   Smallest Memory Footprint
Do not compete 0 0 0 Times tool wins 321 179
Error detected 254 39 39   Shortest Execution Time
Cannot Compute + Time-out 74 424 233 Times tool wins 329 171


On the chart below, denote cases where the two tools did computed a result, denote the cases where at least one tool did not competed, denote the cases where at least one tool did a mistake and denote the cases where at least one tool stated it could not compute a result or timed-out.

memory chart time chart

LTSMin versus TAPAAL(MC)

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

Statistics on the execution
  LTSMin TAPAAL(MC) Both tools   LTSMin TAPAAL(MC)
Computed OK 53 285 276   Smallest Memory Footprint
Do not compete 0 301 0 Times tool wins 152 462
Error detected 290 8 3   Shortest Execution Time
Cannot Compute + Time-out 301 50 6 Times tool wins 127 487


On the chart below, denote cases where the two tools did computed a result, denote the cases where at least one tool did not competed, denote the cases where at least one tool did a mistake and denote the cases where at least one tool stated it could not compute a result or timed-out.

memory chart time chart

LTSMin versus TAPAAL(SEQ)

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

Statistics on the execution
  LTSMin TAPAAL(SEQ) Both tools   LTSMin TAPAAL(SEQ)
Computed OK 12 296 317   Smallest Memory Footprint
Do not compete 0 301 0 Times tool wins 77 548
Error detected 292 3 1   Shortest Execution Time
Cannot Compute + Time-out 305 9 2 Times tool wins 153 472


On the chart below, denote cases where the two tools did computed a result, denote the cases where at least one tool did not competed, denote the cases where at least one tool did a mistake and denote the cases where at least one tool stated it could not compute a result or timed-out.

memory chart time chart

LTSMin versus TAPAAL-OTF(PAR)

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

Statistics on the execution
  LTSMin TAPAAL-OTF(PAR) Both tools   LTSMin TAPAAL-OTF(PAR)
Computed OK 311 138 18   Smallest Memory Footprint
Do not compete 0 301 0 Times tool wins 313 154
Error detected 265 28 28   Shortest Execution Time
Cannot Compute + Time-out 301 410 6 Times tool wins 319 148


On the chart below, denote cases where the two tools did computed a result, denote the cases where at least one tool did not competed, denote the cases where at least one tool did a mistake and denote the cases where at least one tool stated it could not compute a result or timed-out.

memory chart time chart

LTSMin versus TAPAAL-OTF(SEQ)

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

Statistics on the execution
  LTSMin TAPAAL-OTF(SEQ) Both tools   LTSMin TAPAAL-OTF(SEQ)
Computed OK 224 227 105   Smallest Memory Footprint
Do not compete 0 301 0 Times tool wins 230 326
Error detected 293 0 0   Shortest Execution Time
Cannot Compute + Time-out 301 290 6 Times tool wins 262 294


On the chart below, denote cases where the two tools did computed a result, denote the cases where at least one tool did not competed, denote the cases where at least one tool did a mistake and denote the cases where at least one tool stated it could not compute a result or timed-out.

memory chart time chart