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

Introduction

This page presents how LTSMin do cope efficiently with the ReachabilityDeadlock examination face to the other participating tools. In this page, we consider «Known» 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 Cunf

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

Statistics on the execution
  LTSMin Cunf Both tools   LTSMin Cunf
Computed OK 86 14 59   Smallest Memory Footprint
Do not compete 0 277 0 Times tool wins 86 73
Error detected 0 2 0   Shortest Execution Time
Cannot Compute + Time-out 224 17 35 Times tool wins 87 72


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 GreatSPN-Meddly

Some statistics are displayed below, based on 808 runs (404 for LTSMin and 404 for GreatSPN-Meddly, so there are 404 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 46 43 99   Smallest Memory Footprint
Do not compete 0 114 0 Times tool wins 58 130
Error detected 0 0 0   Shortest Execution Time
Cannot Compute + Time-out 157 46 102 Times tool wins 85 103


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 808 runs (404 for LTSMin and 404 for LoLA2.0, so there are 404 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 10 102 135   Smallest Memory Footprint
Do not compete 0 137 0 Times tool wins 23 224
Error detected 0 0 0   Shortest Execution Time
Cannot Compute + Time-out 239 10 20 Times tool wins 28 219


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 808 runs (404 for LTSMin and 404 for Marcie, so there are 404 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 39 66 106   Smallest Memory Footprint
Do not compete 0 0 0 Times tool wins 88 123
Error detected 0 0 0   Shortest Execution Time
Cannot Compute + Time-out 66 39 193 Times tool wins 95 116


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 808 runs (404 for LTSMin and 404 for TAPAAL(MC), so there are 404 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 34 46 111   Smallest Memory Footprint
Do not compete 0 137 0 Times tool wins 38 153
Error detected 0 0 0   Shortest Execution Time
Cannot Compute + Time-out 183 34 76 Times tool wins 49 142


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 808 runs (404 for LTSMin and 404 for TAPAAL(SEQ), so there are 404 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 2 121 143   Smallest Memory Footprint
Do not compete 0 137 0 Times tool wins 16 250
Error detected 0 0 0   Shortest Execution Time
Cannot Compute + Time-out 258 2 1 Times tool wins 42 224


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 808 runs (404 for LTSMin and 404 for TAPAAL-OTF(PAR), so there are 404 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 59 25 86   Smallest Memory Footprint
Do not compete 0 137 0 Times tool wins 70 100
Error detected 0 0 0   Shortest Execution Time
Cannot Compute + Time-out 162 59 97 Times tool wins 90 80


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 808 runs (404 for LTSMin and 404 for TAPAAL-OTF(SEQ), so there are 404 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 17 81 128   Smallest Memory Footprint
Do not compete 0 137 0 Times tool wins 28 198
Error detected 0 10 0   Shortest Execution Time
Cannot Compute + Time-out 222 11 37 Times tool wins 59 167


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